<      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None%&+,-/56:ADIOQRTThis is a wrapper for ^ that provides common typeclass instances for it. This can be helpful when you want to use Data.Set with .D^Helper function to demote an equality check. It would be nice if this could be added as an  instance for >, but it would required collapsing a lot of the modules in  singletonsP to prevent cyclic imports. Or it could be provided as an orphan instance.E&Helper function to demote a comparisonT  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRF  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEM@A>?<=:;8967452301./,-*+())&''$%%"## !!  BCDE2    !!"##$%%&''())*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRNone%&+,-/56ADIOQRTJ^O(1). The empty map. )empty == fromList [] size empty == 0_O(1). A map with a single element. Isingleton 1 'a' == fromList [(1, 'a')] size (singleton 1 'a') == 1`O(1). Is the map empty?aO(1)$. The number of elements in the map.bO(log n)'. Lookup the value at a key in the map.4The function will return the corresponding value as ( value), or  if the key isn't in the map.iO(log n)&. Delete and find the minimal element. deleteFindMin (fromList [(5,"a"), (3,"b"), (10,"c")]) == ((3,"b"), fromList[(5,"a"), (10,"c")]) deleteFindMin Error: can not return the minimal element of an empty mapjO(log n)&. Delete and find the maximal element. deleteFindMax (fromList [(5,"a"), (3,"b"), (10,"c")]) == ((10,"c"), fromList [(3,"b"), (5,"a")]) deleteFindMax empty Error: can not return the maximal element of an empty mapyO(log n)". Find the value at a key. Calls # when the element can not be found. gfromList [(5,'a'), (3,'b')] ! 1 Error: element not in the map fromList [(5,'a'), (3,'b')] ! 5 == 'a'zSame as .{O(log n)+. Is the key a member of the map? See also |.|O(log n)/. Is the key not a member of the map? See also {.}O(log n)". Find the value at a key. Calls 4 when the element can not be found. Consider using b" when elements may not be present.~O(log n). The expression (~ def k map) returns the value at key k or returns default value def! when the key is not in the map.O(log n). Insert a new key and value in the map. If the key is already present in the map, the associated value is replaced with the supplied value.  is equivalent to  .O(log n)>. Insert with a function, combining new value and old value.  f key value mp will insert the entry  key :=> value into mp_ if key does not exist in the map. If the key does exist, the function will insert the entry key :=> f new_value old_value.Same as ], but the combining function is applied strictly. This is often the most desirable behavior.O(log n)C. Insert with a function, combining key, new value and old value.  f key value mp will insert the entry  key :=> value into mp_ if key does not exist in the map. If the key does exist, the function will insert the entry !key :=> f key new_value old_value;. Note that the key passed to f is the same key passed to .Same as 1, but the combining function is applied strictly.O(log n)G. Combines insert operation with old value retrieval. The expression ( f k x map2) is a pair where the first element is equal to (b k map$) and the second element equal to ( f k x map).O(log n). A strict version of .O(log n)r. Delete a key and its value from the map. When the key is not a member of the map, the original map is returned.O(log n). Update a value at a specific key with the result of the provided function. When the key is not a member of the map, the original map is returned.O(log n)k. Adjust a value at a specific key. When the key is not a member of the map, the original map is returned.O(log n). The expression ( f k map) updates the value x at k (if it is in the map). If (f x) is %, the element is deleted. If it is ( y ), the key k is bound to the new value y.O(log n). The expression ( f k map) updates the value x at k (if it is in the map). If (f k x) is %, the element is deleted. If it is ( y ), the key k is bound to the new value y.O(log n). Lookup and update. See also u. The function returns changed value, if it is updated. Returns the original key value if the map entry is deleted.O(log n). The expression ( f k map) alters the value x at k, or absence thereof. 7 can be used to insert, delete, or update a value in a . In short : b k ( f k m) = f (b k m).O(log n) . Return the index' of a key. The index is a number from 0 up to, but not including, the a of the map. Calls  when the key is not a { of the map.O(log n) . Lookup the index' of a key. The index is a number from 0 up to, but not including, the a of the map.O(log n). Retrieve an element by index. Calls  when an invalid index is used.O(log n). Update the element at index. Calls  when an invalid index is used.O(log n). Delete the element at index. Defined as ( i map =  (k x -> ) i map).O(log n)$. The minimal key of the map. Calls  is the map is empty.O(log n)$. The maximal key of the map. Calls  is the map is empty.O(log n)C. Delete the minimal key. Returns an empty map if the map is empty.O(log n)C. Delete the maximal key. Returns an empty map if the map is empty.O(log n)&. Update the value at the minimal key.O(log n)&. Update the value at the maximal key.O(log n)d. Retrieves the minimal (key :=> value) entry of the map, and the map stripped of that element, or  if passed an empty map.O(log n)d. Retrieves the maximal (key :=> value) entry of the map, and the map stripped of that element, or  if passed an empty map.!The union of a list of maps: ( ==   ^).=The union of a list of maps, with a combining operation: ( f ==  ( f) ^).O(n+m). The expression ( t1 t2!) takes the left-biased union of t1 and t2. It prefers t1- when duplicate keys are encountered, i.e. ( ==  unionWith *). The implementation uses the efficient  hedge-union7 algorithm. Hedge-union is more efficient on (bigset ` ` smallset).O(n+m)J. Union with a combining function. The implementation uses the efficient  hedge-union7 algorithm. Hedge-union is more efficient on (bigset ` ` smallset).O(n+m). Difference of two maps. Return elements of the first map not existing in the second map. The implementation uses an efficient hedge algorithm comparable with  hedge-union.O(n+m). Difference with a combining function. When two equal keys are encountered, the combining function is applied to the key and both values. If it returns D, the element is discarded (proper set difference). If it returns ( y+), the element is updated with a new value y(. The implementation uses an efficient hedge algorithm comparable with  hedge-union.O(n+m)`. Intersection of two maps. Return data in the first map for the keys existing in both maps. ( m1 m2 == intersectionWith  m1 m2).O(n+m)V. Intersection with a combining function. Intersection is more efficient on (bigset ` ` smallset).O(n)4. Filter all keys/values that satisfy the predicate.O(n). Partition the map according to a predicate. The first map contains all elements that satisfy the predicate, the second all elements that fail the predicate. See also .O(n)". Map keys/values and collect the  results.O(n)#. Map keys/values and separate the  and  results.O(n),. Map a function over all values in the map.O(n). The function O threads an accumulating argument throught the map in ascending order of keys.O(n). The function O threads an accumulating argument through the map in descending order of keys. O(n*log n).  mapKeysWith c f s! is the map obtained by applying f to each key of s.)The size of the result may be smaller if fr maps two or more distinct keys to the same new key. In this case the associated values will be combined using c . mapKeysWith :: (SOrd k2, SDecide k2) => (forall v. Sing v -> f v -> f v -> f v) -> (forall v. Sing v -> Sing v) -> SingMap k1 f -> SingMap k2 f mapKeysWith c f = fromListWithKey c . map fFirst . toList where fFirst (SomeSingWith1 x y) = (SomeSingWith1 (f x) y)O(n). mapKeysMonotonic f s == mapKeys f s, but works only when f2 is strictly monotonic. That is, for any values x and y, if x < y then f x < f y.  The precondition is not checked. Semi-formally, we have: ~and [x < y ==> f x < f y | x <- ls, y <- ls] ==> mapKeysMonotonic f s == mapKeys f s where ls = keys sThis means that fd maps distinct original keys to distinct resulting keys. This function has better performance than mapKeys. mapKeysMonotonic :: forall (k1 :: KProxy k) k2 f. (forall (v :: k). Sing v -> Sing v) -> SingMap k1 f -> SingMap k2 f mapKeysMonotonic _ Tip = Tip mapKeysMonotonic f (Bin sz k x l r) = Bin sz (f k) x (mapKeysMonotonic f l) (mapKeysMonotonic f r)O(n)2. Fold the keys and values in the map, such that  f z ==  ( f) z . .This is identical to b, and you should use that one instead of this one. This name is kept for backward compatibility.O(n)W. Post-order fold. The function will be applied from the lowest value to the highest.O(n)V. Pre-order fold. The function will be applied from the highest value to the lowest.O(n)0. Return all keys of the map in ascending order. <keys (fromList [(5,"a"), (3,"b")]) == [3,5] keys empty == []O(n)?. Return all key/value pairs in the map in ascending key order. O(n*log n)7. Build a map from a list of key/value pairs. See also f. If the list contains more than one value for the same key, the last value for the key is retained. O(n*log n)Q. Build a map from a list of key/value pairs with a combining function. See also .O(n)'. Convert to a list of key/value pairs.O(n). Convert to an ascending list.O(n). Convert to a descending list.O(n)6. Build a map from an ascending list in linear time. :The precondition (input list is ascending) is not checked.O(n)`. Build a map from an ascending list in linear time with a combining function for equal keys. :The precondition (input list is ascending) is not checked.O(n)K. Build a map from an ascending list of distinct elements in linear time.  The precondition is not checked.O(log n). The expression ( k map ) is a pair  (map1,map2) where the keys in map1 are smaller than k and the keys in map2 larger than k. Any key equal to k is found in neither map1 nor map2.O(log n). The expression ( k map) splits a map just like  but also returns b k map.O(log n).O(n). The expression ( showelem hang wide mapH) shows the tree that implements the map. Elements are shown using the showElem function. If hang is , a hanging6 tree is shown otherwise a rotated tree is shown. If wide is !, an extra wide version is shown.O(n).. Test if the internal map structure is valid.Exported only for Debug.QuickCheckzZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~vZ[]\^_`abcdefghijklmnopqrstuvwxyz{|}~z[\]Z^_`abcdefghijklmnopqrstuvwxyz{|}~xZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~y9 z9 None%&+,-/56ADIOQRT|This will create a pattern match on the first argument that splices in the third argument for each pattern. Example: data Color = Red | Blue | Green deriving Show myFunc :: Color -> String myFunc c = $(enumerateConstructors 'c ''Color =<< [|show c|])vI should fix this function to actually make it work that way. It actually uses the singletonized data type instead.      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&pringletons-0.4-Dcyk20G7ZWlFcS6fxqRg99Data.Singletons.ClassData.Singletons.MapData.Case.EnumerateClassySomeSinggetClassySomeSingFromJSONApplied1parseJSONApplied1ToJSONApplied1toJSONApplied1HashableApplied1hashWithSaltApplied1 EqApplied1 eqApplied1SomeSingWith2' SomeSingWith2SomeSingWith1' SomeSingWith1 SingWith1Applied3 getApplied3Applied2 getApplied2Applied1 getApplied1FromJSONKeyKindparseJSONKeyKind ToJSONKeyKind toJSONKeyKind FromJSONKind parseJSONKind ToJSONKind toJSONKind HashableKindhashWithSaltKindReadKind readPrecKindShowKind showsPrecKind FromJSONSing2parseJSONSing2 FromJSONSing1parseJSONSing1 ToJSONSing2 toJSONSing2 ToJSONSing1 toJSONSing1 HashableSing2hashWithSaltSing2 HashableSing1hashWithSaltSing1 ReadSing2 readPrecSing2 ShowSing2showsPrecSing2OrdSing2 compareSing2OrdSing1 compareSing1EqSing2eqSing2EqSing1eqSing1showKind readMaybeKindeqSome compareSome$fOrdClassySomeSing$fEqClassySomeSing$fHashableSomeSingWith1$fFromJSONSomeSingWith2$fToJSONSomeSingWith2$fEqSomeSingWith2$fReadSomeSingWith2$fShowSomeSingWith2$fEqSomeSingWith1$fHashableSing1kApplied1$fFromJSONSing1kApplied1$fToJSONSing1kApplied1$fEqSing1kApplied1$fFromJSONApplied1$fToJSONApplied1$fHashableApplied1$fShowApplied1$fReadApplied1 $fOrdApplied1 $fEqApplied1SingMap'SingMapTipBinempty singletonnullsizelookup lookupAssoccombine insertMax insertMinmergeglue deleteFindMin deleteFindMaxdeltaratiobalancerotateLrotateRsingleLsingleRdoubleLdoubleRbintrim trimLookupLofilterGtfilterLt!\\member notMemberfindfindWithDefaultinsert insertWith insertWith' insertWithKeyinsertWithKey'insertLookupWithKeyinsertLookupWithKey'deleteadjust adjustWithKeyupdate updateWithKeyupdateLookupWithKeyalter findIndex lookupIndexelemAtupdateAtdeleteAtfindMinfindMax deleteMin deleteMaxupdateMinWithKeyupdateMaxWithKeyminViewWithKeymaxViewWithKeyunions unionsWithKeyunion hedgeUnionL unionWithKeyhedgeUnionWithKey difference hedgeDiffdifferenceWithKeyhedgeDiffWithKey intersectionintersectionWithKey filterWithKeypartitionWithKeymapMaybeWithKeymapEitherWithKey mapWithKeymapAccumLWithKeymapAccumRWithKey foldWithKey foldrWithKey foldlWithKeykeysassocsfromListfromListWithKeytoList toAscList toDescList fromAscListfromAscListWithKeyfromDistinctAscListsplit splitLookupsplitLookupWithKey showTreeWith showsTree showsTreeHangshowWide showsBarsnodewithBar withEmptyvalidorderedbalanced validsize foldlStrictltSomegtSomeunifyOnCompareEQ unifyOnEqfromRec insertRec$fFromJSONSingMap$fToJSONSingMap$fHashableSingMap $fEqSingMapenumerateConstructors%singletons-2.2-LiVetX6ga9c7Y58hIBOWmpData.SingletonsSomeSingghc-prim GHC.ClassesEq readsPrecKindbaseGHC.BaseJustNothingGHC.ErrerrorconstData.Singletons.Prelude.BaseMap Data.Foldablefoldl Data.EitherLeftRightfoldr Data.Tupleuncurry GHC.TypesTruesketchyNameSingletonize