|
c05002af
|
2025-02-05T16:46:13
|
|
[set] Add may_have() as alias for get()
|
|
|
7b927748
|
2025-02-05T12:25:54
|
|
[bit-set] Rename a method
|
|
|
255dadc1
|
2025-02-04T22:02:11
|
|
[set] Speed up may_intersect()
|
|
3cfdbd67
|
2024-02-16T23:41:55
|
|
Use `noexcept` on swap, move constructors, etc.
|
|
|
90fc809f
|
2023-11-10T15:05:08
|
|
[set] Minor likely and __prev__
|
|
|
867640af
|
2023-07-14T13:09:16
|
|
Revert "[set] Add test_and_add / test_and_del"
This reverts commit de1237fbf2660b5952dde4db171a62d9b1a77c92.
This seems to be a net loss.
|
|
|
de1237fb
|
2023-07-14T12:38:56
|
|
[set] Add test_and_add / test_and_del
Use in graph.
|
|
|
0364c69e
|
2023-06-07T15:52:18
|
|
[iter] Add has_fast_len
Set iterators are not random_access, but have fast len().
|
|
|
81b2a56d
|
2023-06-07T15:04:20
|
|
[set] Micro-optimize iteration
|
|
|
ca27925d
|
2023-06-03T16:18:15
|
|
Use hb_codepoint_pair_t in more places
|
|
|
5153218b
|
2023-01-05T16:26:41
|
|
[set] Add hb_set_is_inverted()
|
|
|
d2a2670e
|
2022-11-28T19:42:27
|
|
[iter] Simplify has() interface implementations
|
|
|
b172f88c
|
2022-06-18T14:00:27
|
|
Fix a warning
D:\a\harfbuzz\harfbuzz\src\hb-bit-set-invertible.hh(83): warning C4805: '^': unsafe mix of type 'uint32_t' and type 'const bool' in operation
[870/1075] Compiling C++ object src/harfbuzz.dll.p/hb-face.cc.obj
cl : Command line warning D9025 : overriding '/EHs' with '/EHs-'
cl : Command line warning D9025 : overriding '/EHc' with '/EHc-'
|
|
|
e9c0a740
|
2022-06-15T16:57:16
|
|
Fix clang -Wcomma warnings
Fixes https://github.com/harfbuzz/harfbuzz/issues/3656
|
|
|
58f848da
|
2022-05-19T15:42:54
|
|
[set/map] Adjust hash function return type
|
|
|
124f9aeb
|
2022-05-19T12:58:02
|
|
[set] Make hb_set_t hashable
|
|
|
1f578b5a
|
2022-05-18T15:24:40
|
|
[set] Add pre-allocation internal API
|
|
|
c81198b5
|
2022-05-12T11:58:37
|
|
[set] Tweak move operators a bit
Should be equivalent.
|
|
|
0a388785
|
2022-03-25T09:42:36
|
|
[set] Minor touch-up on the previous commit
|
|
01829882
|
2022-03-25T08:36:44
|
|
[set] Add call to export set contents to an array. (#3500)
[set] Add hb_set_next_many.
|
|
|
38debbab
|
2021-11-01T22:17:35
|
|
[set] Add successful check in swap()
|
|
|
11eadb5d
|
2021-11-01T21:07:09
|
|
[bit-set-invertible] Implement standard-5 methods & swap
|
|
|
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.
|