Data.Urn.Internal.AlmostPerfect

Documentation

almostPerfect :: (b -> b -> b) -> (a -> b) -> Word -> NonEmpty a -> b

Create an "almost perfect" tree from a given list of a specified size. Invariants: specified size must match the actual length of the list, and list must be non-empty.

reverseBits# :: Word# -> Word# -> Word#

Returns the number formed by snipping out the first n bits of the input and reversing them TODO: Make this more efficient