| /external/speex/libspeex/ |
| H A D | cb_search.h | 63 int complexity,
89 int complexity,
|
| H A D | ltp.h | 75 int complexity,
118 int complexity,
|
| H A D | sb_celp.h | 92 int complexity; member in struct:SBEncState
|
| H A D | nb_celp.h | 111 int complexity; /**< Complexity setting (0-10 from least complex to most complex) */ member in struct:EncState
|
| H A D | cb_search.c | 254 int complexity,
288 N=complexity;
584 int complexity,
242 split_cb_search_shape_sign( spx_word16_t target[], spx_coef_t ak[], spx_coef_t awk1[], spx_coef_t awk2[], const void *par, int p, int nsf, spx_sig_t *exc, spx_word16_t *r, SpeexBits *bits, char *stack, int complexity, int update_target ) argument
572 noise_codebook_quant( spx_word16_t target[], spx_coef_t ak[], spx_coef_t awk1[], spx_coef_t awk2[], const void *par, int p, int nsf, spx_sig_t *exc, spx_word16_t *r, SpeexBits *bits, char *stack, int complexity, int update_target ) argument
|
| H A D | nb_celp.c | 203 st->complexity=2;
353 if (!st->submodes[st->submodeID] || (st->complexity>2 && SUBMODE(have_subframe_gain)<3) || SUBMODE(forced_pitch_gain) || SUBMODE(lbr_pitch) != -1
719 if (st->complexity==0)
748 if (st->complexity==0)
793 exc, syn_resp, st->complexity, 0, st->plc_tuning, &st->cumul_gain);
847 innov, syn_resp, bits, stack, st->complexity, SUBMODE(double_codebook));
865 innov2, syn_resp, bits, stack, st->complexity, 0);
883 if (st->complexity!=0)
1662 st->complexity = (*(spx_int32_t*)ptr);
1663 if (st->complexity<
[all...] |
| H A D | sb_celp.c | 266 st->complexity=2;
696 innov, syn_resp, bits, stack, st->complexity, SUBMODE(double_codebook));
711 innov2, syn_resp, bits, stack, st->complexity, 0);
1211 st->complexity = (*(spx_int32_t*)ptr);
1212 if (st->complexity<1)
1213 st->complexity=1;
1216 (*(spx_int32_t*)ptr) = st->complexity;
|
| H A D | ltp.c | 545 int complexity,
570 N=complexity;
772 int complexity,
528 pitch_search_3tap( spx_word16_t target[], spx_word16_t *sw, spx_coef_t ak[], spx_coef_t awk1[], spx_coef_t awk2[], spx_sig_t exc[], const void *par, int start, int end, spx_word16_t pitch_coef, int p, int nsf, SpeexBits *bits, char *stack, spx_word16_t *exc2, spx_word16_t *r, int complexity, int cdbk_offset, int plc_tuning, spx_word32_t *cumul_gain ) argument
755 forced_pitch_quant( spx_word16_t target[], spx_word16_t *sw, spx_coef_t ak[], spx_coef_t awk1[], spx_coef_t awk2[], spx_sig_t exc[], const void *par, int start, int end, spx_word16_t pitch_coef, int p, int nsf, SpeexBits *bits, char *stack, spx_word16_t *exc2, spx_word16_t *r, int complexity, int cdbk_offset, int plc_tuning, spx_word32_t *cumul_gain ) argument
|
| /external/skia/bench/ |
| H A D | PathBench.cpp | 42 virtual int complexity() { return 0; } function in class:PathBench
69 count >>= (3 * complexity());
155 virtual int complexity() { return 1; } function in class:SawToothPathBench
180 virtual int complexity() { return 2; } function in class:LongCurvedPathBench
201 virtual int complexity() { return 2; } function in class:LongLinePathBench
|
| /external/webrtc/src/ |
| H A D | common_types.h | 491 VideoCodecComplexity complexity; member in struct:webrtc::VideoCodecH264
507 VideoCodecComplexity complexity; member in struct:webrtc::VideoCodecVP8
|
| /external/llvm/utils/TableGen/ |
| H A D | CodeGenDAGPatterns.h | 638 unsigned complexity, unsigned uid)
640 Dstregs(dstregs), AddedComplexity(complexity), ID(uid) {}
647 unsigned AddedComplexity; // Add to matching pattern complexity.
659 /// Compute the complexity metric for the input pattern. This roughly
|
| /external/opencv/ml/src/ |
| H A D | mltree.cpp | 822 node->complexity = 0;
2750 node->complexity = 1;
2766 parent->complexity += node->complexity;
2771 - parent->tree_risk)/(parent->complexity - 1);
2778 parent->complexity = node->complexity;
3102 cvWriteInt( fs, "complexity", node->complexity );
3305 node->complexity
[all...] |
| /external/quake/quake/src/QW/client/ |
| H A D | r_edge.c | 29 low depth complexity -- 1 to 3 or so
|
| /external/quake/quake/src/WinQuake/ |
| H A D | r_edge.cpp | 29 low depth complexity -- 1 to 3 or so
|
| /external/opencv/ml/include/ |
| H A D | ml.h | 691 int complexity; member in struct:CvDTreeNode
|
| /external/iproute2/doc/ |
| H A D | ip-cref.tex | 2544 also by their source, the task gets quadratic complexity and its solution
|