Home
last modified time | relevance | path

Searched full:reverse (Results 1 – 25 of 20116) sorted by relevance

12345678910>>...805

/aosp_15_r20/packages/modules/Bluetooth/system/gd/crypto_toolbox/
Dcrypto_toolbox_test.cc65 // algorithm expect all input to be in little endian format, so reverse in TEST()
66 std::reverse(std::begin(k), std::end(k)); in TEST()
67 std::reverse(std::begin(aes_cmac_k_m), std::end(aes_cmac_k_m)); in TEST()
89 // algorithm expect all input to be in little endian format, so reverse in TEST()
90 std::reverse(std::begin(k), std::end(k)); in TEST()
91 std::reverse(std::begin(m), std::end(m)); in TEST()
92 std::reverse(std::begin(aes_cmac_k_m), std::end(aes_cmac_k_m)); in TEST()
116 // algorithm expect all input to be in little endian format, so reverse in TEST()
117 std::reverse(std::begin(k), std::end(k)); in TEST()
118 std::reverse(std::begin(m), std::end(m)); in TEST()
[all …]
/aosp_15_r20/external/eigen/test/
H A Darray_reverse.cpp16 template<typename MatrixType> void reverse(const MatrixType& m) in reverse() function
29 MatrixType m1_r = m1.reverse(); in reverse()
30 // Verify that MatrixBase::reverse() works in reverse()
37 Reverse<MatrixType> m1_rd(m1); in reverse()
38 // Verify that a Reverse default (in both directions) of an expression works in reverse()
45 Reverse<MatrixType, BothDirections> m1_rb(m1); in reverse()
46 // Verify that a Reverse in both directions of an expression works in reverse()
53 Reverse<MatrixType, Vertical> m1_rv(m1); in reverse()
54 // Verify that a Reverse in the vertical directions of an expression works in reverse()
61 Reverse<MatrixType, Horizontal> m1_rh(m1); in reverse()
[all …]
/aosp_15_r20/external/eigen/Eigen/src/Core/
H A DReverse.h20 struct traits<Reverse<MatrixType, Direction> >
49 /** \class Reverse
52 * \brief Expression of the reverse of a vector or matrix
54 * \tparam MatrixType the type of the object of which we are taking the reverse
55 …* \tparam Direction defines the direction of the reverse operation, can be Vertical, Horizontal, o…
57 * This class represents an expression of the reverse of a vector.
58 * It is the return type of MatrixBase::reverse() and VectorwiseOp::reverse()
61 * \sa MatrixBase::reverse(), VectorwiseOp::reverse()
63 template<typename MatrixType, int Direction> class Reverse
64 : public internal::dense_xpr_base< Reverse<MatrixType, Direction> >::type
[all …]
/aosp_15_r20/external/cronet/third_party/libc++/src/test/std/ranges/range.adaptors/range.reverse/
H A Dadaptor.pass.cpp11 // std::views::reverse
26 // views::reverse(x) is equivalent to x.base() if x is a reverse_view in test()
31 std::same_as<BidirRange> auto result = std::views::reverse(reversed); in test()
38 std::same_as<BidirRange> auto result = std::views::reverse(std::views::reverse(view)); in test()
44 // views::reverse(x) is equivalent to subrange{end, begin, size} if x is a in test()
45 // sized subrange over reverse iterators in test()
56 std::same_as<Subrange> auto result = std::views::reverse(subrange); in test()
61 // std::move into views::reverse in test()
64 std::same_as<Subrange> auto result = std::views::reverse(std::move(subrange)); in test()
72 std::same_as<Subrange> auto result = std::views::reverse(subrange); in test()
[all …]
/aosp_15_r20/packages/modules/NeuralNetworks/runtime/test/generated/spec_AIDL_V3/
Dreverse.example.cpp1 // Generated from reverse.mod.py
7 namespace generated_tests::reverse { namespace
44 .type = TestOperationType::REVERSE, in get_test_model_dim1()
62 } // namespace generated_tests::reverse
64 namespace generated_tests::reverse { namespace
135 .type = TestOperationType::REVERSE, in get_test_model_dim1_all_inputs_as_internal()
153 } // namespace generated_tests::reverse
155 namespace generated_tests::reverse { namespace
192 .type = TestOperationType::REVERSE, in get_test_model_dim1_float16()
210 } // namespace generated_tests::reverse
[all …]
/aosp_15_r20/external/cronet/third_party/rust/chromium_crates_io/vendor/regex-automata-0.4.6/src/meta/
H A Dstrategy.rs158 // For example, the reverse anchored optimization seems like it might in new()
159 // always work, but only the DFAs support reverse searching and the DFAs in new()
161 // supported reverse searching, then we could avoid building a full Core in new()
166 debug!("using reverse anchored strategy"); in new()
173 debug!("using reverse suffix strategy"); in new()
180 debug!("using reverse inner strategy"); in new()
488 // used within each respective wrapper, but the DFAs need a reverse NFA in new()
489 // to build itself, and we really do not want to build a reverse NFA if in new()
498 // a reverse NFA. It's possible for the DFAs below to both in new()
500 // building the reverse NFA was totally wasted work. But... in new()
[all …]
/aosp_15_r20/libcore/ojluni/src/main/java/sun/security/provider/certpath/
H A DX509CertificatePair.java48 * CA. The reverse certificate of the CertificatePair contains a certificate
49 * issued by this CA to another CA. When both the forward and the reverse
61 * reverse [1] Certificate OPTIONAL
79 private X509Certificate reverse; field in X509CertificatePair
96 * @param reverse The reverse component of the certificate pair
100 public X509CertificatePair(X509Certificate forward, X509Certificate reverse) in X509CertificatePair() argument
102 if (forward == null && reverse == null) { in X509CertificatePair()
108 this.reverse = reverse; in X509CertificatePair()
161 * Sets the reverse component of the certificate pair.
165 reverse = cert; in setReverse()
[all …]
/aosp_15_r20/external/cronet/third_party/rust/chromium_crates_io/vendor/regex-automata-0.4.6/src/hybrid/
H A Dregex.rs11 finds the end offset of a match, where as the other is a "reverse" DFA that
33 /// "reverse" DFA. The forward DFA is responsible for detecting the end of
34 /// a match while the reverse DFA is responsible for detecting the start
36 /// forward search must first be run followed by a reverse search. A match
37 /// found by the forward DFA guarantees that the reverse DFA will also find
85 /// The reverse lazy DFA. This can only find the start of a match.
95 reverse: DFA, field
238 self.reverse().reset_cache(&mut cache.reverse); in reset_cache()
291 // reverse scan too. in is_match()
447 let (fcache, rcache) = (&mut cache.forward, &mut cache.reverse); in try_search()
[all …]
/aosp_15_r20/external/python/bumble/bumble/
Dcrypto.py120 def reverse(input: bytes) -> bytes: function
143 cipher = Cipher(algorithms.AES(reverse(key)), modes.ECB())
145 return reverse(encryptor.update(reverse(data)))
208 return reverse(aes_cmac(reverse(u) + reverse(v) + z, reverse(x)))
220 t = aes_cmac(reverse(w), salt)
223 reverse(
227 + reverse(n1)
228 + reverse(n2)
229 + reverse(a1)
230 + reverse(a2)
[all …]
/aosp_15_r20/external/deqp/android/cts/main/vk-main-2022-03-01/
H A Dmemory.txt45 dEQP-VK.memory.pageable_allocation.basic.percent_1.reverse.count_12
54 dEQP-VK.memory.pageable_allocation.basic.size_128.reverse.count_1
55 dEQP-VK.memory.pageable_allocation.basic.size_128.reverse.count_10
56 dEQP-VK.memory.pageable_allocation.basic.size_128.reverse.count_100
57 dEQP-VK.memory.pageable_allocation.basic.size_128.reverse.count_1000
66 dEQP-VK.memory.pageable_allocation.basic.size_1KiB.reverse.count_1
67 dEQP-VK.memory.pageable_allocation.basic.size_1KiB.reverse.count_10
68 dEQP-VK.memory.pageable_allocation.basic.size_1KiB.reverse.count_100
69 dEQP-VK.memory.pageable_allocation.basic.size_1KiB.reverse.count_1000
76 dEQP-VK.memory.pageable_allocation.basic.size_1MiB.reverse.count_1
[all …]
/aosp_15_r20/external/deqp/modules/gles31/scripts/
H A Dgen-implicit-conversions.py340 def __init__(self, name, op, in_type, out_type, reverse=False): argument
351 self.reverse = reverse
365 if self.reverse:
373 if self.reverse:
374 expr.reverse()
406 def __init__(self, name, op, in_type, out_type, reverse=False): argument
407 super(ComparisonsCase, self).__init__(name, op, in_type, out_type, reverse)
424 if self.reverse:
443 def __init__(self, name, in_type, out_type, reverse=False, input_in_parens=False): argument
447 self.reverse = reverse
[all …]
/aosp_15_r20/external/guava/android/guava-tests/test/com/google/common/base/
H A DConverterTest.java63 assertEquals(STR_VAL, STR_TO_LONG.reverse().convert(LONG_VAL)); in testConverter()
81 Converter<Long, String> reverseConverter = STR_TO_LONG.reverse(); in testReverse()
84 assertEquals(LONG_VAL, reverseConverter.reverse().convert(STR_VAL)); in testReverse()
89 assertSame(STR_TO_LONG, reverseConverter.reverse()); in testReverse()
91 assertEquals("string2long.reverse()", reverseConverter.toString()); in testReverse()
94 .addEqualityGroup(STR_TO_LONG, STR_TO_LONG.reverse().reverse()) in testReverse()
95 .addEqualityGroup(STR_TO_LONG.reverse(), STR_TO_LONG.reverse()) in testReverse()
101 assertEquals(converter, converter.reverse().reverse()); in testReverseReverse()
139 assertEquals(STR_VAL, converter.reverse().convert(LONG_VAL).value); in testAndThen()
150 assertSame(stringIdentityConverter, stringIdentityConverter.reverse()); in testIdentityConverter()
[all …]
/aosp_15_r20/external/guava/guava-tests/test/com/google/common/base/
H A DConverterTest.java63 assertEquals(STR_VAL, STR_TO_LONG.reverse().convert(LONG_VAL)); in testConverter()
81 Converter<Long, String> reverseConverter = STR_TO_LONG.reverse(); in testReverse()
84 assertEquals(LONG_VAL, reverseConverter.reverse().convert(STR_VAL)); in testReverse()
89 assertSame(STR_TO_LONG, reverseConverter.reverse()); in testReverse()
91 assertEquals("string2long.reverse()", reverseConverter.toString()); in testReverse()
94 .addEqualityGroup(STR_TO_LONG, STR_TO_LONG.reverse().reverse()) in testReverse()
95 .addEqualityGroup(STR_TO_LONG.reverse(), STR_TO_LONG.reverse()) in testReverse()
101 assertEquals(converter, converter.reverse().reverse()); in testReverseReverse()
139 assertEquals(STR_VAL, converter.reverse().convert(LONG_VAL).value); in testAndThen()
150 assertSame(stringIdentityConverter, stringIdentityConverter.reverse()); in testIdentityConverter()
[all …]
/aosp_15_r20/prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
Dphiopt.go51 // reverse is the predecessor from which the truth value comes.
52 var reverse int
54 reverse = 0
56 reverse = 1
68 phioptint(v, b0, reverse)
80 if v.Args[reverse].AuxInt != v.Args[1-reverse].AuxInt {
82 v.reset(ops[v.Args[reverse].AuxInt])
96 if v.Args[reverse].Op == OpConstBool && v.Args[reverse].AuxInt == 1 {
97 if tmp := v.Args[1-reverse]; sdom.IsAncestorEq(tmp.Block, b) {
112 if v.Args[1-reverse].Op == OpConstBool && v.Args[1-reverse].AuxInt == 0 {
[all …]
/aosp_15_r20/external/aws-sdk-java-v2/services-custom/dynamodb-enhanced/src/test/java/software/amazon/awssdk/enhanced/dynamodb/mapper/
H A DBeanTableSchemaTest.java611 EnumBean reverse = beanTableSchema.mapToItem(itemMap); in enumBean_singleEnum() local
612 assertThat(reverse, is(equalTo(enumBean))); in enumBean_singleEnum()
632 EnumBean reverse = beanTableSchema.mapToItem(itemMap); in enumBean_listEnum() local
633 assertThat(reverse, is(equalTo(enumBean))); in enumBean_listEnum()
655 ListBean reverse = beanTableSchema.mapToItem(itemMap); in listBean_stringList() local
656 assertThat(reverse, is(equalTo(listBean))); in listBean_stringList()
678 ListBean reverse = beanTableSchema.mapToItem(itemMap); in listBean_stringListList() local
679 assertThat(reverse, is(equalTo(listBean))); in listBean_stringListList()
703 SetBean reverse = beanTableSchema.mapToItem(itemMap); in setBean_stringSet() local
704 assertThat(reverse, is(equalTo(setBean))); in setBean_stringSet()
[all …]
/aosp_15_r20/art/test/2269-checker-constant-folding-intrinsics/src/
H A DMain.java44 $noinline$assertIntEquals(-2, Integer.reverse(Integer.MAX_VALUE)); in $noinline$testReverseInt()
45 $noinline$assertIntEquals(1, Integer.reverse(Integer.MIN_VALUE)); in $noinline$testReverseInt()
46 $noinline$assertIntEquals(0, Integer.reverse(0)); in $noinline$testReverseInt()
48 $noinline$assertIntEquals(0x55555555, Integer.reverse(0xAAAAAAAA)); in $noinline$testReverseInt()
50 $noinline$assertIntEquals(0xAAAAAAAA, Integer.reverse(0x55555555)); in $noinline$testReverseInt()
60 $noinline$assertIntEquals(1 << 31, Integer.reverse(1 << 0)); in $noinline$testReverseInt_powerOfTwo()
61 $noinline$assertIntEquals(1 << 30, Integer.reverse(1 << 1)); in $noinline$testReverseInt_powerOfTwo()
62 $noinline$assertIntEquals(1 << 29, Integer.reverse(1 << 2)); in $noinline$testReverseInt_powerOfTwo()
63 $noinline$assertIntEquals(1 << 28, Integer.reverse(1 << 3)); in $noinline$testReverseInt_powerOfTwo()
64 $noinline$assertIntEquals(1 << 27, Integer.reverse(1 << 4)); in $noinline$testReverseInt_powerOfTwo()
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/python/ops/ragged/
H A Dragged_math_ops_test.py94 def _cumsum_slow(rt, axis=0, exclusive=False, reverse=False, name=None): argument
97 reverse=reverse, name=name)
109 reverse=True),
112 reverse=True,
125 axis=1, reverse=True),
128 axis=1, exclusive=True, reverse=True),
134 reverse=False): argument
138 original_rt, axis=axis, exclusive=exclusive, reverse=reverse)
141 reverse=reverse)
149 exclusive=True, reverse=True, axis=2),
[all …]
/aosp_15_r20/external/llvm-libc/test/src/__support/
H A Dblockstore_test.cpp20 template <size_t BLOCK_SIZE, size_t ELEMENT_COUNT, bool REVERSE>
22 LIBC_NAMESPACE::BlockStore<Element, BLOCK_SIZE, REVERSE> block_store; in populate_and_iterate()
29 if (REVERSE) { in populate_and_iterate()
41 LIBC_NAMESPACE::BlockStore<Element, BLOCK_SIZE, REVERSE>::destroy( in populate_and_iterate()
45 template <bool REVERSE> void back_test() { in back_test()
47 BlockStore<int, 4, REVERSE> block_store; in back_test()
55 template <bool REVERSE> void empty_test() { in empty_test()
57 BlockStore<int, 2, REVERSE> block_store; in empty_test()
68 template <bool REVERSE> void erase_test() { in erase_test()
70 BlockStore<int, 2, REVERSE> block_store; in erase_test()
[all …]
/aosp_15_r20/external/cronet/third_party/rust/chromium_crates_io/vendor/regex-automata-0.4.6/src/dfa/
H A Dregex.rs12 finds the end offset of a match, where as the other is a "reverse" DFA that
48 reverse: A,
55 reverse: A,
65 /// "reverse" DFA. The forward DFA is responsible for detecting the end of
66 /// a match while the reverse DFA is responsible for detecting the start
68 /// forward search must first be run followed by a reverse search. A match
69 /// found by the forward DFA guarantees that the reverse DFA will also find
113 /// // Second, build sparse DFAs from the forward and reverse dense DFAs.
115 /// let rev = dense_re.reverse().to_sparse()?;
360 // reverse scan too. in is_match()
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/python/kernel_tests/control_flow/
H A Dscan_ops_test.py40 def handle_options(func, x, axis, exclusive, reverse): argument
46 if reverse:
64 if reverse:
76 def _compare(self, x, axis, exclusive, reverse): argument
77 np_out = handle_options(np.cumsum, x, axis, exclusive, reverse)
79 tf_out = math_ops.cumsum(x, axis, exclusive, reverse).eval()
85 for reverse in [True, False]:
86 self._compare(x, axis, exclusive, reverse)
165 def _compareGradient(self, shape, axis, exclusive, reverse): argument
169 result = math_ops.cumsum(t, axis, exclusive, reverse)
[all …]
/aosp_15_r20/external/cronet/third_party/libc++/src/test/libcxx/strings/string.view/string.view.iterators/
H A Dassert.iterator-indexing.pass.cpp20 void test_iterator(Iter begin, Iter end, bool reverse) { in test_iterator() argument
27 reverse ? "__bounded_iter::operator--: Attempt to rewind an iterator past the start" in test_iterator()
34 reverse ? "__bounded_iter::operator+=: Attempt to rewind an iterator past the start" in test_iterator()
39 reverse ? "__bounded_iter::operator--: Attempt to rewind an iterator past the start" in test_iterator()
47 reverse ? "__bounded_iter::operator--: Attempt to rewind an iterator past the start" in test_iterator()
58 reverse ? "__bounded_iter::operator++: Attempt to advance an iterator past the end" in test_iterator()
69 reverse ? "__bounded_iter::operator-=: Attempt to rewind an iterator past the start" in test_iterator()
82 reverse ? "__bounded_iter::operator+=: Attempt to rewind an iterator past the start" in test_iterator()
95 reverse ? "__bounded_iter::operator-=: Attempt to advance an iterator past the end" in test_iterator()
108 reverse ? "__bounded_iter::operator+=: Attempt to advance an iterator past the end" in test_iterator()
[all …]
/aosp_15_r20/external/skia/src/core/
H A DSkEdgeClipper.cpp37 it to be increasing in Y. If it had to reverse the order of the points,
151 bool reverse = sort_increasing_Y(pts, srcPts, 3); in clipMonoQuad() local
164 reverse = !reverse; in clipMonoQuad()
172 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse); in clipMonoQuad()
177 this->appendVLine(clip.fRight, pts[0].fY, pts[2].fY, reverse); in clipMonoQuad()
189 this->appendVLine(clip.fLeft, tmp[0].fY, tmp[2].fY, reverse); in clipMonoQuad()
199 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse); in clipMonoQuad()
212 this->appendQuad(tmp, reverse); in clipMonoQuad()
213 this->appendVLine(clip.fRight, tmp[2].fY, tmp[4].fY, reverse); in clipMonoQuad()
219 this->appendQuad(pts, reverse); in clipMonoQuad()
[all …]
/aosp_15_r20/external/cronet/third_party/libc++/src/test/libcxx/containers/views/views.span/
H A Dassert.iterator-indexing.pass.cpp24 void test_iterator(Iter begin, Iter end, bool reverse) { in test_iterator() argument
31 reverse ? "__bounded_iter::operator--: Attempt to rewind an iterator past the start" in test_iterator()
38 reverse ? "__bounded_iter::operator+=: Attempt to rewind an iterator past the start" in test_iterator()
43 reverse ? "__bounded_iter::operator--: Attempt to rewind an iterator past the start" in test_iterator()
51 reverse ? "__bounded_iter::operator--: Attempt to rewind an iterator past the start" in test_iterator()
61 reverse ? "__bounded_iter::operator++: Attempt to advance an iterator past the end" in test_iterator()
71 reverse ? "__bounded_iter::operator-=: Attempt to rewind an iterator past the start" in test_iterator()
84 reverse ? "__bounded_iter::operator+=: Attempt to rewind an iterator past the start" in test_iterator()
97 reverse ? "__bounded_iter::operator-=: Attempt to advance an iterator past the end" in test_iterator()
110 reverse ? "__bounded_iter::operator+=: Attempt to advance an iterator past the end" in test_iterator()
[all …]
/aosp_15_r20/external/chromium-trace/catapult/third_party/polymer/components/iron-flex-layout/
H A Diron-flex-layout-classes.html26 - iron-flex-reverse
112 <!-- Basic flexbox reverse styles -->
113 <dom-module id="iron-flex-reverse">
116 .layout.horizontal-reverse,
117 .layout.vertical-reverse {
123 .layout.horizontal-reverse {
124 -ms-flex-direction: row-reverse;
125 -webkit-flex-direction: row-reverse;
126 flex-direction: row-reverse;
129 .layout.vertical-reverse {
[all …]
/aosp_15_r20/system/update_engine/scripts/update_payload/
H A Dcommon.py179 def _ObjNameIter(items, base_name, reverse=False, name_format_func=None): argument
185 reverse: whether iteration should be in reverse order
192 idx, inc = (len(items), -1) if reverse else (1, 1)
193 if reverse:
207 def OperationIter(operations, base_name, reverse=False): argument
209 return _ObjNameIter(operations, base_name, reverse=reverse,
213 def ExtentIter(extents, base_name, reverse=False): argument
215 return _ObjNameIter(extents, base_name, reverse=reverse)
218 def SignatureIter(sigs, base_name, reverse=False): argument
220 return _ObjNameIter(sigs, base_name, reverse=reverse)

12345678910>>...805