Home
last modified time | relevance | path

Searched refs:incoming_count (Results 1 – 2 of 2) sorted by relevance

/third_party/libuv/test/
Dtest-pipe-sendmsg.c39 static unsigned int incoming_count; variable
88 ASSERT(incoming_count < ARRAY_SIZE(incoming)); in read_cb()
89 inc = &incoming[incoming_count++]; in read_cb()
94 if (incoming_count != ARRAY_SIZE(incoming)) in read_cb()
157 ASSERT(ARRAY_SIZE(incoming) == incoming_count); in TEST_IMPL()
/third_party/boost/boost/polygon/detail/
Dpolygon_arbitrary_formation.hpp1226 …vector<std::pair<std::pair<std::pair<Point, Point>, int>, active_tail_arbitrary*> > incoming_count; typedef in boost::polygon::polygon_arbitrary_formation
1247 static inline void sort_incoming_count(incoming_count& count, const Point& pt) { in sort_incoming_count()
1370incoming_count& counts_from_scanline, vertex_arbitrary_count& incoming_count) { in processPoint_() argument
1378 incoming.reserve(incoming_count.size()); in processPoint_()
1383 for(std::size_t i = 0; i < incoming_count.size(); ++i) { in processPoint_()
1384 incoming.push_back(incoming_count[i].second); in processPoint_()
1385 if(incoming_count[i].first < point) { in processPoint_()
1453 … if(j == i_size_less_1 && incoming_count[j].first.get(HORIZONTAL) == point.get(HORIZONTAL)) { in processPoint_()
1463incoming_count[j].first, -1), tailPair.first)); in processPoint_()
1469incoming_count[i].first, 1), tailPair.second)); in processPoint_()
[all …]