version(showAssertTags) dbg(); struct S { int x; } alias Key = S; auto set = radixTreeSet!(Key); assert(!set.contains(S(43))); assert(set.insert(S(43))); assert(set.contains(S(43))); assert(!set.insert(S(43))); assert(set.contains(S(43)));
TODO activate
version(showAssertTags) dbg(); // alias Key = string; // alias Value = Array!int; // RadixTreeMapGrowOnly!(Key, Value) map;
Benchmark performance and memory usage when span is span.