| /external/drrickorang/LoopbackApp/app/src/main/java/org/drrickorang/loopback/ |
| FFT.java | 63 int i, j, k, n1, n2, a; local
68 n2 = mFFTSamplingSize / 2;
70 n1 = n2;
89 n2 = 1;
92 n1 = n2;
93 n2 = n2 + n2;
101 for (k = j; k < mFFTSamplingSize; k = k + n2) {
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| array3d.h | 41 // Creates an array of dimensions n1 x n2 x n3, uninitialized values.
42 Array3D(const int64 n1, const int64 n2, const int64 n3)
43 : Array<T>(std::vector<int64>{n1, n2, n3}) {}
45 // Creates an array of dimensions n1 x n2 x n3, initialized to value.
46 Array3D(const int64 n1, const int64 n2, const int64 n3, const T value)
47 : Array<T>(std::vector<int64>{n1, n2, n3}, value) {}
55 // results in an array with n1=3, n2=4, n3=2.
71 int64 n2() const { return this->dim(1); } function in class:xla::Array3D
|
| /external/webrtc/webrtc/system_wrappers/include/ |
| ntp_time.h | 55 inline bool operator==(const NtpTime& n1, const NtpTime& n2) {
56 return n1.seconds() == n2.seconds() && n1.fractions() == n2.fractions();
58 inline bool operator!=(const NtpTime& n1, const NtpTime& n2) {
59 return !(n1 == n2);
|
| /external/boringssl/src/crypto/fipsmodule/bn/ |
| mul.c | 285 // r is 2*n2 words in size,
286 // a and b are both n2 words in size.
287 // n2 must be a power of 2.
289 // t must be 2*n2 words in size
294 // dnX may not be positive, but n2/2+dnX has to be
296 int n2, int dna, int dnb, BN_ULONG *t) {
297 int n = n2 / 2, c1, c2;
302 // Only call bn_mul_comba 8 if n2 == 8 and the
304 if (n2 == 8 && dna == 0 && dnb == 0) {
310 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL)
430 int i, j, n2 = n * 2; local
[all...] |
| /external/icu/icu4c/source/common/ |
| unorm.cpp | 51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
89 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode)
101 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
182 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
266 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
[all...] |
| /external/tensorflow/tensorflow/core/profiler/internal/ |
| tfprof_show.h | 82 [&opts](const T* n1, const T* n2) {
84 if (n2->name() == kTFProfRoot) return false;
85 bool name_cmp = n1->name() < n2->name();
90 n2->proto().total_requested_bytes();
93 n2->proto().total_peak_bytes();
96 n2->proto().total_residual_bytes();
99 n2->proto().total_output_bytes();
102 n2->proto().total_exec_micros();
105 n2->proto().total_accelerator_exec_micros();
108 n2->proto().total_cpu_exec_micros()
[all...] |
| /external/bzip2/ |
| bzmore | 16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
|
| /external/elfutils/libelf/ |
| elf32_fsize.c | 67 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
|
| /external/v8/src/compiler/ |
| graph.h | 70 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
71 Node* nodes[] = {n1, n2};
74 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
75 Node* nodes[] = {n1, n2, n3};
78 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
79 Node* nodes[] = {n1, n2, n3, n4};
82 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
84 Node* nodes[] = {n1, n2, n3, n4, n5};
87 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
89 Node* nodes[] = {n1, n2, n3, n4, n5, n6}
[all...] |
| /art/test/963-default-range-smali/src/ |
| Iface.java | 18 String n2,
|
| /external/clang/test/Sema/ |
| attr-section.c | 14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| sample3_unittest.cc | 105 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/googletest/googletest/samples/ |
| sample3_unittest.cc | 105 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/ |
| sample3_unittest.cc | 105 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/tensorflow/tensorflow/core/graph/ |
| algorithm.h | 33 bool operator()(const Node* n1, const Node* n2) const {
34 return n1->id() < n2->id();
40 bool operator()(const Node* n1, const Node* n2) const {
41 return n1->name() < n2->name();
|
| /external/v8/testing/gtest/samples/ |
| sample3_unittest.cc | 105 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/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| sample3_unittest.cc | 105 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());
|
| /libcore/ojluni/src/main/java/sun/misc/ |
| ASCIICaseInsensitiveComparator.java | 41 int n1=s1.length(), n2=s2.length(); local
42 int minLen = n1 < n2 ? n1 : n2;
55 return n1 - n2;
|
| /prebuilts/ndk/r16/sources/third_party/googletest/googletest/samples/ |
| sample3_unittest.cc | 105 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());
|
| /art/test/706-checker-scheduler/src/ |
| Main.java | 21 int n2; field in class:Main.ExampleObj
23 public ExampleObj(int n1, int n2) {
25 this.n2 = n2;
415 my_obj.n2++;
455 my_obj.n2++;
496 my_obj.n2++;
|
| /external/guava/guava-tests/benchmark/com/google/common/math/ |
| BigIntegerMathBenchmark.java | 68 * Returns the product of {@code n1} exclusive through {@code n2} inclusive.
70 private static BigInteger oldSlowFactorial(int n1, int n2) {
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));
|
| /prebuilts/go/darwin-x86/src/syscall/ |
| syscall_bsd_test.go | 27 n2, err := syscall.Getfsstat(data, flags)
28 t.Logf("Getfsstat([]syscall.Statfs_t, %d) = (%v, %v)", flags, n2, err)
32 if n != n2 {
33 t.Errorf("Getfsstat(nil) = %d, but subsequent Getfsstat(slice) = %d", n, n2)
41 for i, stat := range data[:n2] {
|
| /prebuilts/go/linux-x86/src/syscall/ |
| syscall_bsd_test.go | 27 n2, err := syscall.Getfsstat(data, flags)
28 t.Logf("Getfsstat([]syscall.Statfs_t, %d) = (%v, %v)", flags, n2, err)
32 if n != n2 {
33 t.Errorf("Getfsstat(nil) = %d, but subsequent Getfsstat(slice) = %d", n, n2)
41 for i, stat := range data[:n2] {
|
| /external/dtc/tests/ |
| path-references.c | 69 int n1, n2, n3, n4; local
77 n2 = fdt_path_offset(fdt, "/node2");
78 if (n2 < 0)
79 FAIL("fdt_path_offset(/node2): %s", fdt_strerror(n2));
82 check_ref(fdt, n2, "/node1");
|
| /external/libmojo/mojo/public/cpp/bindings/tests/ |
| equals_unittest.cc | 67 NamedRegionPtr n2(n1.Clone());
68 EXPECT_TRUE(n1.Equals(n2));
70 n2->rects = base::nullopt;
71 EXPECT_FALSE(n1.Equals(n2));
72 n2->rects.emplace();
73 EXPECT_FALSE(n1.Equals(n2));
75 n2->rects->push_back(CreateRect());
76 n2->rects->push_back(CreateRect());
77 EXPECT_FALSE(n1.Equals(n2));
79 n2->rects->resize(1)
[all...] |
