| /external/aac/libSBRenc/src/ |
| sbrenc_freq_sca.cpp | 405 INT k1 = 0, i; local
431 k1=2*k0;
433 num_bands0=numberOfBands(b_p_o, k0, k1, FL2FXCONST_DBL(0.5f));
434 num_bands1=numberOfBands(b_p_o, k1, k2, warp);
436 CalcBands(diff0, k0, k1, num_bands0);/*CalcBands1 => diff0 */
447 CalcBands(diff1, k1, k2, num_bands1); /* CalcBands2 => diff1 */
456 cumSum(k1, diff1, num_bands1, &v_k_master[num_bands0]);
462 k1=k2;
464 num_bands0=numberOfBands(b_p_o, k0, k1, FL2FXCONST_DBL(0.5f));
465 CalcBands(diff0, k0, k1, num_bands0);/* CalcBands1 => diff0 *
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableMultimap.java | 72 public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1) {
73 return ImmutableListMultimap.of(k1, v1);
79 public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1, K k2, V v2) {
80 return ImmutableListMultimap.of(k1, v1, k2, v2);
87 K k1, V v1, K k2, V v2, K k3, V v3) {
88 return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3);
95 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) {
96 return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3, k4, v4);
103 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) {
104 return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3, k4, v4, k5, v5)
[all...] |
| ImmutableSetMultimap.java | 72 public static <K, V> ImmutableSetMultimap<K, V> of(K k1, V v1) {
74 builder.put(k1, v1);
83 public static <K, V> ImmutableSetMultimap<K, V> of(K k1, V v1, K k2, V v2) {
85 builder.put(k1, v1);
96 K k1, V v1, K k2, V v2, K k3, V v3) {
98 builder.put(k1, v1);
110 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) {
112 builder.put(k1, v1);
125 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) {
127 builder.put(k1, v1)
[all...] |
| ImmutableSortedMap.java | 104 ImmutableSortedMap<K, V> of(K k1, V v1) {
106 ImmutableList.of(entryOf(k1, v1)), Ordering.natural());
117 of(K k1, V v1, K k2, V v2) {
119 .put(k1, v1).put(k2, v2).build();
130 of(K k1, V v1, K k2, V v2, K k3, V v3) {
132 .put(k1, v1).put(k2, v2).put(k3, v3).build();
143 of(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) {
145 .put(k1, v1).put(k2, v2).put(k3, v3).put(k4, v4).build();
156 of(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) {
158 .put(k1, v1).put(k2, v2).put(k3, v3).put(k4, v4).put(k5, v5).build()
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| ImmutableMultimap.java | 71 public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1) {
72 return ImmutableListMultimap.of(k1, v1);
78 public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1, K k2, V v2) {
79 return ImmutableListMultimap.of(k1, v1, k2, v2);
86 K k1, V v1, K k2, V v2, K k3, V v3) {
87 return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3);
94 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) {
95 return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3, k4, v4);
102 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) {
103 return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3, k4, v4, k5, v5)
[all...] |
| ImmutableSetMultimap.java | 67 public static <K, V> ImmutableSetMultimap<K, V> of(K k1, V v1) {
69 builder.put(k1, v1);
78 public static <K, V> ImmutableSetMultimap<K, V> of(K k1, V v1, K k2, V v2) {
80 builder.put(k1, v1);
91 K k1, V v1, K k2, V v2, K k3, V v3) {
93 builder.put(k1, v1);
105 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) {
107 builder.put(k1, v1);
120 K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) {
122 builder.put(k1, v1)
[all...] |
| ImmutableSortedMap.java | 93 of(K k1, V v1) {
94 return create(Ordering.natural(), entryOf(k1, v1));
98 of(K k1, V v1, K k2, V v2) {
100 .put(k1, v1).put(k2, v2).build();
104 of(K k1, V v1, K k2, V v2, K k3, V v3) {
106 .put(k1, v1).put(k2, v2).put(k3, v3).build();
110 of(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) {
112 .put(k1, v1).put(k2, v2).put(k3, v3).put(k4, v4).build();
116 of(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) {
118 .put(k1, v1).put(k2, v2).put(k3, v3).put(k4, v4).put(k5, v5).build()
[all...] |
| /packages/apps/Camera/jni/feature_stab/db_vlvm/ |
| db_metrics.h | 328 int k1=0; local
356 x_i[k1]=x_i[ind1];
357 x_i[k1+1]=x_i[ind1+1];
359 xp_i[k1]=xp_i[ind1];
360 xp_i[k1+1]=xp_i[ind1+1];
362 k1=k1+2;
|
| db_utilities_camera.h | 174 double k1,k2; local
176 k1=db_sqr(H[2])+db_sqr(H[5]);
178 if(k1>=k2)
180 return(db_SafeSqrt(db_SafeDivision(k1,1.0-db_sqr(H[8]))));
|
| /packages/apps/Gallery2/jni_mosaic/feature_stab/db_vlvm/ |
| db_metrics.h | 328 int k1=0; local
356 x_i[k1]=x_i[ind1];
357 x_i[k1+1]=x_i[ind1+1];
359 xp_i[k1]=xp_i[ind1];
360 xp_i[k1+1]=xp_i[ind1+1];
362 k1=k1+2;
|
| db_utilities_camera.h | 174 double k1,k2; local
176 k1=db_sqr(H[2])+db_sqr(H[5]);
178 if(k1>=k2)
180 return(db_SafeSqrt(db_SafeDivision(k1,1.0-db_sqr(H[8]))));
|
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_metrics.h | 328 int k1=0; local
356 x_i[k1]=x_i[ind1];
357 x_i[k1+1]=x_i[ind1+1];
359 xp_i[k1]=xp_i[ind1];
360 xp_i[k1+1]=xp_i[ind1+1];
362 k1=k1+2;
|
| db_utilities_camera.h | 174 double k1,k2; local
176 k1=db_sqr(H[2])+db_sqr(H[5]);
178 if(k1>=k2)
180 return(db_SafeSqrt(db_SafeDivision(k1,1.0-db_sqr(H[8]))));
|
| /external/eigen/Eigen/src/Core/products/ |
| TriangularSolverMatrix.h | 103 for (Index k1=0; k1<actual_kc; k1+=SmallPanelWidth)
105 Index actualPanelWidth = std::min<Index>(actual_kc-k1, SmallPanelWidth);
110 Index i = IsLower ? k2+k1+k : k2-k1-k-1;
111 Index s = IsLower ? k2+k1 : i+1;
139 Index lengthTarget = actual_kc-k1-actualPanelWidth;
140 Index startBlock = IsLower ? k2+k1 : k2-k1-actualPanelWidth
[all...] |
| TriangularMatrixMatrix.h | 157 for (Index k1=0; k1<actual_kc; k1+=SmallPanelWidth)
159 Index actualPanelWidth = std::min<Index>(actual_kc-k1, SmallPanelWidth);
160 Index lengthTarget = IsLower ? actual_kc-k1-actualPanelWidth : k1;
161 Index startBlock = actual_k2+k1;
162 Index blockBOffset = k1;
182 Index startTarget = IsLower ? actual_k2+k1+actualPanelWidth : actual_k2;
|
| /external/skia/legacy/src/utils/ |
| SkBase64.cpp | 138 int k1 = 0;
144 k1 = b >> 4;
148 *dst++ = encode[(k1 | a << 4) & 0x3F];
|
| /external/skia/src/utils/ |
| SkBase64.cpp | 138 int k1 = 0;
144 k1 = b >> 4;
148 *dst++ = encode[(k1 | a << 4) & 0x3F];
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/sec/ |
| SECNamedCurves.java | 476 int k1 = 2;
486 ECCurve curve = new ECCurve.F2m(m, k1, k2, k3, a, b, n, h);
505 int k1 = 2;
515 ECCurve curve = new ECCurve.F2m(m, k1, k2, k3, a, b, n, h);
534 int k1 = 3;
544 ECCurve curve = new ECCurve.F2m(m, k1, k2, k3, a, b, n, h);
563 int k1 = 3;
573 ECCurve curve = new ECCurve.F2m(m, k1, k2, k3, a, b, n, h);
592 int k1 = 3;
602 ECCurve curve = new ECCurve.F2m(m, k1, k2, k3, a, b, n, h)
[all...] |
| /external/chromium/testing/gmock/include/gmock/ |
| gmock-generated-matchers.h | 64 template <class Tuple, int k0 = -1, int k1 = -1, int k2 = -1, int k3 = -1,
70 template <class Tuple, int k0, int k1, int k2, int k3, int k4, int k5, int k6,
75 GMOCK_FIELD_TYPE_(Tuple, k1), GMOCK_FIELD_TYPE_(Tuple, k2),
82 return type(get<k0>(t), get<k1>(t), get<k2>(t), get<k3>(t), get<k4>(t),
109 template <class Tuple, int k0, int k1>
110 class TupleFields<Tuple, k0, k1, -1, -1, -1, -1, -1, -1, -1, -1> {
113 GMOCK_FIELD_TYPE_(Tuple, k1)> type;
116 return type(get<k0>(t), get<k1>(t));
120 template <class Tuple, int k0, int k1, int k2>
121 class TupleFields<Tuple, k0, k1, k2, -1, -1, -1, -1, -1, -1, -1>
[all...] |
| /external/openfst/src/include/fst/ |
| bi-table.h | 228 bool operator()(I k1, I k2) const {
229 if (k1 >= kCurrentKey && k2 >= kCurrentKey) {
230 return (*ht_->hash_equal_)(ht_->Key2Entry(k1), ht_->Key2Entry(k2));
232 return k1 == k2;
437 bool operator()(I k1, I k2) const {
438 if (k1 >= kCurrentKey && k2 >= kCurrentKey) {
439 return ht_->Key2Entry(k1) == ht_->Key2Entry(k2);
441 return k1 == k2;
|
| sparse-tuple-weight.h | 278 const K& k1 = (w1_it.Done()) ? w2_it.Value().first : w1_it.Value().first; local
282 if (k1 == k2) {
283 ret->Push(k1, operator_mapper.Map(k1, v1, v2));
286 } else if (k1 < k2) {
287 ret->Push(k1, operator_mapper.Map(k1, v1, v2_def));
306 const K& k1 = (w1_it.Done()) ? w2_it.Value().first : w1_it.Value().first; local
310 if (k1 == k2) {
314 } else if (k1 < k2)
[all...] |
| /external/clang/test/SemaCXX/ |
| address-of-temporary.cpp | 52 void k1() { consume(S { Y{}.a }); } function in namespace:PointerToArrayDecay
|
| /external/webkit/Source/WebCore/platform/audio/ |
| SincResampler.cpp | 176 float* k1 = m_kernelStorage.data() + offsetIndex * m_kernelSize; local
177 float* k2 = k1 + m_kernelSize;
196 sum1 += input * *k1; \
198 ++k1; \
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| NodeSorter.java | 497 NodeSortKey k1 = (NodeSortKey) m_keys.elementAt(0); local
498 XObject r = k1.m_selectPat.execute(m_execContext, node,
499 k1.m_namespaceContext);
503 if (k1.m_treatAsNumbers)
512 m_key1Value = k1.m_col.getCollationKey(r.str());
|
| /external/eigen/unsupported/test/ |
| FFTW.cpp | 40 for (size_t k1=0;k1<(size_t)timebuf.size();++k1) {
41 acc += promote( timebuf[k1] ) * exp( complex<long double>(0,k1*phinc) );
|
