forked from nutsdb/nutsdb
-
Notifications
You must be signed in to change notification settings - Fork 0
/
tx_bucket.go
107 lines (97 loc) · 3 KB
/
tx_bucket.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
// Copyright 2022 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 "time"
// IterateBuckets iterate over all the bucket depends on ds (represents the data structure)
func (tx *Tx) IterateBuckets(ds uint16, pattern string, f func(key string) bool) error {
if err := tx.checkTxIsClosed(); err != nil {
return err
}
if ds == DataStructureSet {
for bucket := range tx.db.SetIdx {
if end, err := MatchForRange(pattern, bucket, f); end || err != nil {
return err
}
}
}
if ds == DataStructureSortedSet {
for bucket := range tx.db.SortedSetIdx {
if end, err := MatchForRange(pattern, bucket, f); end || err != nil {
return err
}
}
}
if ds == DataStructureList {
f := func(bucket string) error {
if end, err := MatchForRange(pattern, bucket, f); end || err != nil {
return err
}
return nil
}
err := tx.db.Index.handleListBucket(f)
if err != nil {
return err
}
}
if ds == DataStructureBTree {
for bucket := range tx.db.BTreeIdx {
if end, err := MatchForRange(pattern, bucket, f); end || err != nil {
return err
}
}
}
return nil
}
// DeleteBucket delete bucket depends on ds (represents the data structure)
func (tx *Tx) DeleteBucket(ds uint16, bucket string) error {
if err := tx.checkTxIsClosed(); err != nil {
return err
}
ok, err := tx.ExistBucket(ds, bucket)
if err != nil {
return err
}
if !ok {
return ErrBucketNotFound
}
if ds == DataStructureSet {
return tx.put(bucket, []byte("0"), nil, Persistent, DataSetBucketDeleteFlag, uint64(time.Now().Unix()), DataStructureNone)
}
if ds == DataStructureSortedSet {
return tx.put(bucket, []byte("1"), nil, Persistent, DataSortedSetBucketDeleteFlag, uint64(time.Now().Unix()), DataStructureNone)
}
if ds == DataStructureBTree {
return tx.put(bucket, []byte("2"), nil, Persistent, DataBPTreeBucketDeleteFlag, uint64(time.Now().Unix()), DataStructureNone)
}
if ds == DataStructureList {
return tx.put(bucket, []byte("3"), nil, Persistent, DataListBucketDeleteFlag, uint64(time.Now().Unix()), DataStructureNone)
}
return nil
}
func (tx *Tx) ExistBucket(ds uint16, bucket string) (bool, error) {
var ok bool
switch ds {
case DataStructureSet:
_, ok = tx.db.SetIdx[bucket]
case DataStructureSortedSet:
_, ok = tx.db.SortedSetIdx[bucket]
case DataStructureBTree:
_, ok = tx.db.BTreeIdx[bucket]
case DataStructureList:
ok = tx.db.Index.existList(bucket)
default:
return false, ErrDataStructureNotSupported
}
return ok, nil
}