/external/bison/tests/ |
cxx-type.at | 51 } term; 230 node->term.isNterm = 0; 231 node->term.parents = 0; 232 node->term.text = text; 252 free (node->term.text); 281 buffer = strdup (node->term.text);
|
/external/bzip2/ |
manual.xml | 327 <term><computeroutput>-c --stdout</computeroutput></term> 333 <term><computeroutput>-d --decompress</computeroutput></term> 344 <term><computeroutput>-z --compress</computeroutput></term> 351 <term><computeroutput>-t --test</computeroutput></term> 358 <term><computeroutput>-f --force</computeroutput></term> [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/objects/ |
XNodeSetForDOM.java | 66 // JKESS 20020514: Longer-term solution is to force 80 // JKESS 20020514: Longer-term solution is to force
|
/external/ceres-solver/internal/ceres/ |
gradient_checking_cost_function_test.cc | 163 TestTerm<-1, -1> term(arity, dim); 165 CreateGradientCheckingCostFunction(&term, 169 term.Evaluate(¶meters[0], 216 // Should have one term that's bad, causing everything to get dumped. 219 TestTerm<1, 2> term(arity, dim); 221 CreateGradientCheckingCostFunction(&term, 240 TestTerm<-1, -1> term(arity, dim); 242 CreateGradientCheckingCostFunction(&term,
|
/external/chromium/chrome/browser/ui/search_engines/ |
edit_search_engine_controller.h | 49 // url, or if it contains a search term and replacing that search term with a
|
/external/clang/lib/Analysis/ |
CFGStmtMap.cpp | 74 if (Stmt *Term = B->getTerminator()) 75 SM[Term] = B;
|
/external/llvm/docs/HistoricalNotes/ |
2002-05-12-InstListChange.txt | 34 Long term, all of the code that depends on the nasty features in the 36 be changed to do nice local transformations. In the short term, I'll
|
/external/llvm/utils/lit/lit/ |
TestingConfig.py | 19 'TERM' : os.environ.get('TERM',''),
|
/external/markdown/markdown/extensions/ |
def_list.py | 64 for term in terms: 66 dt.text = term
|
/external/nist-sip/java/gov/nist/javax/sip/header/ims/ |
PServedUser.java | 100 if((sessionCase.equals("orig"))||(sessionCase.equals("term"))) 111 throw new InvalidArgumentException("Value can be either orig or term");
|
PServedUserHeader.java | 41 * sessioncase-param = "sescase" EQUAL "orig" / "term"
|
/external/skia/include/core/ |
SkGraphics.h | 27 static void Term(); 107 SkGraphics::Term();
|
/external/skia/src/core/ |
SkGraphics.cpp | 130 void SkGraphics::Term() { 132 SkPaint::Term();
|
/external/valgrind/main/docs/internals/ |
module-structure.txt | 2 Our long term goal is to move to structure Valgrind's top level as a 13 exist long-term. These trees contain mish-mashes of functionality
|
/external/valgrind/main/exp-bbv/docs/ |
bbv-manual.xml | 122 <term> 124 </term> 137 <term> 139 </term> 157 <term> 159 </term> 178 <term> 180 </term>
|
/bionic/libm/upstream-freebsd/lib/msun/src/ |
s_log1p.c | 25 * term is need. Let u=1+x rounded. Let c = (1+x)-u, then 27 * and add back the correction term c/u. 131 c = (k>0)? 1.0-(u-x):x-(u-1.0);/* correction term */ 145 * using the correction term but don't use it if k==0.
|
/external/ceres-solver/docs/ |
reference-overview.tex | 10 The term $ \rho_i\left(\left\|f_i\left(x_{i_1},\hdots,x_{i_k}\right)\right\|^2\right)$ is known as a Residual Block. A Ceres problem is a collection of residual blocks, each of which depends on a subset of the parameter blocks.
|
/external/ceres-solver/examples/ |
denoising.cc | 33 // Note that for good denoising results the weighting between the data term 34 // and the Fields of Experts term needs to be adjusted. This is discussed 64 // This cost function is used to build the data term. 91 // Create the data term
|
/external/chromium/chrome/browser/autocomplete/ |
history_quick_provider.h | 65 // Fill and return an ACMatchClassifications structure given the term
|
/external/dnsmasq/contrib/Suse/ |
rc.dnsmasq-suse | 42 killproc -p $NAMED_PID -TERM $NAMED_BIN
|
/external/dropbear/ |
chansession.h | 49 unsigned char * term; member in struct:ChanSess
|
/external/dropbear/libtommath/ |
bn_mp_mul_d.c | 50 /* compute product and carry sum for this term */
|
/external/guava/ |
mvn-deploy.sh | 22 # This test sucks, but it's short term
|
/external/libgsm/src/ |
long_term.c | 18 * 4.2.11 .. 4.2.12 LONG TERM PREDICTOR (LTP) SECTION 24 * for the long term analysis filter. This is done by calculating a 26 * sub-segment short term residual signal d[0..39] (output of 27 * the short term analysis filter; for simplification the index 29 * RPE-LTP analysis) and the previous reconstructed short term 114 /* Compute the power of the reconstructed short term residual 249 /* Compute the power of the reconstructed short term residual 429 /* Compute the power of the reconstructed short term residual 594 /* Compute the power of the reconstructed short term residual 686 /* Compute the power of the reconstructed short term residua [all...] |
/external/linux-tools-perf/util/ |
color.c | 152 char *term = getenv("TERM"); local 153 if (term && strcmp(term, "dumb"))
|