HomeSort by relevance Sort by last modified time
    Searched refs:n2 (Results 51 - 75 of 392) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/chromium_org/chrome/android/javatests/src/org/chromium/chrome/browser/test/
ProviderBookmarkNodeTest.java 110 private static boolean isSameHierarchyDownwards(BookmarkNode n1, BookmarkNode n2) {
111 if (n1 == null && n2 == null) return true;
112 if (n1 == null || n2 == null) return false;
113 if (!n1.equalContents(n2)) return false;
115 if (!isSameHierarchyDownwards(n1.children().get(i), n2.children().get(i))) return false;
  /external/chromium_org/third_party/openssl/openssl/crypto/objects/
obj_xref.c 210 int n1, n2, n3; local
224 rv = OBJ_find_sigid_algs(n1, &n2, &n3);
226 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
228 rv = OBJ_find_sigid_by_algs(&n1, n2, n3);
230 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
  /external/openssl/crypto/objects/
obj_xref.c 210 int n1, n2, n3; local
224 rv = OBJ_find_sigid_algs(n1, &n2, &n3);
226 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
228 rv = OBJ_find_sigid_by_algs(&n1, n2, n3);
230 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
  /external/apache-xml/src/main/java/org/apache/xalan/transformer/
NodeSorter.java 118 * @param n2 Second node to use in compare
127 NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support)
141 n2Num = ((Double) n2.m_key1Value).doubleValue();
146 n2Num = ((Double) n2.m_key2Value).doubleValue();
153 double n2Num = (double)n2.m_keyValue[kIndex];
161 XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node,
174 result = compare(n1, n2, kIndex + 1, support);
204 n2String = (CollationKey) n2.m_key1Value;
209 n2String = (CollationKey) n2.m_key2Value;
216 String n2String = (String)n2.m_keyValue[kIndex]
    [all...]
  /external/apache-xml/src/main/java/org/apache/xpath/objects/
XNodeSet.java 750 * @param n2 Second number to compare
754 abstract boolean compareNumbers(double n1, double n2);
783 * @param n2 Second number to compare
785 * @return true if n1 is less than n2
787 boolean compareNumbers(double n1, double n2)
789 return n1 < n2;
819 * @param n2 Second number to compare
821 * @return true if n1 is less than or equal to n2
823 boolean compareNumbers(double n1, double n2)
825 return n1 <= n2;
    [all...]
  /external/chromium_org/third_party/icu/source/common/
unormcmp.cpp 577 const Normalizer2 *n2; local
579 n2=Normalizer2Factory::getNFDInstance(*pErrorCode);
581 n2=Normalizer2Factory::getFCDInstance(*pErrorCode);
594 FilteredNormalizer2 fn2(*n2, *uni32);
596 n2=&fn2;
601 int32_t spanQCYes1=n2->spanQuickCheckYes(str1, *pErrorCode);
602 int32_t spanQCYes2=n2->spanQuickCheckYes(str2, *pErrorCode);
619 n2->normalizeSecondAndAppend(fcd1, unnormalized, *pErrorCode);
626 n2->normalizeSecondAndAppend(fcd2, unnormalized, *pErrorCode);
normlzr.cpp 140 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
143 FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
146 n2->normalize(source, *dest, status);
175 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
178 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
181 return n2->quickCheck(source, status);
192 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
195 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
198 return n2->isNormalized(source, status);
226 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, errorCode) local
    [all...]
  /external/chromium_org/ui/message_center/
notification_list.cc 19 Notification* n2) {
20 if (n1->priority() > n2->priority()) // Higher pri go first.
22 if (n1->priority() < n2->priority())
24 return CompareTimestampSerial()(n1, n2);
27 bool CompareTimestampSerial::operator()(Notification* n1, Notification* n2) {
28 if (n1->timestamp() > n2->timestamp()) // Newer come first.
30 if (n1->timestamp() < n2->timestamp())
32 if (n1->serial_number() > n2->serial_number()) // Newer come first.
34 if (n1->serial_number() < n2->serial_number())
  /external/icu4c/common/
unormcmp.cpp 538 UBool _normalize(const Normalizer2 *n2, const UChar *s, int32_t length,
543 int32_t spanQCYes=n2->spanQuickCheckYes(str, *pErrorCode);
558 n2->normalizeSecondAndAppend(normalized, unnormalized, *pErrorCode);
606 const Normalizer2 *n2; local
608 n2=Normalizer2Factory::getNFDInstance(*pErrorCode);
610 n2=Normalizer2Factory::getFCDInstance(*pErrorCode);
618 FilteredNormalizer2 fn2(*n2, *uni32);
628 if(_normalize(n2, s1, length1, fcd1, pErrorCode)) {
632 if(_normalize(n2, s2, length2, fcd2, pErrorCode)) {
normlzr.cpp 139 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
142 FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
145 n2->normalize(source, *dest, status);
174 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
177 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
180 return n2->quickCheck(source, status);
191 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
194 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
197 return n2->isNormalized(source, status);
225 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, errorCode) local
    [all...]
  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 134 NodeEntry &n2 = getNode(ne.getNode2()); local
137 (n2.getCosts().getLength() == ne.getCosts().getCols()) &&
140 ne.setNode2AEItr(n2.addEdge(edgeItr));
344 NodeEntry &n2 = getNode(e.getNode2()); local
346 n2.removeEdge(e.getNode2AEItr());
378 unsigned n2 = std::distance(nodesBegin(), getEdgeNode2(edgeItr)); local
379 assert(n1 != n2 && "PBQP graphs shound not have self-edges.");
381 os << "\n" << n1 << " " << n2 << "\n"
432 bool operator()(Graph::NodeItr n1, Graph::NodeItr n2) const {
433 return &*n1 < &*n2;
    [all...]
  /external/clang/test/CodeGenCXX/
destructor-calls.cpp 39 N n2; local
  /external/clang/test/FixIt/
fixit-vexing-parse.cpp 84 int n2, // expected-note {{change this ',' to a ';' to call 'F1'}} local
  /system/core/rootdir/etc/
init.testmenu 7 n2=`cat /data/phoneentry2 2>/dev/null`
10 n2=${n2:-"*#06#"}
118 echo " 2: Dial: ATD $n2;"
132 "2" ) echo "Dialing $n2"; echo -e "ATD $n2;\r" >$atdev;;
135 "5" ) echo -n "Number: "; read n2; echo $n2 >/data/phoneentry2;;
  /external/chromium_org/third_party/mesa/src/src/mesa/program/
register_allocate.h 60 unsigned int n1, unsigned int n2);
  /external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/
p6.cpp 6 alignas(8) int n2; // expected-note {{previous declaration}} variable
7 alignas(4) extern int n2; // expected-error {{different alignment requirement (4 vs 8)}}
  /external/guava/guava-tests/test/com/google/common/base/
ObjectsTest.java 68 Long n2 = Objects.firstNonNull(null, n1); local
69 assertSame(n1, n2);
  /external/mesa3d/src/mesa/program/
register_allocate.h 60 unsigned int n1, unsigned int n2);
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/
arithmetic_op.hpp 46 template< typename T, T n1, T n2 >
49 BOOST_STATIC_CONSTANT(T, value = (n1 AUX778076_OP_TOKEN n2));
58 template< typename N1, typename N2 > struct apply
63 , typename N2::value_type
66 AUX778076_OP_TOKEN BOOST_MPL_AUX_VALUE_WKND(N2)::value
73 , typename N2::value_type
76 , N2::value
  /system/core/include/utils/
Unicode.h 43 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2);
46 int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2);
  /external/srec/srec/cfront/
sp_fft.c 174 unsigned m, n, n2, i, j, i0, is, id, ii, ib; local
193 n2 = n << 1;
205 id = n2;
207 n2 = n2 >> 1;
226 is = 2 * id - n2;
272 unsigned m, n, n2, n4, i, j, ii, nt; local
286 n2 = n << 1;
289 n2 = n2 >> 1
588 unsigned n2; local
    [all...]
  /external/chromium_org/third_party/sqlite/src/src/
test3.c 399 int n2; local
413 sqlite3BtreeDataSize(pCur, (u32*)&n2);
420 sqlite3_snprintf(sizeof(zBuf),zBuf, "%d", (int)(n1+n2));
447 int n1, n2, i, j; local
468 n2 = getVarint(zBuf, &out);
469 if( n1!=n2 ){
470 sprintf(zErr, "putVarint returned %d and getVarint returned %d", n1, n2);
481 n2 = getVarint32(zBuf, out32);
483 if( n1!=n2 ){
485 n1, n2);
    [all...]
  /external/chromium_org/third_party/sqlite/src/ext/fts1/
ft_hash.c 89 static int intCompare(const void *pKey1, int n1, const void *pKey2, int n2){
90 return n2 - n1;
102 static int ptrCompare(const void *pKey1, int n1, const void *pKey2, int n2){
122 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){
123 if( n1!=n2 ) return 1;
138 static int binCompare(const void *pKey1, int n1, const void *pKey2, int n2){
139 if( n1!=n2 ) return 1;
  /external/libvpx/libvpx/vp8/common/mips/dspr2/
filter_dspr2.c 133 unsigned int n1, n2, n3; local
196 "preceu.ph.qbl %[n2], %[tp2] \n\t"
200 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t"
207 "dpa.w.ph $ac2, %[n2], %[vector1b] \n\t"
216 "lbux %[n2], %[Temp4](%[cm]) \n\t"
222 "sb %[n2], 3(%[dst_ptr]) \n\t"
226 [p3] "=&r" (p3), [n1] "=&r" (n1), [n2] "=&r" (n2),
272 "preceu.ph.qbl %[n2], %[tp2] \n\t"
276 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t
329 unsigned int n1, n2, n3, n4; local
629 unsigned int n1, n2, n3, n4; local
961 unsigned int n1, n2, n3; local
    [all...]
  /cts/tools/dasm/src/dasm/
parser.cup 697 Insn:i Word:n1 Num:n2
698 {: dAsm.addOpcode(i.str_val, n1.str_val, n2.number_val); :}
701 Insn:i Word:n1 Int:n2
702 {: dAsm.addOpcode(i.str_val, n1.str_val, new Integer(n2.int_val)); :}
705 Insn:i Word:n1 Word:n2
706 {: dAsm.addOpcode(i.str_val, n1.str_val, n2.str_val); :}
709 Insn:i Word:n1 Relative:n2
710 {: dAsm.addRelativeGoto(i.str_val, n1.str_val, n2.int_val); :}
713 Insn:i Word:n1 Word:n2 Word:n3
714 {: dAsm.addOpcode(i.str_val, n1.str_val, n2.str_val, n3.str_val); :
    [all...]

Completed in 496 milliseconds

1 23 4 5 6 7 8 91011>>