HomeSort by relevance Sort by last modified time
    Searched refs:positions_ (Results 1 - 9 of 9) sorted by null

  /external/chromium_org/ui/base/models/
tree_node_iterator.h 45 positions_.push(Position<NodeType>(node, index));
50 positions_.push(Position<NodeType>(node, 0));
54 bool has_next() const { return !positions_.empty(); }
64 NodeType* result = positions_.top().node->GetChild(positions_.top().index);
67 positions_.top().index++;
70 positions_.push(Position<NodeType>(result, 0));
76 while (!positions_.empty()) {
77 if (positions_.top().index >= positions_.top().node->child_count()
99 std::stack<Position<NodeType> > positions_; member in class:ui::TreeNodeIterator
    [all...]
  /external/openfst/src/include/fst/extensions/far/
sttable.h 84 positions_.push_back(stream_.tellp());
92 WriteType(stream_, positions_);
93 WriteType(stream_, static_cast<int64>(positions_.size()));
99 vector<int64> positions_; // Position in file of each key-entry pair member in class:fst::STTableWriter
126 positions_.resize(filenames.size());
150 positions_[i].resize(num_entries);
152 ReadType(*streams_[i], &(positions_[i][j]));
153 streams_[i]->seekg(positions_[i][0]);
190 streams_[i]->seekg(positions_[i].front());
206 if (streams_[current_]->tellg() <= positions_[current_].back())
315 vector<vector<int64> > positions_; \/\/ Index of positions for each stream member in class:fst::STTableReader
    [all...]
  /external/chromium_org/sync/internal_api/public/base/
unique_position_unittest.cc 598 positions_.push_back(
602 positions_.push_back(
606 positions_.push_back(
610 positions_.push_back(
622 std::vector<UniquePosition> positions_; member in class:syncer::__anon15405::CompressedPositionTest
649 for (std::vector<UniquePosition>::const_iterator it = positions_.begin();
650 it != positions_.end(); ++it) {
673 for (size_t i = 0; i < positions_.size()-1; ++i) {
674 EXPECT_PRED_FORMAT2(LessThan, positions_[i], positions_[i+1])
    [all...]
  /external/chromium_org/courgette/
adjustment_method.cc 56 std::vector<uint32> positions_; // Offsets into the trace of references. member in class:courgette::LabelInfo
383 TryExtendSequence(p_info_next->positions_[0],
384 m_info_next->positions_[0]);
385 TryExtendSequenceBackwards(p_info_next->positions_[0],
386 m_info_next->positions_[0]);
630 if (curr->positions_.size() != curr->refs_)
647 slot.positions_.push_back(position);
adjustment_method_2.cc 188 std::vector<uint32> positions_; // Offsets into the trace of references. member in class:courgette::adjustment_method_2::LabelInfo
223 slot.positions_.push_back(position);
245 return a->positions_ < b->positions_; // Lexicographic ordering of vector.
391 positions_.push_back(static_cast<uint32>(position));
393 int position_count() const { return static_cast<int>(positions_.size()); }
417 std::vector<uint32> positions_; // Includes exemplar_position_. member in class:courgette::adjustment_method_2::Shingle
946 for (size_t i = 0; i < info->positions_.size(); ++i) {
947 size_t position = info->positions_[i];
    [all...]
  /external/chromium_org/native_client_sdk/src/examples/demo/voronoi/
voronoi.cc 137 Vec2 positions_[kMaxPointCount]; member in class:Voronoi
162 positions_[i].Set(x, y);
373 positions_[j].x += (velocities_[j].x) * z;
374 positions_[j].y += (velocities_[j].y) * z;
375 screen_positions_[j].x = positions_[j].x * ps_context_->width;
376 screen_positions_[j].y = positions_[j].y * ps_context_->height;
461 positions_[i].Set(point.x() / ps_context_->width,
  /external/chromium_org/native_client_sdk/src/gonacl_appengine/src/voronoi/
voronoi.cc 129 Vec2 positions_[kMaxPointCount]; member in class:Voronoi
151 positions_[i].Set(x, y);
370 positions_[j].x += (velocities_[j].x) * z;
371 positions_[j].y += (velocities_[j].y) * z;
372 screen_positions_[j].x = positions_[j].x * ps_context_->width;
373 screen_positions_[j].y = positions_[j].y * ps_context_->height;
432 positions_[i].Set(point.x() / ps_context_->width,
  /external/chromium_org/v8/src/
jsregexp.cc     [all...]
jsregexp.h 549 return positions_ + index;
558 Position positions_[4];
    [all...]

Completed in 411 milliseconds