barak/cayley
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

add InPredicates/OutPredicates

Browse source
This commit is contained in:
Barak Michener 2015-10-28 19:42:59 -04:00
parent b91b7ab824
commit 97247ae40f
3 changed files with 77 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

33
graph/path/path.go
View file

@ -98,11 +98,6 @@ func (p *Path) Tag(tags ...string) *Path {
return p
}
// As is a synonym for Tag.
func (p *Path) As(tags ...string) *Path {
return p.Tag(tags...)
}
// Out updates this Path to represent the nodes that are adjacent to the
// current nodes, via the given outbound predicate.
//
@ -131,6 +126,33 @@ func (p *Path) In(via ...interface{}) *Path {
return p
}
// InPredicates updates this path to represent the nodes of the valid inbound
// predicates from the current nodes.
//
// For example:
// // Returns a list of predicates valid from "bob"
// //
// // Will return []string{"follows"} if there are any things that "follow" Bob
// StartPath(qs, "bob").InPredicates()
func (p *Path) InPredicates() *Path {
p.stack = append(p.stack, predicatesMorphism(true))
return p
}
// OutPredicates updates this path to represent the nodes of the valid inbound
// predicates from the current nodes.
//
// For example:
// // Returns a list of predicates valid from "bob"
// //
// // Will return []string{"follows", "status"} if there are edges from "bob"
// // labelled "follows", and edges from "bob" that describe his "status".
// StartPath(qs, "bob").OutPredicates()
func (p *Path) OutPredicates() *Path {
p.stack = append(p.stack, predicatesMorphism(false))
return p
}
// And updates the current Path to represent the nodes that match both the
// current Path so far, and the given Path.
func (p *Path) And(path *Path) *Path {
@ -221,7 +243,6 @@ func (p *Path) Back(tag string) *Path {
newPath.stack = append(newPath.stack, p.stack[i].Reversal())
i--
}
}
// BuildIterator returns an iterator from this given Path. Note that you must