| /aosp_15_r20/system/tools/aidl/tests/golden_output/frozen/aidl-test-extras-java-source/gen/android/aidl/tests/map/ |
| D | IMapTest.java | 144 int N = data.readInt(); in onTransact() local
162 _result.forEach((k, v) -> { in onTransact() argument
171 _arg1.forEach((k, v) -> { in onTransact() argument
182 int N = data.readInt(); in onTransact() local
200 _result.forEach((k, v) -> { in onTransact() argument
209 _arg1.forEach((k, v) -> { in onTransact() argument
220 int N = data.readInt(); in onTransact() local
238 _result.forEach((k, v) -> { in onTransact() argument
247 _arg1.forEach((k, v) -> { in onTransact() argument
258 int N = data.readInt(); in onTransact() local
[all …]
|
| D | Foo.java | 40 intEnumArrayMap.forEach((k, v) -> { in writeToParcel() argument
49 intArrayMap.forEach((k, v) -> { in writeToParcel() argument
58 barMap.forEach((k, v) -> { in writeToParcel() argument
67 barArrayMap.forEach((k, v) -> { in writeToParcel() argument
76 stringMap.forEach((k, v) -> { in writeToParcel() argument
85 stringArrayMap.forEach((k, v) -> { in writeToParcel() argument
94 interfaceMap.forEach((k, v) -> { in writeToParcel() argument
103 ibinderMap.forEach((k, v) -> { in writeToParcel() argument
121 int N = _aidl_parcel.readInt(); in readFromParcel() local
132 int N = _aidl_parcel.readInt(); in readFromParcel() local
[all …]
|
| /aosp_15_r20/system/tools/aidl/tests/golden_output/aidl-test-extras-java-source/gen/android/aidl/tests/map/ |
| D | IMapTest.java | 144 int N = data.readInt(); in onTransact() local
162 _result.forEach((k, v) -> { in onTransact() argument
171 _arg1.forEach((k, v) -> { in onTransact() argument
182 int N = data.readInt(); in onTransact() local
200 _result.forEach((k, v) -> { in onTransact() argument
209 _arg1.forEach((k, v) -> { in onTransact() argument
220 int N = data.readInt(); in onTransact() local
238 _result.forEach((k, v) -> { in onTransact() argument
247 _arg1.forEach((k, v) -> { in onTransact() argument
258 int N = data.readInt(); in onTransact() local
[all …]
|
| D | Foo.java | 40 intEnumArrayMap.forEach((k, v) -> { in writeToParcel() argument
49 intArrayMap.forEach((k, v) -> { in writeToParcel() argument
58 barMap.forEach((k, v) -> { in writeToParcel() argument
67 barArrayMap.forEach((k, v) -> { in writeToParcel() argument
76 stringMap.forEach((k, v) -> { in writeToParcel() argument
85 stringArrayMap.forEach((k, v) -> { in writeToParcel() argument
94 interfaceMap.forEach((k, v) -> { in writeToParcel() argument
103 ibinderMap.forEach((k, v) -> { in writeToParcel() argument
121 int N = _aidl_parcel.readInt(); in readFromParcel() local
132 int N = _aidl_parcel.readInt(); in readFromParcel() local
[all …]
|
| /aosp_15_r20/external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| H A D | insert_iter_iter_iter.pass.cpp | 31 const int N = sizeof(a)/sizeof(a[0]); in main() local
40 for (std::size_t k = 0; k < N; ++j, ++k) in main() local
49 const int N = sizeof(a)/sizeof(a[0]); in main() local
58 for (std::size_t k = 0; k < N; ++j, ++k) in main() local
69 const unsigned N = sizeof(a)/sizeof(a[0]); in main() local
77 for (std::size_t k = 0; k < N; ++j, ++k) in main() local
88 const unsigned N = sizeof(a)/sizeof(a[0]); in main() local
96 for (std::size_t k = 0; k < N; ++j, ++k) in main() local
105 const int N = sizeof(a)/sizeof(a[0]); in main() local
114 for (std::size_t k = 0; k < N; ++j, ++k) in main() local
[all …]
|
| /aosp_15_r20/external/cronet/third_party/libc++/src/test/std/containers/sequences/vector/vector.modifiers/ |
| H A D | insert_iter_iter_iter.pass.cpp | 35 const int N = sizeof(a)/sizeof(a[0]); in tests() local
44 for (std::size_t k = 0; k < N; ++j, ++k) in tests() local
53 const int N = sizeof(a)/sizeof(a[0]); in tests() local
62 for (std::size_t k = 0; k < N; ++j, ++k) in tests() local
73 const unsigned N = sizeof(a)/sizeof(a[0]); in tests() local
81 for (std::size_t k = 0; k < N; ++j, ++k) in tests() local
92 const unsigned N = sizeof(a)/sizeof(a[0]); in tests() local
100 for (std::size_t k = 0; k < N; ++j, ++k) in tests() local
109 const int N = sizeof(a)/sizeof(a[0]); in tests() local
118 for (std::size_t k = 0; k < N; ++j, ++k) in tests() local
[all …]
|
| /aosp_15_r20/external/cronet/third_party/libc++/src/test/std/containers/sequences/vector.bool/ |
| H A D | insert_iter_iter_iter.pass.cpp | 28 const unsigned N = sizeof(a)/sizeof(a[0]); in tests() local
36 for (std::size_t k = 0; k < N; ++j, ++k) in tests() local
44 const unsigned N = sizeof(a)/sizeof(a[0]); in tests() local
52 for (std::size_t k = 0; k < N; ++j, ++k) in tests() local
62 const unsigned N = sizeof(a)/sizeof(a[0]); in tests() local
70 for (std::size_t k = 0; k < N; ++j, ++k) in tests() local
81 const unsigned N = sizeof(a)/sizeof(a[0]); in tests() local
89 for (std::size_t k = 0; k < N; ++j, ++k) in tests() local
98 const unsigned N = sizeof(a)/sizeof(a[0]); in tests() local
106 for (std::size_t k = 0; k < N; ++j, ++k) in tests() local
[all …]
|
| /aosp_15_r20/external/libcxx/test/std/containers/sequences/vector.bool/ |
| H A D | insert_iter_iter_iter.pass.cpp | 29 const unsigned N = sizeof(a)/sizeof(a[0]); in main() local
37 for (std::size_t k = 0; k < N; ++j, ++k) in main() local
45 const unsigned N = sizeof(a)/sizeof(a[0]); in main() local
53 for (std::size_t k = 0; k < N; ++j, ++k) in main() local
63 const unsigned N = sizeof(a)/sizeof(a[0]); in main() local
71 for (std::size_t k = 0; k < N; ++j, ++k) in main() local
82 const unsigned N = sizeof(a)/sizeof(a[0]); in main() local
90 for (std::size_t k = 0; k < N; ++j, ++k) in main() local
99 const unsigned N = sizeof(a)/sizeof(a[0]); in main() local
107 for (std::size_t k = 0; k < N; ++j, ++k) in main() local
[all …]
|
| /aosp_15_r20/device/google/contexthub/firmware/os/algos/common/math/ |
| D | mat.c | 104 uint32_t k; in mat33Multiply() local
187 uint32_t k; in mat33MultiplyTransposed() local
210 uint32_t k; in mat33MultiplyTransposed2() local
230 uint32_t i, k; in mat33Invert() local
290 const uint32_t N = 3; in mat33SwapRows() local
291 uint32_t k; in mat33SwapRows() local
310 const uint32_t N = 3; in mat33GetEigenbasis() local
311 uint32_t i, j, k, l, m; in mat33GetEigenbasis() local
423 uint32_t mat33Maxind(const struct Mat33 *A, uint32_t k) { in mat33Maxind()
425 const uint32_t N = 3; in mat33Maxind() local
[all …]
|
| /aosp_15_r20/external/tensorflow/tensorflow/core/lib/gtl/ |
| H A D | flatset.h | 58 : rep_(N, hf, eq) {} in rep_() argument
69 : FlatSet(N, hf, eq) { in FlatSet() argument
94 void reserve(size_t N) { rep_.Resize(std::max(N, size())); } in reserve()
95 void rehash(size_t N) { rep_.Resize(std::max(N, size())); } in rehash()
96 void resize(size_t N) { rep_.Resize(std::max(N, size())); } in resize()
172 size_t count(const Key& k) const { return rep_.Find(k).found ? 1 : 0; } in count()
173 iterator find(const Key& k) { in find()
177 const_iterator find(const Key& k) const { in find()
182 std::pair<iterator, bool> insert(const Key& k) { return Insert(k); } in insert()
183 std::pair<iterator, bool> insert(Key&& k) { return Insert(std::move(k)); } in insert()
[all …]
|
| H A D | flatmap.h | 75 : rep_(N, hf, eq) {} in rep_() argument
86 : FlatMap(N, hf, eq) { in FlatMap() argument
111 void reserve(size_t N) { rep_.Resize(std::max(N, size())); } in reserve()
112 void rehash(size_t N) { rep_.Resize(std::max(N, size())); } in rehash()
113 void resize(size_t N) { rep_.Resize(std::max(N, size())); } in resize()
218 size_t count(const Key& k) const { return rep_.Find(k).found ? 1 : 0; } in count()
219 iterator find(const Key& k) { in find()
223 const_iterator find(const Key& k) const { in find()
228 Val& at(const Key& k) { in at()
233 const Val& at(const Key& k) const { in at()
[all …]
|
| /aosp_15_r20/external/pytorch/test/cpp/tensorexpr/ |
| H A D | test_memplanning.cpp | 92 int N = 4; in TEST() local
102 [&](const ExprHandle& m, const ExprHandle& n, const ExprHandle& k) { in TEST()
105 {K}); in TEST()
171 for (const auto k : c10::irange(K)) { in TEST() local
176 for (const auto k : c10::irange(K)) { in TEST() local
203 int N = 4; in TEST() local
213 [&](const ExprHandle& m, const ExprHandle& n, const ExprHandle& k) { in TEST()
216 {K}); in TEST()
285 for (const auto k : c10::irange(K)) { in TEST() local
290 for (const auto k : c10::irange(K)) { in TEST() local
[all …]
|
| /aosp_15_r20/external/cronet/third_party/libc++/src/test/std/containers/sequences/deque/deque.modifiers/ |
| H A D | insert_size_value.pass.cpp | 67 testN(int start, int N, int M) in testN()
127 for (int k = 0; k < i; ++k, ++it) in self_reference_test() local
129 for (int k = 0; k < 5; ++k, ++it) in self_reference_test() local
131 for (int k = i; k < 20; ++k, ++it) in self_reference_test() local
141 const int N = sizeof(rng)/sizeof(rng[0]); in main() local
144 for (int k = 0; k < N; ++k) in main() local
151 const int N = sizeof(rng)/sizeof(rng[0]); in main() local
154 for (int k = 0; k < N; ++k) in main() local
160 const int N = sizeof(rng)/sizeof(rng[0]); in main() local
163 for (int k = 0; k < N; ++k) in main() local
|
| /aosp_15_r20/external/eigen/bench/btl/libs/blitz/ |
| H A D | blitz_interface.hh | 50 static void free_matrix(gene_matrix & A, int N){} in free_matrix()
77 int N=A_stl.size(); in matrix_to_stl() local
85 …ne void matrix_matrix_product(const gene_matrix & A, const gene_matrix & B, gene_matrix & X, int N) in matrix_matrix_product()
89 thirdIndex k; in matrix_matrix_product() local
93 static inline void ata_product(const gene_matrix & A, gene_matrix & X, int N) in ata_product()
97 thirdIndex k; in ata_product() local
101 static inline void aat_product(const gene_matrix & A, gene_matrix & X, int N) in aat_product()
105 thirdIndex k; in aat_product() local
109 static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N) in matrix_vector_product()
116 static inline void atv_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N) in atv_product()
[all …]
|
| /aosp_15_r20/external/flac/src/libFLAC/ |
| H A D | window.c | 52 const FLAC__int32 N = L - 1; in FLAC__window_bartlett() local
71 const FLAC__int32 N = L - 1; in FLAC__window_bartlett_hann() local
80 const FLAC__int32 N = L - 1; in FLAC__window_blackman() local
90 const FLAC__int32 N = L - 1; in FLAC__window_blackman_harris_4term_92db_sidelobe() local
99 const FLAC__int32 N = L - 1; in FLAC__window_connes() local
104 double k = ((double)n - N2) / N2; in FLAC__window_connes() local
112 const FLAC__int32 N = L - 1; in FLAC__window_flattop() local
121 const FLAC__int32 N = L - 1; in FLAC__window_gauss() local
131 const double k = ((double)n - N2) / (stddev * N2); in FLAC__window_gauss() local
139 const FLAC__int32 N = L - 1; in FLAC__window_hamming() local
[all …]
|
| /aosp_15_r20/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
| H A D | eval.pass.cpp | 53 const int N = 1000000; in test1() local
80 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test1() local
105 const int N = 1000000; in test2() local
132 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test2() local
157 const size_t N = 1000000; in test3() local
184 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test3() local
209 const int N = 1000000; in test4() local
236 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test4() local
262 const int N = 1000000; in test5() local
290 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test5() local
[all …]
|
| /aosp_15_r20/external/cronet/third_party/libc++/src/test/std/numerics/rand/rand.dist/rand.dist.samp/rand.dist.samp.plinear/ |
| H A D | eval.pass.cpp | 52 const int N = 1000000; in test1() local
79 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test1() local
104 const int N = 1000000; in test2() local
131 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test2() local
156 const std::size_t N = 1000000; in test3() local
183 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test3() local
208 const int N = 1000000; in test4() local
235 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test4() local
261 const int N = 1000000; in test5() local
289 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test5() local
[all …]
|
| /aosp_15_r20/frameworks/av/media/module/codecs/amrwb/enc/src/ |
| H A D | q_pulse.c | 34 Word16 N) /* (i) number of bits for position */ in quant_1p_N1()
55 Word16 N) /* (i) number of bits for position */ in quant_2p_2N1()
111 Word16 N) /* (i) number of bits for position */ in quant_3p_3N1()
153 Word16 N) /* (i) number of bits for position */ in quant_4p_4N1()
190 Word16 N) /* (i) number of bits for position */ in quant_4p_4N()
194 Word32 i, j, k, index; in quant_4p_4N() local
256 Word16 N) /* (i) number of bits for position */ in quant_5p_5N()
260 Word32 i, j, k, index, tmp2; in quant_5p_5N() local
330 Word16 N) /* (i) number of bits for position */ in quant_6p_6N_2()
334 Word32 i, j, k, index; in quant_6p_6N_2() local
|
| /aosp_15_r20/external/ComputeLibrary/src/core/NEON/kernels/ |
| H A D | NEFFTRadixStageKernel.cpp | 355 …oat *out, float *in, unsigned int Nx, unsigned int NxRadix, const float32x2_t &w_m, unsigned int N) in fft_radix_2_axes_0()
360 for(unsigned int k = 2 * j; k < 2 * N; k += 2 * NxRadix) in fft_radix_2_axes_0() local
397 … *in, unsigned int Nx, unsigned int NxRadix, const float32x2_t &w_m, unsigned int N, unsigned int … in fft_radix_2_axes_1()
402 for(unsigned int k = 2 * j; k < 2 * M; k += 2 * NxRadix) in fft_radix_2_axes_1() local
421 …oat *out, float *in, unsigned int Nx, unsigned int NxRadix, const float32x2_t &w_m, unsigned int N) in fft_radix_3_axes_0()
428 for(unsigned int k = 2 * j; k < 2 * N; k += 2 * NxRadix) in fft_radix_3_axes_0() local
465 … *in, unsigned int Nx, unsigned int NxRadix, const float32x2_t &w_m, unsigned int N, unsigned int … in fft_radix_3_axes_1()
472 for(unsigned int k = 2 * j; k < 2 * M; k += 2 * NxRadix) in fft_radix_3_axes_1() local
492 …oat *out, float *in, unsigned int Nx, unsigned int NxRadix, const float32x2_t &w_m, unsigned int N) in fft_radix_4_axes_0()
500 for(unsigned int k = 2 * j; k < 2 * N; k += 2 * NxRadix) in fft_radix_4_axes_0() local
[all …]
|
| /aosp_15_r20/external/eigen/bench/btl/libs/STL/ |
| H A D | STL_interface.hh | 68 static inline void copy_vector(const gene_vector & source, gene_vector & cible, int N){ in copy_vector()
75 static inline void copy_matrix(const gene_matrix & source, gene_matrix & cible, int N){ in copy_matrix()
81 static inline void ata_product(const gene_matrix & A, gene_matrix & X, int N) in ata_product()
87 for (int k=0;k<N;k++) in ata_product() local
94 static inline void aat_product(const gene_matrix & A, gene_matrix & X, int N) in aat_product()
102 for (int k=0;k<N;k++){ in aat_product() local
112 …ne void matrix_matrix_product(const gene_matrix & A, const gene_matrix & B, gene_matrix & X, int N) in matrix_matrix_product()
118 for (int k=0;k<N;k++) in matrix_matrix_product() local
125 static inline void matrix_vector_product(gene_matrix & A, gene_vector & B, gene_vector & X, int N) in matrix_vector_product()
136 static inline void symv(gene_matrix & A, gene_vector & B, gene_vector & X, int N) in symv()
[all …]
|
| /aosp_15_r20/external/ComputeLibrary/tests/validation/reference/ |
| H A D | DFT.cpp | 52 void rdft_1d_step(const T *src_ptr, size_t N, T *dst_ptr, size_t K) in rdft_1d_step()
57 for(unsigned int k = 0; k < K; ++k) in rdft_1d_step() local
82 void dft_1d_step(const T *src_ptr, T *dst_ptr, size_t N) in dft_1d_step()
87 for(unsigned int k = 0; k < N; ++k) in dft_1d_step() local
116 void irdft_1d_step(const T *src_ptr, size_t K, T *dst_ptr, size_t N) in irdft_1d_step()
127 for(unsigned int k = 0; k < K; ++k) in irdft_1d_step() local
134 for(unsigned int k = 0; k < Nleft; ++k) in irdft_1d_step() local
152 void idft_1d_step(const T *src_ptr, T *dst_ptr, size_t N) in idft_1d_step()
161 for(unsigned int k = 0; k < N; ++k) in idft_1d_step() local
186 const unsigned int N = src.shape()[0]; in rdft_1d_core() local
[all …]
|
| /aosp_15_r20/external/cronet/third_party/libc++/src/test/std/containers/sequences/deque/deque.cons/ |
| H A D | assign_iter_iter.pass.cpp | 61 testN(int start, int N, int M) in testN()
83 testNI(int start, int N, int M) in testNI()
94 const int N = sizeof(rng)/sizeof(rng[0]); in basic_test() local
97 for (int k = 0; k < N; ++k) in basic_test() local
104 const int N = sizeof(rng)/sizeof(rng[0]); in basic_test() local
107 for (int k = 0; k < N; ++k) in basic_test() local
113 const int N = sizeof(rng)/sizeof(rng[0]); in basic_test() local
116 for (int k = 0; k < N; ++k) in basic_test() local
|
| /aosp_15_r20/external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| H A D | insert_size_value.pass.cpp | 66 testN(int start, int N, int M) in testN()
126 for (int k = 0; k < i; ++k, ++it) in self_reference_test() local
128 for (int k = 0; k < 5; ++k, ++it) in self_reference_test() local
130 for (int k = i; k < 20; ++k, ++it) in self_reference_test() local
140 const int N = sizeof(rng)/sizeof(rng[0]); in main() local
143 for (int k = 0; k < N; ++k) in main() local
150 const int N = sizeof(rng)/sizeof(rng[0]); in main() local
153 for (int k = 0; k < N; ++k) in main() local
|
| /aosp_15_r20/external/cronet/third_party/libc++/src/test/std/containers/sequences/deque/deque.capacity/ |
| H A D | resize_size.pass.cpp | 67 testN(int start, int N, int M) in testN()
77 const int N = sizeof(rng)/sizeof(rng[0]); in main() local
80 for (int k = 0; k < N; ++k) in main() local
86 const int N = sizeof(rng)/sizeof(rng[0]); in main() local
89 for (int k = 0; k < N; ++k) in main() local
94 const int N = sizeof(rng)/sizeof(rng[0]); in main() local
97 for (int k = 0; k < N; ++k) in main() local
|
| H A D | resize_size_value.pass.cpp | 67 testN(int start, int N, int M) in testN()
77 const int N = sizeof(rng)/sizeof(rng[0]); in main() local
80 for (int k = 0; k < N; ++k) in main() local
86 const int N = sizeof(rng)/sizeof(rng[0]); in main() local
89 for (int k = 0; k < N; ++k) in main() local
94 const int N = sizeof(rng)/sizeof(rng[0]); in main() local
97 for (int k = 0; k < N; ++k) in main() local
|