You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
112 lines
2.7 KiB
112 lines
2.7 KiB
package memdb
|
|
|
|
import (
|
|
"fmt"
|
|
"github.com/chrislusf/seaweedfs/weed/filer2"
|
|
"github.com/google/btree"
|
|
"strings"
|
|
)
|
|
|
|
func init() {
|
|
filer2.Stores = append(filer2.Stores, &MemDbStore{})
|
|
}
|
|
|
|
type MemDbStore struct {
|
|
tree *btree.BTree
|
|
}
|
|
|
|
type entryItem struct {
|
|
*filer2.Entry
|
|
}
|
|
|
|
func (a entryItem) Less(b btree.Item) bool {
|
|
return strings.Compare(string(a.FullPath), string(b.(entryItem).FullPath)) < 0
|
|
}
|
|
|
|
func (store *MemDbStore) GetName() string {
|
|
return "memory"
|
|
}
|
|
|
|
func (store *MemDbStore) Initialize(configuration filer2.Configuration) (err error) {
|
|
store.tree = btree.New(8)
|
|
return nil
|
|
}
|
|
|
|
func (store *MemDbStore) InsertEntry(entry *filer2.Entry) (err error) {
|
|
// println("inserting", entry.FullPath)
|
|
store.tree.ReplaceOrInsert(entryItem{entry})
|
|
return nil
|
|
}
|
|
|
|
func (store *MemDbStore) UpdateEntry(entry *filer2.Entry) (err error) {
|
|
if _, err = store.FindEntry(entry.FullPath); err != nil {
|
|
return fmt.Errorf("no such file %s : %v", entry.FullPath, err)
|
|
}
|
|
store.tree.ReplaceOrInsert(entryItem{entry})
|
|
return nil
|
|
}
|
|
|
|
func (store *MemDbStore) FindEntry(fullpath filer2.FullPath) (entry *filer2.Entry, err error) {
|
|
item := store.tree.Get(entryItem{&filer2.Entry{FullPath: fullpath}})
|
|
if item == nil {
|
|
return nil, nil
|
|
}
|
|
entry = item.(entryItem).Entry
|
|
return entry, nil
|
|
}
|
|
|
|
func (store *MemDbStore) DeleteEntry(fullpath filer2.FullPath) (err error) {
|
|
store.tree.Delete(entryItem{&filer2.Entry{FullPath: fullpath}})
|
|
return nil
|
|
}
|
|
|
|
func (store *MemDbStore) ListDirectoryEntries(fullpath filer2.FullPath, startFileName string, inclusive bool, limit int) (entries []*filer2.Entry, err error) {
|
|
|
|
startFrom := string(fullpath)
|
|
if startFileName != "" {
|
|
startFrom = startFrom + "/" + startFileName
|
|
}
|
|
|
|
store.tree.AscendGreaterOrEqual(entryItem{&filer2.Entry{FullPath: filer2.FullPath(startFrom)}},
|
|
func(item btree.Item) bool {
|
|
if limit <= 0 {
|
|
return false
|
|
}
|
|
entry := item.(entryItem).Entry
|
|
// println("checking", entry.FullPath)
|
|
|
|
if entry.FullPath == fullpath {
|
|
// skipping the current directory
|
|
// println("skipping the folder", entry.FullPath)
|
|
return true
|
|
}
|
|
|
|
dir, name := entry.FullPath.DirAndName()
|
|
if name == startFileName {
|
|
if inclusive {
|
|
limit--
|
|
entries = append(entries, entry)
|
|
}
|
|
return true
|
|
}
|
|
|
|
// only iterate the same prefix
|
|
if !strings.HasPrefix(string(entry.FullPath), string(fullpath)) {
|
|
// println("breaking from", entry.FullPath)
|
|
return false
|
|
}
|
|
|
|
if dir != string(fullpath) {
|
|
// this could be items in deeper directories
|
|
// println("skipping deeper folder", entry.FullPath)
|
|
return true
|
|
}
|
|
// now process the directory items
|
|
// println("adding entry", entry.FullPath)
|
|
limit--
|
|
entries = append(entries, entry)
|
|
return true
|
|
},
|
|
)
|
|
return entries, nil
|
|
}
|