Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. boundedSub :: SaturatingNum a => a -> a -> a

   clash-prelude	Clash.Class.Num

   Subtraction that clips to maxBound on overflow, and minBound on underflow

2. boundedList :: Int -> Memo a -> Memo [a]

   data-memocombinators	Data.MemoCombinators

   Build a table which memoizes all lists of less than the given length.

3. boundedAdjacent :: (Ord a, Enum a) => a -> a -> Bool

   Ranged-sets	Data.Ranged.Boundaries

   Check adjacency, allowing for case where x = maxBound. Use as the definition of "adjacent" for bounded enumerated types such as Int and Char.

4. boundedBelow :: (Eq a, Enum a, Bounded a) => a -> Maybe a

   Ranged-sets	Data.Ranged.Boundaries

   The usual implementation of adjacentBelow for bounded enumerated types.

5. package bounded-qsem

   Bounded quantity semaphores. Bounded quantity semaphores, meaning quantity semaphores that have an upper-bound in the number of units that can be available at any given time.

6. boundedTrie :: CounterUpdate -> Maybe BoundedTrie

   gogol-dataflow	Gogol.Dataflow

   Bounded trie data

7. boundedTrie :: CounterUpdate -> Maybe BoundedTrie

   gogol-dataflow	Gogol.Dataflow.Types

   Bounded trie data

8. liftFixedToBounded :: FixedPrim a -> BoundedPrim a

   bytestring	Data.ByteString.Builder.Prim

   Lift a FixedPrim to a BoundedPrim.

9. primBounded :: BoundedPrim a -> a -> Builder

   bytestring	Data.ByteString.Builder.Prim

   Create a Builder that encodes values with the given BoundedPrim. We rewrite consecutive uses of primBounded such that the bound-checks are fused. For example,

   primBounded (word32 c1) `mappend` primBounded (word32 c2)
   

   is rewritten such that the resulting Builder checks only once, if ther are at 8 free bytes, instead of checking twice, if there are 4 free bytes. This optimization is not observationally equivalent in a strict sense, as it influences the boundaries of the generated chunks. However, for a user of this library it is observationally equivalent, as chunk boundaries of a LazyByteString can only be observed through the internal interface. Moreover, we expect that all primitives write much fewer than 4kb (the default short buffer size). Hence, it is safe to ignore the additional memory spilled due to the more aggressive buffer wrapping introduced by this optimization.

10. primMapByteStringBounded :: BoundedPrim Word8 -> StrictByteString -> Builder

    bytestring	Data.ByteString.Builder.Prim

    Create a Builder that encodes each Word8 of a StrictByteString using a BoundedPrim. For example, we can write a Builder that filters a StrictByteString as follows.

    import qualified Data.ByteString.Builder.Prim as P
    

    filterBS p = P.condB p (P.liftFixedToBounded P.word8) P.emptyB
    

Page 16 of many | Previous | Next