iterator

package

Go to main page

Versions in this module

v0

v0.4.1

Apr 25, 2015

Changes in this version

+ func Identity(a, b graph.Value) bool

type And

+ func (it *And) Describe() graph.Description

+ func (it *And) Err() error

type Comparison

+ func (it *Comparison) Describe() graph.Description

+ func (it *Comparison) Err() error

type Fixed

+ func NewFixed(cmp Equality) *Fixed

+ func (it *Fixed) Describe() graph.Description

+ func (it *Fixed) Err() error

type HasA

+ func (it *HasA) Describe() graph.Description

+ func (it *HasA) Err() error

type Int64

+ func (it *Int64) Describe() graph.Description

+ func (it *Int64) Err() error

type LinksTo

+ func (it *LinksTo) Describe() graph.Description

+ func (it *LinksTo) Err() error

type Materialize

+ func (it *Materialize) Describe() graph.Description

+ func (it *Materialize) Err() error

type Node

+ ID int

+ type Not struct

+ func NewNot(primaryIt, allIt graph.Iterator) *Not

+ func (it *Not) Clone() graph.Iterator

+ func (it *Not) Close() error

+ func (it *Not) Contains(val graph.Value) bool

+ func (it *Not) Describe() graph.Description

+ func (it *Not) Err() error

+ func (it *Not) Next() bool

+ func (it *Not) NextPath() bool

+ func (it *Not) Optimize() (graph.Iterator, bool)

+ func (it *Not) Reset()

+ func (it *Not) Result() graph.Value

+ func (it *Not) ResultTree() *graph.ResultTree

+ func (it *Not) Size() (int64, bool)

+ func (it *Not) Stats() graph.IteratorStats

+ func (it *Not) SubIterators() []graph.Iterator

+ func (it *Not) TagResults(dst map[string]graph.Value)

+ func (it *Not) Tagger() *graph.Tagger

+ func (it *Not) Type() graph.Type

+ func (it *Not) UID() uint64

type Null

+ func (it *Null) Describe() graph.Description

+ func (it *Null) Err() error

type Optional

+ func (it *Optional) Describe() graph.Description

+ func (it *Optional) Err() error

type Or

+ func (it *Or) Describe() graph.Description

+ func (it *Or) Err() error

v0.4.0

Aug 26, 2014

Changes in this version

type And

+ func (it *And) NextPath() bool

type Comparison

+ func (it *Comparison) NextPath() bool

type Fixed

+ func (it *Fixed) NextPath() bool

type HasA

+ func (it *HasA) NextPath() bool

type Int64

+ func (it *Int64) NextPath() bool

+ type Keyer interface

+ Key func() interface{}

type LinksTo

+ func (it *LinksTo) NextPath() bool

+ type Materialize struct

+ func NewMaterialize(sub graph.Iterator) *Materialize

+ func (it *Materialize) Clone() graph.Iterator

+ func (it *Materialize) Close()

+ func (it *Materialize) Contains(v graph.Value) bool

+ func (it *Materialize) DebugString(indent int) string

+ func (it *Materialize) Next() bool

+ func (it *Materialize) NextPath() bool

+ func (it *Materialize) Optimize() (graph.Iterator, bool)

+ func (it *Materialize) Reset()

+ func (it *Materialize) Result() graph.Value

+ func (it *Materialize) ResultTree() *graph.ResultTree

+ func (it *Materialize) Size() (int64, bool)

+ func (it *Materialize) Stats() graph.IteratorStats

+ func (it *Materialize) SubIterators() []graph.Iterator

+ func (it *Materialize) TagResults(dst map[string]graph.Value)

+ func (it *Materialize) Tagger() *graph.Tagger

+ func (it *Materialize) Type() graph.Type

+ func (it *Materialize) UID() uint64

type Null

+ func (it *Null) NextPath() bool

type Optional

+ func (it *Optional) NextPath() bool

type Or

+ func (it *Or) NextPath() bool

v0.3.1

Jul 31, 2014

Changes in this version

+ func BasicEquality(a, b graph.Value) bool

+ func NextUID() uint64

+ func OutputQueryShapeForIterator(it graph.Iterator, ts graph.TripleStore, outputMap map[string]interface{})

+ func RunIntOp(a int64, op Operator, b int64) bool

+ type And struct

+ func NewAnd() *And

+ func (it *And) AddSubIterator(sub graph.Iterator)

+ func (it *And) Clone() graph.Iterator

+ func (it *And) Close()

+ func (it *And) Contains(val graph.Value) bool

+ func (it *And) DebugString(indent int) string

+ func (it *And) Next() (graph.Value, bool)

+ func (it *And) NextResult() bool

+ func (it *And) Optimize() (graph.Iterator, bool)

+ func (it *And) Reset()

+ func (it *And) Result() graph.Value

+ func (it *And) ResultTree() *graph.ResultTree

+ func (it *And) Size() (int64, bool)

+ func (it *And) Stats() graph.IteratorStats

+ func (it *And) SubIterators() []graph.Iterator

+ func (it *And) TagResults(dst map[string]graph.Value)

+ func (it *And) Tagger() *graph.Tagger

+ func (it *And) Type() graph.Type

+ func (it *And) UID() uint64

+ type Comparison struct

+ func NewComparison(sub graph.Iterator, op Operator, val interface{}, ts graph.TripleStore) *Comparison

+ func (it *Comparison) Clone() graph.Iterator

+ func (it *Comparison) Close()

+ func (it *Comparison) Contains(val graph.Value) bool

+ func (it *Comparison) DebugString(indent int) string

+ func (it *Comparison) Next() (graph.Value, bool)

+ func (it *Comparison) NextResult() bool

+ func (it *Comparison) Optimize() (graph.Iterator, bool)

+ func (it *Comparison) Reset()

+ func (it *Comparison) Result() graph.Value

+ func (it *Comparison) ResultTree() *graph.ResultTree

+ func (it *Comparison) Size() (int64, bool)

+ func (it *Comparison) Stats() graph.IteratorStats

+ func (it *Comparison) SubIterators() []graph.Iterator

+ func (it *Comparison) TagResults(dst map[string]graph.Value)

+ func (it *Comparison) Tagger() *graph.Tagger

+ func (it *Comparison) Type() graph.Type

+ func (it *Comparison) UID() uint64

+ type Equality func(a, b graph.Value) bool

+ type Fixed struct

+ func NewFixedIteratorWithCompare(compareFn Equality) *Fixed

+ func (it *Fixed) Add(v graph.Value)

+ func (it *Fixed) Clone() graph.Iterator

+ func (it *Fixed) Close()

+ func (it *Fixed) Contains(v graph.Value) bool

+ func (it *Fixed) DebugString(indent int) string

+ func (it *Fixed) Next() (graph.Value, bool)

+ func (it *Fixed) NextResult() bool

+ func (it *Fixed) Optimize() (graph.Iterator, bool)

+ func (it *Fixed) Reset()

+ func (it *Fixed) Result() graph.Value

+ func (it *Fixed) ResultTree() *graph.ResultTree

+ func (it *Fixed) Size() (int64, bool)

+ func (it *Fixed) Stats() graph.IteratorStats

+ func (it *Fixed) SubIterators() []graph.Iterator

+ func (it *Fixed) TagResults(dst map[string]graph.Value)

+ func (it *Fixed) Tagger() *graph.Tagger

+ func (it *Fixed) Type() graph.Type

+ func (it *Fixed) UID() uint64

+ type HasA struct

+ func NewHasA(ts graph.TripleStore, subIt graph.Iterator, d quad.Direction) *HasA

+ func (it *HasA) Clone() graph.Iterator

+ func (it *HasA) Close()

+ func (it *HasA) Contains(val graph.Value) bool

+ func (it *HasA) DebugString(indent int) string

+ func (it *HasA) Direction() quad.Direction

+ func (it *HasA) Next() (graph.Value, bool)

+ func (it *HasA) NextContains() bool

+ func (it *HasA) NextResult() bool

+ func (it *HasA) Optimize() (graph.Iterator, bool)

+ func (it *HasA) Reset()

+ func (it *HasA) Result() graph.Value

+ func (it *HasA) ResultTree() *graph.ResultTree

+ func (it *HasA) Size() (int64, bool)

+ func (it *HasA) Stats() graph.IteratorStats

+ func (it *HasA) SubIterators() []graph.Iterator

+ func (it *HasA) TagResults(dst map[string]graph.Value)

+ func (it *HasA) Tagger() *graph.Tagger

+ func (it *HasA) Type() graph.Type

+ func (it *HasA) UID() uint64

+ type Int64 struct

+ func NewInt64(min, max int64) *Int64

+ func (it *Int64) Clone() graph.Iterator

+ func (it *Int64) Close()

+ func (it *Int64) Contains(tsv graph.Value) bool

+ func (it *Int64) DebugString(indent int) string

+ func (it *Int64) Next() (graph.Value, bool)

+ func (it *Int64) NextResult() bool

+ func (it *Int64) Optimize() (graph.Iterator, bool)

+ func (it *Int64) Reset()

+ func (it *Int64) Result() graph.Value

+ func (it *Int64) ResultTree() *graph.ResultTree

+ func (it *Int64) Size() (int64, bool)

+ func (it *Int64) Stats() graph.IteratorStats

+ func (it *Int64) SubIterators() []graph.Iterator

+ func (it *Int64) TagResults(dst map[string]graph.Value)

+ func (it *Int64) Tagger() *graph.Tagger

+ func (it *Int64) Type() graph.Type

+ func (it *Int64) UID() uint64

+ type Link struct

+ LinkNode int

+ Pred int

+ Source int

+ Target int

+ type LinksTo struct

+ func NewLinksTo(ts graph.TripleStore, it graph.Iterator, d quad.Direction) *LinksTo

+ func (it *LinksTo) Clone() graph.Iterator

+ func (it *LinksTo) Close()

+ func (it *LinksTo) Contains(val graph.Value) bool

+ func (it *LinksTo) DebugString(indent int) string

+ func (it *LinksTo) Direction() quad.Direction

+ func (it *LinksTo) Next() (graph.Value, bool)

+ func (it *LinksTo) NextResult() bool

+ func (it *LinksTo) Optimize() (graph.Iterator, bool)

+ func (it *LinksTo) Reset()

+ func (it *LinksTo) Result() graph.Value

+ func (it *LinksTo) ResultTree() *graph.ResultTree

+ func (it *LinksTo) Size() (int64, bool)

+ func (it *LinksTo) Stats() graph.IteratorStats

+ func (it *LinksTo) SubIterators() []graph.Iterator

+ func (it *LinksTo) TagResults(dst map[string]graph.Value)

+ func (it *LinksTo) Tagger() *graph.Tagger

+ func (it *LinksTo) Type() graph.Type

+ func (it *LinksTo) UID() uint64

+ type Node struct

+ Id int

+ IsFixed bool

+ IsLinkNode bool

+ Tags []string

+ Values []string

+ type Null struct

+ func NewNull() *Null

+ func (it *Null) Clone() graph.Iterator

+ func (it *Null) Close()

+ func (it *Null) Contains(graph.Value) bool

+ func (it *Null) DebugString(indent int) string

+ func (it *Null) Next() (graph.Value, bool)

+ func (it *Null) NextResult() bool

+ func (it *Null) Optimize() (graph.Iterator, bool)

+ func (it *Null) Reset()

+ func (it *Null) Result() graph.Value

+ func (it *Null) ResultTree() *graph.ResultTree

+ func (it *Null) Size() (int64, bool)

+ func (it *Null) Stats() graph.IteratorStats

+ func (it *Null) SubIterators() []graph.Iterator

+ func (it *Null) TagResults(dst map[string]graph.Value)

+ func (it *Null) Tagger() *graph.Tagger

+ func (it *Null) Type() graph.Type

+ func (it *Null) UID() uint64

+ type Operator int

+ type Optional struct

+ func NewOptional(it graph.Iterator) *Optional

+ func (it *Optional) CanNext() bool

+ func (it *Optional) Clone() graph.Iterator

+ func (it *Optional) Close()

+ func (it *Optional) Contains(val graph.Value) bool

+ func (it *Optional) DebugString(indent int) string

+ func (it *Optional) NextResult() bool

+ func (it *Optional) Optimize() (graph.Iterator, bool)

+ func (it *Optional) Reset()

+ func (it *Optional) Result() graph.Value

+ func (it *Optional) ResultTree() *graph.ResultTree

+ func (it *Optional) Size() (int64, bool)

+ func (it *Optional) Stats() graph.IteratorStats

+ func (it *Optional) SubIterators() []graph.Iterator

+ func (it *Optional) TagResults(dst map[string]graph.Value)

+ func (it *Optional) Tagger() *graph.Tagger

+ func (it *Optional) Type() graph.Type

+ func (it *Optional) UID() uint64

+ type Or struct

+ func NewOr() *Or

+ func NewShortCircuitOr() *Or

+ func (it *Or) AddSubIterator(sub graph.Iterator)

+ func (it *Or) Clone() graph.Iterator

+ func (it *Or) Close()

+ func (it *Or) Contains(val graph.Value) bool

+ func (it *Or) DebugString(indent int) string

+ func (it *Or) Next() (graph.Value, bool)

+ func (it *Or) NextResult() bool

+ func (it *Or) Optimize() (graph.Iterator, bool)

+ func (it *Or) Reset()

+ func (it *Or) Result() graph.Value

+ func (it *Or) ResultTree() *graph.ResultTree

+ func (it *Or) Size() (int64, bool)

+ func (it *Or) Stats() graph.IteratorStats

+ func (it *Or) SubIterators() []graph.Iterator

+ func (it *Or) TagResults(dst map[string]graph.Value)

+ func (it *Or) Tagger() *graph.Tagger

+ func (it *Or) Type() graph.Type

+ func (it *Or) UID() uint64

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL