Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

Exact lookup

1. ifoldMap1 :: forall a (n :: Nat) s . (Semigroup s, SNatI n) => (Wrd ('S n) -> a -> s) -> Tree ('S n) a -> s

   ral	Data.RAVec.Tree.DF

   There is no type-class for this :(

2. ifoldr1Map :: forall (n :: Nat) a b . (Wrd n -> a -> b -> b) -> (Wrd n -> a -> b) -> Tree n a -> b

   ral	Data.RAVec.Tree.DF

   No documentation available.

3. imap :: forall (n :: Nat) a b . SNatI n => (Wrd n -> a -> b) -> Tree n a -> Tree n b

   ral	Data.RAVec.Tree.DF

   >>> let t = Node (Node (Leaf 'a') (Leaf 'b')) (Node (Leaf 'c') (Leaf 'd'))
   
   >>> imap (,) t
   Node (Node (Leaf (0b00,'a')) (Leaf (0b01,'b'))) (Node (Leaf (0b10,'c')) (Leaf (0b11,'d')))
   

4. filterMap :: (a -> Maybe b) -> b -> Signal a -> Signal b

   ramus	Ramus.Signal

   Map a signal over a function which returns a Maybe, yielding only the |values inside Justs, dropping the Nothings.

5. module Data.RangeSet.IntMap

   This is simply a specialization of Data.RangeSet.Map to Int. The implementation of RIntSet is based on Data.IntMap.Strict.

6. lookupAttributeMap :: ClassAttributeMap -> Map CompressedWord U32 -> CompressedWord -> BitGet (Map U32 U32)

   rattletrap	Rattletrap.Type.Attribute

   No documentation available.

7. module Rattletrap.Type.AttributeMapping

   No documentation available.

8. data AttributeMapping

   rattletrap	Rattletrap.Type.AttributeMapping

   No documentation available.

9. AttributeMapping :: U32 -> U32 -> AttributeMapping

   rattletrap	Rattletrap.Type.AttributeMapping

   No documentation available.

10. attributeMappings :: Cache -> List AttributeMapping

    rattletrap	Rattletrap.Type.Cache

    No documentation available.

Page 1212 of many | Previous | Next