Searched refs:Sequences (Results 1 – 25 of 37) sorted by relevance
12
192 Sequences.clear(); in clear()513 if (!Sequences.empty()) { in parse()514 std::sort(Sequences.begin(), Sequences.end(), Sequence::orderByLowPC); in parse()554 if (Sequences.empty()) in lookupAddress()559 SequenceIter first_seq = Sequences.begin(); in lookupAddress()560 SequenceIter last_seq = Sequences.end(); in lookupAddress()565 found_seq = Sequences.back(); in lookupAddress()578 if (Sequences.empty()) in lookupAddressRange()584 SequenceIter first_seq = Sequences.begin(); in lookupAddressRange()585 SequenceIter last_seq = Sequences.end(); in lookupAddressRange()
194 std::vector<MachineInstr*> Sequences; in runOnBasicBlock() local215 Sequences.push_back(CurrInstr); in runOnBasicBlock()223 DEBUG(dbgs() << "Scan complete, " << Sequences.size() in runOnBasicBlock()227 for (auto &MI : Sequences) { in runOnBasicBlock()
181 Sequences.push_back(S); in appendSequence()216 SequenceVector Sequences; member
1 # Constants, Sequences, and Random Values19 ## Sequences section in Constants, Sequences, and Random Values
5 * [Constants, Sequences, and Random Values](constant_op.md)
9 ### Sequences
22 ## Sequences section in Tutorials
725 SmallVector<SmallVector<MaskRolPair, 1>, 4> Sequences; in emitComposeSubRegIndexLaneMask() local733 for (size_t s = 0, se = Sequences.size(); s != se; ++s, SIdx = NextSIdx) { in emitComposeSubRegIndexLaneMask()734 SmallVectorImpl<MaskRolPair> &Sequence = Sequences[s]; in emitComposeSubRegIndexLaneMask()742 Sequences.push_back(IdxSequence); in emitComposeSubRegIndexLaneMask()754 for (size_t s = 0, se = Sequences.size(); s != se; ++s) { in emitComposeSubRegIndexLaneMask()756 const SmallVectorImpl<MaskRolPair> &Sequence = Sequences[s]; in emitComposeSubRegIndexLaneMask()
117 # Sequences of three or more ووو look very confusing; we shorten them.
112 # Sequences of three or more ووو look very confusing; we shorten them.
62 has a simple form. Sequences representing non-terminal elements in the grammar150 Sequences representing terminal tokens may be represented as either two-element
57 has a simple form. Sequences representing non-terminal elements in the grammar145 Sequences representing terminal tokens may be represented as either two-element
518 messages without moving them to sub-folders. Sequences are defined in a file
12 # with additions for Emoji Sequences from https://goo.gl/cluFCn
363 Tuples and Sequences679 Comparing Sequences and Other Types
415 Tuples and Sequences728 Comparing Sequences and Other Types
485 ## Sequences ## section in Expectation Order
7 # Emoji Variation Sequences for UTS #51
637 Sequences can be copied by slicing::1063 Sequences (Tuples/Lists)
1317 * Sequences (instances of :class:`tuple`, :class:`list`, or :class:`range`) can1323 Sequences compare lexicographically using comparison of corresponding
244 Sequences259 Sequences also support slicing: ``a[i:j]`` selects all items with index *k* such268 Sequences are distinguished according to their mutability:
251 Sequences266 Sequences also support slicing: ``a[i:j]`` selects all items with index *k* such277 Sequences are distinguished according to their mutability:
797 Sequences can be copied by slicing::1172 Sequences (Tuples/Lists)
171 Sequences1215 Sequences, general methods, plus: