HomeSort by relevance Sort by last modified time
    Searched defs:c1 (Results 176 - 200 of 635) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/chromium/base/
callback_unittest.cc 79 Callback<void(int)> c1; local
87 EXPECT_TRUE(c1.is_null());
  /external/chromium/chrome/browser/ui/
input_window_dialog_win.cc 179 ColumnSet* c1 = layout->AddColumnSet(0); local
180 c1->AddColumn(GridLayout::CENTER, GridLayout::CENTER, 0,
182 c1->AddPaddingColumn(0, views::kRelatedControlHorizontalSpacing);
183 c1->AddColumn(GridLayout::FILL, GridLayout::CENTER, 1,
  /external/chromium_org/base/
callback_unittest.cc 78 Callback<void(int)> c1; local
86 EXPECT_TRUE(c1.is_null());
  /external/chromium_org/third_party/icu/source/common/
uinvchar.c 430 UChar32 c1, c2; local
449 c1=c;
451 c1=-1;
459 if((c1-=c2)!=0) {
460 return c1;
475 UChar32 c1, c2; local
494 c1=0;
495 } else if((c1=asciiFromEbcdic[c])!=0 && UCHAR_IS_INVARIANT(c1)) {
496 /* c1 is set *
519 int32_t c1, c2; local
    [all...]
unormcmp.cpp 63 * get one code unit c1 from s1 (-1 if end of source)
69 * if(c1==c2) {
73 * // c1!=c2
74 * try to decompose/case-fold c1/c2, and continue if one does;
76 * // still c1!=c2 and neither decomposes/case-folds, return result
77 * return c1-c2;
170 UChar32 c1, c2, cp1, cp2; local
211 c1=c2=-1;
220 if(c1<0) {
223 if(s1==limit1 || ((c1=*s1)==0 && (limit1==NULL || (options&_STRNCMP_STYLE))))
    [all...]
  /external/chromium_org/third_party/icu/source/test/intltest/
aliastst.cpp 66 Calendar* c1 = Calendar::createInstance(oldLoc, status); local
70 const char* l1 = c1->getLocaleID(ULOC_VALID_LOCALE, status);
78 if(!(c1==c2)){
79 errln("CalendarTest: c1!=c2. newLoc= "+UnicodeString(newLoc.getName()) +" oldLoc= "+UnicodeString(oldLoc.getName()));
82 delete c1;
112 errln("TestDateFormat: c1!=c2. newLoc= "+UnicodeString(newLoc.getName()) +" oldLoc= "+UnicodeString(oldLoc.getName()));
133 Collator* c1 = Collator::createInstance(oldLoc, status); local
136 Locale l1 = c1->getLocale(ULOC_VALID_LOCALE, status);
145 if(!(c1==c2)){
146 errln("CollationTest: c1!=c2. newLoc= "+UnicodeString(newLoc.getName()) +" oldLoc= "+UnicodeString(oldLoc.getName()))
    [all...]
  /external/chromium_org/third_party/libphonenumber/src/phonenumbers/utf/
rune.c 68 int c, c1, c2, c3; local
95 c1 = *(uchar*)(str+1) ^ Tx;
96 if(c1 & Testx)
101 l = ((c << Bitx) | c1) & Rune2;
121 l = ((((c << Bitx) | c1) << Bitx) | c2) & Rune3;
139 l = ((((((c << Bitx) | c1) << Bitx) | c2) << Bitx) | c3) & Rune4;
169 int c, c1, c2, c3; local
186 c1 = *(uchar*)(str+1) ^ Tx;
187 if(c1 & Testx)
192 l = ((c << Bitx) | c1) & Rune2
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/swrast/
s_zoom.c 54 GLint c0, c1, r0, r1; local
60 * Compute destination columns: [c0, c1)
63 c1 = imageX + (GLint) ((spanX + width - imageX) * ctx->Pixel.ZoomX);
64 if (c1 < c0) {
66 GLint tmp = c1;
67 c1 = c0;
71 c1 = CLAMP(c1, fb->_Xmin, fb->_Xmax);
72 if (c0 == c1) {
94 *x1 = c1;
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/bn/
bn_mul.c 396 int n=n2/2,c1,c2; local
431 c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
434 switch (c1*3+c2)
503 /* t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign
508 c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
512 c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
517 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),t,n2));
523 * c1 holds the carry bits
525 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
526 if (c1)
554 int c1,c2,neg; local
761 int c1,c2; local
    [all...]
  /external/chromium_org/third_party/re2/util/
rune.cc 51 int c, c1, c2, c3; local
68 c1 = *(unsigned char*)(str+1) ^ Tx;
69 if(c1 & Testx)
74 l = ((c << Bitx) | c1) & Rune2;
89 l = ((((c << Bitx) | c1) << Bitx) | c2) & Rune3;
104 l = ((((((c << Bitx) | c1) << Bitx) | c2) << Bitx) | c3) & Rune4;
233 long c1; local
241 c1 = *(unsigned char*)s;
242 if(c1 < Runeself) { /* one byte rune */
243 if(c1 == 0
    [all...]
  /external/chromium_org/third_party/sqlite/src/src/
callback.c 289 u8 c1 = (u8)pDef->zName[0]; local
290 int h = (sqlite3UpperToLower[c1] + nName) % ArraySize(pHash->a);
  /external/chromium_org/ui/gfx/image/
image_unittest_util.cc 36 int c1 = static_cast<int>(component1); local
38 return std::abs(c1 - c2) <= 40;
  /external/chromium_org/ui/views/layout/
grid_layout_unittest.cc 85 ColumnSet* c1 = layout.AddColumnSet(0); local
86 c1->AddColumn(alignment, alignment, 1, GridLayout::USE_PREF, 0, 0);
129 ColumnSet* c1 = layout.AddColumnSet(0); local
130 c1->AddColumn(GridLayout::LEADING, GridLayout::LEADING,
132 c1->AddColumn(GridLayout::LEADING, GridLayout::LEADING,
152 ColumnSet* c1 = layout.AddColumnSet(0); local
153 c1->AddColumn(GridLayout::LEADING, GridLayout::LEADING,
155 c1->AddColumn(GridLayout::LEADING, GridLayout::LEADING,
176 ColumnSet* c1 = layout.AddColumnSet(0); local
177 c1->AddColumn(GridLayout::LEADING, GridLayout::LEADING
202 ColumnSet* c1 = layout.AddColumnSet(0); local
288 ColumnSet* c1 = layout.AddColumnSet(0); local
312 ColumnSet* c1 = layout.AddColumnSet(0); local
332 ColumnSet* c1 = layout.AddColumnSet(0); local
352 ColumnSet* c1 = layout.AddColumnSet(0); local
373 ColumnSet* c1 = layout.AddColumnSet(0); local
    [all...]
  /external/clang/test/CXX/special/class.ctor/
p6-0x.cpp 23 constexpr Constexpr1 c1 = Constexpr1(); // ok variable
  /external/clang/test/CodeGenCXX/
global-init.cpp 174 const C c1 = C(); member in namespace:test7
vtable-available-externally.cpp 152 struct c1 {}; struct in namespace:Test7
153 struct c10 : c1{
156 struct c11 : c10, c1{
  /external/clang/test/Sema/
string-init.c 21 char16_t c1[] = "a"; // expected-error{{initializing wide char array with non-wide string literal}} local
  /external/clang/test/SemaCXX/
aggregate-initialization.cpp 70 C c1 = { 1 }; local
string-init.cpp 16 char16_t c1[] = "a"; // expected-error{{initializing wide char array with non-wide string literal}} local
  /external/clang/test/SemaTemplate/
instantiate-member-class.cpp 37 X<int>::C *c1; variable
44 c1 = c2; // expected-error{{assigning to 'X<int>::C *' from incompatible type 'X<float>::C *'}}
  /external/eigen/bench/
eig33.cpp 55 // The characteristic equation is x^3 - c2*x^2 + c1*x - c0 = 0. The
59 Scalar c1 = m(0,0)*m(1,1) - m(0,1)*m(0,1) + m(0,0)*m(2,2) - m(0,2)*m(0,2) + m(1,1)*m(2,2) - m(1,2)*m(1,2); local
65 Scalar a_over_3 = (c1 - c2*c2_over_3)*s_inv3;
69 Scalar half_b = Scalar(0.5)*(c0 + c2_over_3*(Scalar(2)*c2_over_3*c2_over_3 - c1));
  /external/eigen/test/
block.cpp 37 Index c1 = internal::random<Index>(0,cols-1); local
38 Index c2 = internal::random<Index>(c1,cols-1);
41 VERIFY_IS_EQUAL(m1.col(c1).transpose(), m1.transpose().row(c1));
50 m1.col(c1) += s1 * m1_copy.col(c2);
51 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + s1 * m1_copy.col(c2));
52 m1.col(c1).col(0) += s1 * m1_copy.col(c2);
53 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + Scalar(2) * s1 * m1_copy.col(c2))
193 Index c1 = internal::random<Index>(0,cols-1); local
    [all...]
sparse_product.cpp 17 int c1 = internal::random(0,m2.cols()-1); local
18 VERIFY_IS_APPROX(m4=m2.col(c)*refMat2.col(c1).transpose(), refMat4=refMat2.col(c)*refMat2.col(c1).transpose());
19 VERIFY_IS_APPROX(m4=refMat2.col(c1)*m2.col(c).transpose(), refMat4=refMat2.col(c1)*refMat2.col(c).transpose());
26 int c1 = internal::random(0,m2.cols()-1); local
27 VERIFY_IS_APPROX(m4=m2.row(r).transpose()*refMat2.col(c1).transpose(), refMat4=refMat2.row(r).transpose()*refMat2.col(c1).transpose());
28 VERIFY_IS_APPROX(m4=refMat2.col(c1)*m2.row(r), refMat4=refMat2.col(c1)*refMat2.row(r))
    [all...]
  /external/eigen/test/eigen2/
eigen2_submatrices.cpp 19 CheckMinor(MatrixType& m1, int r1, int c1)
26 mi = m1.minor(r1,c1);
27 VERIFY_IS_APPROX(mi.transpose(), m1.transpose().minor(c1,r1));
29 m1.minor(r1,c1)(0,0) = m1.minor(0,0)(0,0);
69 int c1 = ei_random<int>(0,cols-1); local
70 int c2 = ei_random<int>(c1,cols-1);
73 VERIFY_IS_APPROX(m1.col(c1).transpose(), m1.transpose().row(c1));
74 VERIFY_IS_APPROX(square.row(r1).eigen2_dot(m1.col(c1)), (square.lazy() * m1.conjugate())(r1,c1));
    [all...]
  /external/icu4c/common/
ucmndata.c 105 int32_t c1=(uint8_t)*s1++; local
107 cmp=c1-c2;
108 if(cmp!=0 || c1==0) { /* different or done */

Completed in 361 milliseconds

1 2 3 4 5 6 78 91011>>