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. last :: MonadThrow m => [a] -> m a

   listsafe	Data.List.Safe

   Extract the last element of a list. Empty lists throw an EmptyListException.

2. last :: TreePos Empty a -> TreePos Empty a

   rosezipper	Data.Tree.Zipper

   The last space in the current forest.

3. last :: StringCells s => s -> StringCellChar s

   string-class	Data.String.Class

   No documentation available.

4. last :: NonEmpty a -> a

   verset	Verset

   Extract the last element of the stream.

5. last :: HasCallStack => [a] -> a

   xmonad-contrib	XMonad.Config.Prime

   Extract the last element of a list, which must be finite and non-empty. WARNING: This function is partial. Consider using unsnoc instead.

   Examples

   >>> last [1, 2, 3]
   3
   

   >>> last [1..]
   * Hangs forever *
   

   >>> last []
   *** Exception: Prelude.last: empty list
   

6. last :: HasCallStack => [a] -> a

   xmonad-contrib	XMonad.Prelude

   Extract the last element of a list, which must be finite and non-empty. WARNING: This function is partial. Consider using unsnoc instead.

   Examples

   >>> last [1, 2, 3]
   3
   

   >>> last [1..]
   * Hangs forever *
   

   >>> last []
   *** Exception: Prelude.last: empty list
   

7. LastStmt :: XLastStmt idL idR body -> body -> Maybe Bool -> SyntaxExpr idR -> StmtLR idL idR body

   ghc	Language.Haskell.Syntax.Expr

   No documentation available.

8. newtype Last' a

   Cabal-syntax	Distribution.Compat.Semigroup

   A copy of Last.

9. Last' :: a -> Last' a

   Cabal-syntax	Distribution.Compat.Semigroup

   No documentation available.

10. data LastSym0 (a1 :: TyFun NonEmpty a a)

    singletons-base	Data.List.NonEmpty.Singletons

    No documentation available.

Page 20 of many | Previous | Next