Directories
¶
| Path | Synopsis |
|---|---|
|
algorithms
|
|
|
hsearch
Package hsearch provides a proof-of-concept for multiple searching algorithms.
|
Package hsearch provides a proof-of-concept for multiple searching algorithms. |
|
hsort
Package hsort provides a proof-of-concept for multiple sorting algorithms.
|
Package hsort provides a proof-of-concept for multiple sorting algorithms. |
|
data_structures
|
|
|
hbit
Package hbit provides a safe and fast utility for storing and operating on bits.
|
Package hbit provides a safe and fast utility for storing and operating on bits. |
|
hlist
Package hlist provides linked list functionalities.
|
Package hlist provides linked list functionalities. |
|
hqueue
Package hqueue provides a simple and lean first-in/first-out queue.
|
Package hqueue provides a simple and lean first-in/first-out queue. |
|
hstack
Package hstack provides a simple and lean last-in/first-out stack.
|
Package hstack provides a simple and lean last-in/first-out stack. |
|
htable
Package htable is a data structure of rows and columns, with each row having the same number of items and each column holding the same type of data.
|
Package htable is a data structure of rows and columns, with each row having the same number of items and each column holding the same type of data. |
|
htree
Package htree provides an interface to create and use balanced AVL binary trees.
|
Package htree provides an interface to create and use balanced AVL binary trees. |
Click to show internal directories.
Click to hide internal directories.