:: [a] -> Bool package:numeric-prelude

null :: Foldable t => t a -> Bool
numeric-prelude NumericPrelude NumericPrelude.Base
Test whether the structure is empty. The default implementation is optimized for structures that are similar to cons-lists, because there is no general way to do better.
lengthLeft :: C n => [a] -> n
numeric-prelude NumericPrelude.List.Generic
Left associative length computation that is appropriate for types like Integer.
lengthRight :: C n => [a] -> n
numeric-prelude NumericPrelude.List.Generic
Right associative length computation that is appropriate for types like Peano number.