Searched defs:indices (Results 1 - 25 of 319) sorted by relevance

1234567891011>>

/external/libcxx/test/re/re.iter/re.tokiter/re.tokiter.cnstr/
H A Darray.fail.cpp36 const int indices[] = {-1, 0, 1}; local
38 std::regex("\\d{3}-\\d{4}"), indices);
H A Darray.pass.cpp29 const int indices[] = {-1, 0, 1}; local
31 phone_numbers, indices);
/external/chromium_org/third_party/angle/samples/angle/sample_util/
H A Dgeometry_utils.h19 std::vector<GLushort> indices; member in struct:SphereGeometry
29 std::vector<GLushort> indices; member in struct:CubeGeometry
/external/chromium_org/third_party/skia/src/utils/
H A DSkTextureCompressor_R11EAC.cpp20 // |base_cw|mod|mul| ----------------- indices -------------------
59 uint64_t indices) {
62 SkASSERT(indices < (static_cast<uint64_t>(1) << 48));
67 return SkEndian_SwapBE64(b | m | p | indices);
110 // Finally, choose the proper palette and indices
118 // and update the indices with the choice. Also store the error
121 uint64_t indices = 0;
144 indices <<= 3;
145 indices |= bestIndex;
148 SkASSERT(indices < (static_cas
58 pack_r11eac_block(uint16_t base_cw, uint16_t palette, uint16_t multiplier, uint64_t indices) argument
[all...]
/external/chromium_org/v8/test/mjsunit/
H A Dstring-indexof-1.js117 var indices = [0x5, 0x65, 0x85, 0x105, 0x205, 0x285, 0x2005, 0x2085, 0xfff0]; variable
120 for (var i = 0; i < indices.length; i++) {
121 var index = indices[i];
/external/lzma/CPP/7zip/UI/Common/
H A DSortUtils.cpp14 void SortFileNames(const UStringVector &strings, CIntVector &indices) argument
16 indices.Clear();
18 indices.Reserve(numItems);
20 indices.Add(i);
21 indices.Sort(CompareStrings, (void *)&strings);
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DElementRareData.cpp39 short indices[2]; member in struct:blink::SameSizeAsElementRareData
/external/chromium_org/third_party/icu/source/test/letest/
H A Dletest.h39 le_int32 *indices; member in struct:TestResult
/external/chromium_org/third_party/skia/src/core/
H A DSkVertState.cpp23 const uint16_t* indices = state->fIndices; local
28 state->f0 = indices[index + 0];
29 state->f1 = indices[index + 1];
30 state->f2 = indices[index + 2];
53 const uint16_t* indices = state->fIndices; local
58 state->f2 = indices[index + 2];
60 state->f0 = indices[index + 1];
61 state->f1 = indices[index + 0];
63 state->f0 = indices[index + 0];
64 state->f1 = indices[inde
83 const uint16_t* indices = state->fIndices; local
[all...]
H A DSkVertState.h25 * If the vertices are unindexed pass NULL for indices.
27 VertState(int vCount, const uint16_t indices[], int indexCount) argument
28 : fIndices(indices) {
30 if (indices) {
/external/chromium_org/third_party/skia/src/gpu/
H A DGrPathRange.cpp35 void GrPathRange::willDrawPaths(const uint32_t indices[], int count) const { argument
43 SkASSERT(indices[i] < static_cast<uint32_t>(fNumPaths));
45 const int groupIndex = indices[i] / kPathsPerGroup;
/external/chromium_org/ui/accessibility/
H A Dtree_generator.cc27 std::vector<int> indices; local
31 // Use the first few bits of |tree_index| to permute the indices.
33 indices.push_back(i + 1);
38 permuted.push_back(indices[index]);
39 indices.erase(indices.begin() + index);
/external/icu/icu4c/source/test/letest/
H A Dletest.h39 le_int32 *indices; member in struct:TestResult
/external/libcxx/src/
H A Dhash.cpp76 // potential primes = 210*k + indices[i], k >= 1
79 const unsigned indices[] = member in namespace:__anon23581
189 // Start searching list of potential primes: L * k0 + indices[in]
190 const size_t M = sizeof(indices) / sizeof(indices[0]);
194 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L)
195 - indices);
196 n = L * k0 + indices[in];
566 n = L * k0 + indices[i
[all...]
/external/skia/src/core/
H A DSkVertState.cpp23 const uint16_t* indices = state->fIndices; local
28 state->f0 = indices[index + 0];
29 state->f1 = indices[index + 1];
30 state->f2 = indices[index + 2];
53 const uint16_t* indices = state->fIndices; local
58 state->f2 = indices[index + 2];
60 state->f0 = indices[index + 1];
61 state->f1 = indices[index + 0];
63 state->f0 = indices[index + 0];
64 state->f1 = indices[inde
83 const uint16_t* indices = state->fIndices; local
[all...]
H A DSkVertState.h25 * If the vertices are unindexed pass NULL for indices.
27 VertState(int vCount, const uint16_t indices[], int indexCount) argument
28 : fIndices(indices) {
30 if (indices) {
/external/chromium_org/content/renderer/
H A Dexternal_popup_menu.cc76 const std::vector<int>& indices) {
82 popup_menu_client_->didAcceptIndices(indices);
75 DidSelectItems(bool canceled, const std::vector<int>& indices) argument
/external/chromium_org/third_party/angle/samples/angle/mip_map_2d/
H A DMipMap2D.cpp101 const GLushort indices[] = { 0, 1, 2, 0, 2, 3 }; local
130 glDrawElements ( GL_TRIANGLES, 6, GL_UNSIGNED_SHORT, indices);
135 glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_SHORT, indices);
141 glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_SHORT, indices);
/external/chromium_org/third_party/angle/samples/angle/simple_texture_2d/
H A DSimpleTexture2D.cpp93 GLushort indices[] = { 0, 1, 2, 0, 2, 3 }; local
119 glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_SHORT, indices);
/external/chromium_org/third_party/angle/samples/angle/stencil_operations/
H A DStencilOperations.cpp107 GLubyte indices[][6] = local
159 glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_BYTE, indices[0]);
173 glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_BYTE, indices[1]);
187 glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_BYTE, indices[2]);
202 glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_BYTE, indices[3]);
220 glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_BYTE, indices[4]);
/external/chromium_org/third_party/angle/samples/angle/texture_wrap/
H A DTextureWrap.cpp97 GLushort indices[] = { 0, 1, 2, 0, 2, 3 }; local
123 glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_SHORT, indices);
129 glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_SHORT, indices);
135 glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_SHORT, indices);
/external/chromium_org/third_party/angle/tests/angle_tests/
H A DLineLoopTest.cpp131 static const GLubyte indices[] = { 0, 7, 6, 9, 8, 0 }; local
132 runTest(GL_UNSIGNED_BYTE, 0, indices + 1);
137 static const GLushort indices[] = { 0, 7, 6, 9, 8, 0 }; local
138 runTest(GL_UNSIGNED_SHORT, 0, indices + 1);
148 static const GLuint indices[] = { 0, 7, 6, 9, 8, 0 }; local
149 runTest(GL_UNSIGNED_INT, 0, indices + 1);
154 static const GLubyte indices[] = { 0, 7, 6, 9, 8, 0 }; local
159 glBufferData(GL_ELEMENT_ARRAY_BUFFER, sizeof(indices), indices, GL_STATIC_DRAW);
168 static const GLushort indices[] local
187 static const GLuint indices[] = { 0, 7, 6, 9, 8, 0 }; local
[all...]
/external/chromium_org/third_party/angle/tests/perf_tests/
H A DTexSubImage.cpp117 GLushort indices[] = { 0, 1, 2, 0, 2, 3 }; local
120 glBufferData(GL_ELEMENT_ARRAY_BUFFER, sizeof(indices), indices, GL_STATIC_DRAW);
/external/chromium_org/third_party/freetype/src/psaux/
H A Dt1cmap.h75 FT_UShort* indices; member in struct:T1_CMapCustomRec_
/external/chromium_org/third_party/opus/src/silk/
H A DNLSF_decode.c37 const opus_int8 indices[], /* I Quantization indices [ order ] */
48 out_Q10 = silk_LSHIFT( indices[ i ], 10 );
83 /* Unpack entropy table indices and predictor for current CB1 index */
35 silk_NLSF_residual_dequant( opus_int16 x_Q10[], const opus_int8 indices[], const opus_uint8 pred_coef_Q8[], const opus_int quant_step_size_Q16, const opus_int16 order ) argument

Completed in 557 milliseconds

1234567891011>>