dik
Table implemented as optimized sorted hashed dictionary of {array[char]: Option[T]}, same size as OrderedTable
Summary
| Latest Version | Unknown |
|---|---|
| License | MIT |
| CI Status | Failing |
| Downloads | 0 |
| Last Indexed | 2026-07-21 05:24 |
Tags
Installation
nimble install dik
choosenim install dik
git clone https://github.com/juancarlospaco/dik
OS Compatibility
| Platform | Linux | macOS | Windows | FreeBSD | OpenBSD | NetBSD | Android | iOS | WASM | Embedded |
|---|---|---|---|---|---|---|---|---|---|---|
| dik | ✓ | ✓ | ✓ | - | - | - | - | - | - | - |
Source
| Repository | https://github.com/juancarlospaco/dik |
|---|---|
| Homepage | https://github.com/juancarlospaco/dik |
| Registry Source | nimble_official |
README
Dik
Table implemented as optimized sorted hashed dictionary, same size and API as a Table, 0 dependencies, ~300 lines.
Get items by index or BackwardsIndex or Slice or string,
destructor, resize in-place, toSeq, pretty, Heterogeneous values, tests for everything.
Documentation, Tests, Examples: https://juancarlospaco.github.io/dik
![]()
Benchmark
| Operation | Table |
Dik |
|---|---|---|
del() |
974 microseconds | 301 microseconds |
clear() |
5 milliseconds | 150 microseconds |
add() |
418 microseconds | 250 microseconds |
get() |
242 microseconds | 220 microseconds |
Table is not ordered and does not return Option[T], so it is just an approximation for development.
FAQ
- Whats the name ?.
Dik is a Dict.