-
### Elasticsearch Version
main
### Installed Plugins
_No response_
### Java Version
_bundled_
### OS Version
n/a
### Problem Description
The `SimplifyComparisonArithmetics` optimization incor…
-
Is there a way to define a LinearProgram to have some/all variables to be Integer? I can't find any solvers other than the Apache Simplex (there is a BreachAndBound class, but it seems to be a stub). …
-
```
package main
import (
"fmt"
"time"
binance "github.com/banbox/banexg/binance"
)
func main() {
symbol := "SOLUSDT"
timeframe := "5m"
options := map[string]interface{}{}
ap…
-
## 🐛 Bug
The transformation in IRSimplifier for integers: `m*n % m -> 0` is not safe because `m` is not guaranteed to be non-zeros. We need to forbid this optimization.
-
https://github.com/JuliaLang/julia/pull/47546 made `BigFloat(::Float64)` about 2x faster, but basically the same optimization could be done for the common Integer types (`Base.BitInteger64`), `Base.IE…
-
If LLVM knows that an integer value can always fit in a 32-bit integer, it should probably do that. This especially applies to loop counters, which LLVM likes to do the opposite and convert to `size_t…
-
An Expr of the form pow(x, y) that triggers the raise_to_integer_power() optimization generates an expression tree that explodes in proportion to y. [e.g.: pow(2, 0x7fffffff)]
-
## Description of the issue
This is a rather large project and it is about including concepts from Modelling in the ontology. I am not 100% sure if they even belong but we can discuss that. Here is…
-
~~~c++
int f(int i, int j, int k) {
if (i + j > k) // FN
i = k - j;
return i;
}
int g(int i, int j, int k) {
if (i > k - j) // warning
i = k - j;
return i;
…
-
https://github.com/facebook/zstd/issues/2832#issuecomment-2186664715 mentions that:
> Starting v1.5.6, zstd at high compression levels features a better compression ratio on 32-bit structures. The …