HomeSort by relevance Sort by last modified time
    Searched refs:stack_ (Results 1 - 25 of 75) sorted by null

1 2 3

  /packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/
stringbuffer.h 39 explicit GenericStringBuffer(Allocator* allocator = 0, size_t capacity = kDefaultCapacity) : stack_(allocator, capacity) {}
42 GenericStringBuffer(GenericStringBuffer&& rhs) : stack_(std::move(rhs.stack_)) {}
45 stack_ = std::move(rhs.stack_);
50 void Put(Ch c) { *stack_.template Push<Ch>() = c; }
53 void Clear() { stack_.Clear(); }
56 *stack_.template Push<Ch>() = '\0';
57 stack_.ShrinkToFit();
58 stack_.template Pop<Ch>(1);
74 mutable internal::Stack<Allocator> stack_; member in class:GenericStringBuffer
    [all...]
memorybuffer.h 40 GenericMemoryBuffer(Allocator* allocator = 0, size_t capacity = kDefaultCapacity) : stack_(allocator, capacity) {}
42 void Put(Ch c) { *stack_.template Push<Ch>() = c; }
45 void Clear() { stack_.Clear(); }
46 void ShrinkToFit() { stack_.ShrinkToFit(); }
47 Ch* Push(size_t count) { return stack_.template Push<Ch>(count); }
48 void Pop(size_t count) { stack_.template Pop<Ch>(count); }
51 return stack_.template Bottom<Ch>();
54 size_t GetSize() const { return stack_.GetSize(); }
57 mutable internal::Stack<Allocator> stack_; member in struct:GenericMemoryBuffer
65 std::memset(memoryBuffer.stack_.Push<char>(n), c, n * sizeof(c))
    [all...]
  /packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/internal/
stack.h 33 // Optimization note: Do not allocate memory for stack_ in constructor.
35 Stack(Allocator* allocator, size_t stackCapacity) : allocator_(allocator), ownAllocator_(0), stack_(0), stackTop_(0), stackEnd_(0), initialCapacity_(stackCapacity) {
43 stack_(rhs.stack_),
50 rhs.stack_ = 0;
69 stack_ = rhs.stack_;
76 rhs.stack_ = 0;
88 internal::Swap(stack_, rhs.stack_);
187 char *stack_; member in class:internal::Stack
    [all...]
  /external/bison/examples/calc++/
stack.hh 112 : stack_ (stack)
121 return stack_[range_ - i];
125 const S& stack_; member in class:yy::slice
  /system/update_engine/payload_generator/
tarjan.cc 37 stack_.clear();
54 stack_.push_back(vertex);
62 } else if (utils::VectorContainsValue(stack_, vertex_next)) {
71 other_vertex = stack_.back();
72 stack_.pop_back();
74 } while (other_vertex != vertex && !stack_.empty());
cycle_breaker.cc 101 DCHECK(stack_.empty());
107 stack_.push_back(current_vertex_);
108 CHECK_GE(stack_.size(),
110 Edge min_edge = make_pair(stack_[0], stack_[1]);
113 for (vector<Vertex::Index>::const_iterator it = stack_.begin();
114 it != (stack_.end() - 1); ++it) {
117 stack_.pop_back();
130 stack_.pop_back();
146 for (vector<Vertex::Index>::const_iterator it = ++stack_.begin()
    [all...]
cycle_breaker.h 58 std::vector<Vertex::Index> stack_; // the stack variable in the paper member in class:chromeos_update_engine::CycleBreaker
tarjan.h 46 std::vector<Vertex::Index> stack_; member in class:chromeos_update_engine::TarjanAlgorithm
  /external/icu/icu4c/source/common/
bytestrieiterator.cpp 30 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) {
34 // str_ and stack_ are pointers so that it's easy to turn bytestrie.h into
41 stack_=new UVector32(errorCode);
42 if(U_SUCCESS(errorCode) && (str_==NULL || stack_==NULL)) {
52 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) {
57 stack_=new UVector32(errorCode);
61 if(str_==NULL || stack_==NULL) {
80 delete stack_;
94 stack_->setSize(0);
99 BytesTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty();
    [all...]
ucharstrieiterator.cpp 30 maxLength_(maxStringLength), value_(0), stack_(NULL) {
34 // stack_ is a pointer so that it's easy to turn ucharstrie.h into
40 stack_=new UVector32(errorCode);
41 if(stack_==NULL) {
52 maxLength_(maxStringLength), value_(0), stack_(NULL) {
56 stack_=new UVector32(errorCode);
60 if(stack_==NULL) {
78 delete stack_;
93 stack_->setSize(0);
98 UCharsTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty();
    [all...]
  /system/core/libmemunreachable/
PtracerThread.h 44 std::unique_ptr<Stack> stack_; member in class:PtracerThread
Tarjan.h 67 stack_(allocator), components_(allocator) {}
75 allocator::vector<Node<T>*> stack_; member in class:TarjanAlgorithm
81 stack_.clear();
103 stack_.push_back(vertex);
109 } else if (std::find(stack_.begin(), stack_.end(), vertex_next) != stack_.end()) {
117 other_vertex = stack_.back();
118 stack_.pop_back();
120 } while (other_vertex != vertex && !stack_.empty())
    [all...]
PtracerThread.cpp 71 stack_ = std::make_unique<Stack>(PTHREAD_STACK_MIN);
72 if (stack_->top() == nullptr) {
89 stack_ = nullptr;
101 child_pid_ = clone(proxy, stack_->top(),
  /external/regex-re2/re2/
walker-inl.h 89 stack<WalkState<T> >* stack_; member in class:re2::Regexp::Walker
133 stack_ = new stack<WalkState<T> >;
139 delete stack_;
146 if (stack_ && stack_->size() > 0) {
148 while (stack_->size() > 0) {
149 delete stack_->top().child_args;
150 stack_->pop();
164 stack_->push(WalkState<T>(re, top_arg));
169 s = &stack_->top()
    [all...]
  /art/runtime/gc/
allocation_record.h 82 stack_(std::move(r.stack_)) {}
86 stack_(r.stack_) {}
97 return stack_.size();
102 return stack_[index];
106 stack_.push_back(element);
110 DCHECK_LT(index, stack_.size());
111 stack_[index].SetMethod(m);
112 stack_[index].SetDexPc(dex_pc)
122 std::vector<AllocRecordStackTraceElement> stack_; member in class:art::gc::AllocRecordStackTrace
    [all...]
  /external/libchrome/base/
at_exit.h 61 std::stack<base::Closure> stack_; member in class:base::AtExitManager
at_exit.cc 61 g_top_manager->stack_.push(std::move(task));
77 tasks.swap(g_top_manager->stack_);
88 DCHECK(g_top_manager->stack_.empty());
  /external/google-breakpad/src/processor/
postfix_evaluator-inl.h 61 explicit AutoStackClearer(vector<string> *stack) : stack_(stack) {}
62 ~AutoStackClearer() { stack_->clear(); }
65 vector<string> *stack_; member in class:google_breakpad::AutoStackClearer
199 stack_.push_back(token);
237 AutoStackClearer clearer(&stack_);
245 if (stack_.empty())
256 AutoStackClearer clearer(&stack_);
262 if (stack_.size() != 1) {
276 if (!stack_.size())
279 string token = stack_.back()
    [all...]
postfix_evaluator.h 99 : dictionary_(dictionary), memory_(memory), stack_() {}
173 vector<string> stack_; member in class:google_breakpad::PostfixEvaluator
  /external/v8/src/compiler/
graph-reducer.cc 35 stack_(zone) {}
47 DCHECK(stack_.empty());
51 if (!stack_.empty()) {
72 DCHECK(stack_.empty());
110 NodeState& entry = stack_.top();
249 Node* node = stack_.top().node;
251 stack_.pop();
258 stack_.push({node, 0});
  /external/flatbuffers/include/flatbuffers/
flexbuffers.h 747 void Null() { stack_.push_back(Value()); }
750 void Int(int64_t i) { stack_.push_back(Value(i, TYPE_INT, WidthI(i))); }
753 void UInt(uint64_t u) { stack_.push_back(Value(u, TYPE_UINT, WidthU(u))); }
756 void Float(float f) { stack_.push_back(Value(f)); }
759 void Double(double f) { stack_.push_back(Value(f)); }
811 stack_.push_back(Value(static_cast<uint64_t>(sloc), TYPE_KEY, BIT_WIDTH_8));
829 stack_.back().u_ = sloc;
870 size_t StartVector() { return stack_.size(); }
871 size_t StartVector(const char *key) { Key(key); return stack_.size(); }
872 size_t StartMap() { return stack_.size();
    [all...]
  /art/runtime/
thread_pool.h 56 DCHECK(stack_.get() != nullptr);
57 return stack_->Size();
74 std::unique_ptr<MemMap> stack_; member in class:art::ThreadPoolWorker
thread_pool.cc 47 stack_.reset(MemMap::MapAnonymous(name.c_str(), nullptr, stack_size, PROT_READ | PROT_WRITE,
49 CHECK(stack_.get() != nullptr) << error_msg;
50 CHECK_ALIGNED(stack_->Begin(), kPageSize);
51 int mprotect_result = mprotect(stack_->Begin(), kPageSize, PROT_NONE);
56 CHECK_PTHREAD_CALL(pthread_attr_setstack, (&attr, stack_->Begin(), stack_->Size()), reason);
  /external/protobuf/src/google/protobuf/util/internal/
json_stream_parser.cc 99 stack_(),
112 stack_.push(VALUE);
150 if (stack_.empty() && leftover_.empty()) {
197 if (stack_.empty()) {
208 while (!stack_.empty()) {
209 ParseType type = stack_.top();
211 stack_.pop();
246 stack_.push(type);
569 stack_.push(ENTRY);
587 stack_.push(ENTRY)
    [all...]
  /external/bison/data/
stack.hh 100 : stack_ (stack)
109 return stack_[range_ - i];
113 const S& stack_;

Completed in 632 milliseconds

1 2 3