surrealpatch/kvs/db.go
2016-07-19 10:24:55 +01:00

282 lines
5.2 KiB
Go

// Copyright © 2016 Abcum Ltd
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package kvs
import (
"fmt"
"strings"
"github.com/abcum/surreal/cnf"
"github.com/abcum/surreal/util/keys"
)
var stores = make(map[string]func(*cnf.Options) (DS, error))
// DB is a database handle to a single Surreal cluster.
type DB struct {
ds DS
}
// New sets up the underlying key-value store
func New(opts *cnf.Options) (db *DB, err error) {
var ds DS
if strings.HasPrefix(opts.DB.Path, "boltdb://") {
if ds, err = stores["boltdb"](opts); err != nil {
return
}
}
if strings.HasPrefix(opts.DB.Path, "mysql://") {
if ds, err = stores["mysql"](opts); err != nil {
return
}
}
if strings.HasPrefix(opts.DB.Path, "pgsql://") {
if ds, err = stores["pgsql"](opts); err != nil {
return
}
}
db = &DB{ds: ds}
err = db.enc(opts)
return
}
func (db *DB) enc(opts *cnf.Options) (err error) {
ck := &keys.CK{KV: opts.DB.Base}
kv, err := db.Get(ck.Encode())
if err != nil {
return err
}
if kv.Exists() == false {
err = db.Put(ck.Encode(), []byte("±"))
}
if kv.Exists() == true && kv.Str() != "±" {
err = fmt.Errorf("Please provide a valid encryption key for the stored data.")
}
return
}
// All retrieves all key:value items in the db.
func (db *DB) All() (kvs []KV, err error) {
tx, err := db.Txn(false)
if err != nil {
return
}
defer tx.Close()
return tx.All()
}
// Get retrieves a single key:value item.
func (db *DB) Get(key []byte) (kv KV, err error) {
tx, err := db.Txn(false)
if err != nil {
return
}
defer tx.Close()
return tx.Get(key)
}
// MGet retrieves multiple key:value items.
func (db *DB) MGet(keys ...[]byte) (kvs []KV, err error) {
tx, err := db.Txn(false)
if err != nil {
return
}
defer tx.Close()
return tx.MGet(keys...)
}
// PGet retrieves the range of rows which are prefixed with `pre`.
func (db *DB) PGet(pre []byte) (kvs []KV, err error) {
tx, err := db.Txn(false)
if err != nil {
return
}
defer tx.Close()
return tx.PGet(pre)
}
// RGet retrieves the range of `max` rows between `beg` (inclusive) and
// `end` (exclusive). To return the range in descending order, ensure
// that `end` sorts lower than `beg` in the key value store.
func (db *DB) RGet(beg, end []byte, max uint64) (kvs []KV, err error) {
tx, err := db.Txn(false)
if err != nil {
return
}
defer tx.Close()
return tx.RGet(beg, end, max)
}
// Put sets the value for a key.
func (db *DB) Put(key, val []byte) (err error) {
tx, err := db.Txn(true)
if err != nil {
return
}
defer tx.Commit()
return tx.Put(key, val)
}
// CPut conditionally sets the value for a key if the existing value is equal
// to the expected value. To conditionally set a value only if there is no
// existing entry pass nil for the expected value.
func (db *DB) CPut(key, val, exp []byte) (err error) {
tx, err := db.Txn(true)
if err != nil {
return
}
defer tx.Commit()
return tx.CPut(key, val, exp)
}
// Del deletes a single key:value item.
func (db *DB) Del(key []byte) (err error) {
tx, err := db.Txn(true)
if err != nil {
return
}
defer tx.Commit()
return tx.Del(key)
}
// CDel conditionally deletes a key if the existing value is equal to the
// expected value.
func (db *DB) CDel(key, exp []byte) (err error) {
tx, err := db.Txn(true)
if err != nil {
return
}
defer tx.Commit()
return tx.CDel(key, exp)
}
// MDel deletes multiple key:value items.
func (db *DB) MDel(keys ...[]byte) (err error) {
tx, err := db.Txn(true)
if err != nil {
return
}
defer tx.Commit()
return tx.MDel(keys...)
}
// PDel deletes the range of rows which are prefixed with `pre`.
func (db *DB) PDel(pre []byte) (err error) {
tx, err := db.Txn(true)
if err != nil {
return
}
defer tx.Commit()
return tx.PDel(pre)
}
// RDel deletes the range of `max` rows between `beg` (inclusive) and
// `end` (exclusive). To delete the range in descending order, ensure
// that `end` sorts lower than `beg` in the key value store.
func (db *DB) RDel(beg, end []byte, max uint64) (err error) {
tx, err := db.Txn(true)
if err != nil {
return
}
defer tx.Commit()
return tx.RDel(beg, end, max)
}
// Txn executes retryable in the context of a distributed transaction.
// The transaction is automatically aborted if retryable returns any
// error aside from recoverable internal errors, and is automatically
// committed otherwise. The retryable function should have no side
// effects which could cause problems in the event it must be run more
// than once.
func (db *DB) Txn(writable bool) (txn TX, err error) {
return db.ds.Txn(writable)
}
// Close ...
func (db *DB) Close() (err error) {
return db.ds.Close()
}
func Register(name string, constructor func(*cnf.Options) (DS, error)) {
stores[name] = constructor
}