úÎظ     (c) Luke Palmer 2010BSD3 Luke Palmer <lrpalmer@gmail.com> experimental Haskell 2010SafeX *A trie from integers to values of type a. 'Semantics: [[IntTrie a]] = Integer -> a9Apply the trie to an argument. This is the semantic map.The identity trie. apply identity = id Modify the function at one point ^apply (modify x f t) i | i == x = f (apply t i) | otherwise = apply t i1Modify the function at one point (strict version)#Overwrite the function at one point "overwrite i x = modify i (const x)!Negate the domain of the function 6apply (mirror t) i = apply t (-i) mirror . mirror = idQModify the function at a (potentially infinite) list of points in ascending order FmodifyAscList [(i0, f0)..(iN, fN)] = modify i0 f0 . ... . modify iN fNRModify the function at a (potentially infinite) list of points in descending order       )data-inttrie-0.1.3-3biS5ktXSx99RrDZli68zw Data.IntTrieIntTrieapplyidentitymodifymodify' overwritemirror modifyAscListmodifyDescList$fMonoidBitTrie$fSemigroupBitTrie$fApplicativeBitTrie$fFunctorBitTrie$fMonoidIntTrie$fSemigroupIntTrie$fApplicativeIntTrie$fFunctorIntTrieBitTrie