úÎ2þ.æ4      !"#$%&'()*+,-./0123Safe4The empty TrieMap5$Create map from list of associations6Search for a value in the map71Recursive lookup from nodes down (excluding root)8Unsafe indexing into TrieMap9Insert new word into map:(Insert value into existing tree of nodes;2Create node (or series of nodes) to point to value<=>?@ABCDEFG456789:;HI<=>?@ABCDEFG456789:; <=>?@ABCDEFG456789:;HIIdentifiers for ListLike values(c) Adam Wagner, 2017None$The empty IdentifiersNew Identifiers from listÅCombine two identifier sets into one. Because the ids will change while combining two sets, a map is also returned that identifies the new location of old ids for the second set passed in.(Insert item into set (given it a new id)Insert many items into setNew List from IdentifiersFind id for given value$Number of items in Identifiers value cFind numeric id for given value. Will error when the value is not a member of the Identifiers map. Find key for given id iGiven many ids, return many keys. Ids with no associated values will be omitted from the resulting list. IFind id for given value. Will error when the id has no associated value.  Infix version of unsafeLookupKeyItems 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 set8Ids for the first set passed to combine remain unchangedFEnsure the migration points to the same value in both old and new setsJKL   JKL Identifiers for Hashable values(c) Adam Wagner, 2017None$The empty IdentifiersNew Identifiers from listÅCombine two identifier sets into one. Because the ids will change while combining two sets, a map is also returned that identifies the new location of old ids for the second set passed in.(Insert item into set (given it a new id)Insert many items into set New List from Identifiers!Find id for given key"$Number of items in Identifiers value#cFind numeric id for given value. Will error when the value is not a member of the Identifiers map.$Find key for given id% Given many ids, return many keys&IFind id for given value. Will error when the id has no associated value.' Infix version of unsafeLookupKey(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 set-8Ids for the first set passed to combine remain unchanged.FEnsure the migration points to the same value in both old and new setsMNO !"#$%&'()*+,-./012 !"#$%&'()*+,-." !$%#&'()+*,-.MNO !"#$%&'()*+,-./012P           !"#$%&'()*+,-./01012*identifiers-0.4.2.0-FYmkAkl2yZn7gr2Kh2umLUData.Identifiers.ListLikeData.Identifiers.Hashable Data.TrieMap IdentifiersemptyfromListcombineinsert insertManytoListlookupIdsizeunsafeLookupId lookupKey lookupKeysunsafeLookupKey! prop_hasId prop_stableIdprop_keyRetrievalUnsafeprop_keyRetrievalprop_idempotentprop_stableCombineprop_properMigration$fNFDataIdentifiers$fSerializeIdentifiers$fBinaryIdentifiers$fShowIdentifiers$fEqIdentifierslookup lookupNode insertNode createNodeTrieNodeNodeVertical ValueVert ValueHoriz ValueNode ValueBottomTrieMapRoot ValueRootFlatRoot EmptyRoot$fNFDataTrieNode$fNFDataTrieMapidsnames