Searched refs:n2 (Results 1 - 25 of 281) sorted by relevance

1234567891011>>

/external/v8/test/mjsunit/
H A Dthis-property-assignment.js40 var n2 = new Node();
41 assertEquals(3, n2.a);
/external/strace/tests/
H A Dsigaction.awk30 n2[1] = "SIG_IGN, \\[HUP INT\\], SA_RESTART"
33 n2[2] = "0x[0-9a-f]+, \\[QUIT TERM\\], SA_SIGINFO"
36 n2[3] = "SIG_DFL, \\[\\], 0"
39 n2[4] = "SIG_DFL, ~\\[HUP( ((RT|SIGRT)[^] ]+|[3-9][0-9]|1[0-9][0-9]))*\\], 0"
45 o2[i] = n2[i - 1]
55 "\\{" n2[i] "\\}, \\{" o2[i] "\\}, " a2 "|" \
56 "\\{" n2[i] "\\}, \\{" o2[i] "\\}, " a3 ")\\) = 0$"
/external/opencv3/modules/photo/src/
H A Darrays.hpp54 int n1,n2; member in struct:cv::Array2d
58 a(array2d.a), n1(array2d.n1), n2(array2d.n2), needToDeallocArray(false)
67 a(_a), n1(_n1), n2(_n2), needToDeallocArray(false)
72 n1(_n1), n2(_n2), needToDeallocArray(true)
74 a = new T[n1*n2];
85 return a + i*n2;
98 int n1,n2,n3; member in struct:cv::Array3d
102 a(_a), n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(false)
107 n1(_n1), n2(_n
134 int n1,n2,n3,n4; member in struct:cv::Array4d
[all...]
/external/v8/test/cctest/compiler/
H A Dtest-node.cc149 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
152 CHECK_USES(n0, n1, n2);
155 CHECK_INPUTS(n2, n0);
161 CHECK_USES(n2, NONE);
162 CHECK_USES(n3, n1, n2);
165 CHECK_INPUTS(n2, n3);
184 Node* n2 = graph.NewNode(&dummy_operator0); local
186 n1->ReplaceUses(n2);
190 CHECK_USES(n2, n1);
200 Node* n2 local
233 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
249 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
283 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
302 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
331 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local
362 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local
385 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local
413 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
437 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
466 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
502 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local
512 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local
522 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local
531 Node* n2 = graph.NewNode(&dummy_operator2, n0, n0); local
539 Node* n2 = graph.NewNode(&dummy_operator2, n0, n0); local
577 Node* n2 = graph.NewNode(&dummy_operator0); local
591 Node* n2 = graph.NewNode(&dummy_operator0); local
605 Node* n2 = graph.NewNode(&dummy_operator0); local
618 Node* n2 = graph.NewNode(&dummy_operator0); local
630 Node* n2 = graph.NewNode(&dummy_operator0); local
650 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
663 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
676 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
688 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
700 Node* n2 = graph.NewNode(&dummy_operator1, n0); local
720 Node* n2; local
[all...]
/external/libutf/
H A Dutfutf.c29 long f, n1, n2; local
37 n2 = strlen(s2);
39 if(strncmp(p, s2, n2) == 0)
/external/libcxx/test/std/localization/locales/locale/locale.operators/
H A Deq.pass.cpp24 std::locale n2(LOCALE_en_US_UTF_8);
32 assert(cloc != n2);
40 assert(copy != n2);
48 assert(n1 == n2);
53 assert(n2 != cloc);
54 assert(n2 != copy);
55 assert(n2 == n1);
56 assert(n2 == n2);
57 assert(n2 !
[all...]
/external/testng/src/test/java/test/tmp/
H A DTest_TestListenerAppender.java15 public void verifyData1(String n1, Integer n2) { argument
16 System.out.println(n1 + " " + n2);
/external/chromium-trace/catapult/telemetry/telemetry/util/
H A Dcolor_histogram.py28 n2 = sum_func(hist2)
29 if (n1 == 0 or n2 == 0) and default_color is None:
34 if n2 == 0:
36 n2 = 1
39 remainder = np.multiply(hist1, n2) - np.multiply(hist2, n1)
46 remainder += value1 * n2 - value2 * n1
51 return abs(float(total) / n1 / n2)
/external/clang/test/SemaCXX/
H A Dpr18284-crash-on-invalid.cpp15 namespace n2 { namespace
24 } // namespace n2
/external/selinux/libsepol/src/
H A Debitmap.c20 ebitmap_node_t *n1, *n2, *new, *prev; local
25 n2 = e2->node;
27 while (n1 || n2) {
34 if (n1 && n2 && n1->startbit == n2->startbit) {
36 new->map = n1->map | n2->map;
38 n2 = n2->next;
39 } else if (!n2 || (n1 && n1->startbit < n2
152 ebitmap_node_t *n1, *n2; local
202 ebitmap_node_t *n1, *n2; local
230 ebitmap_node_t *n2 = e2->node; local
[all...]
/external/webrtc/webrtc/system_wrappers/include/
H A Dntp_time.h55 inline bool operator==(const NtpTime& n1, const NtpTime& n2) { argument
56 return n1.seconds() == n2.seconds() && n1.fractions() == n2.fractions();
58 inline bool operator!=(const NtpTime& n1, const NtpTime& n2) { argument
59 return !(n1 == n2);
/external/boringssl/src/crypto/bn/
H A Dmul.c305 /* r is 2*n2 words in size,
306 * a and b are both n2 words in size.
307 * n2 must be a power of 2.
309 * t must be 2*n2 words in size
315 /* dnX may not be positive, but n2/2+dnX has to be */
316 static void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument
318 int n = n2 / 2, c1, c2;
323 /* Only call bn_mul_comba 8 if n2 == 8 and the
326 if (n2 == 8 && dna == 0 && dnb == 0) {
332 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMA
450 int i, j, n2 = n * 2; local
724 bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) argument
[all...]
/external/icu/icu4c/source/common/
H A Dunorm.cpp49 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
50 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
57 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
59 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
64 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
72 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
73 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
80 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
82 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
87 return unorm2_isNormalized((const UNormalizer2 *)n2, sr
99 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
115 _iterate(UCharIterator *src, UBool forward, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UBool doNormalize, UBool *pNeededToNormalize, UErrorCode *pErrorCode) argument
180 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
223 _concatenate(const UChar *left, int32_t leftLength, const UChar *right, int32_t rightLength, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UErrorCode *pErrorCode) argument
264 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
[all...]
/external/bzip2/
H A Dbzmore16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
/external/elfutils/libelf/
H A Delf32_fsize.c67 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
/external/v8/test/mjsunit/compiler/
H A Dosr-infinite.js29 function n2() { function
73 test(n2);
/external/clang/test/Sema/
H A Dattr-section.c14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
/external/google-breakpad/src/testing/gtest/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
/external/protobuf/gtest/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
/external/v8/src/compiler/
H A Dgraph.h68 Node* NewNode(const Operator* op, Node* n1, Node* n2) { argument
69 Node* nodes[] = {n1, n2};
72 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument
73 Node* nodes[] = {n1, n2, n3};
76 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument
77 Node* nodes[] = {n1, n2, n3, n4};
80 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
82 Node* nodes[] = {n1, n2, n3, n4, n5};
85 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
87 Node* nodes[] = {n1, n2, n
90 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7) argument
95 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8) argument
100 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9) argument
[all...]
/external/vulkan-validation-layers/tests/gtest-1.7.0/samples/
H A Dsample3_unittest.cc105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
/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/v8/test/unittests/compiler/
H A Dnode-unittest.cc56 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local
58 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1, n2));
59 EXPECT_THAT(n1->uses(), UnorderedElementsAre(n2));
60 EXPECT_EQ(2, n2->InputCount());
61 EXPECT_EQ(n0, n2->InputAt(0));
62 EXPECT_EQ(n1, n2->InputAt(1));
83 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local
84 EXPECT_THAT(n2->inputs(), ElementsAre(n0, n1));
105 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local
106 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1, n2));
118 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local
139 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local
173 Node* n2 = Node::New(zone(), 2, &kOp0, 0, nullptr, false); local
196 node->AppendInput(zone(), n2); local
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/
H A DTTestImpl.java228 * &nbsp;&nbsp;<code> t = (m1 - m2) / (sqrt(1/n1 +1/n2) sqrt(var))</code>
231 * <strong><code> n2</code></strong> is the size of second sample;
237 * <code>var = sqrt(((n1 - 1)var1 + (n2 - 1)var2) / ((n1-1) + (n2-1)))</code>
270 * &nbsp;&nbsp; <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
273 * <strong><code> n2</code></strong> is the size of the second sample;
309 * &nbsp;&nbsp; <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
312 * <strong><code> n2</code></strong> is the size of the second sample;
350 * &nbsp;&nbsp;<code> t = (m1 - m2) / (sqrt(1/n1 +1/n2) sqrt(var))</code>
353 * <strong><code> n2</cod
898 df(double v1, double v2, double n1, double n2) argument
930 t(double m1, double m2, double v1, double v2, double n1, double n2) argument
947 homoscedasticT(double m1, double m2, double v1, double v2, double n1, double n2) argument
985 tTest(double m1, double m2, double v1, double v2, double n1, double n2) argument
1010 homoscedasticTTest(double m1, double m2, double v1, double v2, double n1, double n2) argument
[all...]
/external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/
H A Dtest_object_graph.py51 n2 = Node("n2")
61 graph.addNode(n2)
71 self.assertTrue(graph.findNode(n2) is n2)
74 self.assertTrue(graph.findNode("n2") is n2)
111 n2 = graph.createNode(ArgNode, "n2", 1)
115 graph.createReference(n1, n2, "n
[all...]

Completed in 1064 milliseconds

1234567891011>>