| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/ |
| ver4_patricia_trie_reading_utils.h | 32 namespace backward { namespace in namespace:latinime
36 } // namespace backward
38 namespace backward { namespace in namespace:latinime
50 } // namespace backward
|
| ver4_patricia_trie_reading_utils.cpp | 24 #include "dictionary/structure/backward/v402/ver4_patricia_trie_reading_utils.h"
29 namespace backward { namespace in namespace:latinime
38 } // namespace backward
|
| ver4_pt_node_array_reader.h | 31 namespace backward { namespace in namespace:latinime
35 } // namespace backward
37 namespace backward { namespace in namespace:latinime
55 } // namespace backward
|
| ver4_patricia_trie_node_reader.h | 32 namespace backward { namespace in namespace:latinime
36 } // namespace backward
38 namespace backward { namespace in namespace:latinime
41 } // namespace backward
43 namespace backward { namespace in namespace:latinime
77 } // namespace backward
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/content/ |
| dict_content.h | 30 namespace backward { namespace in namespace:latinime
45 } // namespace backward
|
| sparse_table_dict_content.cpp | 24 #include "dictionary/structure/backward/v402/content/sparse_table_dict_content.h"
27 namespace backward { namespace in namespace:latinime
49 } // namespace backward
|
| /external/guava/guava-gwt/test-super/com/google/common/collect/testing/google/super/com/google/common/collect/testing/google/ |
| 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();
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/bigram/ |
| ver4_bigram_list_policy.h | 30 #include "dictionary/structure/backward/v402/content/bigram_entry.h"
33 namespace backward { namespace in namespace:latinime
38 } // namespace backward
40 namespace backward { namespace in namespace:latinime
43 } // namespace backward
45 namespace backward { namespace in namespace:latinime
92 } // namespace backward
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/arm/ |
| thumb-b-bad.s | 8 b . + 0x1000004 @ gas mis-assembles as a backward branch
9 b.w . + 0x2000002 @ gas mis-assembles as a backward branch
11 f: b g @ gas mis-assembles as a backward branch
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| 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();
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/OrderedCollectionTest/ |
| gentest.sh | 56 echo '# populate the tree in random order and empty it iterating backward'
58 echo backward-empty
65 echo backward-list
|
| /external/python/cpython2/Demo/turtle/ |
| tdemo_peace.py | 30 backward(640)
50 backward(170)
|
| /external/python/cpython3/Lib/turtledemo/ |
| peace.py | 30 backward(640)
50 backward(170)
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mmix/ |
| relax1.s | 2 # and backward. Have a few variable-length thingies in-between so it
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/ |
| dictionary_structure_with_buffer_policy_factory.cpp | 22 #include "dictionary/structure/backward/v402/ver4_dict_buffers.h"
23 #include "dictionary/structure/backward/v402/ver4_dict_constants.h"
24 #include "dictionary/structure/backward/v402/ver4_patricia_trie_policy.h"
62 return newPolicyForOnMemoryV4Dict<backward::v402::Ver4DictConstants,
63 backward::v402::Ver4DictBuffers,
64 backward::v402::Ver4DictBuffers::Ver4DictBuffersPtr,
65 backward::v402::Ver4PatriciaTriePolicy>(
122 return newPolicyForV4Dict<backward::v402::Ver4DictConstants,
123 backward::v402::Ver4DictBuffers,
124 backward::v402::Ver4DictBuffers::Ver4DictBuffersPtr
[all...] |
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/z8k/ |
| jr-back.d | 3 #name: jr backward
|
| /toolchain/binutils/binutils-2.27/ld/testsuite/ld-z8k/ |
| calr-back-fail-8001.d | 1 #name: Z8001 backward calr just out of range
|
| calr-back-fail-8002.d | 1 #name: Z8002 backward calr just out of range
|
| jr-back-fail-8001.d | 1 #name: Z8001 backward jr just out of range
|
| jr-back-fail-8002.d | 1 #name: Z8002 backward jr just out of range
|
| ldr-back-fail-8001.d | 1 #name: Z8001 backward relative load just out of range
|
| ldr-back-fail-8002.d | 1 #name: Z8002 backward relative load just out of range
|
| /external/brotli/c/enc/ |
| 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 = cur_ix - prev_ix local
[all...] |
| /external/brotli/research/ |
| README.md | 3 In this directory we publish simple tools to analyze backward reference distance distributions in LZ77 compression. We developed these tools to be able to make more efficient encoding of distances in large-window brotli. In large-window compression the average cost of a backward reference distance is higher, and this may allow for more advanced encoding strategies, such as delta coding or an increase in context size, to bring significant compression density improvements. Our tools visualize the backward references as histogram images, i.e., one pixel in the image shows how many distances of a certain range exist at a certain locality in the data. The human visual system is excellent at pattern detection, so we tried to roughly identify patterns visually before going into more quantitative analysis. These tools can turn out to be useful in development of other LZ77-based compressors and we hope you try them out.
9 This tool generates optimal (match-length-wise) backward references for every position in the input files and stores them in `*.dist` file described below.
17 This tool generates a visualization of the distribution of backward references stored in `*.dist` file. The original file size has to be specified as a second parameter. The output is a grayscale PGM (binary) image.
29 This tool generates a diff PPM (binary) image between two input 8-bit PGM (binary) images. Input images must be of same size. Useful for comparing different backward references distributions for same input file. Normally used for comparison of output images from `draw_histogram` tool.
48 ## Backward distance file format
55 More verbose explanation: for each backward reference there is a position-distance pair, also a copy length may be specified. Copy length is prefixed with flag byte 0, position-distance pair is prefixed with flag byte 1. Each number is a 32-bit integer. Copy length always comes before position-distance pair. Standalone copy length is allowed, in this case it is ignored.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/lint/ |
| TypoFix.java | 79 IRegion backward = finder.find(start, typo, false /*forward*/, true, true, false); local
80 if (forward != null && backward != null) {
83 int backwardDelta = start - backward.getOffset();
87 start = backward.getOffset();
91 } else if (backward != null) {
92 start = backward.getOffset();
|
