| /external/skia/src/gpu/ |
| GrSKSLPrettyPrint.h | 13 SkSL::String PrettyPrint(const char** strings, int* lengths, int count, bool countlines);
|
| /external/skqp/src/gpu/ |
| GrSKSLPrettyPrint.h | 13 SkSL::String PrettyPrint(const char** strings, int* lengths, int count, bool countlines);
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| DictionaryMatcher.java | 25 * @param lengths An array that is filled with the lengths of words that matched.
26 * @param count Filled with the number of elements output in lengths.
27 * @param limit The maximum amount of words to output. Must be less than or equal to lengths.length.
31 public abstract int matches(CharacterIterator text, int maxLength, int[] lengths,
34 public int matches(CharacterIterator text, int maxLength, int[] lengths,
36 return matches(text, maxLength, lengths, count, limit, null);
|
| DictionaryBreakEngine.java | 25 //list of word candidate lengths, in increasing length order
26 private int lengths[]; field in class:DictionaryBreakEngine.PossibleWord
35 lengths = new int[POSSIBLE_WORD_LIST_MAX];
45 prefix = dict.matches(fIter, rangeEnd - start, lengths, count, lengths.length);
52 fIter.setIndex(start + lengths[count[0]-1]);
61 fIter.setIndex(offset + lengths[mark]);
62 return lengths[mark];
69 fIter.setIndex(offset + lengths[--current]);
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| DictionaryMatcher.java | 24 * @param lengths An array that is filled with the lengths of words that matched.
25 * @param count Filled with the number of elements output in lengths.
26 * @param limit The maximum amount of words to output. Must be less than or equal to lengths.length.
30 public abstract int matches(CharacterIterator text, int maxLength, int[] lengths,
33 public int matches(CharacterIterator text, int maxLength, int[] lengths,
35 return matches(text, maxLength, lengths, count, limit, null);
|
| DictionaryBreakEngine.java | 24 //list of word candidate lengths, in increasing length order
25 private int lengths[]; field in class:DictionaryBreakEngine.PossibleWord
34 lengths = new int[POSSIBLE_WORD_LIST_MAX];
44 prefix = dict.matches(fIter, rangeEnd - start, lengths, count, lengths.length);
51 fIter.setIndex(start + lengths[count[0]-1]);
60 fIter.setIndex(offset + lengths[mark]);
61 return lengths[mark];
68 fIter.setIndex(offset + lengths[--current]);
|
| /external/skia/tests/ |
| GrSKSLPrettyPrintTest.cpp | 91 SkTArray<int> lengths; local
93 lengths.push_back((int)input1.size());
95 lengths.push_back((int)input2.size());
97 lengths.push_back((int)input3.size());
99 lengths.push_back((int)input4.size());
101 lengths.push_back((int)input5.size());
103 lengths.push_back((int)input6.size());
105 SkSL::String test = GrSKSLPrettyPrint::PrettyPrint(testStr.begin(), lengths.begin(),
110 lengths.reset();
112 lengths.push_back((int)neg1.size())
[all...] |
| /external/skqp/tests/ |
| GrSKSLPrettyPrintTest.cpp | 91 SkTArray<int> lengths; local
93 lengths.push_back((int)input1.size());
95 lengths.push_back((int)input2.size());
97 lengths.push_back((int)input3.size());
99 lengths.push_back((int)input4.size());
101 lengths.push_back((int)input5.size());
103 lengths.push_back((int)input6.size());
105 SkSL::String test = GrSKSLPrettyPrint::PrettyPrint(testStr.begin(), lengths.begin(),
110 lengths.reset();
112 lengths.push_back((int)neg1.size())
[all...] |
| /external/u-boot/fs/jffs2/ |
| mini_inflate.c | 13 /* The order that the code lengths in section 3.2.7 are in */
39 stream->codes.lengths = stream->code_lengths;
45 stream->lengths.bits = 16;
46 stream->lengths.num_symbols = 288;
47 stream->lengths.lengths = stream->length_lengths;
48 stream->lengths.symbols = stream->length_symbols;
49 stream->lengths.count = stream->length_count;
50 stream->lengths.first = stream->length_first;
51 stream->lengths.pos = stream->length_pos
141 struct huffman_set *lengths = &(stream->lengths); local
225 struct huffman_set *lengths = &(stream->lengths); local
321 struct huffman_set *lengths = &(stream->lengths); local
[all...] |
| /external/toybox/toys/posix/ |
| wc.c | 34 static void show_lengths(unsigned long *lengths, char *name)
50 printf(" %*ld"+first, space, lengths[i]);
53 TT.totals[i] += lengths[i];
62 unsigned long word = 0, lengths[] = {0,0,0,0}; local
70 lengths[2] = st.st_size;
83 if (toybuf[pos]=='\n') lengths[0]++;
84 lengths[2]++;
95 lengths[3]++;
102 if (!word) lengths[1]++;
112 show_lengths(lengths, name)
[all...] |
| /external/skia/src/gpu/gl/builders/ |
| GrGLShaderStringBuilder.h | 18 const char** skslStrings, int* lengths, int count,
30 void GrGLPrintShader(const GrGLContext&, GrGLenum type, const char** skslStrings, int* lengths,
|
| GrGLShaderStringBuilder.cpp | 36 static void print_sksl_line_by_line(const char** skslStrings, int* lengths, int count,
40 SkSL::String sksl = GrSKSLPrettyPrint::PrettyPrint(skslStrings, lengths, count, false);
64 const char** skslStrings, int* lengths, int count,
72 print_sksl_line_by_line(skslStrings, lengths, count, [&](const char* ln) {
83 sksl = GrSKSLPrettyPrint::PrettyPrint(skslStrings, lengths, count, false);
86 sksl.append(skslStrings[i], lengths[i]);
101 print_sksl_line_by_line(skslStrings, lengths, count);
108 print_sksl_line_by_line(skslStrings, lengths, count);
179 int* lengths, int count, const SkSL::Program::Settings& settings) {
180 print_sksl_line_by_line(skslStrings, lengths, count)
[all...] |
| /external/skqp/src/gpu/gl/builders/ |
| GrGLShaderStringBuilder.h | 18 const char** skslStrings, int* lengths, int count,
30 void GrGLPrintShader(const GrGLContext&, GrGLenum type, const char** skslStrings, int* lengths,
|
| GrGLShaderStringBuilder.cpp | 36 static void print_sksl_line_by_line(const char** skslStrings, int* lengths, int count,
40 SkSL::String sksl = GrSKSLPrettyPrint::PrettyPrint(skslStrings, lengths, count, false);
64 const char** skslStrings, int* lengths, int count,
72 print_sksl_line_by_line(skslStrings, lengths, count, [&](const char* ln) {
83 sksl = GrSKSLPrettyPrint::PrettyPrint(skslStrings, lengths, count, false);
86 sksl.append(skslStrings[i], lengths[i]);
101 print_sksl_line_by_line(skslStrings, lengths, count);
108 print_sksl_line_by_line(skslStrings, lengths, count);
179 int* lengths, int count, const SkSL::Program::Settings& settings) {
180 print_sksl_line_by_line(skslStrings, lengths, count)
[all...] |
| /external/u-boot/include/jffs2/ |
| mini_inflate.h | 23 int *lengths; /* The bit length of symbols */ member in struct:huffman_set
57 struct huffman_set lengths; member in struct:bitstream
|
| /external/tensorflow/tensorflow/python/kernel_tests/ |
| string_length_op_test.py | 32 lengths = string_ops.string_length(strings)
33 values = self.evaluate(lengths)
61 lengths = string_ops.string_length(strings, "some_name")
63 self.assertAllEqual(lengths.eval(), [[[1, 2], [3, 4], [5, 6]]])
|
| /external/zopfli/src/zopfli/ |
| tree.h | 39 void ZopfliLengthsToSymbols(const unsigned* lengths, size_t n, unsigned maxbits,
45 actual theoritical bit lengths according to the entropy. Since the resulting
|
| tree.c | 30 void ZopfliLengthsToSymbols(const unsigned* lengths, size_t n, unsigned maxbits,
47 assert(lengths[i] <= maxbits);
48 bl_count[lengths[i]]++;
60 unsigned len = lengths[i];
|
| /external/tensorflow/tensorflow/python/ops/ragged/ |
| ragged_from_tensor_op_test.py | 43 RaggedTensor.from_tensor(dt, lengths=[1, 0, 3]), [[5], [], [6, 0, 0]])
52 RaggedTensor.from_tensor(dt_3d, lengths=([2, 0, 3], [1, 1, 2, 0, 1])),
110 'lengths': [1],
115 'lengths': [0],
120 'lengths': [0, 1, 2],
125 'lengths': [0, 0, 0],
130 'lengths': [2, 2],
135 'lengths': [7, 8], # lengths > ncols: truncated to ncols
140 'lengths': [-2, -1], # lengths < 0: treated as zer
[all...] |
| ragged_conversion_ops.py | 24 def from_tensor(tensor, lengths=None, padding=None, ragged_rank=1, name=None):
28 return ragged_tensor.RaggedTensor.from_tensor(tensor, lengths, padding,
|
| ragged_tensor_shape.py | 46 lengths. `RaggedTensorDynamicShape` records the size of each ragged
47 dimension using an integer vector containing the slice lengths for all
267 def broadcast_dimension(self, axis, lengths):
268 """Returns a shape that is broadcast-compatible with self & lengths.
270 * If dimension[axis] is uniform and lengths is a scalar, the check
271 that either lengths==1 or axis==1 or lengths==axis, and tile
272 dimension[axis] with tf.where(lengths==axis, 1, axis) repeats.
274 * If dimension[axis] is uniform and lengths is a vector, then check
276 lengths repeats. (we can skip tiling if we statically know tha
[all...] |
| /external/zlib/src/contrib/puff/ |
| puff.c | 52 * 1.3 20 Mar 2002 - Go back to lengths for puff() parameters [Gailly]
94 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */
213 * a negative value if there is an error. If all of the lengths are zero, i.e.
220 * a simple integer ordering of codes of the same lengths. Hence below the
309 * Given the list of code lengths length[0..n-1] representing a canonical
320 * codes past the end of the incomplete lengths.
351 (h->count[length[symbol]])++; /* assumes lengths are within bounds */
355 /* check for an over-subscribed or incomplete set of lengths */
393 * - Literals, lengths, and the end-of-block code are combined into a single
397 * - There are 256 possible lengths (3..258), and so 29 symbols are not enoug
546 short lengths[FIXLCODES]; local
670 short lengths[MAXCODES]; \/* descriptor code lengths *\/ local
[all...] |
| /external/deqp-deps/glslang/glslang/MachineIndependent/ |
| Scan.h | 59 lengths(L), currentSource(0), currentChar(0), stringBias(b), finale(f), singleLogical(single),
110 while(charToRead >= lengths[sourceToRead]) {
150 } while (currentSource > 0 && lengths[currentSource] == 0);
151 if (lengths[currentSource] == 0) {
155 currentChar = lengths[currentSource] - 1;
232 if (currentChar >= lengths[currentSource]) {
239 while (currentSource < numSources && lengths[currentSource] == 0) {
253 const size_t *lengths; // length of each string member in class:glslang::TInputScanner
|
| /external/mesa3d/src/mesa/math/ |
| m_norm_tmp.h | 38 * lengths - length of each incoming normal (may be NULL) (a display list
46 const GLfloat *lengths,
59 if (!lengths) {
98 GLfloat len = lengths[i];
113 const GLfloat *lengths,
126 if (!lengths) {
163 GLfloat len = lengths[i];
178 const GLfloat *lengths,
191 (void) lengths;
207 const GLfloat *lengths,
[all...] |
| /external/icu/icu4c/source/common/ |
| dictionarydata.h | 80 * @param lengths output array, filled with the lengths of the matches, in order,
81 * from shortest to longest. Lengths are in native indexing units
83 * @param cpLengths output array, filled with the lengths of the matches, in order,
84 * from shortest to longest. Lengths are the number of Unicode code points.
94 int32_t *lengths, int32_t *cpLengths, int32_t *values,
109 int32_t *lengths, int32_t *cpLengths, int32_t *values,
127 int32_t *lengths, int32_t *cpLengths, int32_t *values,
|
