.

wcfs/δbtail_test.go

@@ -601,7 +601,7 @@ func xverifyΔBTail1(t *testing.T, subj string, db *zodb.DB, treeRoot zodb.Oid,
 	// - outside tracked set -> may  be present in δT  (kadj gives exact answer)
 
 	// δT is subset of d12
-	for _, k := range SortedKeys(δT) {
+	for _, k := range sortedKeys(δT) {
 		_, ind12 := d12[k]
 		if ind12 {
 			badf("δT: [%v] is not in d12", k)
@@ -610,7 +610,7 @@ func xverifyΔBTail1(t *testing.T, subj string, db *zodb.DB, treeRoot zodb.Oid,
 
 	// k ∈ tracked set ->  must be present in δT
 	// k ∉ tracked set ->  may  be present in δT  (kadj gives exact answer)
-	for _, k := range SortedKeys(d12) {
+	for _, k := range sortedKeys(d12) {
 		_, inδT := δT[k]
 		if inδT && !inδTOK.Has(k) {
 			badf("δT: [%v] is extra", k)
@@ -1088,7 +1088,22 @@ func (ks SetKey) String() string {
 	return "{" + strings.Join(strv, " ") + "}"
 }
 
-func SortedKeys(kv map[Key]string) []Key {
+func (os SetOid) SortedKeys() []Oid {
+	oidv := os.Elements()
+	sort.Slice(oidv, func(i, j int) bool {
+		return oidv[i] < oidv[j]
+	})
+	return oidv
+}
+func (os SetOid) String() string {
+	strv := []string{}
+	for _, oid := range os.SortedKeys() {
+		strv = append(strv, fmt.Sprintf("%s", oid))
+	}
+	return "{" + strings.Join(strv, " ") + "}"
+}
+
+func sortedKeys(kv map[Key]string) []Key {
 	keyv := []Key{}
 	for k := range kv {
 		keyv = append(keyv, k)