h*       0.1(c) Sergey Vinokurov 2018BSD3-style (see LICENSE)serg.foo@gmail.com Safe-Inferred 9:;< radix-treeA tree data structure that efficiently indexes values by string keys.,This type can be more memory-efficient than  because it combines common prefixes of all keys. Specific savings will vary depending on concrete data set. radix-tree,Either has 0 or 2 or more children, never 1. radix-treeRadix tree with no elements. radix-tree!Check whether radix tree is empty radix-tree,O(n) Get number of elements in a radix tree. radix-tree Add new element to a radix tree. radix-treeAdd new element to a radix tree. If an element was already present for the given key, use supplied funciton f to produce a new value. The function will be called like this f newValue oldValue. radix-treeO(length(key)) Try to find a value associated with the given key.  radix-treeConstruct a radix tree from list of key-value pairs. If some key appears twice in the input list, later occurrences will override earlier ones.  radix-tree7O(n) Convert a radix tree to a list of key-value pairs.  radix-treeO(n) Convert a radix tree to an ascending list of key-value pairs.  radix-tree)O(n) Get all keys stored in a radix tree.  radix-tree0O(n) Get set of all keys stored in a radix tree. radix-tree+O(n) Get all values stored in a radix tree. radix-treeO(n) Map a function that can remove some existing elements over a radix tree. radix-treeO(n + m) Combine two radix trees trees. If a key is present in both trees then the value from left one will be retained. radix-treeO(n + m) Combine two trees using supplied function to resolve values that have the same key in both trees. radix-tree+Prefix of node contents common with the key radix-tree&Suffix with the first mismatching byte radix-tree-First byte of the suffix that caused mismatch radix-treeRest of node contents, suffix radix-tree Non-empty radix-treeKey radix-tree Key offset radix-tree Node contents  (c) Sergey Vinokurov 2018BSD3-style (see LICENSE)serg.foo@gmail.com Safe-Inferred k        !"%radix-tree-0.1-83t2nqQiVN8CrAXaXsSvz4Data.RadixTreeData.RadixTree.Internal radix-treeDataMap RadixTree RadixNodeRadixStremptynullsizeinsert insertWithlookupfromListtoList toAscListkeyskeysSetelemsmapMaybeunion unionWith$fNFDataRadixTree$fShowMismatch$fGenericMismatch$fShowRadixTree$fFunctorRadixTree$fFoldableRadixTree$fTraversableRadixTree$fGenericRadixTreeCommonPrefixThenMismatchanalyseMismatch