| /external/cronet/third_party/brotli/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 | 217 const size_t backward = (size_t)distance_cache[i]; in FN() local
218 size_t prev_ix = (cur_ix - backward); in FN()
221 if (prev_ix >= cur_ix || backward > max_backward) { in FN()
237 out->distance = backward; in FN()
246 size_t backward = 0; in FN() local
253 backward += delta; in FN()
254 if (backward > max_backward || (CAPPED_CHAINS && !delta)) break; in FN()
255 prev_ix = (cur_ix - backward) & ring_buffer_mask; in FN()
271 score_t score = BackwardReferenceScore(len, backward); in FN()
276 out->distance = backward; in FN()
|
| D | hash_longest_match_inc.h | 174 const size_t backward = (size_t)distance_cache[i]; in FN() local
175 size_t prev_ix = (size_t)(cur_ix - backward); in FN()
179 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
204 out->distance = backward; in FN()
219 const size_t backward = cur_ix - prev_ix; in FN() local
220 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
237 score_t score = BackwardReferenceScore(len, backward); in FN()
242 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 | 145 const size_t backward = cur_ix - prev_ix; in FN() local
147 if (backward == 0 || backward > max_backward || depth_remaining == 0) { in FN()
166 InitBackwardMatch(matches++, backward, len); in FN()
221 const size_t backward = cur_ix - prev_ix; in FN() local
222 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
236 InitBackwardMatch(matches++, backward, len); in FN()
|
| /external/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()
|
| /external/ComputeLibrary/tests/validation/CPP/ |
| D | DFT.cpp | 89 auto backward = reference::ridft_1d(forward, is_odd); in TEST_SUITE() local
92 validate(SimpleTensorAccessor<float>(src), backward, RelativeTolerance<float>(0.1f)); in TEST_SUITE()
105 auto backward = reference::dft_1d(forward, reference::FFTDirection::Inverse); in DATA_TEST_CASE() local
108 validate(SimpleTensorAccessor<float>(src), backward, RelativeTolerance<float>(0.1f)); in DATA_TEST_CASE()
125 auto backward = reference::ridft_2d(forward, is_odd); in TEST_SUITE() local
128 validate(SimpleTensorAccessor<float>(src), backward, RelativeTolerance<float>(0.1f)); in TEST_SUITE()
141 auto backward = reference::dft_2d(forward, reference::FFTDirection::Inverse); in DATA_TEST_CASE() local
144 …validate(SimpleTensorAccessor<float>(src), backward, RelativeTolerance<float>(0.1f), 0.f, Absolute… in DATA_TEST_CASE()
|
| /external/guava/android/guava-testlib/src/com/google/common/collect/testing/google/ |
| D | BiMapInverseTester.java | 54 assertEquals(pair.backward, copy.backward); in testInverseSerialization()
55 assertSame(copy.backward, copy.forward.inverse()); in testInverseSerialization()
56 assertSame(copy.forward, copy.backward.inverse()); in testInverseSerialization()
61 final BiMap<V, K> backward; field in BiMapInverseTester.BiMapPair
65 this.backward = original.inverse(); in BiMapPair()
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| D | BiMapInverseTester.java | 54 assertEquals(pair.backward, copy.backward); in testInverseSerialization()
55 assertSame(copy.backward, copy.forward.inverse()); in testInverseSerialization()
56 assertSame(copy.forward, copy.backward.inverse()); in testInverseSerialization()
61 final BiMap<V, K> backward; field in BiMapInverseTester.BiMapPair
65 this.backward = original.inverse(); in BiMapPair()
|
| /external/harfbuzz_ng/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()
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | AbstractBiMap.java | 58 AbstractBiMap(Map<K, V> forward, Map<V, K> backward) { in AbstractBiMap() argument
59 setDelegates(forward, backward); in AbstractBiMap()
63 private AbstractBiMap(Map<K, V> backward, AbstractBiMap<V, K> forward) { in AbstractBiMap() argument
64 delegate = backward; in AbstractBiMap()
91 void setDelegates(Map<K, V> forward, Map<V, K> backward) { in setDelegates() argument
95 checkArgument(backward.isEmpty()); in setDelegates()
96 checkArgument(forward != backward); in setDelegates()
98 inverse = makeInverse(backward); in setDelegates()
101 AbstractBiMap<V, K> makeInverse(Map<V, K> backward) { in makeInverse() argument
102 return new Inverse<>(backward, this); in makeInverse()
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | AbstractBiMap.java | 59 AbstractBiMap(Map<K, V> forward, Map<V, K> backward) { in AbstractBiMap() argument
60 setDelegates(forward, backward); in AbstractBiMap()
64 private AbstractBiMap(Map<K, V> backward, AbstractBiMap<V, K> forward) { in AbstractBiMap() argument
65 delegate = backward; in AbstractBiMap()
92 void setDelegates(Map<K, V> forward, Map<V, K> backward) { in setDelegates() argument
96 checkArgument(backward.isEmpty()); in setDelegates()
97 checkArgument(forward != backward); in setDelegates()
99 inverse = makeInverse(backward); in setDelegates()
102 AbstractBiMap<V, K> makeInverse(Map<V, K> backward) { in makeInverse() argument
103 return new Inverse<>(backward, this); in makeInverse()
[all …]
|
| /external/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…
|
| /external/xz-java/src/org/tukaani/xz/lz/ |
| D | LZEncoder.java | 281 public void copyUncompressed(OutputStream out, int backward, int len)
283 out.write(buf, readPos + 1 - backward, len);
315 public int getByte(int backward) {
316 return buf[readPos - backward] & 0xFF;
324 public int getByte(int forward, int backward) {
325 return buf[readPos + forward - backward] & 0xFF;
|
| /external/grpc-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
|
| /external/grpc-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
|
| /external/python/cpython2/Lib/idlelib/idle_test/ |
| D | test_searchengine.py | 314 backward = self.make_search(self.engine.search_backward)
316 Equal(backward(pat, 3, 5, True), self.res)
317 Equal(backward(pat, 2, 0, True), self.res) # wrap
318 Equal(backward(pat, 2, 0, False), None) # no wrap
319 Equal(backward(pat, 2, 16, False), self.res)
321 Equal(backward(self.failpat, 3, 9, True), None)
322 Equal(backward(self.emptypat, 2, 10, True, ok=True), (2, (9,9)))
325 Equal(backward(self.emptypat, 2, 9, True), (2, (5, 9)))
|
| /external/python/cpython3/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)))
|
| /external/cronet/third_party/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
|
| /external/icu/icu4c/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
|
| /external/python/cpython3/Lib/turtledemo/ |
| 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)
|