**Packages**- base
- bytestring
- text
- unix
- package

The group function takes a list and returns a list of lists such that the concatenation of the result is equal to the argument. Moreover, each sublist in the result contains only equal elements. For example,
> group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"]
It is a special case of groupBy, which allows the programmer to supply their own equality test.

The group function takes a ByteString and returns a list of ByteStrings such that the concatenation of the result is equal to the argument. Moreover, each sublist in the result contains only equal elements. For example,
> group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"]
It is a special case of groupBy, which allows the programmer to supply their own equality test.

The group function takes a ByteString and returns a list of ByteStrings such that the concatenation of the result is equal to the argument. Moreover, each sublist in the result contains only equal elements. For example,
> group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"]
It is a special case of groupBy, which allows the programmer to supply their own equality test. It is about 40% faster than *groupBy (==)*

The group function takes a Text and returns a list of Texts such that the concatenation of the result is equal to the argument. Moreover, each sublist in the result contains only equal elements. For example,
> group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"]
It is a special case of groupBy, which allows the programmer to supply their own equality test.

Group has execute permission.

The unique numeric ID for this group (gr_gid)

A list of zero or more usernames that are members (gr_mem)

Group has read, write and execute permission.

The name of this group (gr_name)

A groupoid is structure consisting of a set of elements (here a Haskell type) and a binary operator (in present case the function gappend).
It is comparable to the Monoid typeclass, but there is no obligation that the set supports a neutral element (mempty in Data.Monoid).
In geometry, bounding boxes (represented as two points - bottom-left corner and top-right corner) give an example where a groupoid may be more satisfying than a monoid. The union operation on bounding boxes is essential to track the extent of shapes after their superimposition. To fit bounding box union into the Monoid typeclass one can do a clever trick representing mempty with the bottom-left corner at positive infinity and the top-right corner at negative infinity, the standard implementation of union which uses min and max will still proceed to identify the extreme corners correctly. This is nice enough if the bounding box coordinates are represented by Doubles, but a problem if they are Ints (say representing grid coordinates) - one might decide it is better simply to consider concrete bounding boxes and not their empty/infinite cousins.
Version 0.1.0

This package has been absorbed into semigroupoids 4.0
Version 4.0

The password for this group (gr_passwd)

Group has read permission.

Haskell 98 groups. A group is a monoid with invertibility.
Version 0.4.0.0