./devel/hs-sorted-list, Type-enforced sorted lists and related functions

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: CURRENT, Version: 0.2.2.0nb2, Package name: hs-sorted-list-0.2.2.0nb2, Maintainer: pkgsrc-users

Type-enforced sorted lists and related functions.

These are useful for:
* Constraining the argument of a function to be a sorted list by stating in
your type that the input list is a sorted list.
* Avoiding sorting a list twice.
* Creating a list that is sorted from the moment of its construction, so it
doesn't have to be sorted later.
* Performing list operations keeping the input list sorted.
* Improving those list operations that can be benefited from the ordering
of its elements.
* Creating infinite lists that are sorted!
* And more!

Master sites:

Filesize: 6.489 KB

Version history: (Expand)

CVS history: (Expand)


   2024-04-28 18:56:38 by Masatake Daimon | Files touched by this commit (1) 
Log message:
devel/hs-sorted-list: Fix build with GHC 9.8

This breaks build with the currently default GHC 9.6. Please bear with me
until I switch the default compiler.
   2023-11-02 07:37:49 by Masatake Daimon | Files touched by this commit (1141) 
Log message:
Revbump all Haskell after updating lang/ghc96
   2023-10-24 19:37:56 by Masatake Daimon | Files touched by this commit (4) 
Log message:
devel/hs-sorted-list: Update to 0.2.2.0

0.2.2.0
* Add deleteAll.
   2023-10-09 06:55:01 by Masatake Daimon | Files touched by this commit (988) 
Log message:
Bump Haskell packages after updating lang/ghc94
   2022-02-26 04:58:36 by Masatake Daimon | Files touched by this commit (872) 
Log message:
Bump all Haskell packages after enabling "split sections" in mk/haskell.mk
   2022-02-16 11:04:42 by Masatake Daimon | Files touched by this commit (5) 
Log message:
devel/hs-sorted-list: import hs-sorted-list-0.2.1.0

Type-enforced sorted lists and related functions.

These are useful for:
* Constraining the argument of a function to be a sorted list by stating in
  your type that the input list is a sorted list.
* Avoiding sorting a list twice.
* Creating a list that is sorted from the moment of its construction, so it
  doesn't have to be sorted later.
* Performing list operations keeping the input list sorted.
* Improving those list operations that can be benefited from the ordering
  of its elements.
* Creating infinite lists that are sorted!
* And more!