Documentation ¶
Index ¶
- Constants
- func PositionOf(tok *Token, d quad.Direction, qs *QuadStore) int
- func Type() graph.Type
- type AllIterator
- func (it *AllIterator) Clone() graph.Iterator
- func (it *AllIterator) Close() error
- func (it *AllIterator) Contains(v graph.Value) (ok bool)
- func (it *AllIterator) Describe() graph.Description
- func (it *AllIterator) Err() error
- func (it *AllIterator) Next() bool
- func (it *AllIterator) NextPath() bool
- func (it *AllIterator) Optimize() (graph.Iterator, bool)
- func (it *AllIterator) Reset()
- func (it *AllIterator) Result() graph.Value
- func (it *AllIterator) Size() (int64, bool)
- func (it *AllIterator) Sorted() bool
- func (it *AllIterator) Stats() graph.IteratorStats
- func (it *AllIterator) SubIterators() []graph.Iterator
- func (it *AllIterator) TagResults(dst map[string]graph.Value)
- func (it *AllIterator) Tagger() *graph.Tagger
- func (it *AllIterator) Type() graph.Type
- func (it *AllIterator) UID() uint64
- type Iterator
- func (it *Iterator) Clone() graph.Iterator
- func (it *Iterator) Close() error
- func (it *Iterator) Contains(v graph.Value) bool
- func (it *Iterator) Describe() graph.Description
- func (it *Iterator) Err() error
- func (it *Iterator) Next() bool
- func (it *Iterator) NextPath() bool
- func (it *Iterator) Optimize() (graph.Iterator, bool)
- func (it *Iterator) Reset()
- func (it *Iterator) Result() graph.Value
- func (it *Iterator) Size() (int64, bool)
- func (it *Iterator) Sorted() bool
- func (it *Iterator) Stats() graph.IteratorStats
- func (it *Iterator) SubIterators() []graph.Iterator
- func (it *Iterator) TagResults(dst map[string]graph.Value)
- func (it *Iterator) Tagger() *graph.Tagger
- func (it *Iterator) Type() graph.Type
- func (it *Iterator) UID() uint64
- type QuadStore
- func (qs *QuadStore) ApplyDeltas(deltas []graph.Delta, ignoreOpts graph.IgnoreOpts) error
- func (qs *QuadStore) Close()
- func (qs *QuadStore) FixedIterator() graph.FixedIterator
- func (qs *QuadStore) Horizon() graph.PrimaryKey
- func (qs *QuadStore) NameOf(k graph.Value) string
- func (qs *QuadStore) NodesAllIterator() graph.Iterator
- func (qs *QuadStore) OptimizeIterator(it graph.Iterator) (graph.Iterator, bool)
- func (qs *QuadStore) Quad(k graph.Value) quad.Quad
- func (qs *QuadStore) QuadDirection(val graph.Value, d quad.Direction) graph.Value
- func (qs *QuadStore) QuadIterator(d quad.Direction, val graph.Value) graph.Iterator
- func (qs *QuadStore) QuadsAllIterator() graph.Iterator
- func (qs *QuadStore) Size() int64
- func (qs *QuadStore) SizeOf(k graph.Value) int64
- func (qs *QuadStore) Type() string
- func (qs *QuadStore) UpdateValueKeyBy(name string, amount int64, tx *lmdb.Txn) error
- func (qs *QuadStore) ValueOf(s string) graph.Value
- func (qs *QuadStore) WriteHorizonAndSize(tx *lmdb.Txn) error
- type Token
- Bugs
Constants ¶
const (
// QuadStoreType is used to select a QuadStore backend to Cayley.
QuadStoreType = "lmdb"
)
Variables ¶
This section is empty.
Functions ¶
Types ¶
type AllIterator ¶
type AllIterator struct {
// contains filtered or unexported fields
}
AllIterator is an implementation of graph.Nexter.
func NewAllIterator ¶
func NewAllIterator(db string, d quad.Direction, qs *QuadStore) *AllIterator
NewAllIterator allocates and initializes an AllIterator that is returned to the caller.
func (*AllIterator) Clone ¶
func (it *AllIterator) Clone() graph.Iterator
Clone returns an independent copy of it.
func (*AllIterator) Contains ¶
func (it *AllIterator) Contains(v graph.Value) (ok bool)
Contains ??? BUG(bmatsuo): Contains is surely broken. It just looks for v in the given database. It seems like it should buffer the output, or run the iteration again.
func (*AllIterator) Optimize ¶
func (it *AllIterator) Optimize() (graph.Iterator, bool)
Optimize ???
func (*AllIterator) SubIterators ¶
func (it *AllIterator) SubIterators() []graph.Iterator
SubIterators are not supported and a nil slice is always returned.
func (*AllIterator) TagResults ¶
func (it *AllIterator) TagResults(dst map[string]graph.Value)
TagResults returns the iterators tags.
func (*AllIterator) Tagger ¶
func (it *AllIterator) Tagger() *graph.Tagger
Tagger returns the iterator's tagger.
type Iterator ¶
type Iterator struct {
// contains filtered or unexported fields
}
Iterator is an implementation of graph.Nexter.
func NewIterator ¶
NewIterator allocates and initializes a new Iterator that is returned to the caller.
func (*Iterator) SubIterators ¶
SubIterators are not supported and a nil slice is always returned.
func (*Iterator) TagResults ¶
TagResults ??
type QuadStore ¶
type QuadStore struct {
// contains filtered or unexported fields
}
QuadStore ??
func (*QuadStore) ApplyDeltas ¶
ApplyDeltas ??
func (*QuadStore) FixedIterator ¶
func (qs *QuadStore) FixedIterator() graph.FixedIterator
FixedIterator ??
func (*QuadStore) NodesAllIterator ¶
NodesAllIterator ??
func (*QuadStore) OptimizeIterator ¶
OptimizeIterator ??
func (*QuadStore) QuadDirection ¶
QuadDirection ??
func (*QuadStore) QuadIterator ¶
QuadIterator ??
func (*QuadStore) QuadsAllIterator ¶
QuadsAllIterator ??
func (*QuadStore) UpdateValueKeyBy ¶
UpdateValueKeyBy ??
Notes ¶
Bugs ¶
Contains is surely broken. It just looks for v in the given database. It seems like it should buffer the output, or run the iteration again.