Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security Policy
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

path

package

Go to main page

Versions in this module

v0

v0.6.0

Sep 20, 2016

Changes in this version

type Path

+ func (p *Path) Clone() *Path

+ func (p *Path) Count() *Path

+ func (p *Path) Filter(op iterator.Operator, node quad.Value) *Path

+ func (p *Path) HasReverse(via interface{}, nodes ...quad.Value) *Path

+ func (p *Path) Iterate(ctx context.Context) *graph.IterateChain

+ func (p *Path) Limit(v int64) *Path

+ func (p *Path) Regex(pattern *regexp.Regexp) *Path

+ func (p *Path) RegexWithRefs(pattern *regexp.Regexp) *Path

+ func (p *Path) Skip(v int64) *Path

+ func (p *Path) Unique() *Path

v0.5.0

Mar 23, 2016

Changes in this version

+ type Path struct

+ func NewPath(qs graph.QuadStore) *Path

+ func PathFromIterator(qs graph.QuadStore, it graph.Iterator) *Path

+ func StartMorphism(nodes ...string) *Path

+ func StartPath(qs graph.QuadStore, nodes ...string) *Path

+ func (p *Path) And(path *Path) *Path

+ func (p *Path) Back(tag string) *Path

+ func (p *Path) Both(via ...interface{}) *Path

+ func (p *Path) BuildIterator() graph.Iterator

+ func (p *Path) BuildIteratorOn(qs graph.QuadStore) graph.Iterator

+ func (p *Path) Except(path *Path) *Path

+ func (p *Path) Follow(path *Path) *Path

+ func (p *Path) FollowReverse(path *Path) *Path

+ func (p *Path) Has(via interface{}, nodes ...string) *Path

+ func (p *Path) In(via ...interface{}) *Path

+ func (p *Path) InPredicates() *Path

+ func (p *Path) InWithTags(tags []string, via ...interface{}) *Path

+ func (p *Path) Is(nodes ...string) *Path

+ func (p *Path) IsMorphism() bool

+ func (p *Path) LabelContext(via ...interface{}) *Path

+ func (p *Path) LabelContextWithTags(tags []string, via ...interface{}) *Path

+ func (p *Path) Morphism() graph.ApplyMorphism

+ func (p *Path) Or(path *Path) *Path

+ func (p *Path) Out(via ...interface{}) *Path

+ func (p *Path) OutPredicates() *Path

+ func (p *Path) OutWithTags(tags []string, via ...interface{}) *Path

+ func (p *Path) Reverse() *Path

+ func (p *Path) Save(via interface{}, tag string) *Path

+ func (p *Path) SaveOptional(via interface{}, tag string) *Path

+ func (p *Path) SaveOptionalReverse(via interface{}, tag string) *Path

+ func (p *Path) SaveReverse(via interface{}, tag string) *Path

+ func (p *Path) Tag(tags ...string) *Path