| /external/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 26 class Sequence = std::vector<T>,
27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
31 const Sequence &sequence = Sequence())
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
38 const Sequence &sequence = Sequence()
[all...] |
| /external/chromium/net/tools/testserver/ |
| asn1der.py | 16 SEQUENCE = 0x30
53 def Sequence(values):
54 """Encodes a sequence of other values.
61 return Data(SEQUENCE, ''.join(values))
|
| device_management.py | 593 algorithm = asn1der.Sequence(
596 rsa_pubkey = asn1der.Sequence([ asn1der.Integer(key.n),
598 pubkey = asn1der.Sequence([ algorithm, asn1der.Bitstring(rsa_pubkey) ])
|
| /external/chromium/testing/gmock/include/gmock/ |
| gmock-spec-builders.h | 112 // expectation gets picked. Therefore, we sequence all mock function
504 friend class Sequence;
603 // Sequence objects are used by a user to specify the relative order
606 class Sequence {
608 // Constructs an empty sequence.
609 Sequence() : last_expectation_(new Expectation) {}
611 // Adds an expectation to this sequence. The caller must ensure
612 // that no other thread is accessing this Sequence object.
616 // The last expectation in this sequence. We use a linked_ptr here
617 // because Sequence objects are copyable and we want the copies t
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGList.cpp | 147 Sequence.push_back(SU);
176 Sequence.reserve(SUnits.size());
246 Sequence.push_back(0); // NULL here means noop
|
| ScheduleDAGFast.cpp | 183 Sequence.push_back(SU);
539 Sequence.reserve(SUnits.size());
630 std::reverse(Sequence.begin(), Sequence.end());
|
| ScheduleDAGRRList.cpp | 409 /// across a sequence of two-address node. This is important because the
608 Sequence.push_back(SU);
725 unsigned LookAhead = std::min((unsigned)Sequence.size(),
730 std::vector<SUnit*>::const_iterator I = (Sequence.end() - LookAhead);
732 for (std::vector<SUnit*>::const_iterator E = Sequence.end(); I != E; ++I) {
744 SUnit *OldSU = Sequence.back();
746 Sequence.pop_back();
756 OldSU = Sequence.back();
[all...] |
| ScheduleDAGSDNodes.cpp | 353 // of the sequence of nodes that are glued together.
710 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
711 SUnit *SU = Sequence[i];
748 // order sequence.
|
| /external/clang/lib/Sema/ |
| SemaInit.cpp | [all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 55 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
56 if (SUnit *SU = Sequence[i])
72 Sequence.clear();
396 for (unsigned i = 0, e = Sequence.size(); i != e; ++i)
397 if (!Sequence[i])
400 assert(Sequence.size() + DeadNodes - Noops == SUnits.size() &&
|
| PostRASchedulerList.cpp | 259 // Schedule each sequence of instructions not interrupted by a label
323 Sequence.clear();
581 Sequence.push_back(SU);
622 Sequence.reserve(SUnits.size());
692 Sequence.push_back(0); // NULL here means noop
|
| ScheduleDAGInstrs.cpp | 674 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
675 if (SUnit *SU = Sequence[i])
684 if (!Sequence.empty())
685 Begin = Sequence[0]->getInstr();
|
| /external/chromium/testing/gmock/test/ |
| gmock_output_test_.cc | 48 using testing::Sequence;
154 Sequence s1, s2;
|
| gmock-spec-builders_test.cc | 90 using testing::Sequence;
366 Sequence s;
379 Sequence s;
391 Sequence s1, s2;
402 Sequence s;
417 Sequence s;
1045 Sequence s1, s2;
1224 // Tests that any order is allowed when no sequence is used.
[all...] |
| /external/clang/test/SemaTemplate/ |
| temp_arg_nontype.cpp | 203 template <typename Sequence, int I0>
204 struct as_nview<Sequence, I0> // expected-note{{while checking a default template argument used here}}
|
| /external/chromium/testing/gmock/src/ |
| gmock-spec-builders.cc | 241 // Points to the implicit sequence introduced by a living InSequence
243 ThreadLocal<Sequence*> g_gmock_implicit_sequence;
767 // Adds an expectation to a sequence.
768 void Sequence::AddExpectation(const Expectation& expectation) const {
778 // Creates the implicit sequence if there isn't one.
781 internal::g_gmock_implicit_sequence.set(new Sequence);
788 // Deletes the implicit sequence if it was created by the constructor
|
| /external/harfbuzz/src/ |
| harfbuzz-gsub-private.h | 92 HB_Sequence* Sequence; /* array of Sequence tables */
95 HB_UShort SequenceCount; /* number of Sequence tables */
163 glyph sequence */
|
| harfbuzz-gsub.c | 323 /* Sequence */
409 ms->Sequence = NULL;
411 if ( ALLOC_ARRAY( ms->Sequence, count, HB_Sequence ) )
414 s = ms->Sequence;
454 if ( ms->Sequence )
457 s = ms->Sequence;
497 count = ms->Sequence[index].GlyphCount;
498 s = ms->Sequence[index].Substitute;
[all...] |
| /external/icu4c/test/intltest/ |
| wbnf.cpp | 685 class Sequence : public Pick {
702 virtual ~Sequence(){
890 // combining sequence.
1153 UBool sequence(Pick* &node \/*out*\/){ function in class:Parser
[all...] |
| /external/neven/ |
| Android.mk | 64 Embedded/common/src/b_BitFeatureEm/Sequence.c \
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 494 std::vector<SUnit*> Sequence; // The schedule. Null SUnit*'s
523 /// according to the order specified in Sequence.
566 /// in the Sequence member.
|
| /external/llvm/lib/Transforms/Scalar/ |
| ObjCARC.cpp | [all...] |
| LoopStrengthReduce.cpp | [all...] |
| /external/blktrace/doc/ |
| blktrace.tex | 76 \emph{bt} is the name of the directory from the above git sequence). The
129 To build and install the tools, execute the following sequence (as root):
607 \emph{s} & Sequence numbers \\ \hline
666 \item[\%8s] Sequence number
[all...] |
| /external/opencv/cxcore/src/ |
| cxpersistence.cpp | 258 CV_PARSE_ERROR( "Sequence element should not have name (use <_></_>)" );
655 /* returns the sequence element by its index */
[all...] |
