| /external/speex/libspeex/ |
| cb_search.h | 63 int complexity,
89 int complexity,
|
| ltp.h | 75 int complexity,
118 int complexity,
|
| sb_celp.h | 92 int complexity; member in struct:SBEncState
|
| nb_celp.h | 111 int complexity; /**< Complexity setting (0-10 from least complex to most complex) */ member in struct:EncState
|
| cb_search.c | 254 int complexity,
288 N=complexity;
291 /* Complexity isn't as important for the codebooks as it is for the pitch */
584 int complexity,
|
| 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)
[all...] |
| 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);
[all...] |
| ltp.c | 545 int complexity,
570 N=complexity;
772 int complexity,
|
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
| vop.cpp | 548 mp4dec_log("DecodeVOLHeader(): Shape Complexity estimation is not supported.\n");
555 currVol->complexity.text_1 = BitstreamReadBits16(stream, 4);
563 currVol->complexity.text_2 = BitstreamReadBits16(stream, 4);
569 currVol->complexity.mc = BitstreamReadBits16(stream, 6);
908 if ((currVol->complexity.text_1 >> 3) & 0x1) /* intra */
910 if (currVol->complexity.text_1 & 0x1) /* not_coded */
912 if ((currVol->complexity.text_2 >> 3) & 0x1) /* dct_coefs */
914 if ((currVol->complexity.text_2 >> 2) & 0x1) /* dct_lines */
916 if ((currVol->complexity.text_2 >> 1) & 0x1) /* vlc_symbols */
918 if (currVol->complexity.text_2 & 0x1) /* vlc_bits *
[all...] |
| mp4lib_int.h | 27 #define FAST_IDCT /* , for fast Variable complexity IDCT */
47 /* complexity estimation parameters */
92 int complexity_estDisable; /* VOL disable complexity estimation */
93 int complexity_estMethod; /* VOL complexity estimation method */
94 Complexity_Est complexity; /* complexity estimation flags */ member in struct:tagVol
|
| /external/webrtc/src/ |
| common_types.h | 491 VideoCodecComplexity complexity; member in struct:webrtc::VideoCodecH264
507 VideoCodecComplexity complexity; member in struct:webrtc::VideoCodecVP8
|
| /external/skia/bench/ |
| PathBench.cpp | 44 virtual int complexity() { return 0; } function in class:PathBench
71 count >>= (3 * complexity());
172 virtual int complexity() SK_OVERRIDE { return 1; }
197 virtual int complexity() SK_OVERRIDE { return 2; }
218 virtual int complexity() SK_OVERRIDE { return 2; }
|
| /external/llvm/utils/TableGen/ |
| CodeGenDAGPatterns.h | 652 unsigned complexity, unsigned uid)
654 Dstregs(dstregs), AddedComplexity(complexity), ID(uid) {}
661 unsigned AddedComplexity; // Add to matching pattern complexity.
673 /// Compute the complexity metric for the input pattern. This roughly
|
| /external/opencv/ml/src/ |
| mltree.cpp | 822 node->complexity = 0;
[all...] |
| /build/tools/droiddoc/templates-pdk/ |
| sdkpage.cs | 85 but always increases application complexity. If you have not run into any limitations
|
| /external/quake/quake/src/QW/client/ |
| r_edge.c | 29 low depth complexity -- 1 to 3 or so
|
| /external/quake/quake/src/WinQuake/ |
| r_edge.cpp | 29 low depth complexity -- 1 to 3 or so
|
| /external/ceres-solver/docs/ |
| solving.tex | 181 II. This version of Ceres has a higher iteration complexity, but also
307 matrix~\cite{trefethen1997numerical}. This method has $O(p^2)$ space complexity and $O(p^3)$ time
308 complexity and is only practical for problems with up to a few hundred
347 The solution to this problem is to replace~\eqref{eq:normal} with a {\em preconditioned} system. Given a linear system, $Ax =b$ and a preconditioner $M$ the preconditioned system is given by $M^{-1}Ax = M^{-1}b$. The resulting algorithm is known as Preconditioned Conjugate Gradients algorithm (PCG) and its worst case complexity now depends on the condition number of the {\em preconditioned} matrix $\kappa(M^{-1}A)$.
[all...] |
| /external/opencv/ml/include/ |
| ml.h | 691 int complexity; member in struct:CvDTreeNode
[all...] |
| /external/libvorbis/doc/ |
| 01-introduction.tex | 40 encoder and simple, low-complexity decoder. Vorbis decode is
|
| /external/iproute2/doc/ |
| ip-cref.tex | [all...] |
