Documentation ¶
Index ¶
- Variables
- func GetBackedHas(ds Datastore, key Key) (bool, error)
- func NamespaceType(namespace string) string
- func NamespaceValue(namespace string) string
- type Batch
- type Batching
- type CheckedDatastore
- type Datastore
- type GCDatastore
- type Key
- func (k Key) BaseNamespace() string
- func (k Key) Bytes() []byte
- func (k Key) Child(k2 Key) Key
- func (k Key) ChildString(s string) Key
- func (k *Key) Clean()
- func (k Key) Equal(k2 Key) bool
- func (k Key) Instance(s string) Key
- func (k Key) IsAncestorOf(other Key) bool
- func (k Key) IsDescendantOf(other Key) bool
- func (k Key) IsTopLevel() bool
- func (k Key) Less(k2 Key) bool
- func (k Key) List() []string
- func (k Key) MarshalJSON() ([]byte, error)
- func (k Key) Name() string
- func (k Key) Namespaces() []string
- func (k Key) Parent() Key
- func (k Key) Path() Key
- func (k Key) Reverse() Key
- func (k Key) String() string
- func (k Key) Type() string
- func (k *Key) UnmarshalJSON(data []byte) error
- type KeySlice
- type LogBatch
- type LogDatastore
- func (d *LogDatastore) Batch() (Batch, error)
- func (d *LogDatastore) Check() error
- func (d *LogDatastore) Children() []Datastore
- func (d *LogDatastore) Close() error
- func (d *LogDatastore) CollectGarbage() error
- func (d *LogDatastore) Delete(key Key) (err error)
- func (d *LogDatastore) Get(key Key) (value interface{}, err error)
- func (d *LogDatastore) Has(key Key) (exists bool, err error)
- func (d *LogDatastore) Put(key Key, value interface{}) (err error)
- func (d *LogDatastore) Query(q dsq.Query) (dsq.Results, error)
- func (d *LogDatastore) Scrub() error
- type MapDatastore
- func (d *MapDatastore) Batch() (Batch, error)
- func (d *MapDatastore) Close() error
- func (d *MapDatastore) Delete(key Key) (err error)
- func (d *MapDatastore) Get(key Key) (value interface{}, err error)
- func (d *MapDatastore) Has(key Key) (exists bool, err error)
- func (d *MapDatastore) Put(key Key, value interface{}) (err error)
- func (d *MapDatastore) Query(q dsq.Query) (dsq.Results, error)
- type NullDatastore
- func (d *NullDatastore) Batch() (Batch, error)
- func (d *NullDatastore) Close() error
- func (d *NullDatastore) Delete(key Key) (err error)
- func (d *NullDatastore) Get(key Key) (value interface{}, err error)
- func (d *NullDatastore) Has(key Key) (exists bool, err error)
- func (d *NullDatastore) Put(key Key, value interface{}) (err error)
- func (d *NullDatastore) Query(q dsq.Query) (dsq.Results, error)
- type ScrubbedDatastore
- type Shim
- type ThreadSafeDatastore
Constants ¶
This section is empty.
Variables ¶
var ErrBatchUnsupported = errors.New("this datastore does not support batching")
var ErrInvalidType = errors.New("datastore: invalid type error")
ErrInvalidType is returned by Put when a given value is incopatible with the type the datastore supports. This means a conversion (or serialization) is needed beforehand.
var ErrNotFound = errors.New("datastore: key not found")
ErrNotFound is returned by Get, Has, and Delete when a datastore does not map the given key to a value.
Functions ¶
func GetBackedHas ¶
GetBackedHas provides a default Datastore.Has implementation. It exists so Datastore.Has implementations can use it, like so:
func (*d SomeDatastore) Has(key Key) (exists bool, err error) { return GetBackedHas(d, key) }
func NamespaceType ¶
NamespaceType is the first component of a namespace. `foo` in `foo:bar`
func NamespaceValue ¶
NamespaceValue returns the last component of a namespace. `baz` in `f:b:baz`
Types ¶
type Batch ¶
func NewBasicBatch ¶
type CheckedDatastore ¶
CheckedDatastore is an interface that should be implemented by datastores which may need checking on-disk data integrity.
type Datastore ¶
type Datastore interface { // Put stores the object `value` named by `key`. // // The generalized Datastore interface does not impose a value type, // allowing various datastore middleware implementations (which do not // handle the values directly) to be composed together. // // Ultimately, the lowest-level datastore will need to do some value checking // or risk getting incorrect values. It may also be useful to expose a more // type-safe interface to your application, and do the checking up-front. Put(key Key, value interface{}) error // Get retrieves the object `value` named by `key`. // Get will return ErrNotFound if the key is not mapped to a value. Get(key Key) (value interface{}, err error) // Has returns whether the `key` is mapped to a `value`. // In some contexts, it may be much cheaper only to check for existence of // a value, rather than retrieving the value itself. (e.g. HTTP HEAD). // The default implementation is found in `GetBackedHas`. Has(key Key) (exists bool, err error) // Delete removes the value for given `key`. Delete(key Key) error // Query searches the datastore and returns a query result. This function // may return before the query actually runs. To wait for the query: // // result, _ := ds.Query(q) // // // use the channel interface; result may come in at different times // for entry := range result.Next() { ... } // // // or wait for the query to be completely done // entries, _ := result.Rest() // for entry := range entries { ... } // Query(q query.Query) (query.Results, error) }
Datastore represents storage for any key-value pair.
Datastores are general enough to be backed by all kinds of different storage: in-memory caches, databases, a remote datastore, flat files on disk, etc.
The general idea is to wrap a more complicated storage facility in a simple, uniform interface, keeping the freedom of using the right tools for the job. In particular, a Datastore can aggregate other datastores in interesting ways, like sharded (to distribute load) or tiered access (caches before databases).
While Datastores should be written general enough to accept all sorts of values, some implementations will undoubtedly have to be specific (e.g. SQL databases where fields should be decomposed into columns), particularly to support queries efficiently. Moreover, certain datastores may enforce certain types of values (e.g. requiring an io.Reader, a specific struct, etc) or serialization formats (JSON, Protobufs, etc).
IMPORTANT: No Datastore should ever Panic! This is a cross-module interface, and thus it should behave predictably and handle exceptional conditions with proper error reporting. Thus, all Datastore calls may return errors, which should be checked by callers.
type GCDatastore ¶
GCDatastore is an interface that should be implemented by datastores which don't free disk space by just removing data from them
type Key ¶
type Key struct {
// contains filtered or unexported fields
}
A Key represents the unique identifier of an object. Our Key scheme is inspired by file systems and Google App Engine key model.
Keys are meant to be unique across a system. Keys are hierarchical, incorporating more and more specific namespaces. Thus keys can be deemed 'children' or 'ancestors' of other keys::
Key("/Comedy") Key("/Comedy/MontyPython")
Also, every namespace can be parametrized to embed relevant object information. For example, the Key `name` (most specific namespace) could include the object type::
Key("/Comedy/MontyPython/Actor:JohnCleese") Key("/Comedy/MontyPython/Sketch:CheeseShop") Key("/Comedy/MontyPython/Sketch:CheeseShop/Character:Mousebender")
func KeyWithNamespaces ¶
KeyWithNamespaces constructs a key out of a namespace slice.
func RandomKey ¶
func RandomKey() Key
RandomKey returns a randomly (uuid) generated key.
RandomKey() NewKey("/f98719ea086343f7b71f32ea9d9d521d")
func (Key) BaseNamespace ¶
BaseNamespace returns the "base" namespace of this key (path.Base(filename))
NewKey("/Comedy/MontyPython/Actor:JohnCleese").BaseNamespace() "Actor:JohnCleese"
func (Key) Child ¶
Child returns the `child` Key of this Key.
NewKey("/Comedy/MontyPython").Child(NewKey("Actor:JohnCleese")) NewKey("/Comedy/MontyPython/Actor:JohnCleese")
func (Key) ChildString ¶
ChildString returns the `child` Key of this Key -- string helper.
NewKey("/Comedy/MontyPython").ChildString("Actor:JohnCleese") NewKey("/Comedy/MontyPython/Actor:JohnCleese")
func (Key) Instance ¶
Instance returns an "instance" of this type key (appends value to namespace).
NewKey("/Comedy/MontyPython/Actor").Instance("JohnClesse") NewKey("/Comedy/MontyPython/Actor:JohnCleese")
func (Key) IsAncestorOf ¶
IsAncestorOf returns whether this key is a prefix of `other`
NewKey("/Comedy").IsAncestorOf("/Comedy/MontyPython") true
func (Key) IsDescendantOf ¶
IsDescendantOf returns whether this key contains another as a prefix.
NewKey("/Comedy/MontyPython").IsDescendantOf("/Comedy") true
func (Key) IsTopLevel ¶
IsTopLevel returns whether this key has only one namespace.
func (Key) List ¶
List returns the `list` representation of this Key.
NewKey("/Comedy/MontyPython/Actor:JohnCleese").List() ["Comedy", "MontyPythong", "Actor:JohnCleese"]
func (Key) MarshalJSON ¶
MarshalJSON implements the json.Marshaler interface, keys are represented as JSON strings
func (Key) Name ¶
Name returns the "name" of this key (field of last namespace).
NewKey("/Comedy/MontyPython/Actor:JohnCleese").Name() "JohnCleese"
func (Key) Namespaces ¶
Namespaces returns the `namespaces` making up this Key.
NewKey("/Comedy/MontyPython/Actor:JohnCleese").Namespaces() ["Comedy", "MontyPython", "Actor:JohnCleese"]
func (Key) Parent ¶
Parent returns the `parent` Key of this Key.
NewKey("/Comedy/MontyPython/Actor:JohnCleese").Parent() NewKey("/Comedy/MontyPython")
func (Key) Path ¶
Path returns the "path" of this key (parent + type).
NewKey("/Comedy/MontyPython/Actor:JohnCleese").Path() NewKey("/Comedy/MontyPython/Actor")
func (Key) Reverse ¶
Reverse returns the reverse of this Key.
NewKey("/Comedy/MontyPython/Actor:JohnCleese").Reverse() NewKey("/Actor:JohnCleese/MontyPython/Comedy")
func (Key) Type ¶
Type returns the "type" of this key (value of last namespace).
NewKey("/Comedy/MontyPython/Actor:JohnCleese").Type() "Actor"
func (*Key) UnmarshalJSON ¶
MarshalJSON implements the json.Unmarshaler interface, keys will parse any value specified as a key to a string
type KeySlice ¶
type KeySlice []Key
KeySlice attaches the methods of sort.Interface to []Key, sorting in increasing order.
type LogBatch ¶
type LogBatch struct { Name string // contains filtered or unexported fields }
LogBatch logs all accesses through the batch.
type LogDatastore ¶
type LogDatastore struct { Name string // contains filtered or unexported fields }
LogDatastore logs all accesses through the datastore.
func NewLogDatastore ¶
func NewLogDatastore(ds Datastore, name string) *LogDatastore
NewLogDatastore constructs a log datastore.
func (*LogDatastore) Batch ¶
func (d *LogDatastore) Batch() (Batch, error)
func (*LogDatastore) Check ¶
func (d *LogDatastore) Check() error
func (*LogDatastore) Children ¶
func (d *LogDatastore) Children() []Datastore
Children implements Shim
func (*LogDatastore) Close ¶
func (d *LogDatastore) Close() error
func (*LogDatastore) CollectGarbage ¶
func (d *LogDatastore) CollectGarbage() error
func (*LogDatastore) Delete ¶
func (d *LogDatastore) Delete(key Key) (err error)
Delete implements Datastore.Delete
func (*LogDatastore) Get ¶
func (d *LogDatastore) Get(key Key) (value interface{}, err error)
Get implements Datastore.Get
func (*LogDatastore) Has ¶
func (d *LogDatastore) Has(key Key) (exists bool, err error)
Has implements Datastore.Has
func (*LogDatastore) Put ¶
func (d *LogDatastore) Put(key Key, value interface{}) (err error)
Put implements Datastore.Put
func (*LogDatastore) Scrub ¶
func (d *LogDatastore) Scrub() error
type MapDatastore ¶
type MapDatastore struct {
// contains filtered or unexported fields
}
MapDatastore uses a standard Go map for internal storage.
func NewMapDatastore ¶
func NewMapDatastore() (d *MapDatastore)
NewMapDatastore constructs a MapDatastore
func (*MapDatastore) Batch ¶
func (d *MapDatastore) Batch() (Batch, error)
func (*MapDatastore) Close ¶
func (d *MapDatastore) Close() error
func (*MapDatastore) Delete ¶
func (d *MapDatastore) Delete(key Key) (err error)
Delete implements Datastore.Delete
func (*MapDatastore) Get ¶
func (d *MapDatastore) Get(key Key) (value interface{}, err error)
Get implements Datastore.Get
func (*MapDatastore) Has ¶
func (d *MapDatastore) Has(key Key) (exists bool, err error)
Has implements Datastore.Has
func (*MapDatastore) Put ¶
func (d *MapDatastore) Put(key Key, value interface{}) (err error)
Put implements Datastore.Put
type NullDatastore ¶
type NullDatastore struct { }
NullDatastore stores nothing, but conforms to the API. Useful to test with.
func NewNullDatastore ¶
func NewNullDatastore() *NullDatastore
NewNullDatastore constructs a null datastoe
func (*NullDatastore) Batch ¶
func (d *NullDatastore) Batch() (Batch, error)
func (*NullDatastore) Close ¶
func (d *NullDatastore) Close() error
func (*NullDatastore) Delete ¶
func (d *NullDatastore) Delete(key Key) (err error)
Delete implements Datastore.Delete
func (*NullDatastore) Get ¶
func (d *NullDatastore) Get(key Key) (value interface{}, err error)
Get implements Datastore.Get
func (*NullDatastore) Has ¶
func (d *NullDatastore) Has(key Key) (exists bool, err error)
Has implements Datastore.Has
func (*NullDatastore) Put ¶
func (d *NullDatastore) Put(key Key, value interface{}) (err error)
Put implements Datastore.Put
type ScrubbedDatastore ¶
CheckedDatastore is an interface that should be implemented by datastores which want to provide a mechanism to check data integrity and/or error correction
type ThreadSafeDatastore ¶
type ThreadSafeDatastore interface { Datastore IsThreadSafe() }
ThreadSafeDatastore is an interface that all threadsafe datastore should implement to leverage type safety checks.
Directories ¶
Path | Synopsis |
---|---|
Package fs is a simple Datastore implementation that stores keys are directories and files, mirroring the key.
|
Package fs is a simple Datastore implementation that stores keys are directories and files, mirroring the key. |
Package keytransform introduces a Datastore Shim that transforms keys before passing them to its child.
|
Package keytransform introduces a Datastore Shim that transforms keys before passing them to its child. |
Package mount provides a Datastore that has other Datastores mounted at various key prefixes.
|
Package mount provides a Datastore that has other Datastores mounted at various key prefixes. |
Package namespace introduces a namespace Datastore Shim, which basically mounts the entire child datastore under a prefix.
|
Package namespace introduces a namespace Datastore Shim, which basically mounts the entire child datastore under a prefix. |
Package mount provides a Datastore that has other Datastores mounted at various key prefixes and is threadsafe
|
Package mount provides a Datastore that has other Datastores mounted at various key prefixes and is threadsafe |