Ranged Sets for Haskell
Description
A ranged set is a list of non-overlapping ranges. The ranges have upper and lower boundaries, and a boundary divides the base type into values above and below. No value can ever sit on a boundary. So you can have the set {2.0 < x <= 3.0, 5.3 < x < 6}
Categories
Update Notifications
User Ratings
User Reviews
Be the first to post a review of Ranged Sets for Haskell!