Bodigrim/quote-quot

Divide without division

32
/ 100
Emerging

This tool generates highly optimized routines for integer division that run 2.5x-3.5x faster than standard methods. It takes a known positive divisor (like 10) and an integer, and produces the quotient using only arithmetic and bitwise operations. This is useful for Haskell developers working on performance-critical applications.

No commits in the last 6 months.

Use this if you are a Haskell developer needing to significantly speed up integer division operations where the divisor is constant and known during compilation.

Not ideal if your divisors are not known at compile-time or can be zero, or if you are not developing in Haskell.

Haskell development performance optimization compiler optimization systems programming low-level arithmetic
Stale 6m No Package No Dependents
Maintenance 2 / 25
Adoption 6 / 25
Maturity 16 / 25
Community 8 / 25

How are scores calculated?

Stars

20

Forks

2

Language

Haskell

License

BSD-3-Clause

Category

code-editor

Last pushed

Aug 09, 2025

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ai-coding/Bodigrim/quote-quot"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.