AU: Class to perform delta updates.

src/platform/update_engine/cycle_breaker.cc

 // Copyright (c) 2010 The Chromium OS Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "update_engine/cycle_breaker.h"
 #include <set>
 #include <utility>
 #include "update_engine/graph_utils.h"
 #include "update_engine/tarjan.h"
 #include "update_engine/utils.h"
@@ skipping 58 matching lines @@
   }
   
   out_cut_edges->swap(cut_edges_);
   DCHECK(stack_.empty());
 }
 
 void CycleBreaker::HandleCircuit() {
   stack_.push_back(current_vertex_);
   CHECK_GE(stack_.size(), 2);
   Edge min_edge = make_pair(stack_[0], stack_[1]);
-  uint64 min_edge_weight = kuint64max;
+  uint64_t min_edge_weight = kuint64max;
   for (vector<Vertex::Index>::const_iterator it = stack_.begin();
        it != (stack_.end() - 1); ++it) {
     Edge edge = make_pair(*it, *(it + 1));
     if (cut_edges_.find(edge) != cut_edges_.end()) {
       stack_.pop_back();
       return;
     }
-    uint64 edge_weight = graph_utils::EdgeWeight(subgraph_, edge);
+    uint64_t edge_weight = graph_utils::EdgeWeight(subgraph_, edge);
     if (edge_weight < min_edge_weight) {
       min_edge_weight = edge_weight;
       min_edge = edge;
     }
   }
   cut_edges_.insert(min_edge);
   stack_.pop_back();
 }
 
 void CycleBreaker::Unblock(Vertex::Index u) {
@@ skipping 37 matching lines @@
          w != subgraph_[vertex].subgraph_edges.end(); ++w) {
       subgraph_[*w].subgraph_edges.insert(vertex);
     }
   }
   CHECK_EQ(vertex, stack_.back());
   stack_.pop_back();
   return found;
 }
 
 }  // namespace chromeos_update_engine