| /external/chromium/net/spdy/ |
| spdy_io_buffer.cc | 11 uint64 SpdyIOBuffer::order_ = 0; member in class:net::SpdyIOBuffer
17 position_(++order_),
|
| spdy_io_buffer.h | 51 static uint64 order_; // Maintains a FIFO order for equal priorities. member in class:net::SpdyIOBuffer
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| topsort.h | 42 : order_(order), acyclic_(acyclic) {}
61 order_->clear();
63 order_->push_back(kNoStateId);
65 (*order_)[(*finish_)[finish_->size() - s - 1]] = s;
71 vector<StateId> *order_; member in class:fst::TopOrderVisitor
|
| queue.h | 293 order_(0), state_(0) {
295 TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic);
299 state_.resize(order_.size(), kNoStateId);
306 order_(order), state_(order.size(), kNoStateId) {}
311 if (front_ > back_) front_ = back_ = order_[s];
312 else if (order_[s] > back_) back_ = order_[s];
313 else if (order_[s] < front_) front_ = order_[s];
314 state_[order_[s]] = s
335 vector<StateId> order_; member in class:fst::TopOrderQueue
[all...] |
| /external/chromium/chrome/browser/sync/glue/ |
| data_type_manager_impl.cc | 48 : order_(order) { }
52 return (*order_)[lhs->type()] < (*order_)[rhs->type()];
56 std::map<syncable::ModelType, int>* order_; member in class:browser_sync::__anon3068::SortComparator
|
| /external/chromium/base/ |
| message_loop_unittest.cc | 661 : order_(order),
666 : order_(order),
674 order_->push_back(item);
679 order_->push_back(item);
689 return order_;
697 TaskList* order_; member in class:OrderedTasks
824 order_(order),
830 new RecursiveTask(2, order_, 1, is_reentrant_));
832 new MessageBoxTask(order_, 2, is_reentrant_));
834 new RecursiveTask(2, order_, 3, is_reentrant_))
870 TaskList* order_; member in class:Recursive2Tasks
[all...] |
| /external/chromium/chrome/browser/resources/file_manager/js/ |
| exif_reader.js | 198 this.order_ = order;
|
