# fixed-point: Binary fixed-point arithmetic

Versions | 0.1.0.0, 0.1.0.1, 0.2.0.0, 0.3.0.0, 0.4.0.0, 0.4.0.1, 0.5.0.0, 0.5.0.1 |
---|---|

Dependencies | base (==4.3.*), vector (==0.7.*) [details] |

License | MIT |

Author | Jake McArthur |

Maintainer | Jake McArthur <Jake.McArthur@gmail.com> |

Category | Data, Game, Math, Numerical |

Source repo | head: darcs get http://patch-tag.com/r/jmcarthur/fixed-point this: darcs get http://patch-tag.com/r/jmcarthur/fixed-point --tag v0.4.0.0 |

Uploaded | by JakeMcArthur at Sat Apr 30 20:31:17 UTC 2011 |

Distributions | NixOS:0.5.0.1 |

Downloads | 2961 total (22 in the last 30 days) |

Rating | (no votes yet) [estimated by rule of succession] |

Your Rating | |

Status | Docs uploaded by user Build status unknown [no reports yet] Hackage Matrix CI |

This package defines a type for binary fixed-precision arithmetic. The main differences between this and Data.Fixed are that this is binary fixed-point and it's polymorphic in the underlying representation. When is this more appropriate than floating point? You'll mainly want to use this when you need to be able to represent fractional values within a bounded range. Fixed-point numbers have the advantage of uniformity in these cases. On the downside, you lose precision relative to floating point numbers as you approach zero, and you lose the ability to express very large (but imprecise) values that floating point can express. On some architectures, fixed-point arithmetic might be faster than floating-point arithmetic, but this is probably not the case on x86.

## Downloads

- fixed-point-0.4.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)