M.V. Hutz
361f529bdc
## Summary - Added doc comments across the codebase: `pkg/lambda`, `pkg/saccharine`, `pkg/codec`, `pkg/engine`, `pkg/iterator`, `pkg/set`, `pkg/convert`, `internal/registry`, and `cmd/lambda`. - Made lambda and saccharine expression structs use public fields instead of getters, matching `go/ast` conventions. - Removed superfluous constructors for saccharine and lambda expression/statement types in favor of struct literals. - Consolidated saccharine token constructors into a single `NewToken` function. - Removed the unused `trace` package. ## Test plan - [x] `go build ./...` passes. - [x] `go test ./...` passes. - [ ] Verify `go doc` output renders correctly for documented packages. Reviewed-on: #45 Co-authored-by: M.V. Hutz <git@maximhutz.me> Co-committed-by: M.V. Hutz <git@maximhutz.me>
71 lines
1.4 KiB
Go
71 lines
1.4 KiB
Go
// Package set defines a generic, mutable unordered set data structure.
|
|
package set
|
|
|
|
import "iter"
|
|
|
|
// A Set is an implementation of an mutable, unordered set. It uses a Golang map
|
|
// as its underlying data structure.
|
|
type Set[T comparable] map[T]bool
|
|
|
|
// Add appends a list of items into the set.
|
|
func (s Set[T]) Add(items ...T) {
|
|
for _, item := range items {
|
|
s[item] = true
|
|
}
|
|
}
|
|
|
|
// Has returns true an item is present in the set.
|
|
func (s Set[T]) Has(item T) bool {
|
|
return s[item]
|
|
}
|
|
|
|
// Remove deletes a list of items from the set.
|
|
func (s Set[T]) Remove(items ...T) {
|
|
for _, item := range items {
|
|
delete(s, item)
|
|
}
|
|
}
|
|
|
|
// Merge adds all items in the argument into the set. The argument is not
|
|
// mutated.
|
|
func (s Set[T]) Merge(o Set[T]) {
|
|
for item := range o {
|
|
s.Add(item)
|
|
}
|
|
}
|
|
|
|
// ToList returns all items present in the set, as a slice. The order of the
|
|
// items is not guaranteed.
|
|
func (s Set[T]) ToList() []T {
|
|
list := []T{}
|
|
|
|
for item := range s {
|
|
list = append(list, item)
|
|
}
|
|
|
|
return list
|
|
}
|
|
|
|
// Items returns a sequence of all items present in the set. The order of the
|
|
// items is not guaranteed.
|
|
func (s Set[T]) Items() iter.Seq[T] {
|
|
return func(yield func(T) bool) {
|
|
for item := range s {
|
|
if !yield(item) {
|
|
return
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// New creates a set of all items as argument.
|
|
func New[T comparable](items ...T) Set[T] {
|
|
result := Set[T]{}
|
|
|
|
for _, item := range items {
|
|
result.Add(item)
|
|
}
|
|
|
|
return result
|
|
}
|