Lines Matching full:visited
308 v_t visited;
319 visited.push_back(path::filename(i->path()));
321 v_t::const_iterator a0 = std::find(visited.begin(), visited.end(), "a0");
322 v_t::const_iterator aa1 = std::find(visited.begin(), visited.end(), "aa1");
323 v_t::const_iterator ab1 = std::find(visited.begin(), visited.end(), "ab1");
324 v_t::const_iterator dontlookhere = std::find(visited.begin(), visited.end(),
326 v_t::const_iterator da1 = std::find(visited.begin(), visited.end(), "da1");
327 v_t::const_iterator z0 = std::find(visited.begin(), visited.end(), "z0");
328 v_t::const_iterator za1 = std::find(visited.begin(), visited.end(), "za1");
329 v_t::const_iterator pop = std::find(visited.begin(), visited.end(), "pop");
330 v_t::const_iterator p1 = std::find(visited.begin(), visited.end(), "p1");
332 // Make sure that each path was visited correctly.
333 ASSERT_NE(a0, visited.end());
334 ASSERT_NE(aa1, visited.end());
335 ASSERT_NE(ab1, visited.end());
336 ASSERT_NE(dontlookhere, visited.end());
337 ASSERT_EQ(da1, visited.end()); // Not visited.
338 ASSERT_NE(z0, visited.end());
339 ASSERT_NE(za1, visited.end());
340 ASSERT_NE(pop, visited.end());
341 ASSERT_EQ(p1, visited.end()); // Not visited.
343 // Make sure that parents were visited before children. No other ordering
