| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2025-07-21 | Introduce free function to rb_concurrent_set_funcs | Peter Zhu | |
| If we create a key but don't insert it (due to other Ractor winning the race), then it would leak memory if we don't free it. This introduces a new function to free that memory for this case. | |||
| 2025-07-21 | Add rb_concurrent_set_find | Peter Zhu | |
| 2025-07-21 | Add rb_concurrent_set_size | Peter Zhu | |
| 2025-07-15 | Make rb_concurrent_set_funcs const | Peter Zhu | |
| We should never modify rb_concurrent_set_funcs during runtime, so we can make it const. | |||
| 2025-07-07 | Rename `ractor_safe_set` into `concurrent_set` | Jean Boussier | |
| There's nothing ractor related in them, and the classic terminology for these sort of data structures is `concurrent-*`, e.g. concurrent hash. | |||
 |
index : ruby.git | |
| The Ruby Programming Language |
| summaryrefslogtreecommitdiff |