mirror of
https://github.com/featurebasedb/featurebase.git
synced 2026-10-15 07:18:04 +00:00
4c53f86e82
i used this script, a little clunky but it got the job done
```bash
for file in `find . -type f -print | grep '\.go'`; do
sed '1,/^\/\/ limitations under the License.$/d' $file > $file.tmp;
result=`cat $file.tmp`
if [[ result != "" ]]; then
gofmt $file.tmp &> /dev/null;
if [[ $? == 0 ]]; then
mv $file.tmp $file && gofmt -w $file;
else
rm $file.tmp;
fi
else
rm $file.tmp;
fi
done
```
95 lines
2.2 KiB
Go
95 lines
2.2 KiB
Go
package topology
|
|
|
|
import (
|
|
"sort"
|
|
)
|
|
|
|
// Noder is an interface which abstracts the Node slice so that the list of
|
|
// nodes in a cluster can be maintained outside of the cluster struct.
|
|
type Noder interface {
|
|
Nodes() []*Node // Remember: this has to be sorted correctly!!
|
|
PrimaryNodeID(hasher Hasher) string
|
|
SetNodes([]*Node)
|
|
AppendNode(*Node)
|
|
RemoveNode(nodeID string) bool
|
|
}
|
|
|
|
// localNoder is a simple implementation of the Noder interface
|
|
// which maintains an instance of the `nodes` slice.
|
|
type localNoder struct {
|
|
nodes []*Node
|
|
}
|
|
|
|
// NewLocalNoder is a helper function for wrapping an existing slice of Nodes
|
|
// with something which implements Noder.
|
|
func NewLocalNoder(nodes []*Node) *localNoder {
|
|
return &localNoder{
|
|
nodes: nodes,
|
|
}
|
|
}
|
|
|
|
// NewEmptyLocalNoder is an empty Noder used for testing.
|
|
func NewEmptyLocalNoder() *localNoder {
|
|
return &localNoder{}
|
|
}
|
|
|
|
// NewIDNoder is a helper function for wrapping an existing slice of Node IDs
|
|
// with something which implements Noder.
|
|
func NewIDNoder(ids []string) *localNoder {
|
|
nodes := make([]*Node, len(ids))
|
|
for i, id := range ids {
|
|
node := &Node{
|
|
ID: id,
|
|
}
|
|
nodes[i] = node
|
|
}
|
|
|
|
// Nodes must be sorted.
|
|
sort.Sort(ByID(nodes))
|
|
|
|
return &localNoder{
|
|
nodes: nodes,
|
|
}
|
|
}
|
|
|
|
// Nodes implements the Noder interface.
|
|
func (n *localNoder) Nodes() []*Node {
|
|
return n.nodes
|
|
}
|
|
|
|
// PrimaryNodeID implements the Noder interface.
|
|
func (n *localNoder) PrimaryNodeID(hasher Hasher) string {
|
|
snap := NewClusterSnapshot(NewLocalNoder(n.nodes), hasher, 1)
|
|
primaryNode := snap.PrimaryFieldTranslationNode()
|
|
if primaryNode == nil {
|
|
return ""
|
|
}
|
|
return primaryNode.ID
|
|
}
|
|
|
|
// SetNodes implements the Noder interface.
|
|
func (n *localNoder) SetNodes(nodes []*Node) {
|
|
n.nodes = nodes
|
|
}
|
|
|
|
// AppendNode implements the Noder interface.
|
|
func (n *localNoder) AppendNode(node *Node) {
|
|
n.nodes = append(n.nodes, node)
|
|
|
|
// All hosts must be merged in the same order on all nodes in the cluster.
|
|
sort.Sort(ByID(n.nodes))
|
|
}
|
|
|
|
// RemoveNode implements the Noder interface.
|
|
func (n *localNoder) RemoveNode(nodeID string) bool {
|
|
i := NodePositionByID(n.nodes, nodeID)
|
|
if i < 0 {
|
|
return false
|
|
}
|
|
|
|
copy(n.nodes[i:], n.nodes[i+1:])
|
|
n.nodes[len(n.nodes)-1] = nil
|
|
n.nodes = n.nodes[:len(n.nodes)-1]
|
|
|
|
return true
|
|
}
|