/external/lzma/CPP/7zip/UI/Common/ |
SortUtils.h | 8 void SortFileNames(const UStringVector &strings, CUIntVector &indices);
|
SortUtils.cpp | 15 void SortFileNames(const UStringVector &strings, CUIntVector &indices)
18 indices.ClearAndSetSize(numItems);
19 unsigned *vals = &indices[0];
22 indices.Sort(CompareStrings, (void *)&strings);
|
/external/libopus/silk/ |
decode_indices.c | 56 psDec->indices.signalType = (opus_int8)silk_RSHIFT( Ix, 1 ); 57 psDec->indices.quantOffsetType = (opus_int8)( Ix & 1 ); 65 psDec->indices.GainsIndices[ 0 ] = (opus_int8)ec_dec_icdf( psRangeDec, silk_delta_gain_iCDF, 8 ); 68 psDec->indices.GainsIndices[ 0 ] = (opus_int8)silk_LSHIFT( ec_dec_icdf( psRangeDec, silk_gain_iCDF[ psDec->indices.signalType ], 8 ), 3 ); 69 psDec->indices.GainsIndices[ 0 ] += (opus_int8)ec_dec_icdf( psRangeDec, silk_uniform8_iCDF, 8 ); 74 psDec->indices.GainsIndices[ i ] = (opus_int8)ec_dec_icdf( psRangeDec, silk_delta_gain_iCDF, 8 ); 78 /* Decode LSF Indices */ 80 psDec->indices.NLSFIndices[ 0 ] = (opus_int8)ec_dec_icdf( psRangeDec, &psDec->psNLSF_CB->CB1_iCDF[ ( psDec->indices.signalType >> 1 ) * psDec->psNLSF_CB->nVectors ], 8 ) [all...] |
decode_parameters.c | 46 silk_gains_dequant( psDecCtrl->Gains_Q16, psDec->indices.GainsIndices, 52 silk_NLSF_decode( pNLSF_Q15, psDec->indices.NLSFIndices, psDec->psNLSF_CB ); 60 psDec->indices.NLSFInterpCoef_Q2 = 4; 63 if( psDec->indices.NLSFInterpCoef_Q2 < 4 ) { 67 pNLSF0_Q15[ i ] = psDec->prevNLSF_Q15[ i ] + silk_RSHIFT( silk_MUL( psDec->indices.NLSFInterpCoef_Q2, 86 if( psDec->indices.signalType == TYPE_VOICED ) { 92 silk_decode_pitch( psDec->indices.lagIndex, psDec->indices.contourIndex, psDecCtrl->pitchL, psDec->fs_kHz, psDec->nb_subfr ); 95 cbk_ptr_Q7 = silk_LTP_vq_ptrs_Q7[ psDec->indices.PERIndex ]; /* set pointer to start of codebook */ 98 Ix = psDec->indices.LTPIndex[ k ] [all...] |
/external/icu/icu4c/source/layout/ |
CanonShaping.cpp | 15 void CanonShaping::sortMarks(le_int32 *indices, const le_int32 *combiningClasses, le_int32 index, le_int32 limit) 19 le_int32 v = indices[j]; 23 if (c >= combiningClasses[indices[i]]) { 27 indices[i + 1] = indices[i]; 30 indices[i + 1] = v; 41 le_int32 *indices = LE_NEW_ARRAY(le_int32, charCount); local 46 indices[i] = i; 59 sortMarks(indices, combiningClasses, i, mark); 71 le_int32 index = indices[i] [all...] |
/external/libcxx/test/std/re/re.iter/re.tokiter/re.tokiter.cnstr/ |
array.fail.cpp | 34 const int indices[] = {-1, 0, 1}; local 36 std::regex("\\d{3}-\\d{4}"), indices);
|
/external/skia/src/gpu/ |
GrPathRange.cpp | 27 void GrPathRange::loadPathsIfNeeded(const void* indices, PathIndexType indexType, int count) const { 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 { 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);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.iter/re.tokiter/re.tokiter.cnstr/ |
array.fail.cpp | 36 const int indices[] = {-1, 0, 1}; local 38 std::regex("\\d{3}-\\d{4}"), indices);
|
/external/skia/src/core/ |
SkVertState.cpp | 23 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[index + 1] 83 const uint16_t* indices = state->fIndices; local [all...] |
SkVertState.h | 25 * If the vertices are unindexed pass nullptr for indices. 27 VertState(int vCount, const uint16_t indices[], int indexCount) 28 : fIndices(indices) { 30 if (indices) {
|
/external/fonttools/Lib/fontTools/ttLib/tables/ |
T_S_I__0.py | 18 indices = [] 22 indices.append((glyphID, textLength, textOffset)) 25 assert indices[-5] == (0XFFFE, 0, -1409540300), "bad magic number" # 0xABFC1F34 26 self.indices = indices[:-5] 27 self.extra_indices = indices[-4:] 30 if not hasattr(self, "indices"): 35 for index, textLength, textOffset in self.indices: 42 def set(self, indices, extra_indices): 44 self.indices = indice [all...] |
/external/libopus/silk/fixed/ |
LTP_scale_ctrl_FIX.c | 46 psEnc->sCmn.indices.LTP_scaleIndex = (opus_int8)silk_LIMIT( 50 psEnc->sCmn.indices.LTP_scaleIndex = 0; 52 psEncCtrl->LTP_scale_Q14 = silk_LTPScales_table_Q14[ psEnc->sCmn.indices.LTP_scaleIndex ];
|
/external/libopus/silk/float/ |
LTP_scale_ctrl_FLP.c | 45 psEnc->sCmn.indices.LTP_scaleIndex = (opus_int8)silk_LIMIT( round_loss * psEncCtrl->LTPredCodGain * 0.1f, 0.0f, 2.0f ); 48 psEnc->sCmn.indices.LTP_scaleIndex = 0; 51 psEncCtrl->LTP_scale = (silk_float)silk_LTPScales_table_Q14[ psEnc->sCmn.indices.LTP_scaleIndex ] / 16384.0f;
|
/frameworks/ml/bordeaux/learning/multiclass_pa/jni/ |
jni_multiclass_pa.cpp | 26 void CreateIndexValuePairs(const int* indices, const float* values, 31 pair<int, float> new_pair(indices[i], values[i]); 67 jint* indices = env->GetIntArrayElements(index_array, NULL); local 71 if (values && indices && value_len == index_len) { 74 CreateIndexValuePairs(indices, values, value_len, &inputs); 76 env->ReleaseIntArrayElements(index_array, indices, JNI_ABORT); 81 env->ReleaseIntArrayElements(index_array, indices, JNI_ABORT); 100 jint* indices = env->GetIntArrayElements(index_array, NULL); local 104 if (values && indices && value_len == index_len) { 106 CreateIndexValuePairs(indices, values, value_len, &inputs) [all...] |
/prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
test_slice.py | 1 # tests for slice objects; in particular the indices method. 77 self.assertEqual(slice(None ).indices(10), (0, 10, 1)) 78 self.assertEqual(slice(None, None, 2).indices(10), (0, 10, 2)) 79 self.assertEqual(slice(1, None, 2).indices(10), (1, 10, 2)) 80 self.assertEqual(slice(None, None, -1).indices(10), (9, -1, -1)) 81 self.assertEqual(slice(None, None, -2).indices(10), (9, -1, -2)) 82 self.assertEqual(slice(3, None, -2).indices(10), (3, -1, -2)) 84 self.assertEqual(slice(None, -9).indices(10), (0, 1, 1)) 85 self.assertEqual(slice(None, -10).indices(10), (0, 0, 1)) 86 self.assertEqual(slice(None, -11).indices(10), (0, 0, 1) [all...] |
test_buffer.py | 16 indices = (0, None, 1, 3, 19, 300, -1, -2, -31, -300) 17 for start in indices: 18 for stop in indices: 20 for step in indices[1:]:
|
/prebuilts/gdb/linux-x86/lib/python2.7/test/ |
test_slice.py | 1 # tests for slice objects; in particular the indices method. 77 self.assertEqual(slice(None ).indices(10), (0, 10, 1)) 78 self.assertEqual(slice(None, None, 2).indices(10), (0, 10, 2)) 79 self.assertEqual(slice(1, None, 2).indices(10), (1, 10, 2)) 80 self.assertEqual(slice(None, None, -1).indices(10), (9, -1, -1)) 81 self.assertEqual(slice(None, None, -2).indices(10), (9, -1, -2)) 82 self.assertEqual(slice(3, None, -2).indices(10), (3, -1, -2)) 84 self.assertEqual(slice(None, -9).indices(10), (0, 1, 1)) 85 self.assertEqual(slice(None, -10).indices(10), (0, 0, 1)) 86 self.assertEqual(slice(None, -11).indices(10), (0, 0, 1) [all...] |
test_buffer.py | 16 indices = (0, None, 1, 3, 19, 300, -1, -2, -31, -300) 17 for start in indices: 18 for stop in indices: 20 for step in indices[1:]:
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
test_slice.py | 1 # tests for slice objects; in particular the indices method. 77 self.assertEqual(slice(None ).indices(10), (0, 10, 1)) 78 self.assertEqual(slice(None, None, 2).indices(10), (0, 10, 2)) 79 self.assertEqual(slice(1, None, 2).indices(10), (1, 10, 2)) 80 self.assertEqual(slice(None, None, -1).indices(10), (9, -1, -1)) 81 self.assertEqual(slice(None, None, -2).indices(10), (9, -1, -2)) 82 self.assertEqual(slice(3, None, -2).indices(10), (3, -1, -2)) 84 self.assertEqual(slice(None, -9).indices(10), (0, 1, 1)) 85 self.assertEqual(slice(None, -10).indices(10), (0, 0, 1)) 86 self.assertEqual(slice(None, -11).indices(10), (0, 0, 1) [all...] |
test_buffer.py | 16 indices = (0, None, 1, 3, 19, 300, -1, -2, -31, -300) 17 for start in indices: 18 for stop in indices: 20 for step in indices[1:]:
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
test_slice.py | 1 # tests for slice objects; in particular the indices method. 77 self.assertEqual(slice(None ).indices(10), (0, 10, 1)) 78 self.assertEqual(slice(None, None, 2).indices(10), (0, 10, 2)) 79 self.assertEqual(slice(1, None, 2).indices(10), (1, 10, 2)) 80 self.assertEqual(slice(None, None, -1).indices(10), (9, -1, -1)) 81 self.assertEqual(slice(None, None, -2).indices(10), (9, -1, -2)) 82 self.assertEqual(slice(3, None, -2).indices(10), (3, -1, -2)) 84 self.assertEqual(slice(None, -9).indices(10), (0, 1, 1)) 85 self.assertEqual(slice(None, -10).indices(10), (0, 0, 1)) 86 self.assertEqual(slice(None, -11).indices(10), (0, 0, 1) [all...] |
test_buffer.py | 16 indices = (0, None, 1, 3, 19, 300, -1, -2, -31, -300) 17 for start in indices: 18 for stop in indices: 20 for step in indices[1:]:
|
/frameworks/native/opengl/tools/glgen/stubs/gles11/ |
glDrawElementsInstanced.java | 1 // C function void glDrawElementsInstanced ( GLenum mode, GLsizei count, GLenum type, const GLvoid *indices, GLsizei instanceCount ) 7 java.nio.Buffer indices, 11 // C function void glDrawElementsInstanced ( GLenum mode, GLsizei count, GLenum type, const GLvoid *indices, GLsizei instanceCount )
|
glDrawElementsInstancedBaseVertex.java | 1 // C function void glDrawElementsInstancedBaseVertex ( GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei instanceCount, GLint basevertex ) 7 java.nio.Buffer indices, 12 // C function void glDrawElementsInstancedBaseVertex ( GLenum mode, GLsizei count, GLenum type, const void *indices, GLsizei instanceCount, GLint basevertex )
|
/external/opencv3/modules/flann/include/opencv2/flann/ |
nn_index.h | 63 * \param[out] indices The indices of the nearest neighbors found 68 virtual void knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dists, int knn, const SearchParams& params) 71 assert(indices.rows >= queries.rows); 73 assert(int(indices.cols) >= knn); 79 resultSet.init(indices[i], dists[i]); 87 if (get_param(params,"sorted",true)) resultSet.sortAndCopy(indices[i], dists[i], knn); 88 else resultSet.copy(indices[i], dists[i], knn); 96 * \param[out] indices The indinces of the neighbors found within the given radius 102 virtual int radiusSearch(const Matrix<ElementType>& query, Matrix<int>& indices, Matrix<DistanceType>& dists, float radius, const SearchParams& params [all...] |