Implemented an ordered set for function dependencies

src/compiler/eachFunction.go

@@ -10,7 +10,7 @@ func (r *Result) eachFunction(caller *core.Function, traversed map[*core.Functio
 	call(caller)
 	traversed[caller] = true
 
-	for _, function := range caller.Dependencies {
+	for function := range caller.Dependencies.All() {
 		if traversed[function] {
 			continue
 		}

src/core/CompileDelete.go

@@ -26,6 +26,6 @@ func (f *Function) CompileDelete(root *expression.Expression) error {
 	f.BeforeCall()
 	f.Label(asm.CALL, asm.Label{Name: "mem.free", Type: asm.FunctionLabel})
 	f.AfterCall(f.CPU.Input[:2])
-	f.Dependencies = append(f.Dependencies, free)
+	f.Dependencies.Add(free)
 	return nil
 }

src/core/CompileNew.go

@@ -49,6 +49,6 @@ func (f *Function) CompileNew(root *expression.Expression) (types.Type, error) {
 	f.BeforeCall()
 	f.Label(asm.CALL, asm.Label{Name: "mem.alloc", Type: asm.FunctionLabel})
 	f.AfterCall(f.CPU.Input[:1])
-	f.Dependencies = append(f.Dependencies, alloc)
+	f.Dependencies.Add(alloc)
 	return &types.Pointer{To: typ}, nil
 }

src/core/EvaluateDot.go

@@ -76,7 +76,7 @@ func (f *Function) EvaluateDot(expr *expression.Expression) (eval.Value, error)
 	function, exists := f.All.Functions[label]
 
 	if exists {
-		f.Dependencies = append(f.Dependencies, function)
+		f.Dependencies.Add(function)
 
 		value := &eval.Label{
 			Typ: types.AnyPointer,

src/core/EvaluateToken.go

@@ -46,7 +46,7 @@ func (f *Function) EvaluateToken(t token.Token) (eval.Value, error) {
 		function, exists := f.All.Functions[uniqueName]
 
 		if exists {
-			f.Dependencies = append(f.Dependencies, function)
+			f.Dependencies.Add(function)
 
 			value := &eval.Label{
 				Typ: types.AnyPointer,

src/core/Function.go

@@ -4,6 +4,7 @@ import (
 	"git.urbach.dev/cli/q/src/dll"
 	"git.urbach.dev/cli/q/src/fs"
 	"git.urbach.dev/cli/q/src/register"
+	"git.urbach.dev/cli/q/src/set"
 	"git.urbach.dev/cli/q/src/token"
 )
 
@@ -18,7 +19,7 @@ type Function struct {
 	Body         token.List
 	Input        []*Parameter
 	Output       []*Parameter
-	Dependencies []*Function
+	Dependencies set.Ordered[*Function]
 	DLLs         dll.List
 	Err          error
 	deferred     []func()

src/readme.md

@@ -24,6 +24,7 @@
 - [riscv](riscv) - RISCV implementation (w.i.p.)
 - [scanner](scanner) - Scanner frontend used by `build`
 - [scope](scope) - Defines a `Scope` used for code blocks
+- [set](set) - Generic set implementation
 - [sizeof](sizeof) - Calculates the byte size of numbers
 - [token](token) - Converts a file to tokens with the `Tokenize` function
 - [types](types) - Type system

src/set/Ordered.go

@@ -0,0 +1,33 @@
+package set
+
+import (
+	"iter"
+	"slices"
+)
+
+// Ordered is an ordered set.
+type Ordered[T comparable] struct {
+	values []T
+}
+
+// Add adds a value to the set if it doesn't exist yet.
+// It returns `false` if it already exists, `true` if it was added.
+func (set *Ordered[T]) Add(value T) bool {
+	if slices.Contains(set.values, value) {
+		return false
+	}
+
+	set.values = append(set.values, value)
+	return true
+}
+
+// All returns an iterator over all the values in the set.
+func (set *Ordered[T]) All() iter.Seq[T] {
+	return func(yield func(T) bool) {
+		for _, value := range set.values {
+			if !yield(value) {
+				return
+			}
+		}
+	}
+}