| Commit message (Expand) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | PR#6749: ocamlopt returns n for (n mod 1) instead of 0 | Gabriel Scherer | 2015-02-08 | 1 | -0/+4 |
| * | PR#6042: optimize integer division and modulus when divisor is constant. | Xavier Leroy | 2013-11-01 | 1 | -0/+33 |
![]() |
index : delta/ocaml.git | |
| github.com: ocaml/ocaml |
| summaryrefslogtreecommitdiff |
| Commit message (Expand) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | PR#6749: ocamlopt returns n for (n mod 1) instead of 0 | Gabriel Scherer | 2015-02-08 | 1 | -0/+4 |
| * | PR#6042: optimize integer division and modulus when divisor is constant. | Xavier Leroy | 2013-11-01 | 1 | -0/+33 |