size
A 2-dimensional size, measured in pixels.
O(n). Number of elements in the map.
> size empty == 0
> size (singleton 1 'a') == 1
> size (fromList([(1,'a'), (2,'c'), (3,'b')])) == 3
O(n). Cardinality of the set.
O(1). The number of elements in the map.
> size empty == 0
> size (singleton 1 'a') == 1
> size (fromList([(1,'a'), (2,'c'), (3,'b')])) == 3
O(1). The number of elements in the set.
SizeCompare is a small library providing size comparison functions standard Haskell data-types. Size compare runs in O(min(n,m)) for both arguments, possibly faster. Instead of measuring both containers and comparing the result, SizeCompare iteratively deconstructs both sides of the equality equation until a conclusion can be made. A common expression like: length xs > 0 runs O(n) in the length of the list. Sizecompare runs (O(1)) in this particular case: xs |>| 0 This is still an initial version of the library and updates may follow after some more profiling.
Version 0.1
Used to construct generators that depend on the size parameter.
Providing indices, matrixes, sparse matrixes, and signed and unsigned bit vectors.
Version 0.3.4.0
Some text with any width. (text s = sizedText (length s) s)
Show more results