Searched refs:ten (Results 1 - 13 of 13) sorted by relevance
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/ |
H A D | p9.cpp | 19 static const unsigned char ten = 10; member in namespace:PR6707 24 f2(X<int, 10>(), X<char, ten>());
|
/external/clang/test/CodeGen/ |
H A D | ms_struct-bitfield-3.c | 41 struct ten { struct 49 static int a2[(size_struct_2 == sizeof (struct ten)) -1];
|
/external/icu4c/test/intltest/ |
H A D | tsputil.cpp | 244 double ten = 10.0; local 270 if((pinf > ten) != TRUE) { 282 double ten = 10.0; local 308 if((ninf < ten) != TRUE) { 374 double ten = 10.0; local 388 if(uprv_isNaN(ten) == TRUE) { 401 double ten = 10.0; local 415 if((nan > ten) != FALSE) { 428 double ten = 10.0; local 442 if((nan < ten) ! 455 double ten = 10.0; local 482 double ten = 10.0; local 509 double ten = 10.0; local 536 double ten = 10.0; local [all...] |
H A D | ustrtest.cpp | 1689 TestEnumeration ten; local 1699 pc=ten.next(&length, status); 1706 if(ten.next(&length, status)!=NULL) { 1711 ten.reset(status); 1714 pu=ten.unext(&length, status); 1721 if(ten.unext(&length, status)!=NULL) { 1726 if(ten.clone()!=NULL) {
|
/external/v8/tools/ |
H A D | generate-ten-powers.scm | 30 ;; bigloo -static-bigloo -o generate-ten-powers generate-ten-powers.scm 34 (module gen-ten-powers 96 ;; Basically we will have a ten^i that we will *10 at each iteration. We 97 ;; want to create the matissa of 1/ten^i. However the mantissa must be 99 ;; We shift by multiplying with two^e. -> We encode two^e*(1/ten^i) == 100 ;; two^e/ten^i. 102 (ten^i #z10) 106 (if (>bx (/bx (*bx #z2 two^e) ten^i) max-container) 112 (v (rounded-/bx two^e ten [all...] |
/external/apache-harmony/math/src/test/java/tests/api/java/math/ |
H A D | BigIntegerTest.java | 35 BigInteger ten = new BigInteger("10", 10); field in class:BigIntegerTest 385 assertTrue("Incorrect exponent returned for 10**50", ten.pow(50)
|
/external/libvorbis/doc/ |
H A D | 02-bitpacking.tex | 23 seven, ten, eleven and sixteen bit 'bytes' have been used. For
|
H A D | 06-floor0.tex | 94 \varname{[floor0_order]} is ten, the only way to fill all the needed
|
/external/llvm/lib/Support/ |
H A D | APFloat.cpp | 2504 /* The maximum number that can be multiplied by ten with any 3503 APInt ten(precision, 10); 3510 APInt::udivrem(significand, ten, significand, digit);
|
/external/zlib/src/contrib/masmx64/ |
H A D | gvmat64.asm | 372 ;;; be spent in the first ten instructions.
|
/external/zlib/src/contrib/masmx86/ |
H A D | match686.asm | 314 ;;; be spent in the first ten instructions.
|
/external/dropbear/libtommath/ |
H A D | bn.tex | 1631 require ten tests whereas a 1024-bit number would only require four tests.
|
/external/grub/docs/ |
H A D | texinfo.tex | 1400 \csname ten#1\endcsname % change the current font
|
Completed in 681 milliseconds