Îõ³h$ÒE      Safe-Inferredhistogram-simple A simple ,-based histogram that counts occurrences of k.histogram-simple?Convert to a histogram to a map of counts of all nonzero valueshistogram-simpleIncrease a key's count by onehistogram-simpleDecrease a key's count by onehistogram-simpleœIncrease a key's count by an arbitrary number. Can also be used to decrease by passing a negative value. If the count falls below zero, it's set to 0.histogram-simpleÆSet a key's count to an exact value. Nonpositive numbers clip to 0.histogram-simpleSet a key's count to 0.histogram-simple.Check whether a key has a count of at least 1.histogram-simple$Check whether a key has a count of 0 histogram-simpleÆGet the total number of elements in the map, i.e. the sum of all bins. histogram-simple"Check whether a histogram is empty histogram-simple Get a list of all non-zero keys. histogram-simpleñApplies a function to every key. If two keys in the original map to the same value, their counts are combined. histogram-simple1A histogram containing one key with a count of 1.histogram-simpleisSubsetOfBy f h1 h2 returns  if every key in h1 compares to  to its corresponding key in h2 by f.histogram-simpleisSubsetOf h1 h2 returns " if no key has a greater count in h1 than in h2.histogram-simpleÀConstruct a histogram by counting occurrences in a list of keys.histogram-simpleO(n). The expression ( k hist ) is a pair (h1,h2) where all keys in h1 are lower than k and all keys in h2 larger than k. Any key equal to k is found in neither h1 nor h2.histogram-simple k1 k2 returns True. when there is no key that is nonzero in both k1 and k2.        !"+histogram-simple-1.0-IaW6yYP3DzXBo1AQvJYGZhData.HistogramDataMap HistogramtoMap increment decrementaddsetresetnonzerozerosizeemptykeysmapKeys singleton isSubsetOfBy isSubsetOffromListtoListlookupsplit splitLookup!disjoint$fMonoidHistogram$fSemigroupHistogram $fEqHistogram$fShowHistogramghc-prim GHC.TypesTrue