zoopb/package.sort.pb.go

// Code generated by go.wit.com/apps/autogenpb DO NOT EDIT.
// This file was autogenerated with autogenpb v0.5.5-2-g6c9a3dd 2025.09.22_0851
//     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 zoopb

import (
	"fmt"
	"iter"
	"sort"
	"sync"

	"google.golang.org/protobuf/proto"
)

// a simple global lock
var packageMu sync.RWMutex

func (x *Packages) fixUuid() {
	if x == nil {
		return
	}
	if x.Uuid == "2f26cc03-ea30-4481-a333-ad0acc86e1d3" {
		return
	}
	x.Uuid = "2f26cc03-ea30-4481-a333-ad0acc86e1d3"
	x.Version = "v0.0.1 go.wit.com/lib/protobuf/zoopb"
}

func NewPackages() *Packages {
	x := new(Packages)
	x.Uuid = "2f26cc03-ea30-4481-a333-ad0acc86e1d3"
	x.Version = "v0.0.1 go.wit.com/lib/protobuf/zoopb"
	return x
}

// START SORT

// DEFINE THE Packages SCANNER.
// itializes a new scanner.
func newPackagesScanner(things []*Packages) *PackagesScanner {
	return &PackagesScanner{things: things}
}

type PackagesScanner struct {
	sync.Mutex

	things []*Packages
	index  int
}

func (it *PackagesScanner) Scan() bool {
	if it.index >= len(it.things) {
		return false
	}
	it.Lock()
	it.index++
	it.Unlock()
	return true
}

// Next() returns the next thing in the array
func (it *PackagesScanner) Next() *Packages {
	if it.things[it.index-1] == nil {
		fmt.Println("Next() error in PackagesScanner", it.index)
	}
	return it.things[it.index-1]
}

// END DEFINE THE SCANNER

// DEFINE THE Package SCANNER.
// itializes a new scanner.
func newPackageScanner(things []*Package) *PackageScanner {
	return &PackageScanner{things: things}
}

type PackageScanner struct {
	sync.Mutex

	things []*Package
	index  int
}

func (it *PackageScanner) Scan() bool {
	if it.index >= len(it.things) {
		return false
	}
	it.Lock()
	it.index++
	it.Unlock()
	return true
}

// Next() returns the next thing in the array
func (it *PackageScanner) Next() *Package {
	if it.things[it.index-1] == nil {
		fmt.Println("Next() error in PackageScanner", it.index)
	}
	return it.things[it.index-1]
}

// END DEFINE THE SCANNER

// sort struct by Name
type sortPackageName []*Package

func (a sortPackageName) Len() int           { return len(a) }
func (a sortPackageName) Less(i, j int) bool { return a[i].Name < a[j].Name }
func (a sortPackageName) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }

// safely returns a slice of pointers to the FRUIT protobufs
func (x *Packages) allPackages() []*Package {
	x.RLock()
	defer x.RUnlock()

	// Create a new slice to hold pointers to each FRUIT
	var tmp []*Package
	tmp = make([]*Package, len(x.Packages))
	for i, p := range x.Packages {
		tmp[i] = p // Copy pointers for safe iteration
	}

	return tmp
}

// safely returns a slice of pointers to the Package protobufs
func (x *Packages) selectAllPackages() []*Package {
	x.RLock()
	defer x.RUnlock()

	// Create a new slice to hold pointers to each Package
	var tmp []*Package
	tmp = make([]*Package, len(x.Packages))
	for i, p := range x.Packages {
		tmp[i] = p // Copy pointers for safe iteration
	}

	return tmp
}
func (x *Packages) SortByName() *PackageScanner {
	// copy the pointers as fast as possible.
	things := x.selectAllPackages()

	// todo: try slices.SortFunc() instead to see what happens
	sort.Sort(sortPackageName(things))
	//    slices.SortFunc(things, func(a, b *Packages) bool {
	//        return a.Name < b.Name // Sort by ??. let the compiler work it out??
	//    })
	return newPackageScanner(things)
}

// 'for x := range' syntax using the awesome golang 1.24 'iter'
func (x *Packages) IterByName() iter.Seq[*Package] {
	items := x.selectAllPackages()
	sort.Sort(sortPackageName(items))
	// log.Println("Made Iter.Seq[] with length", len(items))
	return func(yield func(*Package) bool) {
		for _, v := range items {
			if !yield(v) {
				return
			}
		}
	}
}

// END SORT

func (x *Packages) Len() int {
	x.RLock()
	defer x.RUnlock()

	return len(x.Packages)
}

// a Append() shortcut (that does Clone() with a mutex) notsure if it really works
func (x *Packages) Append(y *Package) *Package {
	x.Lock()
	defer x.Unlock()

	z := proto.Clone(y).(*Package)
	x.Packages = append(x.Packages, z)

	return z
}

func (x *Packages) All() *PackageScanner {
	PackagePointers := x.selectAllPackages()

	scanner := newPackageScanner(PackagePointers)
	return scanner
}

// Iterate 'for x := range' syntax using the awesome golang 1.24 'iter'
func (x *Packages) IterAll() iter.Seq[*Package] {
	items := x.selectAllPackages()
	// log.Println("Made All() Iter.Seq[] with length", len(items))
	return func(yield func(*Package) bool) {
		for _, v := range items {
			if !yield(v) {
				return
			}
		}
	}
}
func (x *Packages) Delete(y *Package) bool {
	x.Lock()
	defer x.Unlock()

	for i, _ := range x.Packages {
		if x.Packages[i] == y {
			x.Packages[i] = x.Packages[len(x.Packages)-1]
			x.Packages = x.Packages[:len(x.Packages)-1]
			return true
		}
	}
	return false
}

// lookup a Packages by the  Name
func (x *Packages) FindByName(s string) *Package {
	if x == nil {
		return nil
	}

	x.RLock()
	defer x.RUnlock()

	for i, _ := range x.Packages {
		if x.Packages[i].Name == s {
			return x.Packages[i]
		}
	}
	return nil
}

// returns a Package if Name matches, otherwise create
func (x *Packages) InsertByName(y string) *Package {
	x.Lock()
	defer x.Unlock()

	for _, z := range x.Packages {
		if z.Name == y {
			return z
		}
	}

	z := new(Package)
	z.Name = y
	x.Packages = append(x.Packages, z)
	return z
}

func (x *Packages) DeleteByName(s string) bool {
	x.Lock()
	defer x.Unlock()

	for i, _ := range x.Packages {
		if x.Packages[i].Name == s {
			x.Packages[i] = x.Packages[len(x.Packages)-1]
			x.Packages = x.Packages[:len(x.Packages)-1]
			return true
		}
	}
	return false
}

func (x *Packages) AppendByName(y *Package) bool {
	x.Lock()
	defer x.Unlock()

	for _, p := range x.Packages {
		if p.Name == y.Name {
			return false
		}
	}

	x.Packages = append(x.Packages, proto.Clone(y).(*Package))
	return true
}