Behdad Esfahbod
|
b21038d91d
|
[bit-set-invertible] Rewrite next/previous_range() in terms of s.next/previous()
|
2021-08-19 11:24:17 -06:00 |
|
Behdad Esfahbod
|
eb98bc1e32
|
[bit-set-invertible] Rewrite next/previous() using s.next/previous_range()
|
2021-08-19 11:19:24 -06:00 |
|
Behdad Esfahbod
|
248ad3bce5
|
[bit-set-invertible] Implement next/previous
This makes invertible set functionality complete.
|
2021-08-19 10:17:51 -06:00 |
|
Behdad Esfahbod
|
c27f5b1288
|
[bit-set-invertible] Plug in next_range()/previous_range()
|
2021-08-19 10:01:24 -06:00 |
|
Behdad Esfahbod
|
f6aa37159b
|
[bit-set-invertible] Fix process logic for inverted
[# On branch set-invert
|
2021-08-19 01:12:25 -06:00 |
|
Behdad Esfahbod
|
b119b48079
|
[bit-set-invertible] Add unlikely() around inverted checks
|
2021-08-19 00:51:24 -06:00 |
|
Behdad Esfahbod
|
b94f24ec79
|
[bit-set-invertible] Implement set algebra
|
2021-08-19 00:48:00 -06:00 |
|
Behdad Esfahbod
|
8aa92ff8f0
|
[bit-set-invertible] Implement get_min/max
|
2021-08-18 23:01:06 -06:00 |
|
Behdad Esfahbod
|
669b97d949
|
[bit-set-invertible] Implement iterator
|
2021-08-18 21:39:04 -06:00 |
|
Behdad Esfahbod
|
c66894d7c9
|
[bit-set-invertible] Write a subset branch as dagger
|
2021-08-18 21:24:29 -06:00 |
|
Behdad Esfahbod
|
c39d2f7a76
|
[bit-set-invertible] Implement add_array / add_sorted_array / intersects
|
2021-08-18 21:20:54 -06:00 |
|
Behdad Esfahbod
|
f0c3804fa2
|
[set] Add hb_bit_set_invertible_t and resurrect hb_set_invert()
Implementation is NOT complete yet.
|
2021-08-17 19:53:43 -06:00 |