Îõ³h,ZÆÍ      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKL0.2.0.0 Safe-InferredoNone(ËÝì› hash-cons with a precomputed hash and an M to the value.ãWARNING: Do not use this type to wrap types whose Eq or Ord instances allow distinguishable values to compare as equal; this will result in nondeterminism or even visible mutation of semantically-immutable values at runtime. hash-consReference to the value hash-consPrecomputed hash hash-cons Create a new . hash-consExtract the value from a .  hash-consÇNOTE: This instance orders by hash first, and only secondarily by the N instance of a, to improve performance.  hash-consRead instance that parses  from the format "hashCons  x"  hash-consShow instance that displays  in the format "hashCons  x"NoneìËNone9:;<ì i  hash-consNon-empty trie nodes. hash-cons The main  data type. hash-consO(1). Create an empty map. hash-consO(1),. Create a map with a single key-value pair. hash-consO(1),. Create a map with a single key-value pair. hash-consO(log n)Þ. Insert a key-value pair into the map. If the key is already present, the value is replaced. hash-consO(log n)'. Lookup the value at a key in the map. hash-consO(n),. Map a function over all values in the map. hash-consO(n)5. Map a function over all key-value pairs in the map. hash-consO(n)6. Traverse the map with a function that accesses keys.  hash-consO(n)Û. The union of two maps. If a key occurs in both maps, the value from the left map is used.# hash-consO(n)È. Intersection of two maps. Only keys present in both maps are included.% hash-consO(n)Ó. Difference of two maps. Keys in the first map but not in the second are included.' hash-cons%Check if a key is present in the map.) hash-cons(Helper function to combine two subtrees.* hash-consHelper functions.$.)%&/#$*,+'(0 !"- $  !"#$%&'()*+,-./0None Ï%&#$'( !   !#$%&'(None< hash-consO(1). Create an empty map.= hash-consO(1),. Create a map with a single key-value pair.> hash-consO(1),. Create a map with a single key-value pair.? hash-consO(log n)'. Insert a key-value pair into the map.@ hash-consO(log n)'. Insert a key-value pair into the map.A hash-consO(log n)'. Lookup the value at a key in the map.B hash-consO(log n)'. Lookup the value at a key in the map.C hash-consO(n),. Map a function over all values in the map.D hash-consO(n)5. Map a function over all key-value pairs in the map.E hash-consO(n)6. Traverse the map with a function that accesses keys.F hash-consO(n)Û. The union of two maps. If a key occurs in both maps, the value from the left map is used.G hash-consO(n)Û. The union of two maps. If a key occurs in both maps, the value from the left map is used.H hash-consO(n)È. Intersection of two maps. Only keys present in both maps are included.I hash-consO(n)È. Intersection of two maps. Only keys present in both maps are included.J hash-consO(n)Ó. Difference of two maps. Keys in the first map but not in the second are included.K hash-consO(n)È. Intersection of two maps. Only keys present in both maps are included.L hash-cons%Check if a key is present in the map.O hash-cons%Check if a key is present in the map.JKEFG;;<=>?@ABCDEFGHIJKLÐ      !"#$%&'()*+,-./0123456789:;<=>?@AB !#%'(*+,-.CDEFGH/Éhash-cons-0.2.0.0-inplaceData.HashCons.InternalData.HashCons.WordMap.InternalData.HashCons.IntMap hash-consData.HashCons.IntMap.Internal Data.HashConsData.HashCons.WordMapHashCons HashConsC _hashCons_ref_hashCons_hashhashCons unHashConscompareAndSubstitute$fHashableHashCons $fOrdHashCons $fEqHashCons$fReadHashCons$fShowHashConsNonEmptyWordMapLeafBinWordMapEmpty NonEmptyMapempty singletonsingletonNonEmptyinsertinsertNonEmptylookuplookupNonEmptymap mapNonEmpty mapWithKeymapWithKeyNonEmptytraverseWithKeytraverseWithKeyNonEmptyunion unionNonEmptyunionNonEmptyNonEmpty intersectionintersectionNonEmpty differencedifferenceNonEmptymembermemberNonEmptycombinejoinmatchmaskzero branchingBithighestBitMaskshorter$fHashableNonEmptyWordMap$fHashableWordMap$fShowNonEmptyWordMap$fEqNonEmptyWordMap$fOrdNonEmptyWordMap$fGenericNonEmptyWordMap $fShowWordMap $fEqWordMap $fOrdWordMap$fGenericWordMapIntMapbase GHC.IORefIORefghc-prim GHC.ClassesOrd