memstore

package

v0.0.0-...-05f225d Latest Latest Go to latest Published: Jun 19, 2017 License: Apache-2.0 Imports: 9 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/barakmich/cayley

Links

Open Source Insights

Documentation ¶

Index ¶

Constants
func Type() graph.Type
type AllIterator
type Iterator
- func NewIterator(tree *b.Tree, qs *QuadStore, d quad.Direction, value graph.Value) *Iterator
type LogEntry
type QuadDirectionIndex
- 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 QuadStore
- func New(quads ...quad.Quad) *QuadStore

Constants ¶

View Source

const QuadStoreType = "memstore"

Variables ¶

This section is empty.

Functions ¶

func Type ¶

func Type() graph.Type

Types ¶

type AllIterator ¶

type AllIterator struct {
	iterator.Int64
	// contains filtered or unexported fields
}

type Iterator ¶

type Iterator struct {
	// contains filtered or unexported fields
}

func NewIterator ¶

func NewIterator(tree *b.Tree, qs *QuadStore, d quad.Direction, value graph.Value) *Iterator

func (*Iterator) Clone ¶

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

func (*Iterator) Close ¶

func (it *Iterator) Close() error

func (*Iterator) Contains ¶

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

func (*Iterator) Describe ¶

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

func (*Iterator) Err ¶

func (it *Iterator) Err() error

func (*Iterator) Next ¶

func (it *Iterator) Next() bool

func (*Iterator) NextPath ¶

func (it *Iterator) NextPath() bool

func (*Iterator) Optimize ¶

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

func (*Iterator) Reset ¶

func (it *Iterator) Reset()

func (*Iterator) Result ¶

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

func (*Iterator) Size ¶

func (it *Iterator) Size() (int64, bool)

func (*Iterator) Sorted ¶

func (it *Iterator) Sorted() bool

func (*Iterator) Stats ¶

func (it *Iterator) Stats() graph.IteratorStats

func (*Iterator) SubIterators ¶

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

No subiterators.

func (*Iterator) TagResults ¶

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

func (*Iterator) Tagger ¶

func (it *Iterator) Tagger() *graph.Tagger

func (*Iterator) Type ¶

func (it *Iterator) Type() graph.Type

func (*Iterator) UID ¶

func (it *Iterator) UID() uint64

type LogEntry ¶

type LogEntry struct {
	ID        int64
	Quad      quad.Quad
	IDs       [4]int64
	Action    graph.Procedure
	Timestamp time.Time
	DeletedBy int64
}

type QuadDirectionIndex ¶

type QuadDirectionIndex struct {
	// contains filtered or unexported fields
}

func NewQuadDirectionIndex ¶

func NewQuadDirectionIndex() QuadDirectionIndex

func (QuadDirectionIndex) Get ¶

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

func (QuadDirectionIndex) Tree ¶

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

type QuadStore ¶

type QuadStore struct {
	// contains filtered or unexported fields
}

func New ¶

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

New creates a new in-memory quad store and loads provided quads.

func (*QuadStore) AddDelta ¶

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

func (*QuadStore) ApplyDeltas ¶

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

func (*QuadStore) Close ¶

func (qs *QuadStore) Close() error

func (*QuadStore) DebugPrint ¶

func (qs *QuadStore) DebugPrint()

func (*QuadStore) FixedIterator ¶

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

func (*QuadStore) Horizon ¶

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

func (*QuadStore) NameOf ¶

func (qs *QuadStore) NameOf(id graph.Value) quad.Value

func (*QuadStore) NodesAllIterator ¶

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

func (*QuadStore) OptimizeIterator ¶

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

func (*QuadStore) Quad ¶

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

func (*QuadStore) QuadDirection ¶

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

func (*QuadStore) QuadIterator ¶

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

func (*QuadStore) QuadsAllIterator ¶

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

func (*QuadStore) RemoveDelta ¶

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

func (*QuadStore) Size ¶

func (qs *QuadStore) Size() int64

func (*QuadStore) Type ¶

func (qs *QuadStore) Type() string

func (*QuadStore) ValueOf ¶

func (qs *QuadStore) ValueOf(name quad.Value) graph.Value

func (*QuadStore) WriteQuad ¶

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

Source Files ¶

View all Source files

Directories ¶

Path	Synopsis
b Package b implements a B+tree.	Package b implements a B+tree.

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