Sub (full) in projects: aosp_15_r20 - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched full:sub (Results 1 – 25 of 20388) sorted by relevance

12 3 4 5 6 7 8 9 10 >>...816

/aosp_15_r20/external/ltp/testcases/kernel/device-drivers/v4l/user_space/doc/spec/
H A D	r2492.htm	`338 >b<SUB 339 >1</SUB 342 >b<SUB 343 >0</SUB 346 >g<SUB 347 >2</SUB 350 >g<SUB 351 >1</SUB 354 >g<SUB 355 >0</SUB [all …]`
/aosp_15_r20/external/deqp/android/cts/main/vk-main-2024-03-01/
H A D	memory.txt	178 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.flush_map2 179 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.invalidate_map2 180 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.remap_map2 181 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.simple_map2 182 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subflush_map2 183 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subflush_overlapping_m… 184 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subflush_separate_map2 185 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subinvalidate_map2 186 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subinvalidate_overlapp… 187 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subinvalidate_separate… [all …]
/aosp_15_r20/external/swiftshader/tests/regres/testlists/vk-default/
H A D	memory.txt	912 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.flush 913 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.flush_map2 914 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.invalidate 915 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.invalidate_map2 916 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.remap 917 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.remap_map2 918 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.simple 919 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.simple_map2 920 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subflush 921 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subflush_map2 [all …]
/aosp_15_r20/external/deqp/external/vulkancts/mustpass/main/vk-default/
H A D	memory.txt	858 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.flush 859 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.flush_map2 860 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.invalidate 861 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.invalidate_map2 862 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.remap 863 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.remap_map2 864 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.simple 865 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.simple_map2 866 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subflush 867 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subflush_map2 [all …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/optimization/linear/
H A D	LinearConstraint.java	35 * <li>c<sub>1</sub>x<sub>1</sub> + ... c<sub>n</sub>x<sub>n</sub> = v</li> 36 * <li>c<sub>1</sub>x<sub>1</sub> + ... c<sub>n</sub>x<sub>n</sub> <= v</li> 37 * <li>c<sub>1</sub>x<sub>1</sub> + ... c<sub>n</sub>x<sub>n</sub> >= v</li> 38 * <li>l<sub>1</sub>x<sub>1</sub> + ... l<sub>n</sub>x<sub>n</sub> + l<sub>cst</sub> = 39 * r<sub>1</sub>x<sub>1</sub> + ... r<sub>n</sub>x<sub>n</sub> + r<sub>cst</sub></li> 40 * <li>l<sub>1</sub>x<sub>1</sub> + ... l<sub>n</sub>x<sub>n</sub> + l<sub>cst</sub> <= 41 * r<sub>1</sub>x<sub>1</sub> + ... r<sub>n</sub>x<sub>n</sub> + r<sub>cst</sub></li> 42 * <li>l<sub>1</sub>x<sub>1</sub> + ... l<sub>n</sub>x<sub>n</sub> + l<sub>cst</sub> >= 43 * r<sub>1</sub>x<sub>1</sub> + ... r<sub>n</sub>x<sub>n</sub> + r<sub>cst</sub></li> 45 …* The c<sub>i</sub>, l<sub>i</sub> or r<sub>i</sub> are the coefficients of the constraints, the x… [all …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/linear/
H A D	LinearConstraint.java	35 * <li>c<sub>1</sub>x<sub>1</sub> + ... c<sub>n</sub>x<sub>n</sub> = v</li> 36 * <li>c<sub>1</sub>x<sub>1</sub> + ... c<sub>n</sub>x<sub>n</sub> <= v</li> 37 * <li>c<sub>1</sub>x<sub>1</sub> + ... c<sub>n</sub>x<sub>n</sub> >= v</li> 38 * <li>l<sub>1</sub>x<sub>1</sub> + ... l<sub>n</sub>x<sub>n</sub> + l<sub>cst</sub> = 39 * r<sub>1</sub>x<sub>1</sub> + ... r<sub>n</sub>x<sub>n</sub> + r<sub>cst</sub></li> 40 * <li>l<sub>1</sub>x<sub>1</sub> + ... l<sub>n</sub>x<sub>n</sub> + l<sub>cst</sub> <= 41 * r<sub>1</sub>x<sub>1</sub> + ... r<sub>n</sub>x<sub>n</sub> + r<sub>cst</sub></li> 42 * <li>l<sub>1</sub>x<sub>1</sub> + ... l<sub>n</sub>x<sub>n</sub> + l<sub>cst</sub> >= 43 * r<sub>1</sub>x<sub>1</sub> + ... r<sub>n</sub>x<sub>n</sub> + r<sub>cst</sub></li> 45 …* The c<sub>i</sub>, l<sub>i</sub> or r<sub>i</sub> are the coefficients of the constraints, the x… [all …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/optim/linear/
H A D	LinearConstraint.java	32 * <li>c<sub>1</sub>x<sub>1</sub> + ... c<sub>n</sub>x<sub>n</sub> = v</li> 33 * <li>c<sub>1</sub>x<sub>1</sub> + ... c<sub>n</sub>x<sub>n</sub> <= v</li> 34 * <li>c<sub>1</sub>x<sub>1</sub> + ... c<sub>n</sub>x<sub>n</sub> >= v</li> 35 * <li>l<sub>1</sub>x<sub>1</sub> + ... l<sub>n</sub>x<sub>n</sub> + l<sub>cst</sub> = 36 * r<sub>1</sub>x<sub>1</sub> + ... r<sub>n</sub>x<sub>n</sub> + r<sub>cst</sub></li> 37 * <li>l<sub>1</sub>x<sub>1</sub> + ... l<sub>n</sub>x<sub>n</sub> + l<sub>cst</sub> <= 38 * r<sub>1</sub>x<sub>1</sub> + ... r<sub>n</sub>x<sub>n</sub> + r<sub>cst</sub></li> 39 * <li>l<sub>1</sub>x<sub>1</sub> + ... l<sub>n</sub>x<sub>n</sub> + l<sub>cst</sub> >= 40 * r<sub>1</sub>x<sub>1</sub> + ... r<sub>n</sub>x<sub>n</sub> + r<sub>cst</sub></li> 42 …* The c<sub>i</sub>, l<sub>i</sub> or r<sub>i</sub> are the coefficients of the constraints, the x… [all …]
/aosp_15_r20/external/deqp/android/cts/main/vk-main-2019-03-01/
H A D	memory.txt	508 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.flush 509 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.invalidate 510 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.remap 511 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.simple 512 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subflush 513 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subflush_overlapping 514 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subflush_separate 515 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subinvalidate 516 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subinvalidate_overlapp… 517 dEQP-VK.memory.mapping.dedicated_alloc.buffer.sub.1048577.offset_0.size_1025.subinvalidate_separate [all …]
/aosp_15_r20/external/ot-br-posix/src/dbus/common/
H A D	dbus_message_helper_openthread.cpp	54 DBusMessageIter sub; in DBusMessageExtract() local 61 SuccessOrExit(error = DbusMessageIterRecurse(aIter, &sub, DBUS_TYPE_STRUCT)); in DBusMessageExtract() 63 SuccessOrExit(error = DBusMessageExtract(&sub, aScanResult.mExtAddress)); in DBusMessageExtract() 64 SuccessOrExit(error = DBusMessageExtract(&sub, aScanResult.mNetworkName)); in DBusMessageExtract() 65 SuccessOrExit(error = DBusMessageExtract(&sub, aScanResult.mExtendedPanId)); in DBusMessageExtract() 66 SuccessOrExit(error = DBusMessageExtract(&sub, aScanResult.mSteeringData)); in DBusMessageExtract() 67 SuccessOrExit(error = DBusMessageExtract(&sub, aScanResult.mPanId)); in DBusMessageExtract() 68 SuccessOrExit(error = DBusMessageExtract(&sub, aScanResult.mJoinerUdpPort)); in DBusMessageExtract() 69 SuccessOrExit(error = DBusMessageExtract(&sub, aScanResult.mChannel)); in DBusMessageExtract() 70 SuccessOrExit(error = DBusMessageExtract<int16_t>(&sub, rssi)); in DBusMessageExtract() [all …]
/aosp_15_r20/external/tensorflow/tensorflow/compiler/xla/g3doc/
H A D	tiled_layout.md	27 Without tiling, an element e=(e<sub>n</sub>, e<sub>n-1</sub>, ... , 28 e<sub>1</sub>) in an array with array bounds d=(d<sub>n</sub>, d<sub>n-1</sub>, 29 ... , d<sub>1</sub>) (d1 is the most minor dimension) is laid out by major to 33 = linear_index((e<sub>n</sub>, e<sub>n-1</sub>, ... , e<sub>1</sub>), 34 (d<sub>n</sub>, d<sub>n-1</sub>, ... , d<sub>1</sub>)) \ 35 = e<sub>n</sub>d<sub>n-1</sub>...d<sub>1</sub> + 36 e<sub>n-1</sub>d<sub>n-2</sub>...d<sub>1</sub> + ... + e<sub>1</sub> 45 When tiling of size (t<sub>n</sub>, t<sub>n-1</sub>, ... , t<sub>1</sub>) is 46 used, an element in the array with indices (e<sub>n</sub>, e<sub>n-1</sub>, ... 47 , e<sub>1</sub>) is mapped to this position in the final layout: [all …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/
H A D	HarmonicCoefficientsGuesser.java	28 * <p>We know f (t) at some sampling points t<sub>i</sub> and want to find a, 51 * integrals between t<sub>1</sub> and t<sub>i</sub> for each t<sub>i</sub> : 53 …* If2 (t<sub>i</sub>) - If2 (t<sub>1</sub>) = A × (t<sub>i</sub> - t<sub>1</sub>) + B &tim… 62 …* <p>For a bilinear expression z (x<sub>i</sub>, y<sub>i</sub>) = A × x<sub>i</sub> + B &tim… 64 …* ∑ (z<sub>i</sub> - z (x<sub>i</sub>, y<sub>i</sub>))<sup>2</sup> are given by these expressi… 67 … ∑y<sub>i</sub>y<sub>i</sub> ∑x<sub>i</sub>z<sub>i</sub> - ∑x<sub>i</sub>y<sub… 69 … ∑x<sub>i</sub>x<sub>i</sub> ∑y<sub>i</sub>y<sub>i</sub> - ∑x<sub>i</sub>y<sub… 71 … ∑x<sub>i</sub>x<sub>i</sub> ∑y<sub>i</sub>z<sub>i</sub> - ∑x<sub>i</sub>y<sub… 73 … ∑x<sub>i</sub>x<sub>i</sub> ∑y<sub>i</sub>y<sub>i</sub> - ∑x<sub>i</sub>y<sub… 83 * for each t<sub>i</sub> from t<sub>1</sub> to t<sub>n-1</sub>, compute: [all …]
/aosp_15_r20/external/libaom/aom_dsp/
H A D	fft_common.h	126 #define GEN_FFT_4(ret, suffix, T, T_VEC, load, store, constant, add, sub) \ argument 134 const T_VEC w1 = sub(i0, i2); \ 136 const T_VEC w3 = sub(i1, i3); \ 139 store(output + 2 * stride, sub(w0, w2)); \ 140 store(output + 3 * stride, sub(kWeight0, w3)); \ 143 #define GEN_FFT_8(ret, suffix, T, T_VEC, load, store, constant, add, sub, mul) \ argument 156 const T_VEC w1 = sub(i0, i4); \ 158 const T_VEC w3 = sub(i2, i6); \ 160 const T_VEC w5 = sub(w0, w2); \ 162 const T_VEC w8 = sub(i1, i5); \ [all …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/fitting/
H A D	HarmonicFitter.java	87 * <p>We know f (t) at some sampling points t<sub>i</sub> and want to find a, ω and φ 108 * t<sub>1</sub> and t<sub>i</sub> for each t<sub>i</sub> : 111 …* If2 (t<sub>i</sub>) - If2 (t<sub>1</sub>) = A × (t<sub>i</sub> - t<sub>1</sub>) + B &tim… 117 * <p>For a bilinear expression z (x<sub>i</sub>, y<sub>i</sub>) = A × x<sub>i</sub> + B 118 * × y<sub>i</sub>, the coefficients A and B that minimize a least square criterion ∑ 119 * (z<sub>i</sub> - z (x<sub>i</sub>, y<sub>i</sub>))<sup>2</sup> are given by these 124 … ∑y<sub>i</sub>y<sub>i</sub> ∑x<sub>i</sub>z<sub>i</sub> - ∑x<sub>i</sub>y<sub… 126 … ∑x<sub>i</sub>x<sub>i</sub> ∑y<sub>i</sub>y<sub>i</sub> - ∑x<sub>i</sub>y<sub… 128 … ∑x<sub>i</sub>x<sub>i</sub> ∑y<sub>i</sub>z<sub>i</sub> - ∑x<sub>i</sub>y<sub… 130 … ∑x<sub>i</sub>x<sub>i</sub> ∑y<sub>i</sub>y<sub>i</sub> - ∑x<sub>i</sub>y<sub… [all …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/optimization/fitting/
H A D	HarmonicFitter.java	85 * <p>We know f (t) at some sampling points t<sub>i</sub> and want to find a, 108 * integrals between t<sub>1</sub> and t<sub>i</sub> for each t<sub>i</sub> : 110 …* If2 (t<sub>i</sub>) - If2 (t<sub>1</sub>) = A × (t<sub>i</sub> - t<sub>1</sub>) + B &tim… 119 …* <p>For a bilinear expression z (x<sub>i</sub>, y<sub>i</sub>) = A × x<sub>i</sub> + B &tim… 121 …* ∑ (z<sub>i</sub> - z (x<sub>i</sub>, y<sub>i</sub>))<sup>2</sup> are given by these expressi… 124 … ∑y<sub>i</sub>y<sub>i</sub> ∑x<sub>i</sub>z<sub>i</sub> - ∑x<sub>i</sub>y<sub… 126 … ∑x<sub>i</sub>x<sub>i</sub> ∑y<sub>i</sub>y<sub>i</sub> - ∑x<sub>i</sub>y<sub… 128 … ∑x<sub>i</sub>x<sub>i</sub> ∑y<sub>i</sub>z<sub>i</sub> - ∑x<sub>i</sub>y<sub… 130 … ∑x<sub>i</sub>x<sub>i</sub> ∑y<sub>i</sub>y<sub>i</sub> - ∑x<sub>i</sub>y<sub… 140 * for each t<sub>i</sub> from t<sub>1</sub> to t<sub>n-1</sub>, compute: [all …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math/transform/
H A D	FastHadamardTransformer.java	95 … \| x<sub>0</sub> \| a<sub>0</sub>=x<sub>0</sub>+x<sub>1</sub> \| b<sub>0</sub>=a<sub>0</sub>+a<sub>1… 97 … \| x<sub>1</sub> \| a<sub>1</sub>=x<sub>2</sub>+x<sub>3</sub> \| b<sub>0</sub>=a<sub>2</sub>+a<sub>3… 99 … \| x<sub>2</sub> \| a<sub>2</sub>=x<sub>4</sub>+x<sub>5</sub> \| b<sub>0</sub>=a<sub>4</sub>+a<sub>5… 101 … \| x<sub>3</sub> \| a<sub>3</sub>=x<sub>6</sub>+x<sub>7</sub> \| b<sub>0</sub>=a<sub>6</sub>+a<sub>7… 103 … \| x<sub>4</sub> \| a<sub>0</sub>=x<sub>0</sub>-x<sub>1</sub> \| b<sub>0</sub>=a<sub>0</sub>-a<sub>1… 105 … \| x<sub>5</sub> \| a<sub>1</sub>=x<sub>2</sub>-x<sub>3</sub> \| b<sub>0</sub>=a<sub>2</sub>-a<sub>3… 107 … \| x<sub>6</sub> \| a<sub>2</sub>=x<sub>4</sub>-x<sub>5</sub> \| b<sub>0</sub>=a<sub>4</sub>-a<sub>5… 109 … \| x<sub>7</sub> \| a<sub>3</sub>=x<sub>6</sub>-x<sub>7</sub> \| b<sub>0</sub>=a<sub>6</sub>-a<sub>7… 119 * <li>The entries of the submatrix D<sub>top</sub> are calculated as follows. 120 * <br>D<sub>top</sub> goes from entry [0][1] to [N/2-1][n+1]. [all …]
/aosp_15_r20/external/vixl/test/aarch32/traces/
H A D	assembler-cond-rd-pc-operand-imm12-sub-t32.h	`38 0xaf, 0xf6, 0xa6, 0x3b // sub al r11 pc 2982 41 0xaf, 0xf2, 0x7d, 0x37 // sub al r7 pc 893 44 0xaf, 0xf6, 0xff, 0x5c // sub al r12 pc 3583 47 0xaf, 0xf2, 0x44, 0x58 // sub al r8 pc 1348 50 0xaf, 0xf2, 0x64, 0x7d // sub al r13 pc 1892 53 0xaf, 0xf6, 0x04, 0x09 // sub al r9 pc 2052 56 0xaf, 0xf6, 0x29, 0x12 // sub al r2 pc 2345 59 0xaf, 0xf2, 0xf1, 0x36 // sub al r6 pc 1009 62 0xaf, 0xf6, 0x81, 0x2c // sub al r12 pc 2689 65 0xaf, 0xf6, 0xb7, 0x35 // sub al r5 pc 2999 [all …]`
H A D	assembler-cond-rd-rn-operand-rm-shift-rs-sub-a32.h	38 0x18, 0x80, 0x4a, 0x40 // sub mi r8 r10 r8 LSL r0 41 0x7d, 0xb8, 0x44, 0x30 // sub cc r11 r4 r13 ROR r8 44 0x73, 0xd4, 0x4b, 0xe0 // sub al r13 r11 r3 ROR r4 47 0x34, 0xbb, 0x45, 0xc0 // sub gt r11 r5 r4 LSR r11 50 0x78, 0xcd, 0x40, 0x60 // sub vs r12 r0 r8 ROR r13 53 0x15, 0xa5, 0x4c, 0x50 // sub pl r10 r12 r5 LSL r5 56 0x12, 0xa9, 0x42, 0x90 // sub ls r10 r2 r2 LSL r9 59 0x39, 0xc7, 0x47, 0x00 // sub eq r12 r7 r9 LSR r7 62 0x70, 0x3b, 0x4d, 0x40 // sub mi r3 r13 r0 ROR r11 65 0x59, 0x9c, 0x40, 0xb0 // sub lt r9 r0 r9 ASR r12 [all …]
H A D	assembler-cond-rd-rn-operand-imm12-sub-t32.h	`38 0xa7, 0xf5, 0xc0, 0x6c // sub al r12 r7 1536 41 0xaa, 0xf2, 0xc7, 0x77 // sub al r7 r10 1991 44 0xaa, 0xf6, 0x01, 0x6d // sub al r13 r10 3585 47 0xac, 0xf6, 0x38, 0x58 // sub al r8 r12 3384 50 0xa4, 0xf6, 0x3b, 0x7e // sub al r14 r4 3899 53 0xa1, 0xf6, 0x45, 0x5a // sub al r10 r1 3397 56 0xaa, 0xf6, 0xf7, 0x32 // sub al r2 r10 3063 59 0xa9, 0xf5, 0x67, 0x66 // sub al r6 r9 3696 62 0xa7, 0xf2, 0x5e, 0x2d // sub al r13 r7 606 65 0xa1, 0xf5, 0xfc, 0x66 // sub al r6 r1 2016 [all …]`
H A D	assembler-cond-rdlow-rnlow-operand-immediate-imm8-in-it-block-sub-t32.h	38 0x48, 0xbf, 0x5a, 0x3b // It mi; sub mi r3 r3 90 41 0x78, 0xbf, 0x8a, 0x3e // It vc; sub vc r6 r6 138 44 0x38, 0xbf, 0x48, 0x3d // It cc; sub cc r5 r5 72 47 0xa8, 0xbf, 0xb5, 0x3e // It ge; sub ge r6 r6 181 50 0x38, 0xbf, 0x8f, 0x39 // It cc; sub cc r1 r1 143 53 0x78, 0xbf, 0x72, 0x3d // It vc; sub vc r5 r5 114 56 0xa8, 0xbf, 0xc3, 0x3c // It ge; sub ge r4 r4 195 59 0xb8, 0xbf, 0xcb, 0x38 // It lt; sub lt r0 r0 203 62 0x88, 0xbf, 0x62, 0x39 // It hi; sub hi r1 r1 98 65 0xc8, 0xbf, 0x1b, 0x1e // It gt; sub gt r3 r3 0 [all …]
H A D	assembler-cond-rdlow-rnlow-operand-immediate-imm3-in-it-block-sub-t32.h	38 0x58, 0xbf, 0xc0, 0x1f // It pl; sub pl r0 r0 7 41 0x28, 0xbf, 0x50, 0x1f // It cs; sub cs r0 r2 5 44 0x98, 0xbf, 0x31, 0x1e // It ls; sub ls r1 r6 0 47 0x38, 0xbf, 0x8d, 0x1f // It cc; sub cc r5 r1 6 50 0x28, 0xbf, 0x15, 0x1e // It cs; sub cs r5 r2 0 53 0x68, 0xbf, 0xf5, 0x1f // It vs; sub vs r5 r6 7 56 0x98, 0xbf, 0x42, 0x1f // It ls; sub ls r2 r0 5 59 0x08, 0xbf, 0x63, 0x1f // It eq; sub eq r3 r4 5 62 0xb8, 0xbf, 0xec, 0x1f // It lt; sub lt r4 r5 7 65 0xb8, 0xbf, 0x7e, 0x1e // It lt; sub lt r6 r7 1 [all …]
H A D	assembler-cond-rd-rn-operand-rm-sub-t32.h	`38 0xa9, 0xeb, 0x0b, 0x0c // sub al r12 r9 r11 41 0xa4, 0xeb, 0x0a, 0x03 // sub al r3 r4 r10 44 0xa0, 0xeb, 0x0c, 0x02 // sub al r2 r0 r12 47 0xa9, 0xeb, 0x0d, 0x09 // sub al r9 r9 r13 50 0xa2, 0xeb, 0x04, 0x0b // sub al r11 r2 r4 53 0xa3, 0xeb, 0x07, 0x07 // sub al r7 r3 r7 56 0xa6, 0xeb, 0x09, 0x0b // sub al r11 r6 r9 59 0xa7, 0xeb, 0x0b, 0x08 // sub al r8 r7 r11 62 0xac, 0xeb, 0x0e, 0x0e // sub al r14 r12 r14 65 0xa5, 0xeb, 0x08, 0x08 // sub al r8 r5 r8 [all …]`
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/ode/nonstiff/
H A D	AdamsMoultonIntegrator.java	43 * derivatives at steps n+1, n, n-1 ... Since y'<sub>n+1</sub> is needed to 44 * compute y<sub>n+1</sub>, another method must be used to compute a first 45 * estimate of y<sub>n+1</sub>, then compute y'<sub>n+1</sub>, then compute 46 * a final estimate of y<sub>n+1</sub> using the following formulas. Depending 50 * <li>k = 1: y<sub>n+1</sub> = y<sub>n</sub> + h y'<sub>n+1</sub></li> 51 * <li>k = 2: y<sub>n+1</sub> = y<sub>n</sub> + h (y'<sub>n+1</sub>+y'<sub>n</sub>)/2</li> 52 …* <li>k = 3: y<sub>n+1</sub> = y<sub>n</sub> + h (5y'<sub>n+1</sub>+8y'<sub>n</sub>-y'<sub>n-1</… 53 …* <li>k = 4: y<sub>n+1</sub> = y<sub>n</sub> + h (9y'<sub>n+1</sub>+19y'<sub>n</sub>-5y'<sub>n-1… 61 * <p>We define scaled derivatives s<sub>i</sub>(n) at step n as: 63 * s<sub>1</sub>(n) = h y'<sub>n</sub> for first derivative [all …]
H A D	AdamsMoultonFieldIntegrator.java	46 * derivatives at steps n+1, n, n-1 ... Since y'<sub>n+1</sub> is needed to 47 * compute y<sub>n+1</sub>, another method must be used to compute a first 48 * estimate of y<sub>n+1</sub>, then compute y'<sub>n+1</sub>, then compute 49 * a final estimate of y<sub>n+1</sub> using the following formulas. Depending 53 * <li>k = 1: y<sub>n+1</sub> = y<sub>n</sub> + h y'<sub>n+1</sub></li> 54 * <li>k = 2: y<sub>n+1</sub> = y<sub>n</sub> + h (y'<sub>n+1</sub>+y'<sub>n</sub>)/2</li> 55 …* <li>k = 3: y<sub>n+1</sub> = y<sub>n</sub> + h (5y'<sub>n+1</sub>+8y'<sub>n</sub>-y'<sub>n-1</… 56 …* <li>k = 4: y<sub>n+1</sub> = y<sub>n</sub> + h (9y'<sub>n+1</sub>+19y'<sub>n</sub>-5y'<sub>n-1… 64 * <p>We define scaled derivatives s<sub>i</sub>(n) at step n as: 66 * s<sub>1</sub>(n) = h y'<sub>n</sub> for first derivative [all …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/
H A D	AdamsMoultonIntegrator.java	41 * derivatives at steps n+1, n, n-1 ... Since y'<sub>n+1</sub> is needed to 42 * compute y<sub>n+1</sub>,another method must be used to compute a first 43 * estimate of y<sub>n+1</sub>, then compute y'<sub>n+1</sub>, then compute 44 * a final estimate of y<sub>n+1</sub> using the following formulas. Depending 48 * <li>k = 1: y<sub>n+1</sub> = y<sub>n</sub> + h y'<sub>n+1</sub></li> 49 * <li>k = 2: y<sub>n+1</sub> = y<sub>n</sub> + h (y'<sub>n+1</sub>+y'<sub>n</sub>)/2</li> 50 …* <li>k = 3: y<sub>n+1</sub> = y<sub>n</sub> + h (5y'<sub>n+1</sub>+8y'<sub>n</sub>-y'<sub>n-1</… 51 …* <li>k = 4: y<sub>n+1</sub> = y<sub>n</sub> + h (9y'<sub>n+1</sub>+19y'<sub>n</sub>-5y'<sub>n-1… 59 * <p>We define scaled derivatives s<sub>i</sub>(n) at step n as: 61 * s<sub>1</sub>(n) = h y'<sub>n</sub> for first derivative [all …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/transform/
H A D	FastHadamardTransformer.java	107 * <th>x<sub>0</sub></th> 108 * <td>a<sub>0</sub> = x<sub>0</sub> + x<sub>1</sub></td> 109 * <td>b<sub>0</sub> = a<sub>0</sub> + a<sub>1</sub></td> 110 * <td>y<sub>0</sub> = b<sub>0</sub >+ b<sub>1</sub></td> 113 * <th>x<sub>1</sub></th> 114 * <td>a<sub>1</sub> = x<sub>2</sub> + x<sub>3</sub></td> 115 * <td>b<sub>0</sub> = a<sub>2</sub> + a<sub>3</sub></td> 116 * <td>y<sub>0</sub> = b<sub>2</sub> + b<sub>3</sub></td> 119 * <th>x<sub>2</sub></th> 120 * <td>a<sub>2</sub> = x<sub>4</sub> + x<sub>5</sub></td> [all …]

12 3 4 5 6 7 8 9 10 >>...816