154 lines
3.7 KiB
Go
154 lines
3.7 KiB
Go
package pilorama
|
|
|
|
import (
|
|
"sort"
|
|
|
|
cidSDK "github.com/nspcc-dev/neofs-sdk-go/container/id"
|
|
)
|
|
|
|
// memoryForest represents multiple replicating trees sharing a single storage.
|
|
type memoryForest struct {
|
|
// treeMap maps tree identifier (container ID + name) to the replicated log.
|
|
treeMap map[string]*state
|
|
}
|
|
|
|
var _ Forest = (*memoryForest)(nil)
|
|
|
|
// NewMemoryForest creates new empty forest.
|
|
// TODO: this function will eventually be removed and is here for debugging.
|
|
func NewMemoryForest() ForestStorage {
|
|
return &memoryForest{
|
|
treeMap: make(map[string]*state),
|
|
}
|
|
}
|
|
|
|
// TreeMove implements the Forest interface.
|
|
func (f *memoryForest) TreeMove(cid cidSDK.ID, treeID string, op *Move) (*LogMove, error) {
|
|
fullID := cid.String() + "/" + treeID
|
|
s, ok := f.treeMap[fullID]
|
|
if !ok {
|
|
s = newState()
|
|
f.treeMap[fullID] = s
|
|
}
|
|
|
|
op.Time = s.timestamp()
|
|
if op.Child == RootID {
|
|
op.Child = s.findSpareID()
|
|
}
|
|
|
|
lm := s.do(op)
|
|
s.operations = append(s.operations, lm)
|
|
return &lm, nil
|
|
}
|
|
|
|
// TreeAddByPath implements the Forest interface.
|
|
func (f *memoryForest) TreeAddByPath(cid cidSDK.ID, treeID string, attr string, path []string, m []KeyValue) ([]LogMove, error) {
|
|
fullID := cid.String() + "/" + treeID
|
|
s, ok := f.treeMap[fullID]
|
|
if !ok {
|
|
s = newState()
|
|
f.treeMap[fullID] = s
|
|
}
|
|
|
|
i, node := s.getPathPrefix(attr, path)
|
|
lm := make([]LogMove, len(path)-i+1)
|
|
for j := i; j < len(path); j++ {
|
|
lm[j-i] = s.do(&Move{
|
|
Parent: node,
|
|
Meta: Meta{Time: s.timestamp(), Items: []KeyValue{{Key: attr, Value: []byte(path[j])}}},
|
|
Child: s.findSpareID(),
|
|
})
|
|
node = lm[j-i].Child
|
|
s.operations = append(s.operations, lm[j-i])
|
|
}
|
|
|
|
mCopy := make([]KeyValue, len(m))
|
|
copy(mCopy, m)
|
|
lm[len(lm)-1] = s.do(&Move{
|
|
Parent: node,
|
|
Meta: Meta{Time: s.timestamp(), Items: mCopy},
|
|
Child: s.findSpareID(),
|
|
})
|
|
return lm, nil
|
|
}
|
|
|
|
// TreeApply implements the Forest interface.
|
|
func (f *memoryForest) TreeApply(cid cidSDK.ID, treeID string, op *Move) error {
|
|
fullID := cid.String() + "/" + treeID
|
|
s, ok := f.treeMap[fullID]
|
|
if !ok {
|
|
s = newState()
|
|
f.treeMap[fullID] = s
|
|
}
|
|
|
|
return s.Apply(op)
|
|
}
|
|
|
|
func (f *memoryForest) Init() error {
|
|
return nil
|
|
}
|
|
|
|
func (f *memoryForest) Open() error {
|
|
return nil
|
|
}
|
|
|
|
func (f *memoryForest) Close() error {
|
|
return nil
|
|
}
|
|
|
|
// TreeGetByPath implements the Forest interface.
|
|
func (f *memoryForest) TreeGetByPath(cid cidSDK.ID, treeID string, attr string, path []string, latest bool) ([]Node, error) {
|
|
fullID := cid.String() + "/" + treeID
|
|
s, ok := f.treeMap[fullID]
|
|
if !ok {
|
|
return nil, ErrTreeNotFound
|
|
}
|
|
|
|
return s.get(attr, path, latest), nil
|
|
}
|
|
|
|
// TreeGetMeta implements the Forest interface.
|
|
func (f *memoryForest) TreeGetMeta(cid cidSDK.ID, treeID string, nodeID Node) (Meta, Node, error) {
|
|
fullID := cid.String() + "/" + treeID
|
|
s, ok := f.treeMap[fullID]
|
|
if !ok {
|
|
return Meta{}, 0, ErrTreeNotFound
|
|
}
|
|
|
|
return s.getMeta(nodeID), s.infoMap[nodeID].Parent, nil
|
|
}
|
|
|
|
// TreeGetChildren implements the Forest interface.
|
|
func (f *memoryForest) TreeGetChildren(cid cidSDK.ID, treeID string, nodeID Node) ([]uint64, error) {
|
|
fullID := cid.String() + "/" + treeID
|
|
s, ok := f.treeMap[fullID]
|
|
if !ok {
|
|
return nil, ErrTreeNotFound
|
|
}
|
|
|
|
children, ok := s.childMap[nodeID]
|
|
if !ok {
|
|
return nil, nil
|
|
}
|
|
|
|
res := make([]Node, len(children))
|
|
copy(res, children)
|
|
return res, nil
|
|
}
|
|
|
|
// TreeGetOpLog implements the pilorama.Forest interface.
|
|
func (f *memoryForest) TreeGetOpLog(cid cidSDK.ID, treeID string, height uint64) (Move, error) {
|
|
fullID := cid.String() + "/" + treeID
|
|
s, ok := f.treeMap[fullID]
|
|
if !ok {
|
|
return Move{}, ErrTreeNotFound
|
|
}
|
|
|
|
n := sort.Search(len(s.operations), func(i int) bool {
|
|
return s.operations[i].Time >= height
|
|
})
|
|
if n == len(s.operations) {
|
|
return Move{}, nil
|
|
}
|
|
return s.operations[n].Move, nil
|
|
}
|