clojurewerkz.ogre.core — com.ardoq/ogre 3.0.0.0-beta2

__ clj macro

(__ xs & body)

Starts a anonymous traversal.

add-V clj

(add-V g)

(add-V g label)

addE clj

(addE t label)

addV clj

(addV t)

(addV t label)

aggregate clj

(aggregate t k)

and clj

(and t & traversals)

as clj

(as t step-label & step-labels)

barrier clj

(barrier t)

(barrier t max-or-consumer)

both clj

(both t & labels)

bothE clj

(bothE t & labels)

bothV clj

(bothV t)

branch clj

(branch t f-or-t)

by clj

(by t)

(by t arg1)

(by t arg1 compar)

cap clj

(cap t k & ks)

choose clj

(choose t f-or-t)

(choose t p-or-t true-choice false-choice)

coalesce clj

(coalesce t & traversals)

coin clj

(coin t prob)

constant clj

(constant t c)

count clj

(count t)

(count t scope)

cyclic-path clj

(cyclic-path t)

dedup clj

(dedup t)

(dedup t & args)

drop clj

(drop t)

E clj

(E g & ids)

Returns all edges matching the supplied ids. If no ids are supplied, returns all edges.

emit clj

(emit t)

(emit t pred-or-t)

explain clj

(explain t)

filter clj

(filter t pred-or-t)

flat-map clj

(flat-map t f-or-t)

fold clj

(fold t)

(fold t seed fold-function)

from clj

(from t t-or-label)

group clj

(group t)

(group t k)

group-count clj

(group-count t)

(group-count t k)

has clj

(has t k)

(has t k val-or-pred-or-t)

(has t label k val-or-pred)

Allows an element if it has the given property or it satisfies given predicate.

has-id clj

(has-id t & ids)

has-key clj

(has-key t & ks)

has-label clj

(has-label t & labels)

id clj

(id t)

identity clj

(identity t)

in clj

(in t & labels)

inE clj

(inE t & labels)

inject clj

(inject t & args)

into-list! clj

(into-list! t)

Returns the objects in the traversal as a list.

into-seq! clj

(into-seq! t)

Returns the objects of the traversal as a sequence.

into-set! clj

(into-set! t)

Returns the objects in the traversal as a set.

into-vec! clj

(into-vec! t)

Returns the objects in the traversal as a vector.

inV clj

(inV t)

is clj

(is t val-or-pred)

iterate! clj

(iterate! t)

Iterates the traversal with the intent of producing side-effects.

key clj

(key t)

label clj

(label t)

limit clj

(limit t lim)

(limit t scope lim)

local clj

(local t local-traversal)

loops clj

(loops t)

map clj

(map t f-or-t)

match clj

(match t & traversals)

max clj

(max t)

(max t scope)

mean clj

(mean t)

(mean t scope)

midV clj

(midV t & ids)

A mid-traversal V known in Gremlin-Java as just V()

min clj

(min t)

(min t scope)

next! clj

(next! t)

(next! t i)

Returns the next object in the traversal.

not clj

(not t not-traversal)

open-graph clj

(open-graph conf)

Opens a new TinkerGraph with default configuration or open a new Graph instance with the specified configuration. The configuration may be a path to a file or a Map of configuration options.

option clj

(option t opt-traversal)

(option t pick-token opt-traversal)

optional clj

(optional t opt-traversal)

or clj

(or t & traversals)

order clj

(order t)

(order t scope)

otherV clj

(otherV t)

out clj

(out t & labels)

outE clj

(outE t & labels)

outV clj

(outV t)

page-rank clj

(page-rank t)

(page-rank t alpha)

path clj

(path t)

peer-pressure clj

(peer-pressure t)

profile clj

(profile t k)

project clj

(project t k & ks)

properties clj

(properties t & ks)

property clj

(property t & args)

property-map clj

(property-map t & ks)

range clj

(range t low high)

(range t scope low high)

repeat clj

(repeat t repeat-traversal)

sack clj

(sack t)

(sack t sack-op)

sample clj

(sample t amount)

(sample t scope amount)

scope clj

(scope s)

select clj

(select t arg1)

(select t arg1 & args)

side-effect clj

(side-effect t c-or-t)

simple-path clj

(simple-path t)

store clj

(store t k)

subgraph clj

(subgraph t k)

sum clj

(sum t)

(sum t scope)

tail clj

(tail t)

(tail t arg1)

(tail t scope lim)

time-limit clj

(time-limit t lim)

times clj

(times t loops)

to clj

(to t arg1)

(to t direction & labels)

to-E clj

(to-E t direction & labels)

to-V clj

(to-V t direction)

traversal clj

(traversal graph)

traverse clj macro

(traverse xs & body)

Starts a traversal.

tree clj

(tree t)

(tree t k)

unfold clj

(unfold t)

union clj

(union t & traversals)

until clj

(until t pred-or-t)

V clj

(V g & ids)

Returns all vertices matching the supplied ids. If no ids are supplied, returns all vertices.

value clj

(value t)

value-map clj

(value-map t & args)

values clj

(values t & ks)

where clj

(where t p-or-t)

(where t k p)

with-bulk clj

(with-bulk g use-bulk)

with-path clj

(with-path g)

with-remote clj

(with-remote g conn)

with-sack clj

(with-sack g arg)

(with-sack g arg m)

with-side-effect clj

(with-side-effect g k v)

(with-side-effect g k v r)