Home
last modified time | relevance | path

Searched +full:- +full:j (Results 1 – 25 of 1250) sorted by relevance

12345678910>>...50

/external/toybox/tests/files/bc/
Dbessel.txt1 j(0, 0)
2 j(0, .5)
3 j(0, -.5)
4 j(0, 1)
5 j(0, -1)
6 j(0, 1.5)
7 j(0, -1.5)
8 j(0, 1.74)
9 j(0, -1.74)
10 j(0, 2)
[all …]
/external/clang/test/SemaCXX/
Dcomplex-folding.cpp1 // RUN: %clang_cc1 %s -std=c++1z -fsyntax-only -verify
5 static_assert((0.0 + 0.0j) == (0.0 + 0.0j));
6 static_assert((0.0 + 0.0j) != (0.0 + 0.0j)); // expected-error {{static_assert}}
8 static_assert((0.0 + 0.0j) == 0.0);
9 static_assert(0.0 == (0.0 + 0.0j));
10 static_assert(0.0 == 0.0j);
11 static_assert((0.0 + 1.0j) != 0.0);
12 static_assert(1.0 != (0.0 + 0.0j));
13 static_assert(0.0 != 1.0j);
17 static_assert((1.0 + 0.0j) == (0.0 + 0.0j)); // expected-error {{static_assert}}
[all …]
/external/python/cpython2/Lib/
Dmarkupbase.py11 _declname_match = re.compile(r'[a-zA-Z][-_.a-zA-Z0-9]*\s*').match
13 _commentclose = re.compile(r'--\s*>')
16 # An analysis of the MS-Word extensions is available at
45 # Internal -- update line number and offset. This should be
46 # called for each piece of data exactly once, in order -- in other
49 def updatepos(self, i, j): argument
50 if i >= j:
51 return j
53 nlines = rawdata.count("\n", i, j)
56 pos = rawdata.rindex("\n", i, j) # Should not fail
[all …]
/external/python/cpython3/Lib/
D_markupbase.py10 _declname_match = re.compile(r'[a-zA-Z][-_.a-zA-Z0-9]*\s*').match
12 _commentclose = re.compile(r'--\s*>')
15 # An analysis of the MS-Word extensions is available at
44 # Internal -- update line number and offset. This should be
45 # called for each piece of data exactly once, in order -- in other
48 def updatepos(self, i, j): argument
49 if i >= j:
50 return j
52 nlines = rawdata.count("\n", i, j)
55 pos = rawdata.rindex("\n", i, j) # Should not fail
[all …]
/external/python/cpython3/Lib/test/
Dtest_complex.py31 def assertCloseAbs(self, x, y, eps=1e-9):
41 self.assertTrue(abs((x-y)/y) < eps)
66 def assertClose(self, x, y, eps=1e-9):
86 simple_real = [float(i) for i in range(-5, 6)]
94 self.check_div(complex(1e200, 1e200), 1+0j)
95 self.check_div(complex(1e-200, 1e-200), 1+0j)
102 self.assertRaises(ZeroDivisionError, complex.__truediv__, 1+1j, 0+0j)
104 # self.assertRaises(OverflowError, pow, 1e200+1j, 1e200+1j)
106 self.assertAlmostEqual(complex.__truediv__(2+0j, 1+1j), 1-1j)
107 self.assertRaises(ZeroDivisionError, complex.__truediv__, 1+1j, 0+0j)
[all …]
/external/libnetfilter_conntrack/src/conntrack/
Dbsf.c2 * (C) 2005-2011 by Pablo Neira Ayuso <pablo@netfilter.org>
173 .jt = jump_true - 1, in nfct_bsf_cmp_k_stack()
193 .jf = jump_false - 1, in nfct_bsf_cmp_k_stack_jf()
247 /* A = skb->data[X + k:word_size] */ in nfct_bsf_load_attr()
261 /* A = skb->data[X + k:word_size] */ in nfct_bsf_load_attr_offset()
297 /* X = offset to nlh->nlmsg_type */ in bsf_cmp_subsys()
302 /* A = skb->data[X+k:B] (subsys_id) */ in bsf_cmp_subsys()
325 unsigned int i, j; in add_state_filter_cta() local
330 /* XXX: 32 maximum states + 3 jumps in the three-level iteration */ in add_state_filter_cta()
334 return -1; in add_state_filter_cta()
[all …]
/external/mesa3d/src/gallium/drivers/softpipe/
Dsp_quad_depth_test.c21 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
64 unsigned j; in get_depth_stencil_values() local
65 const struct softpipe_cached_tile *tile = data->tile; in get_depth_stencil_values()
67 switch (data->format) { in get_depth_stencil_values()
69 for (j = 0; j < TGSI_QUAD_SIZE; j++) { in get_depth_stencil_values()
70 int x = quad->input.x0 % TILE_SIZE + (j & 1); in get_depth_stencil_values()
71 int y = quad->input.y0 % TILE_SIZE + (j >> 1); in get_depth_stencil_values()
72 data->bzzzz[j] = tile->data.depth16[y][x]; in get_depth_stencil_values()
76 for (j = 0; j < TGSI_QUAD_SIZE; j++) { in get_depth_stencil_values()
77 int x = quad->input.x0 % TILE_SIZE + (j & 1); in get_depth_stencil_values()
[all …]
/external/mesa3d/src/mesa/tnl/
Dt_vb_rendertmp.h2 * Mesa 3-D graphics library
4 * Copyright (C) 1999-2005 Brian Paul All Rights Reserved.
78 GLuint j; in TAG() local
83 for (j=start+1; j<count; j+=2 ) { in TAG()
85 if (ctx->Light.ProvokingVertex == GL_LAST_VERTEX_CONVENTION_EXT) in TAG()
86 RENDER_LINE( ELT(j-1), ELT(j) ); in TAG()
88 RENDER_LINE( ELT(j), ELT(j-1) ); in TAG()
99 GLuint j; in TAG() local
109 for (j=start+1; j<count; j++ ) { in TAG()
110 if (ctx->Light.ProvokingVertex == GL_LAST_VERTEX_CONVENTION_EXT) in TAG()
[all …]
/external/python/cpython2/Lib/test/
Dtest_complex.py11 # decorator for skipping tests on non-IEEE 754 platforms
35 def assertCloseAbs(self, x, y, eps=1e-9):
45 self.assertTrue(abs((x-y)/y) < eps)
70 def assertClose(self, x, y, eps=1e-9):
94 simple_real = [float(i) for i in xrange(-5, 6)]
102 self.check_div(complex(1e200, 1e200), 1+0j)
103 self.check_div(complex(1e-200, 1e-200), 1+0j)
110 self.assertRaises(ZeroDivisionError, complex.__div__, 1+1j, 0+0j)
112 # self.assertRaises(OverflowError, pow, 1e200+1j, 1e200+1j)
115 self.assertAlmostEqual(complex.__truediv__(2+0j, 1+1j), 1-1j)
[all …]
/external/minijail/
Dlibminijail.c2 * Use of this source code is governed by a BSD-style license that can be
38 #include "libminijail-private.h"
57 #define SECCOMP_MODE_FILTER 2 /* Uses user-supplied filter. */
72 /* New cgroup namespace might not be in linux-headers yet. */
203 static void run_hooks_or_die(const struct minijail *j,
206 static void free_mounts_list(struct minijail *j) in free_mounts_list() argument
208 while (j->mounts_head) { in free_mounts_list()
209 struct mountpoint *m = j->mounts_head; in free_mounts_list()
210 j->mounts_head = j->mounts_head->next; in free_mounts_list()
211 free(m->data); in free_mounts_list()
[all …]
/external/libcxx/test/std/containers/sequences/vector/vector.modifiers/
Dinsert_iter_size_value.pass.cpp1 //===----------------------------------------------------------------------===//
8 //===----------------------------------------------------------------------===//
31 int j; in main() local
32 for (j = 0; j < 10; ++j) in main()
33 assert(v[j] == 0); in main()
34 for (; j < 15; ++j) in main()
35 assert(v[j] == 1); in main()
36 for (++j; j < 105; ++j) in main()
37 assert(v[j] == 0); in main()
47 std::size_t j; in main() local
[all …]
Dpush_back.pass.cpp1 //===----------------------------------------------------------------------===//
8 //===----------------------------------------------------------------------===//
28 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local
29 assert(c[j] == j); in main()
33 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local
34 assert(c[j] == j); in main()
38 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local
39 assert(c[j] == j); in main()
43 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local
44 assert(c[j] == j); in main()
[all …]
Dpush_back_rvalue.pass.cpp1 //===----------------------------------------------------------------------===//
8 //===----------------------------------------------------------------------===//
31 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local
32 assert(c[j] == MoveOnly(j)); in main()
36 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local
37 assert(c[j] == MoveOnly(j)); in main()
41 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local
42 assert(c[j] == MoveOnly(j)); in main()
46 for (int j = 0; static_cast<std::size_t>(j) < c.size(); ++j) in main() local
47 assert(c[j] == MoveOnly(j)); in main()
[all …]
Dinsert_iter_iter_iter.pass.cpp1 //===----------------------------------------------------------------------===//
8 //===----------------------------------------------------------------------===//
37 int j; in main() local
38 for (j = 0; j < 10; ++j) in main()
39 assert(v[j] == 0); in main()
40 for (std::size_t k = 0; k < N; ++j, ++k) in main()
41 assert(v[j] == a[k]); in main()
42 for (; j < 105; ++j) in main()
43 assert(v[j] == 0); in main()
55 int j; in main() local
[all …]
/external/webrtc/webrtc/common_audio/
Dfft4g.c2 * http://www.kurims.kyoto-u.ac.jp/~ooura/fft.html
3 * Copyright Takuya OOURA, 1996-2001
27 dfst: Sine Transform of RDFT (Real Anti-symmetric DFT)
37 -------- Complex DFT (Discrete Fourier Transform) --------
40 X[k] = sum_j=0^n-1 x[j]*exp(2*pi*i*j*k/n), 0<=k<n
42 X[k] = sum_j=0^n-1 x[j]*exp(-2*pi*i*j*k/n), 0<=k<n
43 (notes: sum_j=0^n-1 is a summation from j=0 to n-1)
50 cdft(2*n, -1, a, ip, w);
54 a[0...2*n-1] :input/output data (float *)
56 a[2*j] = Re(x[j]),
[all …]
/external/libaom/libaom/aom_dsp/
Dblend_a64_mask.c28 // Thus, in order to avoid double-rounding, we want to use normal right shifts
33 // In contrast, the output of the non-d16 functions will not be further rounded,
41 int i, j; in aom_lowbd_blend_a64_d16_mask_c() local
43 const int offset_bits = bd + 2 * FILTER_BITS - conv_params->round_0; in aom_lowbd_blend_a64_d16_mask_c()
44 const int round_offset = (1 << (offset_bits - conv_params->round_1)) + in aom_lowbd_blend_a64_d16_mask_c()
45 (1 << (offset_bits - conv_params->round_1 - 1)); in aom_lowbd_blend_a64_d16_mask_c()
47 2 * FILTER_BITS - conv_params->round_0 - conv_params->round_1; in aom_lowbd_blend_a64_d16_mask_c()
59 for (j = 0; j < w; ++j) { in aom_lowbd_blend_a64_d16_mask_c()
61 const int m = mask[i * mask_stride + j]; in aom_lowbd_blend_a64_d16_mask_c()
62 res = ((m * (int32_t)src0[i * src0_stride + j] + in aom_lowbd_blend_a64_d16_mask_c()
[all …]
/external/cblas/testing/
Dc_dblas2.c16 int i,j,LDA; in F77_dgemv() local
24 for( j=0; j<*n; j++ ) in F77_dgemv()
25 A[ LDA*i+j ]=a[ (*lda)*j+i ]; in F77_dgemv()
42 int i,j,LDA; in F77_dger() local
49 for( j=0; j<*n; j++ ) in F77_dger()
50 A[ LDA*i+j ]=a[ (*lda)*j+i ]; in F77_dger()
55 for( j=0; j<*n; j++ ) in F77_dger()
56 a[ (*lda)*j+i ]=A[ LDA*i+j ]; in F77_dger()
66 int i,j,LDA; in F77_dtrmv() local
79 for( j=0; j<*n; j++ ) in F77_dtrmv()
[all …]
Dc_sblas2.c16 int i,j,LDA; in F77_sgemv() local
24 for( j=0; j<*n; j++ ) in F77_sgemv()
25 A[ LDA*i+j ]=a[ (*lda)*j+i ]; in F77_sgemv()
42 int i,j,LDA; in F77_sger() local
49 for( j=0; j<*n; j++ ) in F77_sger()
50 A[ LDA*i+j ]=a[ (*lda)*j+i ]; in F77_sger()
55 for( j=0; j<*n; j++ ) in F77_sger()
56 a[ (*lda)*j+i ]=A[ LDA*i+j ]; in F77_sger()
66 int i,j,LDA; in F77_strmv() local
79 for( j=0; j<*n; j++ ) in F77_strmv()
[all …]
Dc_cblas2.c17 int i,j,LDA; in F77_cgemv() local
25 for( j=0; j<*n; j++ ){ in F77_cgemv()
26 A[ LDA*i+j ].real=a[ (*lda)*j+i ].real; in F77_cgemv()
27 A[ LDA*i+j ].imag=a[ (*lda)*j+i ].imag; in F77_cgemv()
47 int i,j,irow,jcol,LDA; in F77_cgbmv() local
55 irow=*ku+*kl-i; in F77_cgbmv()
56 jcol=(*ku)-i; in F77_cgbmv()
57 for( j=jcol; j<*n; j++ ){ in F77_cgbmv()
58 A[ LDA*(j-jcol)+irow ].real=a[ (*lda)*j+i ].real; in F77_cgbmv()
59 A[ LDA*(j-jcol)+irow ].imag=a[ (*lda)*j+i ].imag; in F77_cgbmv()
[all …]
Dc_zblas2.c17 int i,j,LDA; in F77_zgemv() local
25 for( j=0; j<*n; j++ ){ in F77_zgemv()
26 A[ LDA*i+j ].real=a[ (*lda)*j+i ].real; in F77_zgemv()
27 A[ LDA*i+j ].imag=a[ (*lda)*j+i ].imag; in F77_zgemv()
47 int i,j,irow,jcol,LDA; in F77_zgbmv() local
55 irow=*ku+*kl-i; in F77_zgbmv()
56 jcol=(*ku)-i; in F77_zgbmv()
57 for( j=jcol; j<*n; j++ ){ in F77_zgbmv()
58 A[ LDA*(j-jcol)+irow ].real=a[ (*lda)*j+i ].real; in F77_zgbmv()
59 A[ LDA*(j-jcol)+irow ].imag=a[ (*lda)*j+i ].imag; in F77_zgbmv()
[all …]
/external/libvpx/libvpx/third_party/googletest/src/include/gtest/internal/
Dgtest-param-util-generated.h.pump1 $$ -*- mode: c++; -*-
49 #include "gtest/internal/gtest-param-util.h"
50 #include "gtest/internal/gtest-port.h"
55 // include/gtest/gtest-param-test.h.
73 $range j 1..i
75 template <$for j, [[typename T$j]]>
78 $if i==1 [[explicit ]]ValueArray$i($for j, [[T$j v$j]]) : $for j, [[v$(j)_(v$j)]] {}
82 const T array[] = {$for j, [[static_cast<T>(v$(j)_)]]};
86 ValueArray$i(const ValueArray$i& other) : $for j, [[v$(j)_(other.v$(j)_)]] {}
89 // No implementation - assignment is unsupported.
[all …]
/external/python/cpython2/Demo/curses/
Drain.py10 def next_j(j): argument
11 if j == 0:
12 j = 4
14 j -= 1
23 return j
42 c = curses.COLS - 4
43 r = curses.LINES - 4
46 for j in range(4, -1, -1):
47 xpos[j] = randrange(0, c) + 2
48 ypos[j] = randrange(0, r) + 2
[all …]
/external/libaom/libaom/third_party/googletest/src/googletest/include/gtest/internal/
Dgtest-param-util-generated.h.pump1 $$ -*- mode: c++; -*-
51 #include "gtest/internal/gtest-param-util.h"
52 #include "gtest/internal/gtest-port.h"
59 // include/gtest/gtest-param-test.h.
77 $range j 1..i
79 template <$for j, [[typename T$j]]>
82 $if i==1 [[explicit ]]ValueArray$i($for j, [[T$j v$j]]) : $for j, [[v$(j)_(v$j)]] {}
86 const T array[] = {$for j, [[static_cast<T>(v$(j)_)]]};
91 // No implementation - assignment is unsupported.
94 $for j [[
[all …]
/external/mesa3d/src/gtest/include/gtest/internal/
Dgtest-param-util-generated.h.pump1 $$ -*- mode: c++; -*-
51 #include "gtest/internal/gtest-param-util.h"
52 #include "gtest/internal/gtest-port.h"
59 // include/gtest/gtest-param-test.h.
77 $range j 1..i
79 template <$for j, [[typename T$j]]>
82 $if i==1 [[explicit ]]ValueArray$i($for j, [[T$j v$j]]) : $for j, [[v$(j)_(v$j)]] {}
86 const T array[] = {$for j, [[static_cast<T>(v$(j)_)]]};
91 // No implementation - assignment is unsupported.
94 $for j [[
[all …]
/external/openssh/
Dsmult_curve25519_ref.c6 Derived from public domain code by D. J. Bernstein.
13 unsigned int j; in add() local
16 for (j = 0;j < 31;++j) { u += a[j] + b[j]; out[j] = u & 255; u >>= 8; } in add()
22 unsigned int j; in sub() local
25 for (j = 0;j < 31;++j) { in sub()
26 u += a[j] + 65280 - b[j]; in sub()
27 out[j] = u & 255; in sub()
30 u += a[31] - b[31]; in sub()
36 unsigned int j; in squeeze() local
39 for (j = 0;j < 31;++j) { u += a[j]; a[j] = u & 255; u >>= 8; } in squeeze()
[all …]

12345678910>>...50