| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/numeric/odeint/include/boost/numeric/odeint/algebra/ |
| D | fusion_algebra.hpp | 6 Algebra for boost::fusion sequences.
72 typedef boost::fusion::vector< S1& , S2& > Sequences; in for_each2() typedef
73 Sequences sequences( s1 , s2 ); in for_each2() local
74 …boost::fusion::for_each( boost::fusion::zip_view< Sequences >( sequences ) , boost::fusion::make_f… in for_each2()
81 typedef boost::fusion::vector< S1& , S2& , S3& > Sequences; in for_each3() typedef
82 Sequences sequences( s1 , s2 , s3 ); in for_each3() local
83 …boost::fusion::for_each( boost::fusion::zip_view< Sequences >( sequences ) , boost::fusion::make_f… in for_each3()
89 typedef boost::fusion::vector< S1& , S2& , S3& , S4& > Sequences; in for_each4() typedef
90 Sequences sequences( s1 , s2 , s3 , s4 ); in for_each4() local
91 …boost::fusion::for_each( boost::fusion::zip_view< Sequences >( sequences ) , boost::fusion::make_f… in for_each4()
[all …]
|
| /aosp_15_r20/external/pytorch/torch/nn/utils/ |
| H A D | rnn.py | 51 All RNN modules accept packed sequences as inputs.
68 :class:`PackedSequence` is constructed from sequences.
70 to recover the original sequences with correct order.
286 r"""Packs a Tensor containing padded sequences of variable length.
293 For unsorted sequences, use `enforce_sorted = False`. If :attr:`enforce_sorted` is
294 ``True``, the sequences should be sorted by length in a decreasing order, i.e.
305 input (Tensor): padded batch of variable length sequences.
311 contain sequences sorted by length in a decreasing order. If
348 r"""Pad a packed batch of variable length sequences.
419 sequences: Union[Tensor, List[Tensor]],
[all …]
|
| /aosp_15_r20/external/pytorch/test/nn/ |
| H A D | test_packed_sequence.py | 32 """Create ordered list of random sequences"""
45 """Create Tensor of random padded sequences"""
85 msg = r"Expected iterable for input sequences, but got arg of type"
222 sequences: List[torch.Tensor] = []
226 sequences.append(torch.rand(seq_len, 5, *trailing_dims))
227 random.shuffle(sequences)
229 expected = torch.stack([pad(seq, maxlen * maxlen) for seq in sequences])
230 padded = rnn_utils.pad_sequence(sequences, True)
234 padded = rnn_utils.pad_sequence(sequences)
239 [pad(seq.flip(0), maxlen * maxlen).flip(0) for seq in sequences]
[all …]
|
| /aosp_15_r20/external/pytorch/torch/csrc/api/include/torch/nn/utils/ |
| H A D | rnn.h | 28 /// All RNN modules accept packed sequences as inputs.
45 /// :class:`PackedSequence` is constructed from sequences.
47 /// to recover the original sequences with correct order.
167 /// Packs a Tensor containing padded sequences of variable length.
174 /// For unsorted sequences, use `enforce_sorted = false`. If `enforce_sorted` is
175 /// ``true``, the sequences should be sorted by length in a decreasing order,
187 /// input (Tensor): padded batch of variable length sequences.
188 /// lengths (Tensor): list of sequences lengths of each batch element.
193 /// contain sequences sorted by length in a decreasing order. If
221 /// Pads a packed batch of variable length sequences.
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/utf8_range/utf8_corpus_dir/ |
| D | utf8_corpus_kuhn.txt | 8 sequences. This file is not meant to be a conformance test. It does
18 sequences, as well as correctly encoded UTF-8 sequences of Unicode code
32 mandate this. In any case, just ignoring malformed sequences or
52 malformed sequences is replaced by a single replacement character.
95 3 Malformed sequences |
121 3.2.1 All 32 first bytes of 2-byte sequences (0xc0-0xdf), |
127 3.2.2 All 16 first bytes of 3-byte sequences (0xe0-0xef), |
132 3.2.3 All 8 first bytes of 4-byte sequences (0xf0-0xf7), |
137 3.2.4 All 4 first bytes of 5-byte sequences (0xf8-0xfb), |
142 3.2.5 All 2 first bytes of 6-byte sequences (0xfc-0xfd), |
[all …]
|
| /aosp_15_r20/external/grpc-grpc/third_party/utf8_range/utf8_corpus_dir/ |
| H A D | utf8_corpus_kuhn.txt | 8 sequences. This file is not meant to be a conformance test. It does
18 sequences, as well as correctly encoded UTF-8 sequences of Unicode code
32 mandate this. In any case, just ignoring malformed sequences or
52 malformed sequences is replaced by a single replacement character.
95 3 Malformed sequences |
121 3.2.1 All 32 first bytes of 2-byte sequences (0xc0-0xdf), |
127 3.2.2 All 16 first bytes of 3-byte sequences (0xe0-0xef), |
132 3.2.3 All 8 first bytes of 4-byte sequences (0xf0-0xf7), |
137 3.2.4 All 4 first bytes of 5-byte sequences (0xf8-0xfb), |
142 3.2.5 All 2 first bytes of 6-byte sequences (0xfc-0xfd), |
[all …]
|
| /aosp_15_r20/prebuilts/sdk/tools/jetifier/jetifier-standalone/lib/ |
| HD | kotlin-stdlib-common-1.3.71.jar | META-INF/
META-INF/MANIFEST.MF
kotlin/
kotlin/ExperimentalMultiplatform.kotlin_metadata
kotlin ... |
| /aosp_15_r20/external/rust/android-crates-io/crates/unicode-bidi/src/ |
| D | prepare.rs | 34 /// Compute the set of isolating run sequences.
40 /// Note: This function does *not* return the sequences in order by their first characters.
49 // Compute the set of isolating run sequences. in isolating_run_sequences()
51 let mut sequences = Vec::with_capacity(runs.len()); in isolating_run_sequences() localVariable
89 sequences.push(sequence); in isolating_run_sequences()
92 // Pop any remaning sequences off the stack. in isolating_run_sequences()
93 sequences.extend(stack.into_iter().rev().filter(|seq| !seq.is_empty())); in isolating_run_sequences()
97 sequences in isolating_run_sequences()
284 let mut sequences = isolating_run_sequences(para_level, classes, &Level::vec(levels)); in test_isolating_run_sequences() localVariable
285 sequences.sort_by(|a, b| a.runs[0].clone().cmp(b.runs[0].clone())); in test_isolating_run_sequences()
[all …]
|
| /aosp_15_r20/prebuilts/cmdline-tools/tools/lib/external/org/jetbrains/kotlin/kotlin-stdlib-common/1.9.20/ |
| HD | kotlin-stdlib-common-1.9.20.jar | META-INF/
META-INF/MANIFEST.MF
META-INF/kotlin-stdlib- ... |
| /aosp_15_r20/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.17-4.8/x86_64-linux/include/c++/4.8.3/parallel/ |
| D | multiway_merge.h | 215 * that makes this fast is that the order of the sequences is stored
218 * This works well for merging up to 4 sequences.
334 * that makes this fast is that the order of the sequences is stored
337 * This works well for merging up to 4 sequences.
911 * @param __sentinel The sequences have __a __sentinel element.
1050 // __k sequences.
1113 * None of the passed sequences may be empty.
1135 // __k sequences.
1203 * Must not be called if the number of sequences is 1.
1248 // Leave only non-empty sequences.
[all …]
|
| /aosp_15_r20/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| D | multiway_merge.h | 215 * that makes this fast is that the order of the sequences is stored
218 * This works well for merging up to 4 sequences.
334 * that makes this fast is that the order of the sequences is stored
337 * This works well for merging up to 4 sequences.
911 * @param __sentinel The sequences have __a __sentinel element.
1050 // __k sequences.
1113 * None of the passed sequences may be empty.
1135 // __k sequences.
1203 * Must not be called if the number of sequences is 1.
1248 // Leave only non-empty sequences.
[all …]
|
| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/fusion/include/boost/fusion/algorithm/transformation/detail/preprocessed/ |
| D | zip20.hpp | 25 typedef mpl::vector< T0 , T1 > sequences; typedef
26 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
47 typedef mpl::vector< T0 , T1 , T2 > sequences; typedef
48 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
69 typedef mpl::vector< T0 , T1 , T2 , T3 > sequences; typedef
70 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
91 typedef mpl::vector< T0 , T1 , T2 , T3 , T4 > sequences; typedef
92 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
113 typedef mpl::vector< T0 , T1 , T2 , T3 , T4 , T5 > sequences; typedef
114 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
[all …]
|
| D | zip30.hpp | 25 typedef mpl::vector< T0 , T1 > sequences; typedef
26 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
47 typedef mpl::vector< T0 , T1 , T2 > sequences; typedef
48 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
69 typedef mpl::vector< T0 , T1 , T2 , T3 > sequences; typedef
70 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
91 typedef mpl::vector< T0 , T1 , T2 , T3 , T4 > sequences; typedef
92 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
113 typedef mpl::vector< T0 , T1 , T2 , T3 , T4 , T5 > sequences; typedef
114 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
[all …]
|
| D | zip10.hpp | 25 typedef mpl::vector< T0 , T1 > sequences; typedef
26 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
47 typedef mpl::vector< T0 , T1 , T2 > sequences; typedef
48 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
69 typedef mpl::vector< T0 , T1 , T2 , T3 > sequences; typedef
70 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
91 typedef mpl::vector< T0 , T1 , T2 , T3 , T4 > sequences; typedef
92 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
113 typedef mpl::vector< T0 , T1 , T2 , T3 , T4 , T5 > sequences; typedef
114 typedef typename mpl::transform<sequences, add_reference<mpl::_> >::type ref_params;
[all …]
|
| /aosp_15_r20/external/leakcanary2/shark-graph/api/ |
| H A D | shark-graph.api | 32 public abstract fun getClasses ()Lkotlin/sequences/Sequence;
37 public abstract fun getInstances ()Lkotlin/sequences/Sequence;
39 public abstract fun getObjectArrays ()Lkotlin/sequences/Sequence;
41 public abstract fun getObjects ()Lkotlin/sequences/Sequence;
43 public abstract fun getPrimitiveArrays ()Lkotlin/sequences/Sequence;
66 public final fun getClassHierarchy ()Lkotlin/sequences/Sequence;
67 public final fun getDirectInstances ()Lkotlin/sequences/Sequence;
71 public final fun getInstances ()Lkotlin/sequences/Sequence;
73 public final fun getObjectArrayInstances ()Lkotlin/sequences/Sequence;
76 public final fun getPrimitiveArrayInstances ()Lkotlin/sequences/Sequence;
[all …]
|
| /aosp_15_r20/out/soong/.intermediates/prebuilts/sdk/current/androidx/m2repository/androidx/work/work-runtime/2.10.0-rc01/androidx.work_work-runtime/android_common_apex34/aar/ |
| D | inspector.jar | META-INF/
META-INF/MANIFEST.MF
META-INF/androidx_inspection.min_version
META ... |
| /aosp_15_r20/out/soong/.intermediates/prebuilts/sdk/current/androidx/m2repository/androidx/work/work-runtime/2.10.0-rc01/androidx.work_work-runtime/android_common_apex30/aar/ |
| D | inspector.jar | META-INF/
META-INF/MANIFEST.MF
META-INF/androidx_inspection.min_version
META ... |
| /aosp_15_r20/out/soong/.intermediates/prebuilts/sdk/current/androidx/m2repository/androidx/work/work-runtime/2.10.0-rc01/androidx.work_work-runtime/android_common/aar/ |
| D | inspector.jar | META-INF/
META-INF/MANIFEST.MF
META-INF/androidx_inspection.min_version
META ... |
| /aosp_15_r20/out/soong/.intermediates/prebuilts/sdk/current/androidx/m2repository/androidx/work/work-runtime/2.10.0-rc01/androidx.work_work-runtime/android_common_apex33/aar/ |
| D | inspector.jar | META-INF/
META-INF/MANIFEST.MF
META-INF/androidx_inspection.min_version
META ... |
| /aosp_15_r20/external/jcommander/lib/ |
| HD | kotlin-runtime.jar | META-INF/
META-INF/MANIFEST.MF
kotlin/
kotlin/annotation/
kotlin/ ... |
| /aosp_15_r20/external/zstd/lib/compress/ |
| H A D | zstd_ldm.h | 34 * Generates the sequences using the long distance match finder.
35 * Generates long range matching sequences in `sequences`, which parse a prefix
36 * of the source. `sequences` must be large enough to store every sequence,
43 * sequences.
46 ldmState_t* ldms, rawSeqStore_t* sequences,
52 * Compresses a block using the predefined sequences, along with a secondary
54 * secondary block compressor, and those sequences are interspersed with the
55 * predefined sequences. Returns the length of the last literals.
56 * Updates `rawSeqStore.pos` to indicate how many sequences have been consumed.
62 * sequences can be any size, and may be longer than the block. In the case that
[all …]
|
| H A D | zstd_compress_sequences.c | 296 seqDef const* sequences, size_t nbSeq, int longOffsets) in ZSTD_encodeSequences_body() argument
314 BIT_addBits(&blockStream, sequences[nbSeq-1].litLength, LL_bits[llCodeTable[nbSeq-1]]); in ZSTD_encodeSequences_body()
316 BIT_addBits(&blockStream, sequences[nbSeq-1].mlBase, ML_bits[mlCodeTable[nbSeq-1]]); in ZSTD_encodeSequences_body()
322 BIT_addBits(&blockStream, sequences[nbSeq-1].offBase, extraBits); in ZSTD_encodeSequences_body()
325 BIT_addBits(&blockStream, sequences[nbSeq-1].offBase >> extraBits, in ZSTD_encodeSequences_body()
328 BIT_addBits(&blockStream, sequences[nbSeq-1].offBase, ofCodeTable[nbSeq-1]); in ZSTD_encodeSequences_body()
341 (unsigned)sequences[n].litLength, in ZSTD_encodeSequences_body()
342 (unsigned)sequences[n].mlBase + MINMATCH, in ZSTD_encodeSequences_body()
343 (unsigned)sequences[n].offBase); in ZSTD_encodeSequences_body()
352 BIT_addBits(&blockStream, sequences[n].litLength, llBits); in ZSTD_encodeSequences_body()
[all …]
|
| /aosp_15_r20/prebuilts/misc/common/androidx-test/androidx/test/orchestrator/1.5.0/ |
| HD | orchestrator-1.5.0.apk | classes.dex
commonMain/default/manifest
commonMain/default/linkdata/module
commonMain/default/ ... |
| /aosp_15_r20/prebuilts/misc/common/androidx-test/androidx/test/services/test-services/1.5.0/ |
| HD | test-services-1.5.0.apk | classes.dex
kotlinx/coroutines/Debug_commonKt.kotlin_metadata
kotlinx/coroutines/flow/DistinctFlowImpl.kotlin_metadata
... |
| /aosp_15_r20/external/python/cpython2/Doc/library/ |
| D | difflib.rst | 17 This module provides classes and functions for comparing sequences. It
24 This is a flexible class for comparing pairs of sequences of any type, so long
30 idea is then applied recursively to the pieces of the sequences to the left and
32 sequences, but does tend to yield matches that "look right" to people.
37 complicated way on how many elements the sequences have in common; best case
53 This is a class for comparing sequences of lines of text, and producing
55 both to compare sequences of lines, and to compare sequences of characters
67 | ``' '`` | line common to both sequences |
74 the sequences contain tab characters.
190 sequences against which to match *word* (typically a list of strings).
[all …]
|