Proposal: Bounded instance for IntSet (ticket #1953)

[Stefan O'Rear]

On Sun, Dec 02, 2007 at 04:01:05PM -0800, David Benbennick wrote:
> On 12/2/07, Ross Paterson <ross at soi.city.ac.uk> wrote:
> > These are the minimum and maximum under the Ord instance (also for Set),
> > but what is the intuition behind that ordering?
> 
> The order on IntSet is the well-known lexicographic order (see
> http://en.wikipedia.org/wiki/Lexicographical_order).  If this proposal
> is accepted, I intend to propose the Bounded instance for Set next
> (Bounded a => Bounded (Set a)).

This contradicts your code, for the maximal element in the lexicographic
order is *not* singleton maxBound, but rather fromList [minBound ..
maxBound].

(The libraries agree with your code but not your explanation...)

Stefan
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: Digital signature
Url : http://www.haskell.org/pipermail/libraries/attachments/20071202/6df2bdf8/attachment.bin