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
108
109
110
111
112
113
114
115
116
|
// Copyright 2015 The etcd Authors
//
// 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 v2store
import (
"sort"
"time"
"github.com/jonboulle/clockwork"
)
// NodeExtern is the external representation of the
// internal node with additional fields
// PrevValue is the previous value of the node
// TTL is time to live in second
type NodeExtern struct {
Key string `json:"key,omitempty"`
Value *string `json:"value,omitempty"`
Dir bool `json:"dir,omitempty"`
Expiration *time.Time `json:"expiration,omitempty"`
TTL int64 `json:"ttl,omitempty"`
Nodes NodeExterns `json:"nodes,omitempty"`
ModifiedIndex uint64 `json:"modifiedIndex,omitempty"`
CreatedIndex uint64 `json:"createdIndex,omitempty"`
}
func (eNode *NodeExtern) loadInternalNode(n *node, recursive, sorted bool, clock clockwork.Clock) {
if n.IsDir() { // node is a directory
eNode.Dir = true
children, _ := n.List()
eNode.Nodes = make(NodeExterns, len(children))
// we do not use the index in the children slice directly
// we need to skip the hidden one
i := 0
for _, child := range children {
if child.IsHidden() { // get will not return hidden nodes
continue
}
eNode.Nodes[i] = child.Repr(recursive, sorted, clock)
i++
}
// eliminate hidden nodes
eNode.Nodes = eNode.Nodes[:i]
if sorted {
sort.Sort(eNode.Nodes)
}
} else { // node is a file
value, _ := n.Read()
eNode.Value = &value
}
eNode.Expiration, eNode.TTL = n.expirationAndTTL(clock)
}
func (eNode *NodeExtern) Clone() *NodeExtern {
if eNode == nil {
return nil
}
nn := &NodeExtern{
Key: eNode.Key,
Dir: eNode.Dir,
TTL: eNode.TTL,
ModifiedIndex: eNode.ModifiedIndex,
CreatedIndex: eNode.CreatedIndex,
}
if eNode.Value != nil {
s := *eNode.Value
nn.Value = &s
}
if eNode.Expiration != nil {
t := *eNode.Expiration
nn.Expiration = &t
}
if eNode.Nodes != nil {
nn.Nodes = make(NodeExterns, len(eNode.Nodes))
for i, n := range eNode.Nodes {
nn.Nodes[i] = n.Clone()
}
}
return nn
}
type NodeExterns []*NodeExtern
// interfaces for sorting
func (ns NodeExterns) Len() int {
return len(ns)
}
func (ns NodeExterns) Less(i, j int) bool {
return ns[i].Key < ns[j].Key
}
func (ns NodeExterns) Swap(i, j int) {
ns[i], ns[j] = ns[j], ns[i]
}
|
