CrossClj

3.3.1.0 docs

SourceDocs


project

docs index

NAMESPACES
clojurewerkz.ogre

RECENT
    VARS
    __
    add-E
    add-V
    addE
    addV
    aggregate
    and
    as
    barrier
    both
    bothE
    bothV
    branch
    by
    cap
    choose
    coalesce
    coin
    constant
    count
    cyclic-path
    dedup
    drop
    E
    emit
    explain
    filter
    flat-map
    fold
    from
    group
    group-count
    has
    has-id
    has-key
    has-label
    has-not
    has-value
    id
    identity
    in
    inE
    inject
    injects
    into-list!
    into-seq!
    into-set!
    into-vec!
    inV
    is
    iterate!
    key
    label
    limit
    local
    loops
    map
    match
    math
    max
    mean
    midV
    min
    next!
    not
    open-graph
    option
    optional
    or
    order
    otherV
    out
    outE
    outV
    page-rank
    path
    peer-pressure
    profile
    project
    properties
    property
    property-map
    range
    repeat
    sack
    sample
    scope
    select
    side-effect
    simple-path
    skip
    store
    subgraph
    sum
    tail
    time-limit
    times
    to
    to-E
    to-V
    traversal
    traverse
    tree
    unfold
    union
    until
    V
    value
    value-map
    values
    where
    with-bulk
    with-path
    with-remote
    with-sack
    with-side-effect

    « Index of all namespaces of this project

    macro
    (__ xs & body)
    Starts a anonymous traversal.
    
    multimethod
    Adds an edge to the traversal
    
    multimethod
    Adds a vertex to the traversal.
    
    multimethod
    Adds an edge to the traversal. addE is equivalent to add-E.
    
    multimethod
    Adds a vertex to the traversal. addV is equivalent to add-V.
    
    (aggregate t k)
    (and t & traversals)
    (as t step-label & step-labels)
    (barrier t)(barrier t max-or-consumer)
    (both t & labels)
    (bothE t & labels)
    (branch t f-or-t)
    (by t)(by t arg1)(by t arg1 compar)
    (cap t k & ks)
    (choose t f-or-t)(choose t p-or-t true-choice)(choose t p-or-t true-choice false-choice)
    (coalesce t & traversals)
    (coin t prob)
    (constant t c)
    (count t)(count t scope)
    (dedup t)(dedup t & args)
    (E g & ids)
    Returns all edges matching the supplied ids. If no ids are supplied, returns all edges.
    
    (emit t)(emit t pred-or-t)
    (filter t pred-or-t)
    (flat-map t f-or-t)
    (fold t)(fold t seed fold-function)
    (from t t-or-label-or-vertex)
    (group t)(group t k)
    (group-count t)(group-count t k)
    (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 t & ids)
    (has-key t & ks)
    (has-label t label-or-pred)(has-label t label & labels)
    (has-not t k)
    (has-value t pred-or-obj)(has-value t obj & objs)
    (in t & labels)
    (inE t & labels)
    multimethod
    Injects an arbitrary set of objects into the traversal stream
    
    multimethod
    Equivalent to inject
    
    (into-list! t)
    Returns the objects in the traversal as a list.
    
    (into-seq! t)
    Returns the objects of the traversal as a sequence.
    
    (into-set! t)
    Returns the objects in the traversal as a set.
    
    (into-vec! t)
    Returns the objects in the traversal as a vector.
    
    (is t val-or-pred)
    (iterate! t)
    Iterates the traversal with the intent of producing side-effects.
    
    (limit t lim)(limit t scope lim)
    (local t local-traversal)
    (map t f-or-t)
    (match t & traversals)
    (math t expr)
    (max t)(max t scope)
    (mean t)(mean t scope)
    multimethod
    Returns all vertices matching the supplied ids. If no ids are supplied, returns all vertices.
    midV is equivalent to V
    (min t)(min t scope)
    (next! t)(next! t i)
    Returns the next object in the traversal.
    
    (not t not-traversal)
    (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 t opt-traversal)(option t pick-token opt-traversal)
    (optional t opt-traversal)
    (or t & traversals)
    (order t)(order t scope)
    (out t & labels)
    (outE t & labels)
    (page-rank t)(page-rank t alpha)
    (peer-pressure t)
    (profile t k)
    (project t k & ks)
    (properties t & ks)
    (property t & args)
    (property-map t & ks)
    (range t low high)(range t scope low high)
    (repeat t repeat-traversal)
    (sack t)(sack t sack-op)
    (sample t amount)(sample t scope amount)
    (select t arg1)(select t arg1 & args)
    (side-effect t c-or-t)
    (skip t amount)(skip t scope amount)
    (subgraph t k)
    (sum t)(sum t scope)
    (tail t)(tail t arg1)(tail t scope lim)
    (time-limit t lim)
    (times t loops)
    (to t arg1)(to t direction & labels)
    (to-E t direction & labels)
    (to-V t direction)
    (traversal graph)
    macro
    (traverse xs & body)
    Starts a traversal.
    
    (tree t)(tree t k)
    (union t & traversals)
    (until t pred-or-t)
    multimethod
    Returns all vertices matching the supplied ids. If no ids are supplied, returns all vertices.
    
    (value-map t & args)
    (values t & ks)
    (where t p-or-t)(where t k p)
    (with-bulk g use-bulk)
    (with-remote g conn)
    (with-sack g arg)(with-sack g arg m)
    (with-side-effect g k v)(with-side-effect g k v r)