-
The current implementation of sets and maps being 'ordered by default' is unintuitive as it isn't actually 'by default'; One would expect a persistent set to count as a persistent set, regardless of i…
-
I have two map. Could I use it like the following ? 2 diferent keys store a same inner map kv.
```
outer_map
inner_map
outer_map(key_a, inner_map(key1, val1))
outer_map(key_b, inner_map(key1…
-
I tried to find out how many chains in a hash table are unused in a certain workload and added a probe to record all computed hash values, then used it like so:
`kprobe:hashval { @hash[arg0] = coun…
-
Setting the seed and repeating the fused neighborhood sampling for a source code does not reproduce the same subgraph, have identified a fix that will be slower but allow reproducible subgraphs
## …
-
The help for names claims that it shows "all known names". However, it doesn't seem to be that simple and the output varies based on namespace. I'm not sure whether this is a documentation issue or a …
-
The docs say this about `time(...)`:
> bpftrace uses the `strftime(3)` function for formatting time and supports the same format specifiers.
However, it doesn't seem to format `%f` correctly, wh…
-
I have tried using both dense_hash_map and sparse_hash_map for inserting millions of entries into the hash table in a distributed environment, where each process holds its own private hash table. Unfo…
-
Repro
```c++
module test();
import std::thread;
struct Test {
Mutex mu;
}
module xxx;
import test;
def MyTest = Test();
fn void! MyTest.test(&self) {
}
fn void! main(String[] args) {…
-
### Description of Issue
As a developer, i want to add an attribute to my input element so that i can turn off autocomplete or maybe do something else to the component.
- https://developer.mozill…
-
AFAIK, these are slow in STL of C++. We have found some alternatives - policy based data structures (https://codeforces.com/blog/entry/60737, SparseHash by Google, `abseil::flat_hash_map`, `boost::uno…