/external/guava/guava-gwt/test-super/com/google/common/collect/testing/google/super/com/google/common/collect/testing/google/ |
H A D | BiMapInverseTester.java | 48 assertEquals(pair.backward, copy.backward); 49 assertSame(copy.backward, copy.forward.inverse()); 50 assertSame(copy.forward, copy.backward.inverse()); 55 final BiMap<V, K> backward; field in class:BiMapInverseTester.BiMapPair 59 this.backward = original.inverse();
|
/external/guava/guava/src/com/google/common/primitives/ |
H A D | Primitives.java | 63 Map<Class<?>, Class<?>> backward, Class<?> key, Class<?> value) { 65 backward.put(value, key); 62 add(Map<Class<?>, Class<?>> forward, Map<Class<?>, Class<?>> backward, Class<?> key, Class<?> value) argument
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | BiMapInverseTester.java | 53 assertEquals(pair.backward, copy.backward); 54 assertSame(copy.backward, copy.forward.inverse()); 55 assertSame(copy.forward, copy.backward.inverse()); 60 final BiMap<V, K> backward; field in class:BiMapInverseTester.BiMapPair 64 this.backward = original.inverse();
|
/external/speex/libspeex/ |
H A D | fftwrap.c | 249 kiss_fftr_cfg backward; member in struct:kiss_config 258 table->backward = kiss_fftr_alloc(size,1,NULL,NULL); 267 kiss_fftr_free(t->backward); 300 kiss_fftri2(t->backward, in, out);
|
/external/brotli/c/enc/ |
H A D | hash_longest_match_inc.h | 11 help create backward references to previous data. 33 /* Only block_size_ newest backward references are kept, 46 /* Buckets containing block_size_ of backward references. */ 142 /* Find a longest backward match of &data[cur_ix] up to the length of 173 const size_t backward = (size_t)distance_cache[i]; local 174 size_t prev_ix = (size_t)(cur_ix - backward); 178 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { 194 a few unnecessary binary logarithms in backward reference score, 203 out->distance = backward; 219 const size_t backward local [all...] |
H A D | hash_longest_match_quickly_inc.h | 33 help create backward references to previous data. 66 system to find accidentally good backward references here and there. */ 119 /* Find a longest backward match of &data[cur_ix & ring_buffer_mask] 168 size_t backward; local 173 backward = cur_ix - prev_ix; 178 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { 185 const score_t score = BackwardReferenceScore(len, backward); 188 out->distance = backward; 198 const size_t backward local [all...] |
H A D | hash_forgetful_chain_inc.h | 12 help create backward references to previous data. 145 /* Find a longest backward match of &data[cur_ix] up to the length of 175 const size_t backward = (size_t)distance_cache[i]; local 176 size_t prev_ix = (cur_ix - backward); 179 if (prev_ix >= cur_ix || backward > max_backward) { 195 out->distance = backward; 204 size_t backward = 0; local 211 backward += delta; 212 if (backward > max_backward || (CAPPED_CHAINS && !delta)) break; 213 prev_ix = (cur_ix - backward) [all...] |
H A D | hash_longest_match64_inc.h | 11 help create backward references to previous data. 35 /* Only block_size_ newest backward references are kept, 50 /* Buckets containing block_size_ of backward references. */ 149 /* Find a longest backward match of &data[cur_ix] up to the length of 180 const size_t backward = (size_t)distance_cache[i]; local 181 size_t prev_ix = (size_t)(cur_ix - backward); 185 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { 201 a few unnecessary binary logarithms in backward reference score, 210 out->distance = backward; 227 const size_t backward local [all...] |
H A D | hash_to_binary_tree_inc.h | 145 const size_t backward = cur_ix - prev_ix; local 147 if (backward == 0 || backward > max_backward || depth_remaining == 0) { 165 InitBackwardMatch(matches++, backward, len); 194 /* Finds all backward matches of &data[cur_ix & ring_buffer_mask] up to the 217 const size_t backward = cur_ix - prev_ix; local 218 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { 232 InitBackwardMatch(matches++, backward, len);
|
H A D | hash.h | 8 help create backward references to previous data. */ 115 /* Usually, we always choose the longest backward reference. This function 118 If we choose a backward reference that is further away, it will 126 This function is used to sometimes discard a longer backward reference 155 size_t backward; local 173 backward = max_backward + dist + 1 + 176 if (backward >= BROTLI_MAX_DISTANCE) { 179 score = BackwardReferenceScore(matchlen, backward); 185 out->distance = backward;
|
H A D | backward_references_hq.c | 7 /* Function to find backward reference copies. */ 417 const size_t backward = local 419 size_t prev_ix = cur_ix - backward; 425 if (BROTLI_PREDICT_FALSE(backward > max_distance + gap)) { 428 if (backward <= max_distance) { 456 UpdateZopfliNode(nodes, pos, start, l, l, backward, j + 1, cost);
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | AbstractBiMap.java | 56 AbstractBiMap(Map<K, V> forward, Map<V, K> backward) { argument 57 setDelegates(forward, backward); 61 private AbstractBiMap(Map<K, V> backward, AbstractBiMap<V, K> forward) { argument 62 delegate = backward; 88 void setDelegates(Map<K, V> forward, Map<V, K> backward) { argument 92 checkArgument(backward.isEmpty()); 93 checkArgument(forward != backward); 95 inverse = new Inverse<V, K>(backward, this); 354 private Inverse(Map<K, V> backward, AbstractBiMap<V, K> forward) { argument 355 super(backward, forwar [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | AbstractBiMap.java | 52 AbstractBiMap(Map<K, V> forward, Map<V, K> backward) { argument 53 setDelegates(forward, backward); 57 private AbstractBiMap(Map<K, V> backward, AbstractBiMap<V, K> forward) { argument 58 delegate = backward; 84 void setDelegates(Map<K, V> forward, Map<V, K> backward) { argument 88 checkArgument(backward.isEmpty()); 89 checkArgument(forward != backward); 91 inverse = new Inverse<V, K>(backward, this); 350 private Inverse(Map<K, V> backward, AbstractBiMap<V, K> forward) { argument 351 super(backward, forwar [all...] |
/external/lzma/Java/Tukaani/src/org/tukaani/xz/lz/ |
H A D | LZEncoder.java | 272 public void copyUncompressed(OutputStream out, int backward, int len) argument 274 out.write(buf, readPos + 1 - backward, len); 298 * Gets the byte from the given backward offset. 304 * This function is equivalent to <code>getByte(0, backward)</code>. 306 public int getByte(int backward) { argument 307 return buf[readPos - backward] & 0xFF; 311 * Gets the byte from the given forward minus backward offset. 315 public int getByte(int forward, int backward) { argument 316 return buf[readPos + forward - backward] & 0xFF;
|
/external/tensorflow/tensorflow/contrib/layers/python/layers/ |
H A D | rev_block_lib.py | 212 def backward(self, y1, y2): member in class:RevBlock 260 # Reverse variable containers to go backward 331 """Run backward through the reversible layers."""
|
/external/harfbuzz_ng/util/ |
H A D | helper-cairo.cc | 516 hb_bool_t backward = HB_DIRECTION_IS_BACKWARD (hb_buffer_get_direction (buffer)); local 517 l->cluster_flags = backward ? CAIRO_TEXT_CLUSTER_FLAG_BACKWARD : (cairo_text_cluster_flags_t) 0; 521 if (backward) {
|
/external/v8/src/x87/ |
H A D | codegen-x87.cc | 121 Label backward, backward_much_overlap; local 141 __ j(above, &backward); 166 // Simple backward copier. 168 __ bind(&backward);
|
/external/mesa3d/src/gallium/drivers/nouveau/ |
H A D | nouveau_video.c | 277 bool forward, backward; local 289 backward = mb->macroblock_type & PIPE_MPEG12_MB_TYPE_MOTION_BACKWARD; 291 assert(!backward || dec->future < 8); 304 if (backward && forward) { 309 } else assert(!backward); 326 if (backward && forward) 330 else assert(!backward); 346 if (backward) 363 if (backward) {
|
/external/v8/src/ia32/ |
H A D | codegen-ia32.cc | 191 Label backward, backward_much_overlap; local 213 __ j(above, &backward); 282 __ bind(&backward);
|
/external/harfbuzz_ng/src/ |
H A D | hb-uniscribe.cc | 857 bool backward = HB_DIRECTION_IS_BACKWARD (buffer->props.direction); local 1026 pos->x_offset = x_mult * (backward ? -info->var1.i32 : info->var1.i32); 1032 if (backward)
|
H A D | hb-buffer.cc | 620 /* Merge cluster backward. */ 1779 bool backward) 1804 if (backward) 1841 bool backward = HB_DIRECTION_IS_BACKWARD (buffer->props.direction); local 1851 normalize_glyphs_cluster (buffer, start, end, backward); 1854 normalize_glyphs_cluster (buffer, start, end, backward); 1776 normalize_glyphs_cluster(hb_buffer_t *buffer, unsigned int start, unsigned int end, bool backward) argument
|
H A D | hb-coretext.cc | 1221 bool backward = HB_DIRECTION_IS_BACKWARD (buffer->props.direction); local 1222 assert (bool (status_and & kCTRunStatusRightToLeft) == backward); 1223 assert (bool (status_or & kCTRunStatusRightToLeft) == backward);
|
/external/python/cpython2/Lib/lib-tk/ |
H A D | turtle.py | 126 _tg_turtle_functions = ['back', 'backward', 'begin_fill', 'begin_poly', 'bk', 147 _alias_list = ['addshape', 'backward', 'bk', 'fd', 'ht', 'lt', 'pd', 'pos', 1556 """Move the turtle backward by distance. 1558 Aliases: back | backward | bk 1563 Move the turtle backward by distance ,opposite to the direction the 1569 >>> turtle.backward(30) 1928 backward = back variable in class:TNavigator 3886 backward(100)
|
/external/v8/src/interpreter/ |
H A D | interpreter-assembler.cc | 943 void InterpreterAssembler::UpdateInterruptBudget(Node* weight, bool backward) { argument 952 if (backward) { 984 Node* InterpreterAssembler::Advance(Node* delta, bool backward) { argument 988 Node* next_offset = backward ? IntPtrSub(BytecodeOffset(), delta) 994 Node* InterpreterAssembler::Jump(Node* delta, bool backward) { argument 997 UpdateInterruptBudget(TruncateWordToWord32(delta), backward); local 998 Node* new_bytecode_offset = Advance(delta, backward);
|
/external/python/cpython3/Lib/ |
H A D | turtle.py | 127 _tg_turtle_functions = ['back', 'backward', 'begin_fill', 'begin_poly', 'bk', 145 _alias_list = ['addshape', 'backward', 'bk', 'fd', 'ht', 'lt', 'pd', 'pos', 1640 """Move the turtle backward by distance. 1642 Aliases: back | backward | bk 1647 Move the turtle backward by distance ,opposite to the direction the 1653 >>> turtle.backward(30) 2012 backward = back variable in class:TNavigator 3990 backward(100)
|