unordered_set

Documentation

Index

• type UnorderedSet
  • func NewUnorderedSet[T comparable]() *UnorderedSet[T]
  • func (s *UnorderedSet[T]) Contains(item T) bool
  • func (s *UnorderedSet[T]) Empty() bool
  • func (s *UnorderedSet[T]) Erase(item T)
  • func (s *UnorderedSet[T]) Insert(item T)
  • func (s *UnorderedSet[T]) Size() int

Types

type UnorderedSet

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

UnorderedSet is unordered unordered_set based on standard map It can contain comparable elements only

func NewUnorderedSet

func NewUnorderedSet[T comparable]() *UnorderedSet[T]

func (*UnorderedSet[T]) Contains

func (s *UnorderedSet[T]) Contains(item T) bool

Contains checks if Set contains given element. Complexity - O(1). returns true if Set includes the element, false otherwise.

func (*UnorderedSet[T]) Empty

func (s *UnorderedSet[T]) Empty() bool

Empty checks if there are elements in Set. Complexity - O(1). Returns true if the unordered_set is empty, false otherwise.

func (*UnorderedSet[T]) Erase

func (s *UnorderedSet[T]) Erase(item T)

Erase deletes the element from unordered_set if it contains an element does nothing otherwise. Complexity - O(1).

func (*UnorderedSet[T]) Insert

func (s *UnorderedSet[T]) Insert(item T)

Insert inserts element into Set. Complexity - O(1).

func (*UnorderedSet[T]) Size

func (s *UnorderedSet[T]) Size() int

Size returns the number of elements in the container. Complexity - O(1).