memstore

package

Go to main page

Versions in this module

v0

v0.7.5

Nov 26, 2018

v0.7.4

Jun 3, 2018

v0.7.4-2

Nov 26, 2018

v0.7.3

Apr 23, 2018

v0.7.2

Mar 3, 2018

v0.7.1

Jan 30, 2018

v0.7.0

Dec 24, 2017

Changes in this version

type AllIterator

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

+ func (it *AllIterator) Close() error

+ func (it *AllIterator) Contains(ctx context.Context, v graph.Value) bool

+ func (it *AllIterator) Err() error

+ func (it *AllIterator) NextPath(ctx context.Context) 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) Stats() graph.IteratorStats

+ func (it *AllIterator) String() string

+ 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 Cmp func(a, b int64) int

+ type Enumerator struct

+ func (e *Enumerator) Close()

+ func (e *Enumerator) Next() (k int64, v *primitive, err error)

+ func (e *Enumerator) Prev() (k int64, v *primitive, err error)

type Iterator

+ func (it *Iterator) String() string

type QuadStore

+ func (qs *QuadStore) AddBNode() int64

+ func (qs *QuadStore) AddQuad(q quad.Quad) (int64, bool)

+ func (qs *QuadStore) AddValue(v quad.Value) (int64, bool)

+ func (qs *QuadStore) Delete(id int64) bool

+ type Tree struct

+ func TreeNew(cmp Cmp) *Tree

+ func (t *Tree) Clear()

+ func (t *Tree) Close()

+ func (t *Tree) Delete(k int64) (ok bool)

+ func (t *Tree) First() (k int64, v *primitive)

+ func (t *Tree) Get(k int64) (v *primitive, ok bool)

+ func (t *Tree) Last() (k int64, v *primitive)

+ func (t *Tree) Len() int

+ func (t *Tree) Put(k int64, upd func(oldV *primitive, exists bool) (newV *primitive, write bool)) (oldV *primitive, written bool)

+ func (t *Tree) Seek(k int64) (e *Enumerator, ok bool)

+ func (t *Tree) SeekFirst() (e *Enumerator, err error)

+ func (t *Tree) SeekLast() (e *Enumerator, err error)

+ func (t *Tree) Set(k int64, v *primitive)

v0.6.1

Apr 12, 2017

Changes in this version

type LogEntry

+ IDs [4]int64

type QuadStore

+ func New(quads ...quad.Quad) *QuadStore

+ func (qs *QuadStore) WriteQuad(q quad.Quad) error

v0.6.0

Sep 20, 2016

v0.5.0

Mar 23, 2016

v0.4.1

Apr 25, 2015

Changes in this version

+ const QuadStoreType

type Iterator

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

+ func (it *Iterator) Err() error

type LogEntry

+ Action graph.Procedure

+ ID int64

+ Quad quad.Quad

+ Timestamp time.Time

+ type QuadStore struct

+ func (qs *QuadStore) AddDelta(d graph.Delta) error

+ func (qs *QuadStore) ApplyDeltas(deltas []graph.Delta, ignoreOpts graph.IgnoreOpts) error

+ func (qs *QuadStore) Close()

+ func (qs *QuadStore) DebugPrint()

+ func (qs *QuadStore) FixedIterator() graph.FixedIterator

+ func (qs *QuadStore) Horizon() graph.PrimaryKey

+ func (qs *QuadStore) NameOf(id graph.Value) string

+ func (qs *QuadStore) NodesAllIterator() graph.Iterator

+ func (qs *QuadStore) OptimizeIterator(it graph.Iterator) (graph.Iterator, bool)

+ func (qs *QuadStore) Quad(index graph.Value) quad.Quad

+ func (qs *QuadStore) QuadDirection(val graph.Value, d quad.Direction) graph.Value

+ func (qs *QuadStore) QuadIterator(d quad.Direction, value graph.Value) graph.Iterator

+ func (qs *QuadStore) QuadsAllIterator() graph.Iterator

+ func (qs *QuadStore) RemoveDelta(d graph.Delta) error

+ func (qs *QuadStore) Size() int64

+ func (qs *QuadStore) Type() string

+ func (qs *QuadStore) ValueOf(name string) graph.Value

v0.4.0

Aug 26, 2014

Changes in this version

type Iterator

+ func NewIterator(tree *b.Tree, data string, ts *TripleStore) *Iterator

+ func (it *Iterator) NextPath() bool

+ type LogEntry struct

+ DeletedBy int64

+ type NodesAllIterator AllIterator

+ func NewMemstoreNodesAllIterator(ts *TripleStore) *NodesAllIterator

+ func (it *NodesAllIterator) Next() bool

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

+ type QuadDirectionIndex struct

+ func NewQuadDirectionIndex() QuadDirectionIndex

+ func (qdi QuadDirectionIndex) Get(d quad.Direction, id int64) (*b.Tree, bool)

+ func (qdi QuadDirectionIndex) Tree(d quad.Direction, id int64) *b.Tree

+ type QuadsAllIterator AllIterator

+ func NewMemstoreQuadsAllIterator(ts *TripleStore) *QuadsAllIterator

+ func (qit *QuadsAllIterator) Next() bool

type TripleStore

+ func (ts *TripleStore) AddDelta(d graph.Delta) error

+ func (ts *TripleStore) ApplyDeltas(deltas []graph.Delta) error

+ func (ts *TripleStore) Horizon() int64

+ func (ts *TripleStore) RemoveDelta(d graph.Delta) error

v0.3.1

Jul 31, 2014

Changes in this version

+ func Type() graph.Type

+ type AllIterator struct

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

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

+ type Iterator struct

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

+ func (it *Iterator) Close()

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

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

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

+ func (it *Iterator) NextResult() bool

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

+ func (it *Iterator) Reset()

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

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

+ 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 TripleStore struct

+ func (ts *TripleStore) AddTriple(t *quad.Quad)

+ func (ts *TripleStore) AddTripleSet(triples []*quad.Quad)

+ func (ts *TripleStore) Close()

+ func (ts *TripleStore) DebugPrint()

+ func (ts *TripleStore) FixedIterator() graph.FixedIterator

+ func (ts *TripleStore) NameOf(id graph.Value) string

+ func (ts *TripleStore) NodesAllIterator() graph.Iterator

+ func (ts *TripleStore) OptimizeIterator(it graph.Iterator) (graph.Iterator, bool)

+ func (ts *TripleStore) Quad(index graph.Value) *quad.Quad

+ func (ts *TripleStore) RemoveTriple(t *quad.Quad)

+ func (ts *TripleStore) Size() int64

+ func (ts *TripleStore) TripleDirection(val graph.Value, d quad.Direction) graph.Value

+ func (ts *TripleStore) TripleIterator(d quad.Direction, value graph.Value) graph.Iterator

+ func (ts *TripleStore) TriplesAllIterator() graph.Iterator

+ func (ts *TripleStore) ValueOf(name string) graph.Value

v0.3.0

Jun 28, 2014

Changes in this version

+ type Int64 int64

+ func IterateOne(tree *llrb.LLRB, last Int64) Int64

+ func (i Int64) Less(than llrb.Item) bool

+ type LlrbIterator struct

+ func NewLlrbIterator(tree *llrb.LLRB, data string) *LlrbIterator

+ func (it *LlrbIterator) Check(v graph.TSVal) bool

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

+ func (it *LlrbIterator) Close()

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

+ func (it *LlrbIterator) GetStats() *graph.IteratorStats

+ func (it *LlrbIterator) Next() (graph.TSVal, bool)

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

+ func (it *LlrbIterator) Reset()

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

+ func (it *LlrbIterator) Sorted() bool

+ func (it *LlrbIterator) Type() string

+ type MemTripleStore struct

+ func MakeTestingMemstore() *MemTripleStore

+ func NewMemTripleStore() *MemTripleStore

+ func (ts *MemTripleStore) AddTriple(t *graph.Triple)

+ func (ts *MemTripleStore) AddTripleSet(triples []*graph.Triple)

+ func (ts *MemTripleStore) Close()

+ func (ts *MemTripleStore) DebugPrint()

+ func (ts *MemTripleStore) GetIdFor(name string) graph.TSVal

+ func (ts *MemTripleStore) GetNameFor(id graph.TSVal) string

+ func (ts *MemTripleStore) GetNodesAllIterator() graph.Iterator

+ func (ts *MemTripleStore) GetTriple(index graph.TSVal) *graph.Triple

+ func (ts *MemTripleStore) GetTripleDirection(val graph.TSVal, direction string) graph.TSVal

+ func (ts *MemTripleStore) GetTripleIterator(direction string, value graph.TSVal) graph.Iterator

+ func (ts *MemTripleStore) GetTriplesAllIterator() graph.Iterator

+ func (ts *MemTripleStore) MakeFixed() *graph.FixedIterator

+ func (ts *MemTripleStore) OptimizeIterator(it graph.Iterator) (graph.Iterator, bool)

+ func (ts *MemTripleStore) RemoveTriple(t *graph.Triple)

+ func (ts *MemTripleStore) Size() int64

+ type MemstoreAllIterator struct

+ func NewMemstoreAllIterator(ts *MemTripleStore) *MemstoreAllIterator

+ func (memall *MemstoreAllIterator) Next() (graph.TSVal, bool)

+ type TripleDirectionIndex struct

+ func NewTripleDirectionIndex() *TripleDirectionIndex

+ func (tdi *TripleDirectionIndex) Get(dir string, id int64) (*llrb.LLRB, bool)

+ func (tdi *TripleDirectionIndex) GetForDir(s string) map[int64]*llrb.LLRB

+ func (tdi *TripleDirectionIndex) GetOrCreate(dir string, id int64) *llrb.LLRB

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