length -package:base
O(1) length returns the length of a ByteString as an
Int.
O(c) length returns the length of a ByteString as an
Int64
O(n) Returns the number of characters in a
Text.
O(n) Returns the number of characters in a text.
O(n) Returns the number of characters in a
Text.
The number of elements in the sequence.
Count how many values are in the stream.
Subject to fusion
Counts the number of characters encoded in the bytestring. Note that
this includes replacement characters.
Counts the number of characters encoded in the bytestring. Note that
this includes replacement characters.
Counts the number of characters encoded in the bytestring. Note that
this includes replacement characters. The function is linear in the
number of bytes in the representation.
Returns the size/length of a finite structure as an
Int. The
default implementation just counts elements starting with the
leftmost. Instances for structures that can compute the element count
faster than via element-by-element counting, should provide a
specialised implementation.
Examples
Basic usage:
>>> length []
0
>>> length ['a', 'b', 'c']
3
>>> length [1..]
* Hangs forever *
Return the length in bytes of a bytearray
Count the number of elements in a
Producer
Return the length of the container
Return the length of the byte stream in bytes
Return the length of the text stream in characters
Returns the size/length of a finite structure as an
Int. The
default implementation just counts elements starting with the
leftmost. Instances for structures that can compute the element count
faster than via element-by-element counting, should provide a
specialised implementation.
Examples
Basic usage:
>>> length []
0
>>> length ['a', 'b', 'c']
3
>>> length [1..]
* Hangs forever *
@since base-4.8.0.0
Run a stream, keeping its length and its return value.
>>> S.print $ mapped S.length $ chunksOf 3 $ S.each [1..10]
3
3
3
1
O(n/c) length returns the length of a ByteString as an
Int64
Returns the size/length of a finite structure as an
Int. The
default implementation is optimized for structures that are similar to
cons-lists, because there is no general way to do better.