HomeSort by relevance Sort by last modified time
    Searched defs:polygon_list (Results 1 - 2 of 2) sorted by null

  /external/chromium_org/cc/output/
bsp_tree_unittest.cc 17 #define EXPECT_SORTED_LISTS_EQ(polygon_list, compare_list) \
19 EXPECT_EQ(polygon_list.size(), compare_list.size()); \
20 for (unsigned int i = 0; i < polygon_list.size(); i++) { \
21 EXPECT_EQ(polygon_list[i]->order_index(), compare_list[i]); \
116 ScopedPtrDeque<DrawPolygon> polygon_list; local
117 polygon_list.push_back(polygon_a.Pass());
118 polygon_list.push_back(polygon_b.Pass());
119 polygon_list.push_back(polygon_c.Pass());
123 BspTreeTest::RunTest(&polygon_list, compare_list);
144 ScopedPtrDeque<DrawPolygon> polygon_list; local
173 ScopedPtrDeque<DrawPolygon> polygon_list; local
202 ScopedPtrDeque<DrawPolygon> polygon_list; local
238 ScopedPtrDeque<DrawPolygon> polygon_list; local
279 ScopedPtrDeque<DrawPolygon> polygon_list; local
291 ScopedPtrDeque<DrawPolygon> polygon_list; local
336 ScopedPtrDeque<DrawPolygon> polygon_list; local
    [all...]
  /external/chromium_org/cc/trees/
layer_tree_host_common_perftest.cc 241 ScopedPtrVector<DrawPolygon> polygon_list; variable
249 polygon_list.push_back(scoped_ptr<DrawPolygon>(draw_polygon));
256 for (size_t i = 0; i < polygon_list.size(); i++) {
257 test_list.push_back(polygon_list[i]->CreateCopy());

Completed in 366 milliseconds