Searched defs:lengths (Results 1 - 25 of 51) sorted by relevance

123

/external/skia/tests/
H A DGrGLSLPrettyPrintTest.cpp91 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 SkString test = GrGLSLPrettyPrint::PrettyPrintGLSL(testStr.begin(), lengths.begin(),
110 lengths.reset();
112 lengths
[all...]
/external/v8/test/mjsunit/
H A Dstring-indexof-1.js116 var lengths = [1, 4, 15]; // Single char, simple and complex. variable
118 for (var lengthIndex = 0; lengthIndex < lengths.length; lengthIndex++) {
119 var length = lengths[lengthIndex];
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DCharsDictionaryMatcher.java21 public int matches(CharacterIterator text_, int maxLength, int[] lengths, int[] count_, int limit, int[] values) { argument
38 lengths[count] = numChars;
H A DDictionaryMatcher.java22 * @param lengths An array that is filled with the lengths of words that matched.
23 * @param count Filled with the number of elements output in lengths.
24 * @param limit The maximum amount of words to output. Must be less than or equal to lengths.length.
28 public abstract int matches(CharacterIterator text, int maxLength, int[] lengths, argument
31 public int matches(CharacterIterator text, int maxLength, int[] lengths, argument
33 return matches(text, maxLength, lengths, count, limit, null);
H A DBytesDictionaryMatcher.java42 public int matches(CharacterIterator text_, int maxLength, int[] lengths, int[] count_, int limit, int[] values) { argument
59 lengths[count] = numChars;
H A DBreakCTDictionary.java166 * @param lengths An array that is filled with the lengths of words that matched.
167 * @param count Filled with the number of elements output in lengths.
168 * @param limit The size of the lengths array; this limits the number of words output.
171 public int matches(CharacterIterator text, int maxLength, int lengths[], argument
185 lengths[mycount++] = i;
H A DDictionaryBreakEngine.java23 //list of word candidate lengths, in increasing length order
24 private int lengths[]; field in class:DictionaryBreakEngine.PossibleWord
33 lengths = new int[POSSIBLE_WORD_LIST_MAX];
43 prefix = dict.matches(fIter, rangeEnd - start, lengths, count, lengths.length);
50 fIter.setIndex(start + lengths[count[0]-1]);
59 fIter.setIndex(offset + lengths[mark]);
60 return lengths[mark];
67 fIter.setIndex(offset + lengths[--current]);
/external/mesa3d/src/mesa/tnl/
H A Dt_vb_normals.c54 const GLfloat *lengths; local
59 /* We can only use the display list's saved normal lengths if we've
63 lengths = NULL;
65 lengths = VB->NormalLengthPtr;
70 lengths,
/external/toybox/toys/posix/
H A Dwc.c34 static void show_lengths(unsigned long *lengths, char *name) argument
39 xprintf(" %ld"+nospace, lengths[i]);
42 TT.totals[i] += lengths[i];
51 unsigned long word=0, lengths[]={0,0,0}; local
71 if (toybuf[i]==10) lengths[0]++;
74 if (!word) lengths[1]++;
77 lengths[2]++;
81 show_lengths(lengths, name);
/external/zopfli/src/zopfli/
H A Dtree.c30 void ZopfliLengthsToSymbols(const unsigned* lengths, size_t n, unsigned maxbits, argument
47 assert(lengths[i] <= maxbits);
48 bl_count[lengths[i]]++;
60 unsigned len = lengths[i];
/external/marisa-trie/tests/
H A Dtrie-test.cc139 std::vector<std::size_t> lengths; local
140 ASSERT(trie.find("Baddie", &ids, &lengths) == 1);
143 ASSERT(lengths.size() == 1);
144 ASSERT(lengths[0] == 3);
146 ASSERT(trie.find_callback("anderson", FindCallback(&ids, &lengths)) == 1);
149 ASSERT(lengths.size() == 2);
150 ASSERT(lengths[1] == 3);
337 std::vector<std::size_t> lengths; local
338 ASSERT(trie.find("card", &ids, &lengths) == 1);
341 ASSERT(lengths
375 std::size_t lengths[10]; local
539 std::vector<std::size_t> lengths; local
[all...]
/external/mesa3d/src/gallium/state_trackers/clover/api/
H A Dprogram.cpp30 const char **strings, const size_t *lengths,
43 source += (lengths && lengths[i] ?
44 std::string(strings[i], strings[i] + lengths[i]) :
58 const cl_device_id *devs, const size_t *lengths,
64 if (!count || !devs || !lengths || !binaries)
88 binaries, binaries + count, lengths);
29 clCreateProgramWithSource(cl_context ctx, cl_uint count, const char **strings, const size_t *lengths, cl_int *errcode_ret) argument
57 clCreateProgramWithBinary(cl_context ctx, cl_uint count, const cl_device_id *devs, const size_t *lengths, const unsigned char **binaries, cl_int *status_ret, cl_int *errcode_ret) argument
/external/skia/src/animator/
H A DSkGetCondensedInfo.cpp22 static int _searchByName(const unsigned char* lengths, int count, const char* strings, const char target[]) { argument
27 if (strcmp(&strings[lengths[mid << 2]], target) < 0)
32 if (strcmp(&strings[lengths[hi << 2]], target) != 0)
/external/skia/src/gpu/gl/builders/
H A DGrGLShaderStringBuilder.cpp24 int* lengths,
36 SkString prettySource = GrGLSLPrettyPrint::PrettyPrintGLSL(strings, lengths, count, false);
41 GR_GL_CALL(gli, ShaderSource(shaderId, count, strings, lengths));
48 SkString shader = GrGLSLPrettyPrint::PrettyPrintGLSL(strings, lengths, count, false);
74 SkDebugf("%s", GrGLSLPrettyPrint::PrettyPrintGLSL(strings, lengths, count, true).c_str());
84 SkDebugf("%s", GrGLSLPrettyPrint::PrettyPrintGLSL(strings, lengths, count, true).c_str());
20 GrGLCompileAndAttachShader(const GrGLContext& glCtx, GrGLuint programId, GrGLenum type, const char** strings, int* lengths, int count, GrGpu::Stats* stats) argument
H A DGrGLSLPrettyPrint.cpp16 int* lengths,
36 fLength = lengths[i];
197 int* lengths,
201 return pp.prettify(strings, lengths, count, countlines);
15 prettify(const char** strings, int* lengths, int count, bool countlines) argument
196 PrettyPrintGLSL(const char** strings, int* lengths, int count, bool countlines) argument
/external/libvorbis/vq/
H A Dhuffbuild.c131 long *lengths=_ogg_calloc(vals,sizeof(long)); local
149 build_tree_from_lengths0(vals,hist,lengths);
169 fprintf(file,"%2ld,",lengths[j]);
H A Dlatticetune.c31 LSP fitting, then generates new codeword lengths for maximally
42 long *lengths; local
85 lengths=_ogg_calloc(entries,sizeof(long));
132 /* build the codeword lengths */
133 build_tree_from_lengths0(entries,hits,lengths);
135 c->lengthlist=lengths;
/external/marisa-trie/tools/
H A Dmarisa-find.cc41 static std::vector<std::size_t> lengths; local
42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths);
47 std::cout.write(str.c_str(), lengths[i]) << '\t' << str << '\n';
53 lengths.clear();
/external/marisa-trie/v0_1_5/tests/
H A Dtrie-test.cc141 std::vector<std::size_t> lengths; local
142 ASSERT(trie.find("Baddie", &ids, &lengths) == 1);
145 ASSERT(lengths.size() == 1);
146 ASSERT(lengths[0] == 3);
148 ASSERT(trie.find_callback("anderson", FindCallback(&ids, &lengths)) == 1);
151 ASSERT(lengths.size() == 2);
152 ASSERT(lengths[1] == 3);
339 std::vector<std::size_t> lengths; local
340 ASSERT(trie.find("card", &ids, &lengths) == 1);
343 ASSERT(lengths
377 std::size_t lengths[10]; local
557 std::vector<std::size_t> lengths; local
[all...]
/external/marisa-trie/v0_1_5/tools/
H A Dmarisa_alpha-find.cc41 static std::vector<std::size_t> lengths; local
42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths);
47 std::cout.write(str.c_str(), lengths[i]) << '\t' << str << '\n';
53 lengths.clear();
/external/mesa3d/src/mesa/math/
H A Dm_norm_tmp.h38 * 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,
43 transform_normalize_normals( const GLmatrix *mat, GLfloat scale, const GLvector4f *in, const GLfloat *lengths, GLvector4f *dest ) argument
110 transform_normalize_normals_no_rot( const GLmatrix *mat, GLfloat scale, const GLvector4f *in, const GLfloat *lengths, GLvector4f *dest ) argument
175 transform_rescale_normals_no_rot( const GLmatrix *mat, GLfloat scale, const GLvector4f *in, const GLfloat *lengths, GLvector4f *dest ) argument
204 transform_rescale_normals( const GLmatrix *mat, GLfloat scale, const GLvector4f *in, const GLfloat *lengths, GLvector4f *dest ) argument
236 transform_normals_no_rot( const GLmatrix *mat, GLfloat scale, const GLvector4f *in, const GLfloat *lengths, GLvector4f *dest ) argument
266 transform_normals( const GLmatrix *mat, GLfloat scale, const GLvector4f *in, const GLfloat *lengths, GLvector4f *dest ) argument
296 normalize_normals( const GLmatrix *mat, GLfloat scale, const GLvector4f *in, const GLfloat *lengths, GLvector4f *dest ) argument
342 rescale_normals( const GLmatrix *mat, GLfloat scale, const GLvector4f *in, const GLfloat *lengths, GLvector4f *dest ) argument
[all...]
H A Dm_debug_norm.c126 const GLfloat *lengths,
134 (void) lengths;
149 const GLfloat *lengths,
162 if ( !lengths ) {
174 scale = lengths[i];;
123 ref_norm_transform_rescale( const GLmatrix *mat, GLfloat scale, const GLvector4f *in, const GLfloat *lengths, GLvector4f *dest ) argument
146 ref_norm_transform_normalize( const GLmatrix *mat, GLfloat scale, const GLvector4f *in, const GLfloat *lengths, GLvector4f *dest ) argument
/external/icu/icu4c/source/common/
H A Ddictionarydata.cpp44 int32_t *lengths, int32_t *cpLengths, int32_t *values,
61 if (lengths != NULL) {
62 lengths[wordCount] = lengthMatched;
112 int32_t *lengths, int32_t *cpLengths, int32_t *values,
128 if (lengths != NULL) {
129 lengths[wordCount] = lengthMatched;
43 matches(UText *text, int32_t maxLength, int32_t limit, int32_t *lengths, int32_t *cpLengths, int32_t *values, int32_t *prefix) const argument
111 matches(UText *text, int32_t maxLength, int32_t limit, int32_t *lengths, int32_t *cpLengths, int32_t *values, int32_t *prefix) const argument
/external/toybox/toys/other/
H A Dvmstat.c81 "sy\0id\0wa", lengths[] = {2,2,6,6,6,6,4,4,5,5,4,4,2,2,2,2}; local
101 for (i=0; i<sizeof(lengths); i++) {
102 printf(" %*s"+!i, lengths[i], headers);
133 for (i=0; i<sizeof(lengths); i++) {
145 expected += lengths[i] + !!i;
/external/zlib/src/contrib/puff/
H A Dpuff.c52 * 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 (
546 short lengths[FIXLCODES]; local
670 short lengths[MAXCODES]; /* descriptor code lengths */ local
[all...]

Completed in 591 milliseconds

123