Home
last modified time | relevance | path

Searched refs:positions_ (Results 1 – 8 of 8) sorted by relevance

/external/chromium_org/ui/base/models/
Dtree_node_iterator.h42 positions_.push(Position<NodeType>(node, index)); in TreeNodeIterator()
47 positions_.push(Position<NodeType>(node, 0)); in TreeNodeIterator()
51 bool has_next() const { return !positions_.empty(); } in has_next()
61 NodeType* result = positions_.top().node->GetChild(positions_.top().index); in Next()
64 positions_.top().index++; in Next()
67 positions_.push(Position<NodeType>(result, 0)); in Next()
73 while (!positions_.empty()) { in Next()
74 if (positions_.top().index >= positions_.top().node->child_count()) in Next()
75 positions_.pop(); // This Position is all processed, move to the next. in Next()
77 prune_(positions_.top().node->GetChild(positions_.top().index))) in Next()
[all …]
/external/chromium_org/sync/internal_api/public/base/
Dunique_position_unittest.cc598 positions_.push_back( in CompressedPositionTest()
602 positions_.push_back( in CompressedPositionTest()
606 positions_.push_back( in CompressedPositionTest()
610 positions_.push_back( in CompressedPositionTest()
622 std::vector<UniquePosition> positions_; member in syncer::__anon3001e3160111::CompressedPositionTest
649 for (std::vector<UniquePosition>::const_iterator it = positions_.begin(); in TEST_F()
650 it != positions_.end(); ++it) { in TEST_F()
673 for (size_t i = 0; i < positions_.size()-1; ++i) { in TEST_F()
674 EXPECT_PRED_FORMAT2(LessThan, positions_[i], positions_[i+1]); in TEST_F()
/external/chromium_org/native_client_sdk/src/examples/demo/voronoi/
Dvoronoi.cc137 Vec2 positions_[kMaxPointCount]; member in Voronoi
162 positions_[i].Set(x, y); in Reset()
373 positions_[j].x += (velocities_[j].x) * z; in UpdateSim()
374 positions_[j].y += (velocities_[j].y) * z; in UpdateSim()
375 screen_positions_[j].x = positions_[j].x * ps_context_->width; in UpdateSim()
376 screen_positions_[j].y = positions_[j].y * ps_context_->height; in UpdateSim()
461 positions_[i].Set(point.x() / ps_context_->width, in HandleEvent()
/external/chromium_org/native_client_sdk/src/gonacl_appengine/src/voronoi/
Dvoronoi.cc129 Vec2 positions_[kMaxPointCount]; member in Voronoi
151 positions_[i].Set(x, y); in Reset()
370 positions_[j].x += (velocities_[j].x) * z; in UpdateSim()
371 positions_[j].y += (velocities_[j].y) * z; in UpdateSim()
372 screen_positions_[j].x = positions_[j].x * ps_context_->width; in UpdateSim()
373 screen_positions_[j].y = positions_[j].y * ps_context_->height; in UpdateSim()
432 positions_[i].Set(point.x() / ps_context_->width, in HandleEvent()
/external/chromium_org/courgette/
Dadjustment_method.cc56 std::vector<uint32> positions_; // Offsets into the trace of references. member in courgette::LabelInfo
383 TryExtendSequence(p_info_next->positions_[0], in TryExtendAssignment()
384 m_info_next->positions_[0]); in TryExtendAssignment()
385 TryExtendSequenceBackwards(p_info_next->positions_[0], in TryExtendAssignment()
386 m_info_next->positions_[0]); in TryExtendAssignment()
630 if (curr->positions_.size() != curr->refs_) in LinkLabelInfos()
647 slot.positions_.push_back(position); in MakeLabelInfo()
Dadjustment_method_2.cc188 std::vector<uint32> positions_; // Offsets into the trace of references. member in courgette::adjustment_method_2::LabelInfo
223 slot.positions_.push_back(position); in MakeLabelInfo()
245 return a->positions_ < b->positions_; // Lexicographic ordering of vector. in operator ()()
391 positions_.push_back(static_cast<uint32>(position)); in add_position()
393 int position_count() const { return static_cast<int>(positions_.size()); } in position_count()
417 std::vector<uint32> positions_; // Includes exemplar_position_. member in courgette::adjustment_method_2::Shingle
946 for (size_t i = 0; i < info->positions_.size(); ++i) { in AddAffectedPositions()
947 size_t position = info->positions_[i]; in AddAffectedPositions()
/external/chromium_org/v8/src/
Djsregexp.cc2444 Position* pos = &positions_[i]; in Rationalize()
2686 positions_[i].mask = 0; in Clear()
2687 positions_[i].value = 0; in Clear()
2688 positions_[i].determines_perfectly = false; in Clear()
2701 positions_[i] = positions_[by + i]; in Advance()
2704 positions_[i].mask = 0; in Advance()
2705 positions_[i].value = 0; in Advance()
2706 positions_[i].determines_perfectly = false; in Advance()
Djsregexp.h546 return positions_ + index; in positions()
555 Position positions_[4]; variable