úÎ @.      !"#$%&'()*+,-Safe.The empty TrieMap/$Create map from list of associations0Search for a value in the map11Recursive lookup from nodes down (excluding root)2Unsafe indexing into TrieMap3Insert new word into map4(Insert value into existing tree of nodes52Create node (or series of nodes) to point to value6789:;<=>?@A./012345BC6789:;<=>?@A./012345 6789:;<=>?@A./012345BCNone$ The empty IdentifiersNew Identifiers from list(Insert item into set (given it a new id)Insert many items into setNew List from IdentifiersFind id for given key Find key for given id  Given many ids, return many keys Items inserted are given idsInserted items have stable ids+Given id can be used to fetch inserted item+Given id can be used to fetch inserted item:Inserting something more than once does not change the setDEF    DEF None The empty IdentifiersNew Identifiers from list(Insert item into set (given it a new id)Insert many items into setNew List from IdentifiersFind id for given key Find key for given id! Given many ids, return many keys$Items inserted are given ids%Inserted items have stable ids&+Given id can be used to fetch inserted item'+Given id can be used to fetch inserted item(:Inserting something more than once does not change the setGHI !"#$%&'()*+, !"#$%&'( !"#$%'&(GHI !"#$%&'()*+,J           !"#$%&'()*+,-.-./*identifiers-0.4.1.0-HV256UDLSchCttgzDg8rPEData.Identifiers.ListLikeData.Identifiers.Hashable Data.TrieMap IdentifiersemptyfromListinsert insertManytoListlookupIdsizeunsafeLookupId lookupKey lookupKeysunsafeLookupKey! prop_hasId prop_stableIdprop_keyRetrievalUnsafeprop_keyRetrievalprop_idempotent$fNFDataIdentifiers$fSerializeIdentifiers$fBinaryIdentifiers$fShowIdentifiers$fEqIdentifierslookup lookupNode insertNode createNodeTrieNodeNodeVertical ValueVert ValueHoriz ValueNode ValueBottomTrieMapRoot ValueRootFlatRoot EmptyRoot$fNFDataTrieNode$fNFDataTrieMapidsnames