github.com/nutsdb/nutsdb@v1.0.4/tx_list.go

// Copyright 2019 The nutsdb Author. All rights reserved.
//
// 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 nutsdb

import (
	"bytes"
	"sort"
	"strings"
	"time"

	"github.com/pkg/errors"
	"github.com/xujiajun/utils/strconv2"
)

var bucketKeySeqMap map[string]*HeadTailSeq

// ErrSeparatorForListKey returns when list key contains the SeparatorForListKey.
var ErrSeparatorForListKey = errors.Errorf("contain separator (%s) for List key", SeparatorForListKey)

// SeparatorForListKey represents separator for listKey
const SeparatorForListKey = "|"

// RPop removes and returns the last element of the list stored in the bucket at given bucket and key.
func (tx *Tx) RPop(bucket string, key []byte) (item []byte, err error) {
	item, err = tx.RPeek(bucket, key)
	if err != nil {
		return
	}

	return item, tx.push(bucket, key, DataRPopFlag, item)
}

// RPeek returns the last element of the list stored in the bucket at given bucket and key.
func (tx *Tx) RPeek(bucket string, key []byte) ([]byte, error) {
	if err := tx.checkTxIsClosed(); err != nil {
		return nil, err
	}

	b, err := tx.db.bm.GetBucket(DataStructureList, bucket)
	if err != nil {
		return nil, err
	}
	var (
		bucketId = b.Id
		l        *List
		exist    bool
	)

	if l, exist = tx.db.Index.list.exist(bucketId); !exist {
		return nil, ErrBucket
	}

	if tx.CheckExpire(bucket, key) {
		return nil, ErrListNotFound
	}

	item, err := l.RPeek(string(key))
	if err != nil {
		return nil, err
	}

	v, err := tx.db.getValueByRecord(item.record)
	if err != nil {
		return nil, err
	}

	return v, nil
}

// push sets values for list stored in the bucket at given bucket, key, flag and values.
func (tx *Tx) push(bucket string, key []byte, flag uint16, values ...[]byte) error {
	for _, value := range values {
		err := tx.put(bucket, key, value, Persistent, flag, uint64(time.Now().Unix()), DataStructureList)
		if err != nil {
			return err
		}
	}

	return nil
}

func (tx *Tx) getListNewKey(bucket string, key []byte, isLeft bool) []byte {
	if bucketKeySeqMap == nil {
		bucketKeySeqMap = make(map[string]*HeadTailSeq)
	}

	b, err := tx.db.bm.GetBucket(DataStructureList, bucket)
	if err != nil {
		return nil
	}
	bucketId := b.Id

	bucketKey := bucket + string(key)
	if _, ok := bucketKeySeqMap[bucketKey]; !ok {
		bucketKeySeqMap[bucketKey] = tx.getListHeadTailSeq(bucketId, string(key))
	}

	seq := generateSeq(bucketKeySeqMap[bucketKey], isLeft)
	return encodeListKey(key, seq)
}

// RPush inserts the values at the tail of the list stored in the bucket at given bucket,key and values.
func (tx *Tx) RPush(bucket string, key []byte, values ...[]byte) error {
	if err := tx.isKeyValid(bucket, key); err != nil {
		return err
	}

	if strings.Contains(string(key), SeparatorForListKey) {
		return ErrSeparatorForListKey
	}

	for _, value := range values {
		newKey := tx.getListNewKey(bucket, key, false)
		err := tx.push(bucket, newKey, DataLPushFlag, value)
		if err != nil {
			return err
		}
	}

	return nil
}

// LPush inserts the values at the head of the list stored in the bucket at given bucket,key and values.
func (tx *Tx) LPush(bucket string, key []byte, values ...[]byte) error {
	if err := tx.isKeyValid(bucket, key); err != nil {
		return err
	}

	if strings.Contains(string(key), SeparatorForListKey) {
		return ErrSeparatorForListKey
	}

	for _, value := range values {
		newKey := tx.getListNewKey(bucket, key, true)
		err := tx.push(bucket, newKey, DataLPushFlag, value)
		if err != nil {
			return err
		}
	}

	return nil
}

func (tx *Tx) isKeyValid(bucket string, key []byte) error {
	if err := tx.checkTxIsClosed(); err != nil {
		return err
	}

	if tx.CheckExpire(bucket, key) {
		return ErrListNotFound
	}

	return nil
}

func (tx *Tx) LPushRaw(bucket string, key []byte, values ...[]byte) error {
	if err := tx.isKeyValid(bucket, key); err != nil {
		return err
	}

	return tx.push(bucket, key, DataLPushFlag, values...)
}

func (tx *Tx) RPushRaw(bucket string, key []byte, values ...[]byte) error {
	if err := tx.isKeyValid(bucket, key); err != nil {
		return err
	}

	return tx.push(bucket, key, DataRPushFlag, values...)
}

// LPop removes and returns the first element of the list stored in the bucket at given bucket and key.
func (tx *Tx) LPop(bucket string, key []byte) (item []byte, err error) {
	item, err = tx.LPeek(bucket, key)
	if err != nil {
		return
	}

	return item, tx.push(bucket, key, DataLPopFlag, item)
}

// LPeek returns the first element of the list stored in the bucket at given bucket and key.
func (tx *Tx) LPeek(bucket string, key []byte) (item []byte, err error) {
	if err := tx.checkTxIsClosed(); err != nil {
		return nil, err
	}

	b, err := tx.db.bm.GetBucket(DataStructureList, bucket)
	if err != nil {
		return nil, err
	}
	var (
		bucketId = b.Id
		l        *List
		exist    bool
	)

	if l, exist = tx.db.Index.list.exist(bucketId); !exist {
		return nil, ErrBucket
	}
	if tx.CheckExpire(bucket, key) {
		return nil, ErrListNotFound
	}
	r, err := l.LPeek(string(key))
	if err != nil {
		return nil, err
	}

	v, err := tx.db.getValueByRecord(r.record)
	if err != nil {
		return nil, err
	}

	return v, nil
}

// LSize returns the size of key in the bucket in the bucket at given bucket and key.
func (tx *Tx) LSize(bucket string, key []byte) (int, error) {
	if err := tx.checkTxIsClosed(); err != nil {
		return 0, err
	}

	b, err := tx.db.bm.GetBucket(DataStructureList, bucket)
	if err != nil {
		return 0, err
	}

	var (
		bucketId = b.Id
		l        *List
		exist    bool
	)

	if l, exist = tx.db.Index.list.exist(bucketId); !exist {
		return 0, ErrBucket
	}
	if tx.CheckExpire(bucket, key) {
		return 0, ErrListNotFound
	}
	return l.Size(string(key))
}

// LRange returns the specified elements of the list stored in the bucket at given bucket,key, start and end.
// The offsets start and stop are zero-based indexes 0 being the first element of the list (the head of the list),
// 1 being the next element and so on.
// Start and end can also be negative numbers indicating offsets from the end of the list,
// where -1 is the last element of the list, -2 the penultimate element and so on.
func (tx *Tx) LRange(bucket string, key []byte, start, end int) ([][]byte, error) {
	if err := tx.checkTxIsClosed(); err != nil {
		return nil, err
	}

	b, err := tx.db.bm.GetBucket(DataStructureList, bucket)
	if err != nil {
		return nil, err
	}
	var (
		bucketId = b.Id
		l        *List
		exist    bool
	)

	if l, exist = tx.db.Index.list.exist(bucketId); !exist {
		return nil, ErrBucket
	}
	if tx.CheckExpire(bucket, key) {
		return nil, ErrListNotFound
	}

	records, err := l.LRange(string(key), start, end)
	if err != nil {
		return nil, err
	}

	values := make([][]byte, len(records))

	for i, r := range records {
		value, err := tx.db.getValueByRecord(r)
		if err != nil {
			return nil, err
		}
		values[i] = value
	}

	return values, nil
}

// LRem removes the first count occurrences of elements equal to value from the list stored in the bucket at given bucket,key,count.
// The count argument influences the operation in the following ways:
// count > 0: Remove elements equal to value moving from head to tail.
// count < 0: Remove elements equal to value moving from tail to head.
// count = 0: Remove all elements equal to value.
func (tx *Tx) LRem(bucket string, key []byte, count int, value []byte) error {
	var (
		buffer bytes.Buffer
		size   int
	)
	size, err := tx.LSize(bucket, key)
	if err != nil {
		return err
	}

	if count > size || count < -size {
		return ErrCount
	}

	buffer.Write([]byte(strconv2.IntToStr(count)))
	buffer.Write([]byte(SeparatorForListKey))
	buffer.Write(value)
	newValue := buffer.Bytes()

	err = tx.push(bucket, key, DataLRemFlag, newValue)
	if err != nil {
		return err
	}

	return nil
}

// LTrim trims an existing list so that it will contain only the specified range of elements specified.
// the offsets start and stop are zero-based indexes 0 being the first element of the list (the head of the list),
// 1 being the next element and so on.
// start and end can also be negative numbers indicating offsets from the end of the list,
// where -1 is the last element of the list, -2 the penultimate element and so on.
func (tx *Tx) LTrim(bucket string, key []byte, start, end int) error {
	var (
		err    error
		buffer bytes.Buffer
	)

	if err = tx.checkTxIsClosed(); err != nil {
		return err
	}

	b, err := tx.db.bm.GetBucket(DataStructureList, bucket)
	if err != nil {
		return err
	}

	var (
		bucketId = b.Id
		l        *List
		exist    bool
	)

	if l, exist = tx.db.Index.list.exist(bucketId); !exist {
		return ErrBucket
	}

	if tx.CheckExpire(bucket, key) {
		return ErrListNotFound
	}
	if _, ok := l.Items[string(key)]; !ok {
		return ErrListNotFound
	}

	if _, err := tx.LRange(bucket, key, start, end); err != nil {
		return err
	}

	buffer.Write(key)
	buffer.Write([]byte(SeparatorForListKey))
	buffer.Write([]byte(strconv2.IntToStr(start)))
	newKey := buffer.Bytes()

	return tx.push(bucket, newKey, DataLTrimFlag, []byte(strconv2.IntToStr(end)))
}

// LRemByIndex remove the list element at specified index
func (tx *Tx) LRemByIndex(bucket string, key []byte, indexes ...int) error {
	if err := tx.checkTxIsClosed(); err != nil {
		return err
	}

	b, err := tx.db.bm.GetBucket(DataStructureList, bucket)
	if err != nil {
		return err
	}
	bucketId := b.Id
	if _, ok := tx.db.Index.list.exist(bucketId); !ok {
		return ErrListNotFound
	}

	if tx.CheckExpire(bucket, key) {
		return ErrListNotFound
	}

	if len(indexes) == 0 {
		return nil
	}

	sort.Ints(indexes)
	data, err := MarshalInts(indexes)
	if err != nil {
		return err
	}

	err = tx.push(bucket, key, DataLRemByIndex, data)
	if err != nil {
		return err
	}

	return nil
}

// LKeys find all keys matching a given pattern
func (tx *Tx) LKeys(bucket, pattern string, f func(key string) bool) error {
	if err := tx.checkTxIsClosed(); err != nil {
		return err
	}
	b, err := tx.db.bm.GetBucket(DataStructureList, bucket)
	if err != nil {
		return err
	}
	var (
		bucketId = b.Id
		l        *List
		exist    bool
	)
	if l, exist = tx.db.Index.list.exist(bucketId); !exist {
		return ErrBucket
	}

	for key := range l.Items {
		if tx.CheckExpire(bucket, []byte(key)) {
			continue
		}
		if end, err := MatchForRange(pattern, key, f); end || err != nil {
			return err
		}
	}
	return nil
}

func (tx *Tx) ExpireList(bucket string, key []byte, ttl uint32) error {
	if err := tx.checkTxIsClosed(); err != nil {
		return err
	}
	b, err := tx.db.bm.GetBucket(DataStructureList, bucket)
	if err != nil {
		return err
	}

	var (
		bucketId = b.Id
		l        *List
		exist    bool
	)

	if l, exist = tx.db.Index.list.exist(bucketId); !exist {
		return ErrBucket
	}

	l.TTL[string(key)] = ttl
	l.TimeStamp[string(key)] = uint64(time.Now().Unix())
	ttls := strconv2.Int64ToStr(int64(ttl))
	err = tx.push(bucket, key, DataExpireListFlag, []byte(ttls))
	if err != nil {
		return err
	}
	return nil
}

func (tx *Tx) CheckExpire(bucket string, key []byte) bool {
	b, err := tx.db.bm.GetBucket(DataStructureList, bucket)
	if err != nil {
		return false
	}

	var (
		bucketId = b.Id
		l        *List
		exist    bool
	)

	if l, exist = tx.db.Index.list.exist(bucketId); !exist {
		return false
	}

	if l.IsExpire(string(key)) {
		_ = tx.push(bucket, key, DataDeleteFlag)
		return true
	}
	return false
}

func (tx *Tx) GetListTTL(bucket string, key []byte) (uint32, error) {
	if err := tx.checkTxIsClosed(); err != nil {
		return 0, err
	}
	b, err := tx.db.bm.GetBucket(DataStructureList, bucket)
	if err != nil {
		return 0, err
	}

	var (
		bucketId = b.Id
		l        *List
		exist    bool
	)
	if l, exist = tx.db.Index.list.exist(bucketId); !exist {
		return 0, ErrBucket
	}
	return l.GetListTTL(string(key))
}