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

12345678910

/external/libcxx/test/std/re/re.iter/re.tokiter/re.tokiter.cnstr/
H A Darray.fail.cpp35 const int indices[] = {-1, 0, 1}; local
37 std::regex("\\d{3}-\\d{4}"), indices);
H A Darray.pass.cpp30 const int indices[] = {-1, 0, 1}; local
32 phone_numbers, indices);
/external/lzma/CPP/7zip/UI/Common/
H A DSortUtils.cpp15 void SortFileNames(const UStringVector &strings, CUIntVector &indices) argument
18 indices.ClearAndSetSize(numItems);
19 unsigned *vals = &indices[0];
22 indices.Sort(CompareStrings, (void *)&strings);
/external/skia/src/gpu/
H A DGrPathRange.cpp27 void GrPathRange::loadPathsIfNeeded(const void* indices, PathIndexType indexType, int count) const { argument
30 return this->loadPathsIfNeeded(reinterpret_cast<const uint8_t*>(indices), count);
32 return this->loadPathsIfNeeded(reinterpret_cast<const uint16_t*>(indices), count);
34 return this->loadPathsIfNeeded(reinterpret_cast<const uint32_t*>(indices), count);
42 void GrPathRange::assertPathsLoaded(const void* indices, PathIndexType indexType, int count) const { argument
45 return this->assertPathsLoaded(reinterpret_cast<const uint8_t*>(indices), count);
47 return this->assertPathsLoaded(reinterpret_cast<const uint16_t*>(indices), count);
49 return this->assertPathsLoaded(reinterpret_cast<const uint32_t*>(indices), count);
H A DGrPathRange.h73 void loadPathsIfNeeded(const void* indices, PathIndexType, int count) const;
75 template<typename IndexType> void loadPathsIfNeeded(const IndexType* indices, int count) const { argument
83 SkASSERT(indices[i] < static_cast<uint32_t>(fNumPaths));
85 const int groupIndex = indices[i] / kPathsPerGroup;
113 void assertPathsLoaded(const void* indices, PathIndexType, int count) const;
115 template<typename IndexType> void assertPathsLoaded(const IndexType* indices, int count) const {
121 SkASSERT(indices[i] < static_cast<uint32_t>(fNumPaths));
123 const int groupIndex = indices[i] / kPathsPerGroup;
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/
H A DTensorInitializer.h32 Eigen::array<typename traits<Derived>::Index, traits<Derived>::NumDimensions>* indices,
36 (*indices)[traits<Derived>::NumDimensions - N] = i++;
37 Initializer<Derived, N - 1>::run(tensor, indices, v);
47 Eigen::array<typename traits<Derived>::Index, traits<Derived>::NumDimensions>* indices,
52 (*indices)[traits<Derived>::NumDimensions - 1] = i++;
53 tensor.coeffRef(*indices) = v;
73 Eigen::array<typename traits<Derived>::Index, traits<Derived>::NumDimensions> indices; local
74 Initializer<Derived, traits<Derived>::NumDimensions>::run(tensor, &indices, vals);
31 run(TensorEvaluator<Derived, DefaultDevice>& tensor, Eigen::array<typename traits<Derived>::Index, traits<Derived>::NumDimensions>* indices, const InitList& vals) argument
46 run(TensorEvaluator<Derived, DefaultDevice>& tensor, Eigen::array<typename traits<Derived>::Index, traits<Derived>::NumDimensions>* indices, const InitList& vals) argument
H A DTensorStorage.h90 EIGEN_DEVICE_FUNC TensorStorage(DenseIndex... indices) : m_dimensions(indices...) { argument
/external/icu/icu4c/source/test/letest/
H A Dletest.h46 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:__anon10236
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 nullptr for indices.
27 VertState(int vCount, const uint16_t indices[], int indexCount) argument
28 : fIndices(indices) {
30 if (indices) {
/external/deqp/framework/opengl/simplereference/
H A DsglrContextUtil.cpp62 const deUint16 indices[] = { 0, 1, 2, 2, 1, 3 }; local
102 ctx.bufferData(GL_ELEMENT_ARRAY_BUFFER, DE_LENGTH_OF_ARRAY(indices)*sizeof(deUint16), &indices[0], GL_STATIC_DRAW);
104 ctx.drawElements(GL_TRIANGLES, DE_LENGTH_OF_ARRAY(indices), GL_UNSIGNED_SHORT, 0);
132 const deUint16 indices[] = { 0, 1, 2, 2, 1, 3 }; local
150 ctx.drawElements(GL_TRIANGLES, DE_LENGTH_OF_ARRAY(indices), GL_UNSIGNED_SHORT, &indices[0]);
/external/freetype/src/psaux/
H A Dt1cmap.h75 FT_UShort* indices; member in struct:T1_CMapCustomRec_
/external/libopus/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
H A DNLSF_del_dec_quant.c36 opus_int8 indices[], /* O Quantization indices [ order ] */
163 /* afterwards ind_sort[] will contain the indices of the NLSF_QUANT_DEL_DEC_STATES winning RD values */
199 /* last sample: find winner, copy indices and return RD value */
209 indices[ j ] = ind[ ind_tmp & ( NLSF_QUANT_DEL_DEC_STATES - 1 ) ][ j ];
210 silk_assert( indices[ j ] >= -NLSF_QUANT_MAX_AMPLITUDE_EXT );
211 silk_assert( indices[ j ] <= NLSF_QUANT_MAX_AMPLITUDE_EXT );
213 indices[ 0 ] += silk_RSHIFT( ind_tmp, NLSF_QUANT_DEL_DEC_STATES_LOG2 );
214 silk_assert( indices[ 0 ] <= NLSF_QUANT_MAX_AMPLITUDE_EXT );
35 silk_NLSF_del_dec_quant( opus_int8 indices[], const opus_int16 x_Q10[], const opus_int16 w_Q5[], const opus_uint8 pred_coef_Q8[], const opus_int16 ec_ix[], const opus_uint8 ec_rates_Q5[], const opus_int quant_step_size_Q16, const opus_int16 inv_quant_step_size_Q6, const opus_int32 mu_Q20, const opus_int16 order ) argument
/external/pdfium/third_party/freetype/src/psaux/
H A Dt1cmap.h75 FT_UShort* indices; member in struct:T1_CMapCustomRec_
/external/autotest/client/deps/glbench/src/
H A Dtrianglesetuptest.cc43 // Also note that GLES 2.0 uses 16 bit indices.
62 GLushort *indices = NULL; local
70 count_ = CreateMesh(&indices, &index_buffer_size, width, height, 0);
73 index_buffer_size, indices);
80 delete[] indices;
87 count_ = CreateMesh(&indices, &index_buffer_size, width, height,
91 index_buffer_size, indices);
96 delete[] indices;
H A Dattributefetchtest.cc104 GLushort *indices = NULL; local
109 count_ = CreateMesh(&indices, &index_buffer_size, width, height, 0);
111 index_buffer_size, indices);
139 delete[] indices;
H A Dvaryingsandddxytest.cc175 GLushort *indices = NULL; local
179 count_ = CreateMesh(&indices, &index_buffer_size, c, c, 0);
181 index_buffer_size, indices);
214 delete[] indices;
/external/eigen/demos/opengl/
H A Dicosphere.cpp42 std::vector<int>& indices = *mIndices.back(); local
46 indices.push_back(tindices[i][k]);
54 const std::vector<int>& IcoSphere::indices(int level) const function in class:IcoSphere
65 const std::vector<int>& indices = *mIndices.back(); local
68 int end = indices.size();
71 int ids0[3], // indices of outer vertices
72 ids1[3]; // indices of edge vertices
76 int e0 = indices[i+k];
77 int e1 = indices[i+k1];
/external/icu/icu4c/source/test/perf/leperf/
H A Dleperf.cpp44 le_int32 *indices = NULL; local
50 indices = LE_NEW_ARRAY(le_int32, glyphCount + 10);
57 delete indices;
/external/mesa3d/src/gallium/auxiliary/gallivm/
H A Dlp_bld_struct.c51 LLVMValueRef indices[2]; local
55 indices[0] = lp_build_const_int32(gallivm, 0);
56 indices[1] = lp_build_const_int32(gallivm, member);
57 member_ptr = LLVMBuildGEP(gallivm->builder, ptr, indices, Elements(indices), "");
85 LLVMValueRef indices[2]; local
89 indices[0] = lp_build_const_int32(gallivm, 0);
90 indices[1] = index;
91 element_ptr = LLVMBuildGEP(gallivm->builder, ptr, indices, Elements(indices), "");
[all...]
/external/v8/src/libplatform/tracing/
H A Dtrace-buffer.cc80 size_t indices = handle % Capacity(); local
81 *chunk_index = indices / TraceBufferChunk::kChunkSize;
82 *event_index = indices % TraceBufferChunk::kChunkSize;
/external/freetype/src/cache/
H A Dftccmap.c37 /* codes to equivalent glyph indices. */
40 /* 128 consecutive character codes to their corresponding glyph indices. */
48 /* number of glyph indices / character code per node */
74 FT_UInt16 indices[FTC_CMAP_INDICES_MAX]; /* array of glyph indices */ member in struct:FTC_CMapNodeRec_
80 /* if (indices[n] == FTC_CMAP_UNKNOWN), we assume that the corresponding */
81 /* glyph indices haven't been queried through FT_Get_Glyph_Index() yet */
128 node->indices[nn] = FTC_CMAP_UNKNOWN;
288 gindex = FTC_CMAP_NODE( node )->indices[char_code -
320 FTC_CMAP_NODE( node )->indices[char_cod
[all...]
/external/guice/core/src/com/google/inject/internal/
H A DProxyFactory.java93 // Create method/interceptor holders and record indices.
211 final Map<Object, Integer> indices; field in class:ProxyFactory.IndicesCallbackFilter
215 final Map<Object, Integer> indices = Maps.newHashMap();
217 indices.put(MethodWrapper.create(methods.get(i)), i);
219 this.indices = indices;
220 this.hashCode = indices.hashCode();
224 return indices.get(MethodWrapper.create(method));
229 ((IndicesCallbackFilter) o).indices.equals(indices);
[all...]

Completed in 611 milliseconds

12345678910