mirror of
https://github.com/hanzoai/volume.git
synced 2026-10-01 00:48:00 +00:00
zeekay
b61441f7d7
A fork of Rancher's local-path-provisioner at v0.0.36. The behaviour is unchanged and deliberately so — a directory on the node a pod lands on is the right thing for a disk. What changes is identity. The provisioner answers to hanzo.ai/volume rather than rancher.io/local-path. That is not branding: two provisioners sharing one name race for the same claims, and a stock k3s carries the upstream one, so a cluster running both would settle our storage by chance. Data lives at /var/lib/hanzo/volume, so reading a Hanzo cluster does not mean learning another vendor's directory. Apache-2.0 as published, unaltered, with Rancher's attribution in NOTICE. The README says what this is not: durability. A volume here dies with its node. That is hanzoai/replicate's question, one layer up, and keeping the two apart is what lets the disk stay this simple.
98 lines
2.1 KiB
Go
98 lines
2.1 KiB
Go
/*
|
|
Copyright 2019 The Kubernetes 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 value
|
|
|
|
import (
|
|
"sort"
|
|
"strings"
|
|
)
|
|
|
|
// Field is an individual key-value pair.
|
|
type Field struct {
|
|
Name string
|
|
Value Value
|
|
}
|
|
|
|
// FieldList is a list of key-value pairs. Each field is expected to
|
|
// have a different name.
|
|
type FieldList []Field
|
|
|
|
// Sort sorts the field list by Name.
|
|
func (f FieldList) Sort() {
|
|
if len(f) < 2 {
|
|
return
|
|
}
|
|
if len(f) == 2 {
|
|
if f[1].Name < f[0].Name {
|
|
f[0], f[1] = f[1], f[0]
|
|
}
|
|
return
|
|
}
|
|
sort.SliceStable(f, func(i, j int) bool {
|
|
return f[i].Name < f[j].Name
|
|
})
|
|
}
|
|
|
|
// Less compares two lists lexically.
|
|
func (f FieldList) Less(rhs FieldList) bool {
|
|
return f.Compare(rhs) == -1
|
|
}
|
|
|
|
// Compare compares two lists lexically. The result will be 0 if f==rhs, -1
|
|
// if f < rhs, and +1 if f > rhs.
|
|
func (f FieldList) Compare(rhs FieldList) int {
|
|
i := 0
|
|
for {
|
|
if i >= len(f) && i >= len(rhs) {
|
|
// Maps are the same length and all items are equal.
|
|
return 0
|
|
}
|
|
if i >= len(f) {
|
|
// F is shorter.
|
|
return -1
|
|
}
|
|
if i >= len(rhs) {
|
|
// RHS is shorter.
|
|
return 1
|
|
}
|
|
if c := strings.Compare(f[i].Name, rhs[i].Name); c != 0 {
|
|
return c
|
|
}
|
|
if c := Compare(f[i].Value, rhs[i].Value); c != 0 {
|
|
return c
|
|
}
|
|
// The items are equal; continue.
|
|
i++
|
|
}
|
|
}
|
|
|
|
// Equals returns true if the two fieldslist are equals, false otherwise.
|
|
func (f FieldList) Equals(rhs FieldList) bool {
|
|
if len(f) != len(rhs) {
|
|
return false
|
|
}
|
|
for i := range f {
|
|
if f[i].Name != rhs[i].Name {
|
|
return false
|
|
}
|
|
if !Equals(f[i].Value, rhs[i].Value) {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|