| /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...] |
| /system/core/libunwindstack/ |
| DwarfOp.cpp | 41 stack_.clear();
107 if (stack_.size() < op->num_required_stack_values) {
177 stack_.push_front(value);
196 stack_.push_front(value);
204 stack_.push_front(operand);
211 stack_.push_front(StackAt(0));
223 stack_.push_front(StackAt(1));
234 stack_.push_front(StackAt(index));
240 AddressType old_value = stack_[0];
241 stack_[0] = stack_[1]
[all...] |
| /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/ |
| Tarjan.h | 70 : index_(0), stack_(allocator), components_(allocator) {}
79 allocator::vector<Node<T>*> stack_; member in class:android::TarjanAlgorithm
85 stack_.clear();
107 stack_.push_back(vertex);
113 } else if (std::find(stack_.begin(), stack_.end(), vertex_next) != stack_.end()) {
121 other_vertex = stack_.back();
122 stack_.pop_back();
124 } while (other_vertex != vertex && !stack_.empty())
[all...] |
| PtracerThread.h | 47 std::unique_ptr<Stack> stack_; member in class:android::PtracerThread
|
| PtracerThread.cpp | 71 stack_ = std::make_unique<Stack>(PTHREAD_STACK_MIN);
72 if (stack_->top() == nullptr) {
89 stack_ = nullptr;
102 child_pid_ = clone(proxy, stack_->top(), CLONE_VM | CLONE_FS | CLONE_FILES /*|CLONE_UNTRACED*/,
|
| /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/pdfium/core/fpdfapi/parser/ |
| cpdf_object_walker.cpp | 132 while (!stack_.empty() || next_object_) {
137 stack_.push(std::move(new_iterator));
144 SubobjectIterator* it = stack_.top().get();
146 stack_.pop();
153 current_depth_ = stack_.size();
162 if (stack_.empty() || stack_.top()->IsStarted())
164 stack_.pop();
|
| /external/libchrome/base/ |
| at_exit.h | 65 std::stack<base::Closure> stack_; member in class:base::AtExitManager
|
| at_exit.cc | 64 g_top_manager->stack_.push(std::move(task));
80 tasks.swap(g_top_manager->stack_);
95 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/tensorflow/tensorflow/compiler/jit/graphcycles/ |
| graphcycles.cc | 73 Vec<int32> stack_; // Emulates recursion stack when doing depth first search member in struct:tensorflow::GraphCycles::Rep
201 r->stack_.clear();
202 r->stack_.push_back(n);
203 while (!r->stack_.empty()) {
204 n = r->stack_.back();
205 r->stack_.pop_back();
218 r->stack_.push_back(w);
227 r->stack_.clear();
228 r->stack_.push_back(n);
229 while (!r->stack_.empty())
[all...] |
| /external/tensorflow/tensorflow/core/platform/default/ |
| stacktrace.h | 91 void* const* stack() const { return stack_; }
94 void* stack_[32]; member in class:tensorflow::SavedStackTrace
|
| /external/v8/src/compiler/ |
| graph-reducer.cc | 34 stack_(zone) {
49 DCHECK(stack_.empty());
53 if (!stack_.empty()) {
74 DCHECK(stack_.empty());
112 NodeState& entry = stack_.top();
260 Node* node = stack_.top().node;
262 stack_.pop();
269 stack_.push({node, 0});
|
| /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
|
| /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/tensorflow/tensorflow/compiler/xla/ |
| shape_tree.h | 350 stack_.push_back({node_, child_index});
362 stack_(other.stack_),
369 while (!stack_.empty()) {
370 node_ = stack_.back().first;
371 int64 next_child_index = stack_.back().second - 1;
372 stack_.pop_back();
379 stack_.push_back({node_, next_child_index});
383 stack_.push_back({node_, child_index});
393 stack_.push_back({node_, /*child-index=*/0})
458 std::vector<std::pair<NodeType*, int64>> stack_; member in class:xla::ShapeTreeIterator
[all...] |
