| /third_party/skia/third_party/externals/tint/src/utils/ |
| H A D | unique_vector_test.cc | 53 for (auto n : Reverse(unique_vec)) { in TEST()
77 for (auto n : Reverse(unique_vec)) { in TEST()
103 for (auto n : Reverse(unique_vec)) { in TEST()
|
| H A D | reverse_test.cc | 28 for (auto v : Reverse(vec)) { in TEST()
|
| H A D | reverse.h | 24 /// Used by utils::Reverse to hold the underlying iterable.
45 /// Reverse returns an iterable wrapper that when used in range-for loops,
53 /// for (auto v : utils::Reverse(vec)) {
57 detail::ReverseIterable<T> Reverse(T&& iterable) { in Reverse() function
|
| /third_party/typescript/tests/baselines/reference/ |
| H A D | ramdaToolsNoInfinite.js | 67 type Reverse<T extends any[], R extends any[] = [], I extends any[] = []> = {
68 0: Reverse<T, Prepend<T[Pos<I>], R>, Next<I>>;
77 Reverse<Reverse<T1> extends infer R ? Cast<R, any[]> : never, T2>;
|
| H A D | ramdaToolsNoInfinite2.js | 270 declare module "List/Reverse" {
289 export type Reverse<L extends List, LO extends List = []> = L extends unknown ? LO extends unknown ? _Reverse<L, LO> : never : never;
292 import { _Reverse } from "List/Reverse";
|
| /third_party/python/Tools/scripts/ |
| H A D | fixcid.py | 271 Reverse = 0 variable
273 global Reverse
274 Reverse = (not Reverse)
301 if Reverse:
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| H A D | VectorUtils.h | 419 InterleaveGroup(uint32_t Factor, bool Reverse, Align Alignment) in InterleaveGroup() argument
420 : Factor(Factor), Reverse(Reverse), Alignment(Alignment), in InterleaveGroup()
428 Reverse = Stride < 0; in InterleaveGroup()
432 bool isReverse() const { return Reverse; }
532 bool Reverse; member in llvm::InterleaveGroup
|
| /third_party/rust/crates/memchr/src/memmem/ |
| H A D | twoway.rs | 11 pub(crate) struct Reverse(TwoWay);
46 /// This type is wrapped in Forward and Reverse types that expose consistent
244 impl Reverse { impls
247 pub(crate) fn new(needle: &[u8]) -> Reverse {
249 return Reverse(TwoWay::empty());
263 Reverse(TwoWay { byteset, critical_pos, shift })
862 Reverse::new(needle).rfind_general(haystack, needle)
|
| H A D | mod.rs | 1049 TwoWay(twoway::Reverse),
1061 TwoWay(twoway::Reverse::new(needle)) in new()
|
| /third_party/node/deps/brotli/c/enc/ |
| H A D | entropy_encode.c | 152 static void Reverse(uint8_t* v, size_t start, size_t end) { in Reverse() function
203 Reverse(tree, start, *tree_size); in BrotliWriteHuffmanTreeRepetitions()
204 Reverse(extra_bits_data, start, *tree_size); in BrotliWriteHuffmanTreeRepetitions()
239 Reverse(tree, start, *tree_size); in BrotliWriteHuffmanTreeRepetitionsZeros()
240 Reverse(extra_bits_data, start, *tree_size); in BrotliWriteHuffmanTreeRepetitionsZeros()
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| H A D | entropy_encode.c | 152 static void Reverse(uint8_t* v, size_t start, size_t end) { in Reverse() function
203 Reverse(tree, start, *tree_size); in BrotliWriteHuffmanTreeRepetitions()
204 Reverse(extra_bits_data, start, *tree_size); in BrotliWriteHuffmanTreeRepetitions()
239 Reverse(tree, start, *tree_size); in BrotliWriteHuffmanTreeRepetitionsZeros()
240 Reverse(extra_bits_data, start, *tree_size); in BrotliWriteHuffmanTreeRepetitionsZeros()
|
| /third_party/cups-filters/filter/ |
| H A D | imagetopdf.c | 57 Reverse = 0, /* Output order */ variable
369 if (Reverse) { in outPrologue()
816 if (!strcasecmp(val, "Reverse")) { in main()
817 Reverse = 1; in main()
825 Reverse = !strcasecmp(choice->choice,"Reverse"); in main()
829 Reverse = !strcasecmp(attr->value,"Reverse"); in main()
832 Reverse = !strcasecmp(attr->value,"Reverse"); in main()
[all...] |
| /third_party/protobuf/csharp/src/Google.Protobuf/ |
| H A D | ByteArray.cs | 69 internal static void Reverse(byte[] bytes)
in Reverse() method in Google.Protobuf.ByteArray
|
| H A D | WritingPrimitives.cs | 75 floatSpan.Reverse(); in WriteFloat()
95 floatSpan.Reverse(); in WriteFloatSlowPath()
|
| H A D | ParsingPrimitives.cs | 420 // Content is little endian. Reverse if needed to match endianness of architecture. in ParseFloatSlow()
423 tempSpan.Reverse(); in ParseFloatSlow()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/TableGen/ |
| H A D | SetTheory.cpp | 125 const bool Reverse; member
127 RotOp(bool Rev) : Reverse(Rev) {} in RotOp()
131 if (Reverse)
|
| /third_party/skia/third_party/externals/tint/src/ast/ |
| H A D | traverse_expressions.h | 79 for (auto* expr : utils::Reverse(exprs)) { in TraverseExpressions()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| H A D | cord_rep_consume_test.cc | 122 TEST(CordRepConsumeTest, Reverse) { in TEST()
|
| /third_party/node/deps/v8/src/objects/ |
| H A D | elements.h | 163 virtual void Reverse(JSObject receiver) = 0;
|
| /third_party/rust/crates/serde/serde/src/ |
| H A D | lib.rs | 183 pub use self::core::cmp::Reverse;
|
| /third_party/node/deps/v8/src/builtins/ |
| H A D | builtins-typed-array.cc | 319 elements->Reverse(*array); in BUILTIN()
|
| /third_party/pcre2/pcre2/src/ |
| H A D | pcre2_internal.h | 1667 "Reverse", "Assert", "Assert not", \
1749 1+LINK_SIZE, /* Reverse */ \
|
| /third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/ |
| H A D | IceInst.cpp | 62 InstIcmp::ICond Reverse; member
1021 Condition = InstIcmpAttributes[Condition].Reverse; in reverseConditionAndOperands()
|
| /third_party/rust/crates/serde/serde/src/de/ |
| H A D | impls.rs | 778 (T), Reverse<T>, Reverse
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| H A D | HexagonISelDAGToDAGHVX.cpp | 38 // - Reverse delta.
91 // Reverse delta network is same as delta network, with the steps in
330 Reverse
400 getControls(V, 0, Reverse); in run()
416 getControls(R, Log, Reverse); in run()
|