gaedatastore

package
v0.6.0 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Sep 20, 2016 License: Apache-2.0 Imports: 12 Imported by: 0

Documentation

Index

Constants

View Source
const (
	QuadStoreType = "gaedatastore"
)

Variables

This section is empty.

Functions

func Type

func Type() graph.Type

Types

type Iterator

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

func NewAllIterator

func NewAllIterator(qs *QuadStore, kind string) *Iterator

func NewIterator

func NewIterator(qs *QuadStore, k string, d quad.Direction, val 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

TODO (panamafrancis) calculate costs

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 {
	LogID     string
	Action    string
	Key       string
	Timestamp int64
}

type MetadataEntry

type MetadataEntry struct {
	NodeCount int64
	QuadCount int64
}

type NodeEntry

type NodeEntry struct {
	Name string
	Size int64
}

type QuadEntry

type QuadEntry struct {
	Hash      string
	Added     []string `datastore:",noindex"`
	Deleted   []string `datastore:",noindex"`
	Subject   string   `datastore:"subject"`
	Predicate string   `datastore:"predicate"`
	Object    string   `datastore:"object"`
	Label     string   `datastore:"label"`
}

type QuadStore

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

func (*QuadStore) ApplyDeltas

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

func (*QuadStore) Close

func (qs *QuadStore) Close()

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(val graph.Value) quad.Value

func (*QuadStore) NodeSize

func (qs *QuadStore) NodeSize() int64

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(val graph.Value) quad.Quad

func (*QuadStore) QuadDirection

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

func (*QuadStore) QuadIterator

func (qs *QuadStore) QuadIterator(dir quad.Direction, v graph.Value) graph.Iterator

func (*QuadStore) QuadsAllIterator

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

func (*QuadStore) Size

func (qs *QuadStore) Size() int64

func (*QuadStore) Type

func (qs *QuadStore) Type() string

func (*QuadStore) ValueOf

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

type Token

type Token struct {
	Kind string
	Hash string
}

func (Token) IsNode

func (t Token) IsNode() bool

Jump to

Keyboard shortcuts

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