size package:ghc

The number of edges in the graph. Note that this counts every edge found, so if you are representing an unordered graph by having each edge mirrored this will be incorrect. If you created an unordered graph by either mirroring every edge (including loops!) or using the undir function in Data.Graph.Inductive.Basic then you can safely halve the value returned by this.

Get the size of the graph, 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

Cardinality of the set.

Calculate the size of

Get the size of a SmallArray

Some text with any width. (text s = sizedText (length s) s)