Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
Types ¶
type Lesser ¶
type Lesser[T any] interface { comparable // Less returns true if this value is less than the other. Less(other T) bool }
Lesser defines types that can be compared to check for equality or to find the least. It is essential for ordered data-structures such as heaps, search trees and sorted sets.
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
Package heap provides the implementation of a generic binary heap.
|
Package heap provides the implementation of a generic binary heap. |
|
Package heap provides the implementation of a generic circular queue.
|
Package heap provides the implementation of a generic circular queue. |
|
Package sorted provides the implementation of a generic sorted list.
|
Package sorted provides the implementation of a generic sorted list. |
Click to show internal directories.
Click to hide internal directories.