| /packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/ |
| stringbuffer.h | 39 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...] |
| document.h | 2073 internal::Stack<StackAllocator> stack_; member in class:GenericDocument
[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 | 28 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) {
32 // str_ and stack_ are pointers so that it's easy to turn bytestrie.h into
39 stack_=new UVector32(errorCode);
40 if(U_SUCCESS(errorCode) && (str_==NULL || stack_==NULL)) {
50 str_(NULL), maxLength_(maxStringLength), value_(0), stack_(NULL) {
55 stack_=new UVector32(errorCode);
59 if(str_==NULL || stack_==NULL) {
78 delete stack_;
92 stack_->setSize(0);
97 BytesTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty();
[all...] |
| ucharstrieiterator.cpp | 28 maxLength_(maxStringLength), value_(0), stack_(NULL) {
32 // stack_ is a pointer so that it's easy to turn ucharstrie.h into
38 stack_=new UVector32(errorCode);
39 if(stack_==NULL) {
50 maxLength_(maxStringLength), value_(0), stack_(NULL) {
54 stack_=new UVector32(errorCode);
58 if(stack_==NULL) {
76 delete stack_;
91 stack_->setSize(0);
96 UCharsTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty();
[all...] |
| /external/libchrome/base/ |
| at_exit.cc | 58 g_top_manager->stack_.push(task);
70 while (!g_top_manager->stack_.empty()) {
71 base::Closure task = g_top_manager->stack_.top();
73 g_top_manager->stack_.pop();
|
| at_exit.h | 61 std::stack<base::Closure> stack_; member in class:base::AtExitManager
|
| /system/core/libmemunreachable/ |
| PtracerThread.h | 44 std::unique_ptr<Stack> stack_; member in class:PtracerThread
|
| Tarjan.h | 66 stack_(allocator), components_(allocator) {}
74 allocator::vector<Node<T>*> stack_; member in class:TarjanAlgorithm
80 stack_.clear();
102 stack_.push_back(vertex);
108 } else if (std::find(stack_.begin(), stack_.end(), vertex_next) != stack_.end()) {
116 other_vertex = stack_.back();
117 stack_.pop_back();
119 } 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 | 81 stack_(std::move(r.stack_)) {}
85 stack_(r.stack_) {}
96 return stack_.size();
101 return stack_[index];
105 stack_.push_back(element);
109 DCHECK_LT(index, stack_.size());
110 stack_[index].SetMethod(m);
111 stack_[index].SetDexPc(dex_pc)
121 std::vector<AllocRecordStackTraceElement> stack_; member in class:art::gc::AllocRecordStackTrace
[all...] |
| /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();
241 Node* node = stack_.top().node;
243 stack_.pop();
250 stack_.push({node, 0});
|
| /art/runtime/ |
| thread_pool.h | 56 DCHECK(stack_.get() != nullptr);
57 return stack_->Size();
72 std::unique_ptr<MemMap> stack_; member in class:art::ThreadPoolWorker
|
| thread_pool.cc | 43 stack_.reset(MemMap::MapAnonymous(name.c_str(), nullptr, stack_size, PROT_READ | PROT_WRITE,
45 CHECK(stack_.get() != nullptr) << error_msg;
46 CHECK_ALIGNED(stack_->Begin(), kPageSize);
47 int mprotect_result = mprotect(stack_->Begin(), kPageSize, PROT_NONE);
52 CHECK_PTHREAD_CALL(pthread_attr_setstack, (&attr, stack_->Begin(), stack_->Size()), reason);
|
| /external/bison/data/ |
| stack.hh | 100 : stack_ (stack)
109 return stack_[range_ - i];
113 const S& stack_;
|
| /external/v8/src/crankshaft/x87/ |
| lithium-codegen-x87.h | 364 stack_[i] = other.stack_[i];
370 if (!stack_[i].is(other.stack_[i])) return false;
377 stack_[i] = other.stack_[i];
399 stack_[stack_depth_] = reg;
410 X87Register stack_[X87Register::kMaxNumAllocatableRegisters]; member in class:v8::internal::LCodeGen::X87Stack
|
