Searched defs:n2 (Results 1 - 25 of 142) sorted by relevance

123456

/external/clang/test/SemaCXX/
H A Dpr18284-crash-on-invalid.cpp15 namespace n2 { namespace
24 } // namespace n2
/external/clang/test/Sema/
H A Dattr-section.c14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
/external/libutf/
H A Dutfutf.c29 long f, n1, n2; local
37 n2 = strlen(s2);
39 if(strncmp(p, s2, n2) == 0)
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/
H A Dp5.cpp4 alignas(1) alignas(2) int n2; // expected-error {{less than minimum alignment}} variable
H A Dp6.cpp6 alignas(8) int n2; // expected-note {{previous declaration}} variable
7 alignas(4) extern int n2; // expected-error {{different alignment requirement (4 vs 8)}}
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
H A Dp3-0x.cpp44 int n2 = f(0); member in namespace:std_example
/external/clang/test/FixIt/
H A Dfixit-vexing-parse.cpp84 int n2, // expected-note {{change this ',' to a ';' to call 'F1'}} local
/external/icu/icu4c/source/common/unicode/
H A Dnormalizer2.h451 * @param n2 wrapped Normalizer2 instance
455 FilteredNormalizer2(const Normalizer2 &n2, const UnicodeSet &filterSet) : argument
456 norm2(n2), set(filterSet) {}
/external/jmonkeyengine/engine/src/test/jme3test/model/shape/
H A DTestBillboard.java85 n2=new Node("parentParent");
86 n2.setLocalTranslation(Vector3f.UNIT_X.mult(5));
87 n2.attachChild(n);
89 rootNode.attachChild(n2);
96 Node n2; field in class:TestBillboard
102 n2.rotate(0, 0, -tpf);
/external/libcxx/test/std/strings/basic.string/string.modifiers/string_replace/
H A Dsize_size_size_char.pass.cpp13 // replace(size_type pos, size_type n1, size_type n2, charT c);
25 typename S::size_type n2, typename S::value_type c,
32 s.replace(pos, n1, n2, c);
37 typename S::size_type rlen = n2;
24 test(S s, typename S::size_type pos, typename S::size_type n1, typename S::size_type n2, typename S::value_type c, S expected) argument
H A Diter_iter_size_char.pass.cpp25 test(S s, typename S::size_type pos1, typename S::size_type n1, typename S::size_type n2, argument
32 s.replace(first, last, n2, c);
35 typename S::size_type rlen = n2;
H A Diter_iter_pointer_size.pass.cpp26 typename S::size_type n2, S expected)
32 s.replace(first, last, str, n2);
35 typename S::size_type rlen = n2;
25 test(S s, typename S::size_type pos1, typename S::size_type n1, const typename S::value_type* str, typename S::size_type n2, S expected) argument
H A Dsize_size_pointer_size.pass.cpp13 // replace(size_type pos, size_type n1, const charT* s, size_type n2);
27 const typename S::value_type* str, typename S::size_type n2,
34 s.replace(pos, n1, str, n2);
39 typename S::size_type rlen = n2;
26 test(S s, typename S::size_type pos, typename S::size_type n1, const typename S::value_type* str, typename S::size_type n2, S expected) argument
/external/v8/test/cctest/compiler/
H A Dtest-node.cc23 Node* n2 = graph.NewNode(&dummy_operator); local
24 CHECK(n2->id() != n1->id());
31 Node* n2 = graph.NewNode(&dummy_operator); local
33 CHECK(n2->op() == &dummy_operator);
40 Node* n2 = graph.NewNode(&dummy_operator, n0); local
41 CHECK_EQ(1, n2->InputCount());
42 CHECK(n0 == n2->InputAt(0));
50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
51 CHECK_EQ(2, n2->InputCount());
52 CHECK(n0 == n2
61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1); local
122 Node* n2 = graph.NewNode(&dummy_operator); local
136 Node* n2 = graph.NewNode(&dummy_operator, n0); local
184 Node* n2 = graph.NewNode(&dummy_operator); local
241 Node* n2 = graph.NewNode(&dummy_operator, n0); local
257 Node* n2 = graph.NewNode(&dummy_operator, n0); local
288 Node* n2 = graph.NewNode(&dummy_operator, n0); local
303 Node* n2 = graph.NewNode(&dummy_operator, n0); local
346 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
367 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
404 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
422 Node* n2 = graph.NewNode(&dummy_operator, n0); local
445 Node* n2 = graph.NewNode(&dummy_operator, n0); local
481 Node* n2 = graph.NewNode(&dummy_operator, n0); local
523 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
545 Node* n2 = graph.NewNode(&dummy_operator, n0); local
580 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
591 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
602 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
612 Node* n2 = graph.NewNode(&dummy_operator, n0, n0); local
621 Node* n2 = graph.NewNode(&dummy_operator, n0, n0); local
656 Node* n2 = graph.NewNode(&dummy_operator); local
672 Node* n2 = graph.NewNode(&dummy_operator); local
687 Node* n2 = graph.NewNode(&dummy_operator); local
700 Node* n2 = graph.NewNode(&dummy_operator); local
713 Node* n2 = graph.NewNode(&dummy_operator); local
732 Node* n2 = graph.NewNode(&dummy_operator, n0); local
747 Node* n2 = graph.NewNode(&dummy_operator, n0); local
761 Node* n2 = graph.NewNode(&dummy_operator, n0); local
773 Node* n2 = graph.NewNode(&dummy_operator, n0); local
785 Node* n2 = graph.NewNode(&dummy_operator, n0); local
803 Node* n2; local
[all...]
H A Dtest-schedule.cc47 Node* n2 = graph.NewNode(&dummy_operator); local
48 CHECK_EQ(NULL, schedule.block(n2));
/external/clang/test/Modules/
H A Dmacros2.c75 int n2 = TOP_OTHER_REDEF2; // ok variable
H A Dmacros.c168 int n2 = TOP_OTHER_REDEF2; // ok variable
/external/guava/guava-tests/benchmark/com/google/common/math/
H A DBigIntegerMathBenchmark.java68 * Returns the product of {@code n1} exclusive through {@code n2} inclusive.
70 private static BigInteger oldSlowFactorial(int n1, int n2) { argument
71 assert n1 <= n2;
72 if (IntMath.log2(n2, CEILING) * (n2 - n1) < Long.SIZE - 1) {
75 for (int i = n1 + 1; i <= n2; i++) {
85 int mid = (n1 + n2) >>> 1;
86 return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));
/external/apache-xml/src/main/java/org/apache/xalan/transformer/
H A DNodeSorter.java118 * @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
126 compare( NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support) argument
[all...]
/external/clang/test/CodeGenCXX/
H A Ddestructor-calls.cpp39 N n2; local
/external/icu/icu4c/source/samples/uciter8/
H A Duciter8.c44 UCharIterator *iter2, const char *n2) {
52 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
67 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2);
75 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
84 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
94 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
112 log_err("%s->move(start) failed\n", n2);
116 log_err("%s->hasNext() at the start returns FALSE\n", n2);
124 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
134 log_err("%s->hasNext() at the end returns TRUE\n", n2);
43 compareIterators(UCharIterator *iter1, const char *n1, UCharIterator *iter2, const char *n2) argument
[all...]
/external/icu/icu4j/main/classes/translit/src/com/ibm/icu/text/
H A DNormalizationTransliterator.java67 private NormalizationTransliterator(String id, Normalizer2 n2) { argument
69 norm2 = n2;
/external/libcxx/test/std/experimental/string.view/string.view.ops/
H A Dcompare.size_size_sv_pointer_size.pass.cpp14 // const charT* s, size_type n2) const;
25 const CharT *s2, size_t n2,
30 assert ( sign( sv1.compare(pos1, n1, s2, n2)) == sign(expected));
39 const CharT *s2, size_t n2,
44 test1 (sv1, pos1, n1, s2, n2, expected);
24 test1( std::experimental::basic_string_view<CharT> sv1, size_t pos1, size_t n1, const CharT *s2, size_t n2, int expected ) argument
38 test( const CharT *s1, size_t pos1, size_t n1, const CharT *s2, size_t n2, int expected ) argument
/external/libcxx/test/std/strings/basic.string/string.ops/string_compare/
H A Dsize_size_pointer_size.pass.cpp12 // int compare(size_type pos, size_type n1, const charT *s, size_type n2) const;
32 const typename S::value_type* str, typename S::size_type n2, int x)
36 assert(sign(s.compare(pos, n1, str, n2)) == sign(x));
31 test(const S& s, typename S::size_type pos, typename S::size_type n1, const typename S::value_type* str, typename S::size_type n2, int x) argument
/external/v8/src/compiler/
H A Dgraph.h35 Node* NewNode(const Operator* op, Node* n1, Node* n2) { argument
36 Node* nodes[] = {n1, n2};
39 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument
40 Node* nodes[] = {n1, n2, n3};
43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument
44 Node* nodes[] = {n1, n2, n3, n4};
47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
49 Node* nodes[] = {n1, n2, n3, n4, n5};
52 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
54 Node* nodes[] = {n1, n2, n
[all...]

Completed in 4376 milliseconds

123456