Update the type and cost of existing networks if its type is found later by network monitor

webrtc/p2p/base/candidate.h

Index: webrtc/p2p/base/candidate.h
diff --git a/webrtc/p2p/base/candidate.h b/webrtc/p2p/base/candidate.h
index b918344740a6e545f1aee21399bd638608980d69..4eb05f0c631d8679cda0397ece146e169b9a0b1b 100644
--- a/webrtc/p2p/base/candidate.h
+++ b/webrtc/p2p/base/candidate.h
@@ -27,8 +27,6 @@
 
 namespace cricket {
 
-const uint16_t kMaxNetworkCost = 999;
-
 // Candidate for ICE based connection discovery.
 
 class Candidate {
@@ -148,9 +146,9 @@ class Candidate {
 
   // |network_cost| measures the cost/penalty of using this candidate. A network
   // cost of 0 indicates this candidate can be used freely. A value of
-  // |kMaxNetworkCost| indicates it should be used only as the last resort.
+  // rtc::kNetworkCostMax indicates it should be used only as the last resort.
   void set_network_cost(uint16_t network_cost) {
-    ASSERT(network_cost <= kMaxNetworkCost);
+    ASSERT(network_cost <= rtc::kNetworkCostMax);
     network_cost_ = network_cost;
   }
   uint16_t network_cost() const { return network_cost_; }