SizeCompare: Fast size comparison for standard containers.
[ data, library ] [ Propose Tags ]
SizeCompare is a small library providing size comparison functions standard Haskell data-types. Size compare runs in O(min(n,m)) for both arguments, possibly faster. Instead of measuring both containers and comparing the result, SizeCompare iteratively deconstructs both sides of the equality equation until a conclusion can be made. A common expression like: length xs > 0 runs O(n) in the length of the list. Sizecompare runs (O(1)) in this particular case: xs |>| 0 This is still an initial version of the library and updates may follow after some more profiling.
- SizeCompare-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
For package maintainers and hackage trustees
- No Candidates
|Dependencies||base (>=3 && <5), containers (>=0.2) [details]|
|Uploaded||by BramSchuur at 2010-03-02T20:45:01Z|
|Reverse Dependencies||1 direct, 0 indirect [details]|
|Downloads||1285 total (5 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]