Searched defs:promote (Results 1 - 3 of 3) sorted by relevance

/external/chromium_org/third_party/angle/src/compiler/translator/
H A DIntermNode.cpp330 bool TIntermUnary::promote(TInfoSink &) function in class:TIntermUnary
370 bool TIntermBinary::promote(TInfoSink &infoSink) function in class:TIntermBinary
/external/eigen/unsupported/test/
H A DFFTW.cpp21 complex<long double> promote(complex<T> x) { return complex<long double>(x.real(),x.imag()); } function
23 complex<long double> promote(float x) { return complex<long double>( x); } function
24 complex<long double> promote(double x) { return complex<long double>( x); } function
25 complex<long double> promote(long double x) { return complex<long double>( x); } function
38 acc += promote( timebuf[k1] ) * exp( complex<long double>(0,k1*phinc) );
41 complex<long double> x = promote(fftbuf[k0]);
/external/chromium_org/chrome/browser/autocomplete/
H A Dhistory_url_provider.cc191 // If |promote| is true, this also ensures the entry is the first element in
192 // |matches|, moving or adding it to the front as appropriate. When |promote|
196 // It's OK to call this function with both |create_if_necessary| and |promote|
205 bool promote) {
211 if (promote)
222 if (promote)
232 // We can promote this match if it's been typed at least n times, where n == 1
558 // Pass 1: Get the in-memory URL database, and use it to find and promote
738 // need to promote lower-quality matches that are prefixes of higher-quality
790 // know about "foo/", ensure that if the promote typ
200 CreateOrPromoteMatch(const history::URLRow& info, size_t input_location, bool match_in_scheme, history::HistoryMatches* matches, bool create_if_necessary, bool promote) argument
1024 bool promote = true; local
[all...]

Completed in 185 milliseconds