-
In [this comment](https://github.com/mpiannucci/gribberish/issues/41#issuecomment-2405209996) @mpiannucci said:
> I... was going to codegen [a Rust implementation of the GRIB code tables] but never…
-
### Checklist
- [X] The issue exists after disabling all extensions
- [X] The issue exists on a clean installation of webui
- [ ] The issue is caused by an extension, but I believe it is caused b…
-
HI, first of all, thank you for sharing this awesome project, I was looking for a card evaluation algorithm for a custom project in Java and yours is clearly excellent (my Java implementation evaluate…
-
Ok, the idea would be you could do something like this:
```
one = Field(str)
two = Field(str)
three = Field(str, depends=["one", "two"])
```
That will cause `Schema.fields` to order the fi…
-
thanks a lot, it is a great example of perfect hash function,
but i have two questions: in the document perfect.c , there is no definition of UCHAR_MAX,
and in test.c I can't figure out why using 635…
-
As noted in the comment in libssl (ssl/t1_lib.c):
````
/*
* Check hash is available.
* This test is not perfect. A provider could have support
* for a signatu…
-
### Describe the bug
I wasn't sure if I should put this in bugs or feature request (that seemed to be a bigger scale according to the wiki).
I noticed that when I went to add some subject interest…
-
# One Billion Row Challenge · CuriousCoding
Table of Contents The problem Initial solution: 105s First flamegraph Bytes instead of strings: 72s Manual parsing: 61s Inline hash keys: 50s Faster hash f…
-
Right now OpenTF relies on a specific registry implementation to host providers and modules. That works fine and is easily hostable using static files on something like S3, but generally, it's not tri…
-
Hi hypervis0r and Jeff,
Interesting blogpost from you guys. A few things came to mind while reading it. Hope you don't mind me dumping a few of them here.
- Hashing is tricky. It is a tradeoff b…