|
d3e09bf4
|
2021-08-24T10:31:49
|
|
[set] Make all operators null-safe again
Changed my mind.
Also for hb_map_clear().
Part of https://github.com/harfbuzz/harfbuzz/pull/3162
|
|
|
84c2a302
|
2021-08-19T16:33:48
|
|
[bit-set-invertible] Second try fixing previous()
|
|
|
8f88747a
|
2021-08-19T16:30:48
|
|
[bit-set-invertible] Fix previous() iteration
|
|
|
92908c12
|
2021-08-19T15:28:26
|
|
[bit-set-invertible] Remove extra check
We don't expect immutable / null set in this code.
|
|
|
1babe80e
|
2021-08-19T15:18:32
|
|
[bit-set-invertible] Fix last remaining corner-case
|
|
|
e8911d13
|
2021-08-19T14:59:57
|
|
[bit-set-invertible] Implement a couple other missing corner cases
Also, in bit-set, don't compute population in is_equal/is_subset()
if we don't have it computed already.
|
|
|
2579dc64
|
2021-08-19T14:48:27
|
|
[bit-set-invertible] Move code around
|
|
|
2dfc1042
|
2021-08-19T14:47:33
|
|
[bit-set-invertible] Implement is_empty() for inverted case as well
|
|
|
87885e6f
|
2021-08-19T13:26:25
|
|
[bit-set-invertible] Fix next/previous() logic
|
|
|
eec1a25e
|
2021-08-19T13:22:36
|
|
[bit-set-invertible] Rewrite get_min/max() in terms of next/previous()
|
|
|
f4fd7baf
|
2021-08-19T13:05:12
|
|
[bit-set-invertible] Fix subtract() logic
|
|
|
f317d8e4
|
2021-08-19T13:01:07
|
|
[bit-set-invertible] Fix intersect() logic
|
|
|
b21038d9
|
2021-08-19T11:24:17
|
|
[bit-set-invertible] Rewrite next/previous_range() in terms of s.next/previous()
|
|
|
eb98bc1e
|
2021-08-19T11:19:24
|
|
[bit-set-invertible] Rewrite next/previous() using s.next/previous_range()
|
|
|
248ad3bc
|
2021-08-19T10:17:51
|
|
[bit-set-invertible] Implement next/previous
This makes invertible set functionality complete.
|
|
|
c27f5b12
|
2021-08-19T10:01:24
|
|
[bit-set-invertible] Plug in next_range()/previous_range()
|
|
|
f6aa3715
|
2021-08-19T01:12:25
|
|
[bit-set-invertible] Fix process logic for inverted
[# On branch set-invert
|
|
|
b119b480
|
2021-08-19T00:51:24
|
|
[bit-set-invertible] Add unlikely() around inverted checks
|
|
|
b94f24ec
|
2021-08-19T00:48:00
|
|
[bit-set-invertible] Implement set algebra
|
|
|
8aa92ff8
|
2021-08-18T23:01:06
|
|
[bit-set-invertible] Implement get_min/max
|
|
|
669b97d9
|
2021-08-18T21:39:04
|
|
[bit-set-invertible] Implement iterator
|
|
|
c66894d7
|
2021-08-18T21:24:29
|
|
[bit-set-invertible] Write a subset branch as dagger
|
|
|
c39d2f7a
|
2021-08-18T21:20:54
|
|
[bit-set-invertible] Implement add_array / add_sorted_array / intersects
|
|
|
f0c3804f
|
2021-08-17T15:37:19
|
|
[set] Add hb_bit_set_invertible_t and resurrect hb_set_invert()
Implementation is NOT complete yet.
|