| /external/speex/libspeex/ |
| D | cb_search.h | 63 int complexity,
89 int complexity,
|
| D | ltp.h | 75 int complexity,
118 int complexity,
|
| D | nb_celp.c | 203 st->complexity=2; in nb_encoder_init()
353 …if (!st->submodes[st->submodeID] || (st->complexity>2 && SUBMODE(have_subframe_gain)<3) || SUBMODE… in nb_encode()
719 if (st->complexity==0) in nb_encode()
748 if (st->complexity==0) in nb_encode()
793 … exc, syn_resp, st->complexity, 0, st->plc_tuning, &st->cumul_gain); in nb_encode()
847 innov, syn_resp, bits, stack, st->complexity, SUBMODE(double_codebook)); in nb_encode()
865 innov2, syn_resp, bits, stack, st->complexity, 0); in nb_encode()
883 if (st->complexity!=0) in nb_encode()
1662 st->complexity = (*(spx_int32_t*)ptr); in nb_encoder_ctl()
1663 if (st->complexity<0) in nb_encoder_ctl()
[all …]
|
| D | sb_celp.h | 92 int complexity; member
|
| D | nb_celp.h | 111 … int complexity; /**< Complexity setting (0-10 from least complex to most complex) */ member
|
| D | sb_celp.c | 266 st->complexity=2; in sb_encoder_init()
696 … innov, syn_resp, bits, stack, st->complexity, SUBMODE(double_codebook)); in sb_encode()
711 innov2, syn_resp, bits, stack, st->complexity, 0); in sb_encode()
1211 st->complexity = (*(spx_int32_t*)ptr); in sb_encoder_ctl()
1212 if (st->complexity<1) in sb_encoder_ctl()
1213 st->complexity=1; in sb_encoder_ctl()
1216 (*(spx_int32_t*)ptr) = st->complexity; in sb_encoder_ctl()
|
| D | cb_search.c | 254 int complexity, in split_cb_search_shape_sign() argument
288 N=complexity; in split_cb_search_shape_sign()
584 int complexity, in noise_codebook_quant() argument
|
| D | ltp.c | 545 int complexity, in pitch_search_3tap() argument
570 N=complexity; in pitch_search_3tap()
772 int complexity, in forced_pitch_quant() argument
|
| /external/webrtc/src/ |
| D | common_types.h | 491 VideoCodecComplexity complexity; member
507 VideoCodecComplexity complexity; member
|
| /external/skia/bench/ |
| D | PathBench.cpp | 44 virtual int complexity() { return 0; } in complexity() function in PathBench
71 count >>= (3 * complexity()); in onDraw()
172 virtual int complexity() SK_OVERRIDE { return 1; } in complexity() function in SawToothPathBench
197 virtual int complexity() SK_OVERRIDE { return 2; } in complexity() function in LongCurvedPathBench
218 virtual int complexity() SK_OVERRIDE { return 2; } in complexity() function in LongLinePathBench
|
| /external/llvm/lib/Target/X86/ |
| D | README-FPStack.txt | 16 complexity. We need a way to specify the later is more profitable.
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenDAGPatterns.h | 652 unsigned complexity, unsigned uid) in PatternToMatch() argument
654 Dstregs(dstregs), AddedComplexity(complexity), ID(uid) {} in PatternToMatch()
|
| /external/opencv/ml/src/ |
| D | mltree.cpp | 822 node->complexity = 0; in new_node()
2750 node->complexity = 1; in update_tree_rnc()
2766 parent->complexity += node->complexity; in update_tree_rnc()
2771 - parent->tree_risk)/(parent->complexity - 1); in update_tree_rnc()
2778 parent->complexity = node->complexity; in update_tree_rnc()
3102 cvWriteInt( fs, "complexity", node->complexity ); in write_node()
3305 node->complexity = cvReadIntByName( fs, fnode, "complexity" ); in read_node()
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2000-12-06-MeetingSummary.txt | 29 greater than linear in asymptotic complexity, so this extra analaysis
|
| /external/libvpx/libvpx/ |
| D | usage_dx.dox | 34 data has been updated in this call. For all their additional complexity,
|
| /external/eigen/bench/btl/ |
| D | README | 87 …*** nb_op_base() : this method returns the complexity of the calculate method (allowing the mflops…
|
| /external/quake/quake/src/WinQuake/ |
| D | r_edge.cpp | 29 low depth complexity -- 1 to 3 or so
|
| /external/quake/quake/src/QW/client/ |
| D | r_edge.c | 29 low depth complexity -- 1 to 3 or so
|
| /external/webkit/Source/WebKit/mac/Plugins/Hosted/ |
| D | NetscapePluginHostManager.mm | 205 …// This has O(n) complexity but the number of active plug-in hosts is very small so it shouldn't m…
|
| /external/bzip2/ |
| D | README | 123 ensure that this program works correctly. However, the complexity
|
| /external/valgrind/main/docs/internals/ |
| D | threads-syscalls-signals.txt | 64 we avoid the complexity of having signals delivered asynchronously via
98 BUT, there's another complexity: because the Unix signal mechanism has
|
| /external/clang/docs/ |
| D | DriverInternals.rst | 68 gcc driver adds a significant amount of complexity. However, the design
69 of the driver attempts to mitigate this complexity by dividing the
|
| /external/ceres-solver/docs/ |
| D | 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 …Preconditioned Conjugate Gradients algorithm (PCG) and its worst case complexity now depends on t…
526 order of complexity) \texttt{IDENTITY},\texttt{JACOBI},
|
| /external/chromium/base/ |
| D | bind_internal.h.pump | 64 // complexity of defintions for the InvokerN<> later. Even though there are
|
| /external/antlr/antlr-3.4/runtime/Python/ |
| D | pylintrc | 205 # * size, complexity of functions, methods
|