Documentation
¶
Index ¶
- type OrderedSet
- func (s *OrderedSet[T]) Add(v T)
- func (s *OrderedSet[T]) Clear()
- func (s *OrderedSet[T]) Delete(v T) (deleted bool)
- func (s *OrderedSet[T]) ForEach(f func(v T, idx int))
- func (s *OrderedSet[T]) Has(v T) (has bool)
- func (s *OrderedSet[T]) Len() int
- func (s OrderedSet[T]) MarshalJSON() ([]byte, error)
- func (s *OrderedSet[T]) UnmarshalJSON(data []byte) error
- func (s *OrderedSet[T]) Values() []T
- type Set
- type SetLike
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type OrderedSet ¶
type OrderedSet[T comparable] struct { // contains filtered or unexported fields }
OrderedSet is same as Set but remembers insertion order.
func NewOrdered ¶
func NewOrdered[T comparable]() *OrderedSet[T]
func (*OrderedSet[T]) Add ¶
func (s *OrderedSet[T]) Add(v T)
func (*OrderedSet[T]) Clear ¶
func (s *OrderedSet[T]) Clear()
func (*OrderedSet[T]) Delete ¶
func (s *OrderedSet[T]) Delete(v T) (deleted bool)
func (*OrderedSet[T]) ForEach ¶
func (s *OrderedSet[T]) ForEach(f func(v T, idx int))
ForEach iterates over set and invoke f with each elements. The order is FIFO. Add with an existing v does not update the order.
func (*OrderedSet[T]) Has ¶
func (s *OrderedSet[T]) Has(v T) (has bool)
func (*OrderedSet[T]) Len ¶
func (s *OrderedSet[T]) Len() int
func (OrderedSet[T]) MarshalJSON ¶
func (s OrderedSet[T]) MarshalJSON() ([]byte, error)
func (*OrderedSet[T]) UnmarshalJSON ¶
func (s *OrderedSet[T]) UnmarshalJSON(data []byte) error
func (*OrderedSet[T]) Values ¶
func (s *OrderedSet[T]) Values() []T
type Set ¶
type Set[T comparable] struct { // contains filtered or unexported fields }
func New ¶
func New[T comparable]() *Set[T]
Source Files
Click to show internal directories.
Click to hide internal directories.