tiny.preserves.dictionary

1/// Makes a dictionary holding a copy of the slice `entries`, sorted in ascending order of their2/// keys under `compare`. Code that builds a dictionary by hand calls it, so repeated keys are3/// refused and the storage comes out sorted by key. The duplicate check compares each key with4/// every key before it, so its cost grows with the square of the entry count. The copy is one level5/// deep: the dictionary shares everything the keys and values point to, and `freeValue` frees6/// exactly the slice. The call returns `error.DuplicateDictionaryKey` before it allocates when two7/// keys are equal.8pub const dictionary = any_constructors.dictionary;

1pub const dictionary = any.dictionary;