| /third_party/skia/third_party/externals/brotli/c/enc/ |
| D | hash_longest_match_quickly_inc.h | 191 size_t backward; in FN() local
196 backward = cur_ix - prev_ix; in FN()
201 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FN()
208 const score_t score = BackwardReferenceScore(len, backward); in FN()
211 out->distance = backward; in FN()
225 size_t backward; in FN() local
227 backward = cur_ix - prev_ix; in FN()
232 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FN()
239 const score_t score = BackwardReferenceScore(len, backward); in FN()
246 out->distance = backward; in FN()
|
| D | hash_forgetful_chain_inc.h | 215 const size_t backward = (size_t)distance_cache[i]; in FN() local
216 size_t prev_ix = (cur_ix - backward); in FN()
219 if (prev_ix >= cur_ix || backward > max_backward) { in FN()
235 out->distance = backward; in FN()
244 size_t backward = 0; in FN() local
251 backward += delta; in FN()
252 if (backward > max_backward || (CAPPED_CHAINS && !delta)) break; in FN()
253 prev_ix = (cur_ix - backward) & ring_buffer_mask; in FN()
269 score_t score = BackwardReferenceScore(len, backward); in FN()
274 out->distance = backward; in FN()
|
| D | hash_longest_match_inc.h | 178 const size_t backward = (size_t)distance_cache[i]; in FN() local
179 size_t prev_ix = (size_t)(cur_ix - backward); in FN()
183 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
208 out->distance = backward; in FN()
223 const size_t backward = cur_ix - prev_ix; in FN() local
224 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
241 score_t score = BackwardReferenceScore(len, backward); in FN()
246 out->distance = backward; in FN()
|
| D | hash_longest_match64_inc.h | 182 const size_t backward = (size_t)distance_cache[i]; in FN() local
183 size_t prev_ix = (size_t)(cur_ix - backward); in FN()
187 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
212 out->distance = backward; in FN()
228 const size_t backward = cur_ix - prev_ix; in FN() local
229 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
246 score_t score = BackwardReferenceScore(len, backward); in FN()
251 out->distance = backward; in FN()
|
| D | hash_to_binary_tree_inc.h | 144 const size_t backward = cur_ix - prev_ix; in FN() local
146 if (backward == 0 || backward > max_backward || depth_remaining == 0) { in FN()
165 InitBackwardMatch(matches++, backward, len); in FN()
220 const size_t backward = cur_ix - prev_ix; in FN() local
221 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
235 InitBackwardMatch(matches++, backward, len); in FN()
|
| /third_party/node/deps/brotli/c/enc/ |
| D | hash_longest_match_quickly_inc.h | 191 size_t backward; in FN() local
196 backward = cur_ix - prev_ix; in FN()
201 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FN()
208 const score_t score = BackwardReferenceScore(len, backward); in FN()
211 out->distance = backward; in FN()
225 size_t backward; in FN() local
227 backward = cur_ix - prev_ix; in FN()
232 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FN()
239 const score_t score = BackwardReferenceScore(len, backward); in FN()
246 out->distance = backward; in FN()
|
| D | hash_forgetful_chain_inc.h | 215 const size_t backward = (size_t)distance_cache[i]; in FN() local
216 size_t prev_ix = (cur_ix - backward); in FN()
219 if (prev_ix >= cur_ix || backward > max_backward) { in FN()
235 out->distance = backward; in FN()
244 size_t backward = 0; in FN() local
251 backward += delta; in FN()
252 if (backward > max_backward || (CAPPED_CHAINS && !delta)) break; in FN()
253 prev_ix = (cur_ix - backward) & ring_buffer_mask; in FN()
269 score_t score = BackwardReferenceScore(len, backward); in FN()
274 out->distance = backward; in FN()
|
| D | hash_longest_match_inc.h | 178 const size_t backward = (size_t)distance_cache[i]; in FN() local
179 size_t prev_ix = (size_t)(cur_ix - backward); in FN()
183 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
208 out->distance = backward; in FN()
223 const size_t backward = cur_ix - prev_ix; in FN() local
224 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
241 score_t score = BackwardReferenceScore(len, backward); in FN()
246 out->distance = backward; in FN()
|
| D | hash_longest_match64_inc.h | 182 const size_t backward = (size_t)distance_cache[i]; in FN() local
183 size_t prev_ix = (size_t)(cur_ix - backward); in FN()
187 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
212 out->distance = backward; in FN()
228 const size_t backward = cur_ix - prev_ix; in FN() local
229 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
246 score_t score = BackwardReferenceScore(len, backward); in FN()
251 out->distance = backward; in FN()
|
| D | hash_to_binary_tree_inc.h | 144 const size_t backward = cur_ix - prev_ix; in FN() local
146 if (backward == 0 || backward > max_backward || depth_remaining == 0) { in FN()
165 InitBackwardMatch(matches++, backward, len); in FN()
220 const size_t backward = cur_ix - prev_ix; in FN() local
221 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
235 InitBackwardMatch(matches++, backward, len); in FN()
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| D | test-bimap.cc | 43 assert (bm.backward (6) == 3); in main()
70 assert (ibm.backward (0) == 0); in main()
71 assert (ibm.backward (1) == 1); in main()
72 assert (ibm.backward (2) == 2); in main()
|
| /third_party/harfbuzz/src/ |
| D | test-bimap.cc | 43 assert (bm.backward (6) == 3); in main()
70 assert (ibm.backward (0) == 0); in main()
71 assert (ibm.backward (1) == 1); in main()
72 assert (ibm.backward (2) == 2); in main()
|
| /third_party/skia/third_party/externals/brotli/research/ |
| D | README.md | 3 …backward reference distance distributions in LZ77 compression. We developed these tools to be able…
9 This tool generates optimal (match-length-wise) backward references for every position in the input…
17 This tool generates a visualization of the distribution of backward references stored in `*.dist` f…
29 …ages. Input images must be of same size. Useful for comparing different backward references distri…
55 More verbose explanation: for each backward reference there is a position-distance pair, also a cop…
|
| /third_party/grpc/doc/core/ |
| D | pending_api_cleanups.md | 2 backward-compatibility (e.g., a macro or some other function to preserve
5 feature that does change the API in a non-backward-compatible way, we
7 can take the opportunity to clean up any pending backward-compatibility
10 This file lists all pending backward-compatibility changes that should
|
| /third_party/grpc/doc/cpp/ |
| D | pending_api_cleanups.md | 2 backward-compatibility (e.g., a macro or some other function to preserve
5 feature that does change the API in a non-backward-compatible way, we
7 can take the opportunity to clean up any pending backward-compatibility
10 This file lists all pending backward-compatibility changes that should
|
| /third_party/boost/boost/fusion/iterator/detail/ |
| D | advance.hpp | 65 struct backward;
71 backward<
79 struct backward struct
|
| /third_party/boost/libs/python/doc/reference/ |
| D | ssize_t.qbk | 3 …ize_t_max`, and `ssize_t_min`. Appropriate definitions are provided for backward compatibility wit…
6 …ost::python` namespace if available, or provides an appropriate typedef for backward compatibility:
16 …oost::python` namespace if available, or provides appropriate constants for backward compatibility:
|
| /third_party/python/Lib/idlelib/idle_test/ |
| D | test_searchengine.py | 317 backward = self.make_search(self.engine.search_backward)
319 Equal(backward(pat, 3, 5, True), self.res)
320 Equal(backward(pat, 2, 0, True), self.res) # wrap
321 Equal(backward(pat, 2, 0, False), None) # no wrap
322 Equal(backward(pat, 2, 16, False), self.res)
324 Equal(backward(self.failpat, 3, 9, True), None)
325 Equal(backward(self.emptypat, 2, 10, True, ok=True), (2, (9,9)))
328 Equal(backward(self.emptypat, 2, 9, True), (2, (5, 9)))
|
| /third_party/flutter/skia/third_party/externals/icu/source/data/translit/ |
| D | ThaiLogical_Latin.txt | 40 ห | $1 ← h ($notAbove*) \u0304; # backward case, account for reordering
78 ฝ | $1 ← f ($notAbove*) \u0304; # backward case, account for reordering
86 ศ | $1 ← s \u0323 ($notAbove*) \u0304; # backward case, account for reordering
89 ส | $1 ← s ($notAbove*) \u0304; # backward case, account for reordering
98 า | $1 ← a ($notAbove*) \u0304; # backward case, account for reordering
101 ำ | $1 ← a ($notAbove*) \u0309 ; # backward case, account for reordering
104 \u0E35 | $1 ← i ($notAbove*) \u0304 ; # backward case, account for reordering
106 \u0E37 | $1 ← u \u0323 ($notAbove*) \u0304 ; # backward case, account for reordering
109 \u0E39 | $1 ← u ($notAbove*) \u0304 ; # backward case, account for reordering
|
| /third_party/skia/third_party/externals/icu/source/data/translit/ |
| D | ThaiLogical_Latin.txt | 41 ห | $1 ← h ($notAbove*) \u0304; # backward case, account for reordering
79 ฝ | $1 ← f ($notAbove*) \u0304; # backward case, account for reordering
87 ศ | $1 ← s \u0323 ($notAbove*) \u0304; # backward case, account for reordering
90 ส | $1 ← s ($notAbove*) \u0304; # backward case, account for reordering
99 า | $1 ← a ($notAbove*) \u0304; # backward case, account for reordering
102 ำ | $1 ← a ($notAbove*) \u0309 ; # backward case, account for reordering
105 \u0E35 | $1 ← i ($notAbove*) \u0304 ; # backward case, account for reordering
107 \u0E37 | $1 ← u \u0323 ($notAbove*) \u0304 ; # backward case, account for reordering
110 \u0E39 | $1 ← u ($notAbove*) \u0304 ; # backward case, account for reordering
|
| /third_party/icu/icu4c/source/data/translit/ |
| D | ThaiLogical_Latin.txt | 40 ห | $1 ← h ($notAbove*) \u0304; # backward case, account for reordering
78 ฝ | $1 ← f ($notAbove*) \u0304; # backward case, account for reordering
86 ศ | $1 ← s \u0323 ($notAbove*) \u0304; # backward case, account for reordering
89 ส | $1 ← s ($notAbove*) \u0304; # backward case, account for reordering
98 า | $1 ← a ($notAbove*) \u0304; # backward case, account for reordering
101 ำ | $1 ← a ($notAbove*) \u0309 ; # backward case, account for reordering
104 \u0E35 | $1 ← i ($notAbove*) \u0304 ; # backward case, account for reordering
106 \u0E37 | $1 ← u \u0323 ($notAbove*) \u0304 ; # backward case, account for reordering
109 \u0E39 | $1 ← u ($notAbove*) \u0304 ; # backward case, account for reordering
|
| /third_party/python/Lib/turtledemo/ |
| D | peace.py | 30 backward(640)
50 backward(170)
|
| D | bytedesign.py | 39 self.backward(64.65 * scale)
64 self.backward(28 * scale)
71 self.backward(2.5 * scale)
77 self.backward(2.5 * scale)
|
| /third_party/boost/libs/date_time/build/ |
| D | Jamfile.v2 | 6 # date_time is now header only -- this file provides a stub for backward compatibility
21 # still a boost_date_time library to link for backward compatibility
|
| /third_party/wayland-protocols_standard/ |
| D | README.md | 20 the maintainers. Changes to such protocols will always be backward
52 If the changes are backward incompatible changes to an unstable protocol,
79 possible to make discoverable backward incompatible changes.
82 represents backward incompatible changes, and the minor version, which
83 represents backward compatible changes to the interfaces in the protocol.
105 During the development of a new protocol it is possible that backward
109 Assuming a backward incompatible change is needed, the procedure for how to
125 more backward incompatible changes will ever be allowed, one last
|