Documentation
¶
Index ¶
- func MapAdd[K comparable, V any, Map KVS[K, V]](m Map, k K, v V) func()
- type KVS
- type LinkedList
- func (ll *LinkedList[T]) Append(vs ...T)
- func (ll *LinkedList[T]) Iter() iter.Seq[T]
- func (ll *LinkedList[T]) Len() int
- func (ll *LinkedList[T]) Lookup(index int) (T, bool)
- func (ll *LinkedList[T]) Pop() (T, bool)
- func (ll *LinkedList[T]) Prepend(vs ...T)
- func (ll *LinkedList[T]) Shift() (T, bool)
- func (ll *LinkedList[T]) ToSlice() []T
- type List
- type Map
- type OrderedSet
- type Sizer
Examples ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func MapAdd ¶
func MapAdd[K comparable, V any, Map KVS[K, V]](m Map, k K, v V) func()
Types ¶
type KVS ¶ added in v0.302.0
type KVS[K comparable, V any] interface { Lookup(key K) (V, bool) Get(key K) V Set(key K, val V) Delete(key K) Keys() []K ToMap() map[K]V Sizer }
KVS stands for Key Value Store, and a common interface for map[K]V types.
type LinkedList ¶ added in v0.302.0
type LinkedList[T any] struct { // contains filtered or unexported fields }
func (*LinkedList[T]) Append ¶ added in v0.302.0
func (ll *LinkedList[T]) Append(vs ...T)
func (*LinkedList[T]) Iter ¶ added in v0.302.0
func (ll *LinkedList[T]) Iter() iter.Seq[T]
func (*LinkedList[T]) Len ¶ added in v0.302.0
func (ll *LinkedList[T]) Len() int
Len returns the length of elements in the list
func (*LinkedList[T]) Lookup ¶ added in v0.302.0
func (ll *LinkedList[T]) Lookup(index int) (T, bool)
func (*LinkedList[T]) Pop ¶ added in v0.302.0
func (ll *LinkedList[T]) Pop() (T, bool)
func (*LinkedList[T]) Prepend ¶ added in v0.302.0
func (ll *LinkedList[T]) Prepend(vs ...T)
Prepend adds an element to the beginning of the list.
func (*LinkedList[T]) Shift ¶ added in v0.302.0
func (ll *LinkedList[T]) Shift() (T, bool)
func (*LinkedList[T]) ToSlice ¶ added in v0.302.0
func (ll *LinkedList[T]) ToSlice() []T
type Map ¶
type Map[K comparable, V any] map[K]V
type OrderedSet ¶ added in v0.302.0
type OrderedSet[T comparable] struct { // contains filtered or unexported fields }
Example ¶
package main
import (
"go.llib.dev/frameless/pkg/datastruct"
)
func main() {
var set datastruct.OrderedSet[string]
set.Append("foo", "bar", "baz", "foo")
set.ToSlice() // []string{"foo", "bar", "baz"}
set.Len() // 3
}
Example (FromSlice) ¶
package main
import (
"go.llib.dev/frameless/pkg/datastruct"
)
func main() {
var vs = []string{"foo", "bar", "baz", "foo"}
var set = datastruct.OrderedSet[string]{}.FromSlice(vs)
set.ToSlice() // []string{"foo", "bar", "baz"}
set.Len() // 3
}
Example (Has) ¶
package main
import (
"go.llib.dev/frameless/pkg/datastruct"
)
func main() {
var set datastruct.OrderedSet[string]
set.Append("foo", "bar", "baz", "foo")
set.Has("foo") // true
set.Has("bar") // true
set.Has("oof") // false
}
Example (Iterate) ¶
package main
import (
"go.llib.dev/frameless/pkg/datastruct"
)
func main() {
var set datastruct.OrderedSet[string]
set.Append("foo", "bar", "baz", "foo")
for v := range set.Iter() {
_ = v // "foo" -> "bar" -> "baz"
}
}
func (*OrderedSet[T]) Append ¶ added in v0.302.0
func (s *OrderedSet[T]) Append(vs ...T)
func (OrderedSet[T]) FromSlice ¶ added in v0.302.0
func (set OrderedSet[T]) FromSlice(vs []T) OrderedSet[T]
func (OrderedSet[T]) Has ¶ added in v0.302.0
func (s OrderedSet[T]) Has(v T) bool
func (OrderedSet[T]) Iter ¶ added in v0.302.0
func (s OrderedSet[T]) Iter() iter.Seq[T]
func (OrderedSet[T]) Len ¶ added in v0.302.0
func (s OrderedSet[T]) Len() int
func (OrderedSet[T]) ToSlice ¶ added in v0.302.0
func (s OrderedSet[T]) ToSlice() []T
Source Files
Click to show internal directories.
Click to hide internal directories.