datastruct

package

v0.296.0 Latest Latest Go to latest Published: Apr 9, 2025 License: Apache-2.0 Imports: 0 Imported by: 0

Details

This section is empty.

This section is empty.

func MapAdd[K comparable, V any, Map MapInterface[K, V]](m Map, k K, v V) func()

type Map[K comparable, V any] map[K]V

func (m Map[K, V]) Delete(key K)

func (m Map[K, V]) Get(key K) V

func (m Map[K, V]) Keys() []K

func (m Map[K, V]) Len() int

func (m Map[K, V]) Lookup(key K) (V, bool)

func (m Map[K, V]) Set(key K, val V)

type MapInterface[K comparable, V any] interface {
	Lookup(key K) (V, bool)
	Get(key K) V
	Set(key K, val V)
	Delete(key K)

	Len() int
	Keys() []K
}

type Set[T comparable] struct {
	// contains filtered or unexported fields
}

func (s *Set[T]) Add(v T)

func (set Set[T]) From(vs ...T) Set[T]

func (set Set[T]) FromSlice(vs []T) Set[T]

func (s Set[T]) Has(v T) bool

func (s Set[T]) ToSlice() []T

type Stack[T any] []T

func (s *Stack[T]) IsEmpty() bool

IsEmpty check if stack is empty

func (s *Stack[T]) Last() (T, bool)

Last returns the last stack element

func (s *Stack[T]) Pop() (T, bool)

Pop remove and return top element of stack. Return false if stack is empty.

func (s *Stack[T]) Push(v T)

Push a new value onto the stack