-
The HashSet is nice to get equality checks. But when you are using it to display UI elements, vector/array is preferable since order of elements seems to change on each re-render of the application. B…
ghost updated
3 years ago
-
It was suggested by @jvasileff that the performance of `HashMap` is limited by the use of our cross-platform `Array` abstraction. If so, then it should be possible to improve performance on the JVM by…
-
I'm imagining a hashset with all these commands, and if a string is found there, we just do `Token::Function(str_ref)`.
tmke8 updated
3 months ago
-
https://programmercarl.com/0349.%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9A%84%E4%BA%A4%E9%9B%86.html
-
We are still missing some unit tests for:
- [ ] HashMap
- [ ] InsertOnlyHashMap
- [ ] HashSet
- [ ] InsertOnlyHashSet
- [ ] MinHash Code
-
Our current `LinkedHashSet` implementation uses a quirk of the `HashSet` design to produce the correct ordering, but it involves expensive allocations when an item is removed followed by an add or ins…
-
### Which Umbraco version are you using? (Please write the *exact* version, example: 10.1.0)
13.5.2
### Bug summary
**Error while migrating data from v13 to v14**
```
Plan Umbraco.Core failed a…
-
**Problem**
**Steps To Reproduce**
[Reproducile repo](https://github.com/chungwong/bar-chart/tree/issue_2288)
```rs
#[component]
fn Home() -> Element {
let global_filter: Signal = us…
-
Note the issue here:
https://github.com/twitter/algebird/pull/399#issuecomment-73473246
The problem comes that `Array[T]` does not have sane equals/compareTo even though it clearly could. Making an …
-
### Description
I found some code that was looping over a hashset, and removing items. Hashset is not throwing when you remove while enumerating like it used to.
It's convenient that it's like thi…