Documentation
¶
Overview ¶
Package sets provides an abstract Set interface.
In computer science, a set is an abstract data type that can store certain values and no repeated values. It is a computer implementation of the mathematical concept of a finite set. Unlike most other collection types, rather than retrieving a specific element from a set, one typically tests a value for membership in a set.
Reference: https://en.wikipedia.org/wiki/Set_%28abstract_data_type%29
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Set ¶
type Set[T comparable] interface { Add(elements ...T) Remove(elements ...T) Contains(elements ...T) bool containers.Container[T] }
Set interface that all sets implement
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
Package hashset implements a set backed by a hash table.
|
Package hashset implements a set backed by a hash table. |
|
Package linkedhashset is a set that preserves insertion-order.
|
Package linkedhashset is a set that preserves insertion-order. |
|
Package treeset implements a tree backed by a red-black tree.
|
Package treeset implements a tree backed by a red-black tree. |
Click to show internal directories.
Click to hide internal directories.