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.

source

FAQ

• Whats the name ?.

Dik is a Dict.

Stars