Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. headWithDefault :: a -> [a] -> a

   Agda	Agda.Utils.List

   Head function (safe). Returns a default value on empty lists. O(1).

   headWithDefault 42 []      = 42
   headWithDefault 42 [1,2,3] = 1
   

2. indexWithDefault :: a -> [a] -> Int -> a

   Agda	Agda.Utils.List

   Lookup function with default value for index out of range. O(min n index). The name is chosen akin to genericIndex.

3. initWithDefault :: [a] -> [a] -> [a]

   Agda	Agda.Utils.List

   init, safe. O(n).

4. lastWithDefault :: a -> [a] -> a

   Agda	Agda.Utils.List

   Last element (safe). Returns a default list on empty lists. O(n).

5. tailWithDefault :: [a] -> [a] -> [a]

   Agda	Agda.Utils.List

   Tail function (safe). Returns a default list on empty lists. O(1).

6. headWithDefault :: a -> [a] -> a

   BNFC	BNFC.Utils

   Get the first element of a list, fallback for empty list.

7. findWithDefaultL :: DomCodCnt l r => Cod l -> Bimap l r -> Dom l -> Cod l

   bimaps	Data.Bijection.Class

   No documentation available.

8. findWithDefaultR :: DomCodCnt l r => Cod r -> Bimap l r -> Dom r -> Cod r

   bimaps	Data.Bijection.Class

   No documentation available.

9. fromListWithDefault :: a -> [a] -> BinList a

   binary-list	Data.BinaryList

   O(n). Build a binary list from a linked list. If the input list has length different from a power of two, fill to the next power of two with a default element. Warning: this function crashes if the input list length is larger than any power of two in the type Int. However, this is very unlikely.

10. lookupWithDefault :: a -> ByteString -> Trie a -> a

    bytestring-trie	Data.Trie.Convenience

    Lookup a key, returning a default value if it's not found.

Page 13 of many | Previous | Next