# The SizeCompare package

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.

- No changelog available

## Properties

Version | 0.1 |
---|---|

Dependencies | base (>=3 && <5), containers (>=0.2) |

License | GPL |

Author | Bram Schuur |

Maintainer | bschuur@cs.uu.nl |

Category | Data |

Upload date | Tue Mar 2 20:45:01 UTC 2010 |

Uploaded by | BramSchuur |

Downloads | 129 total (11 in last 30 days) |

## Modules

*Data*

[Index]

## Downloads

- SizeCompare-0.1.tar.gz [browse] (Cabal source package)
- Package description (included in the package)

#### Maintainers' corner

For package maintainers and hackage trustees