Lines Matching refs:it
42 for (vector<Extent>::const_iterator it = extents.begin();
43 it != extents.end(); ++it) {
44 if (it->start_block() != kSparseHole)
45 weight += it->num_blocks();
68 for (vector<Extent>::const_iterator it = extents.begin(), e = extents.end();
69 it != e; ++it) {
70 const Extent& extent = *it;
81 for (Vertex::EdgeMap::iterator it = edge_map->begin();
82 it != edge_map->end(); ) {
83 if (!it->second.write_extents.empty())
84 it->second.write_extents.clear();
85 if (it->second.extents.empty()) {
86 // Erase *it, as it contains no blocks
87 edge_map->erase(it++);
89 ++it;
98 for (Graph::iterator it = graph->begin(), e = graph->end(); it != e; ++it) {
99 it->out_edges.erase(index);
114 for (Vertex::EdgeMap::const_iterator it = out_edges.begin(),
115 e = out_edges.end(); it != e; ++it) {
116 LOG(INFO) << " " << it->first << " read-before:";
117 DumpExtents(it->second.extents, 6);
119 DumpExtents(it->second.write_extents, 6);
