-
math.Pow(x,y) optimization for cases: constant integer `y`. For example:
* `... math.Pow(length, 2)...`
* `... math.Pow(length, 3.0)...`
### What version of Go are you using (`go version`)?
…
-
Implement integer division `//` (known as floor_div) for Qint type using the following algorithm: [Integer_division_(unsigned)_with_remainder](https://en.wikipedia.org/wiki/Division_algorithm#Integer_…
dakk updated
3 months ago
-
```
package main
import (
"fmt"
"time"
binance "github.com/banbox/banexg/binance"
)
func main() {
symbol := "SOLUSDT"
timeframe := "5m"
options := map[string]interface{}{}
ap…
-
| | |
|--------------------|----|
| Bugzilla Link | [PR45155](https://bugs.llvm.org/show_bug.cgi?id=45155) |
| Status | NEW |
| Importance | P normal |
|…
-
I would be in favor of implementing u48 and i48. There are few CPUs that support [48-bit integers](https://en.wikipedia.org/wiki/48-bit_computing) otherwise you could represent it as 16-bit and 32-bit…
-
I guess (and did a very quick search) LLVM does not have a `mod` intrinsic, otherwise I would expect it to do this optimization.
`mod(i::Integer, 2^n)` could be rewritten as something like ~~`(0b1
-
Performing mbo over integer parameter spaces with infill optimization "cmaes"
```r
ps = makeParamSet(
makeNumericParam("q", lower = -1, upper = 2),
makeIntegerParam("v", lower = -2, upper = 3)…
mb706 updated
4 years ago
-
### Description
I have an issue, when I am using synchronous system, which contains subSample() or superSample() functionality. In particular, I like to print values into a file in a subsampled par…
-
In https://github.com/lancedb/lance/pull/2662 we added support for bitpacking signed integers in LanceV2. In https://github.com/lancedb/lance/pull/2696, an optimization was made to exclude the sign bi…
-
It might potentially be faster to use a different hashing algorithm when the key size is known to be 32 or 64bits:
See for potentially faster single integer hashing:
https://github.com/skeeto/hash-p…