Package

razie

g

Permalink

package g

Visibility
  1. Public
  2. All

Type Members

  1. class DepthGraphLike[N <: GNode[N, L], L <: GLink[N]] extends GraphLike[N, L]

    Permalink

    depth-limited graph - use for debugging cyclical dependencies - will throw up if more than X levelx

  2. case class GAQRef(meta: String, attrs: AA, loc: GLoc) extends GRef with Product with Serializable

    Permalink

    identifies en entity with the given properties/attribute query

  3. trait GAct extends AnyRef

    Permalink
  4. trait GAssocResolver[From, To] extends AnyRef

    Permalink

    association resolver

  5. trait GCRUD[A] extends AnyRef

    Permalink
  6. case class GIDRef(_meta: String, _id: String, _loc: GLoc) extends GRef with Product with Serializable

    Permalink

    strait-forward unique Id of a single entity

  7. trait GLink[N <: GNode[_, _]] extends AnyRef

    Permalink

    a link between two nodes

  8. case class GLoc(url: String, dir: String = null) extends Product with Serializable

    Permalink

    generic location: it's either an url or a directory...or both - this basically keeps track of the gremlin's whereabouts

  9. trait GNode[N <: GNode[N, L], L <: GLink[N]] extends AnyRef

    Permalink

    smart graph, each node is a sub-graph of "child" nodes and links

  10. case class GRQRef(meta: String, ql: String, loc: GLoc) extends GRef with Product with Serializable

    Permalink

    TODO identifies en entity with the given relational query

  11. trait GRef extends AnyRef

    Permalink

    generic reference - uniquely identifies one (or more?) entities

  12. trait GReferenceable extends AnyRef

    Permalink

    generic referenceable entities

  13. trait GResolver[T] extends AnyRef

    Permalink

    generic referenceable entity resolver / manager

  14. trait GSNode[A] extends GNode[GSNode[A], GLink[GSNode[A]]]

    Permalink

    this is a generic container node - use it to inject a graph structure onto something else

  15. case class GXQRef(xp: String, loc: GLoc) extends GRef with Product with Serializable

    Permalink

    identifies en entity with the given gpath query

  16. trait GraphLike[N <: GNode[N, L], L <: GLink[N]] extends AnyRef

    Permalink

    this is a filtered graph - a subgraph, see Graphs.colored

  17. class IndexedGraphLike[N <: GNode[N, L], L <: GLink[N]] extends NoCyclesGraphLike[N, L]

    Permalink

    DAG - avoids cycles, if any...then I can traverse each node AND LINK just once

  18. class NoCyclesGraphLike[N <: GNode[N, L], L <: GLink[N]] extends GraphLike[N, L]

    Permalink

    Wraps a graph so then I can traverse each node just once, even if the original graph had cycles

    Wraps a graph so then I can traverse each node just once, even if the original graph had cycles

    it will index the nodes as it traverses them, to avoid walking the same path twice.

    This is excellent for example for printing graphs or doing any operation where you just want to visit the nodes and not worry about cycles and stack overflows...

  19. trait SGraph[N <: GSNode[_], L <: GLink[N]] extends AnyRef

    Permalink

    a graph is a set of nodes and links between these nodes.

    a graph is a set of nodes and links between these nodes. It's better though to forget this and see each node as a (sub) graph. Most of the code here will do that

  20. trait WRGraph[N <: GNode[N, L], L <: GLink[N]] extends GNode[N, L]

    Permalink

    a modifyable graph - use the defined operators to change it

Value Members

  1. object GAMAct extends GAct

    Permalink
  2. object GAMResolver

    Permalink

    static entry point for a resolver

  3. object GRef

    Permalink

    gref utilities

  4. object GUid

    Permalink
  5. object Graphs

    Permalink

    traversal helpers

  6. object snakked

    Permalink

    the entire world is a graph of regferenceable entities...Here's all we need to mess with it :D

Ungrouped