Notes added by 'git notes append'

528e051effbc5d7dec236dd5e48f6eb20b28692e

@@ -345,3 +345,225 @@ func file_gitTag_proto_init() {
 }
 
 // `autogen:gitTag.sort.pb.go`
+
+// Code generated by go.wit.com/apps/autogenpb DO NOT EDIT.
+// This file was autogenerated with autogenpb v0.0.38-3-g25ae7fc 2025.01.10_0403
+//     go install go.wit.com/apps/autogenpb@latest
+//
+// define which structs (messages) you want to use in the .proto file
+// Then sort.pb.go and marshal.pb.go files are autogenerated
+//
+// autogenpb uses it and has an example .proto file with instructions
+//
+
+package gitpb
+
+import (
+	"fmt"
+	"sort"
+	"sync"
+)
+
+// bad global lock until modifying the .pb.go file is tested
+// sync.RWMutex or sync.Mutex?
+var gitTagMu sync.RWMutex
+
+type GitTagIterator struct {
+	sync.RWMutex
+
+	things []*GitTag
+	index int
+}
+
+// NewGitTagIterator initializes a new iterator.
+func NewGitTagIterator(things []*GitTag) *GitTagIterator {
+	return &GitTagIterator{things: things}
+}
+
+// Scan moves to the next element and returns false if there are no more things.
+// Use Scan() in a loop, similar to a while loop
+//
+//	for iterator.Scan()
+//		d := iterator.Next(
+//		fmt.Println("found UUID:", d.Uuid
+//	}
+func (it *GitTagIterator) Scan() bool {
+	if it.index >= len(it.things) {
+		return false
+	}
+	it.index++
+	return true
+}
+
+// Next() returns the next thing in the array
+func (it *GitTagIterator) Next() *GitTag {
+	if it.things[it.index-1] == nil {
+		for i, d := range it.things {
+			fmt.Println("i =", i, d)
+		}
+	}
+	return it.things[it.index-1]
+}
+
+func (all *GitTags) All() *GitTagIterator {
+	GitTagPointers := all.selectAllGitTag()
+
+	iterator := NewGitTagIterator(GitTagPointers)
+	return iterator
+}
+
+func (all *GitTags) Len() int {
+	all.Lock.RLock()
+	defer all.Lock.RUnlock()
+
+	return len(all.GitTags)
+}
+
+// safely returns a slice of pointers to the GitTag protobufs
+func (all *GitTags) selectAllGitTag() []*GitTag {
+	all.Lock.RLock()
+	defer all.Lock.RUnlock()
+
+	// Create a new slice to hold pointers to each GitTag
+	var tmp []*GitTag
+	tmp = make([]*GitTag, len(all.GitTags))
+	for i, p := range all.GitTags {
+		tmp[i] = p // Copy pointers for safe iteration
+	}
+
+	return tmp
+}
+// maybe seperate files here?
+// just a simple Append() with no checking (but still uses the mutex lock)
+func (all *GitTags) Append(newP *GitTag) bool {
+	all.Lock.RLock()
+	defer all.Lock.RUnlock()
+
+	all.GitTags = append(all.GitTags, newP)
+	return true
+}
+
+// enforces GitTag is unique
+func (all *GitTags) AppendUniqueRefname(newP *GitTag) bool {
+	all.Lock.RLock()
+	defer all.Lock.RUnlock()
+
+	for _, p := range all.GitTags {
+		if p.Refname == newP.Refname {
+			return false
+		}
+	}
+
+	all.GitTags = append(all.GitTags, newP)
+	return true
+}
+
+// enforces GitTag is unique
+func (all *GitTags) AppendUniqueHash(newP *GitTag) bool {
+	all.Lock.RLock()
+	defer all.Lock.RUnlock()
+
+	for _, p := range all.GitTags {
+		if p.Hash == newP.Hash {
+			return false
+		}
+	}
+
+	all.GitTags = append(all.GitTags, newP)
+	return true
+}
+
+// enforces GitTag is unique
+func (all *GitTags) AppendUnique(newP *GitTag) bool {
+	all.Lock.RLock()
+	defer all.Lock.RUnlock()
+
+	for _, p := range all.GitTags {
+		if p.Refname == newP.Refname {
+			return false
+		}
+		if p.Hash == newP.Hash {
+			return false
+		}
+	}
+
+	all.GitTags = append(all.GitTags, newP)
+	return true
+}
+
+func (all *GitTags) SortByRefname() *GitTagIterator {
+	things := all.selectAllGitTag()
+
+	sort.Sort(GitTagRefname(things))
+
+	iterator := NewGitTagIterator(things)
+	return iterator
+}
+
+type GitTagRefname []*GitTag
+
+func (a GitTagRefname) Len() int           { return len(a) }
+func (a GitTagRefname) Less(i, j int) bool { return a[i].Refname < a[j].Refname }
+func (a GitTagRefname) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }
+
+func (all *GitTags) DeleteByRefname(s string) bool {
+	all.Lock.RLock()
+	defer all.Lock.RUnlock()
+
+	for i, _ := range all.GitTags {
+		if all.GitTags[i].Refname == s {
+			all.GitTags[i] = all.GitTags[len(all.GitTags)-1]
+			all.GitTags = all.GitTags[:len(all.GitTags)-1]
+			return true
+		}
+	}
+	return false
+}
+
+func (all *GitTags) DeleteByHash(s string) bool {
+	all.Lock.RLock()
+	defer all.Lock.RUnlock()
+
+	for i, _ := range all.GitTags {
+		if all.GitTags[i].Hash == s {
+			all.GitTags[i] = all.GitTags[len(all.GitTags)-1]
+			all.GitTags = all.GitTags[:len(all.GitTags)-1]
+			return true
+		}
+	}
+	return false
+}
+
+// find a dependancy by the go path
+func (all *GitTags) FindByRefname(s string) *GitTag {
+	if all == nil {
+		return nil
+	}
+
+	all.Lock.RLock()
+	defer all.Lock.RUnlock()
+
+	for i, _ := range all.GitTags {
+		if all.GitTags[i].Refname == s {
+			return all.GitTags[i]
+		}
+	}
+	return nil
+}
+
+// find a dependancy by the go path
+func (all *GitTags) FindByHash(s string) *GitTag {
+	if all == nil {
+		return nil
+	}
+
+	all.Lock.RLock()
+	defer all.Lock.RUnlock()
+
+	for i, _ := range all.GitTags {
+		if all.GitTags[i].Hash == s {
+			return all.GitTags[i]
+		}
+	}
+	return nil
+}