From c6cf9856b309d47f0de75c310501938d781d217d Mon Sep 17 00:00:00 2001 From: "lperron@google.com" Date: Fri, 8 Apr 2011 15:20:30 +0000 Subject: [PATCH] remove tabs --- examples/network_routing.cc | 44 ++++++++++++++++++------------------- 1 file changed, 22 insertions(+), 22 deletions(-) diff --git a/examples/network_routing.cc b/examples/network_routing.cc index 2011713a3d..5ec9419055 100644 --- a/examples/network_routing.cc +++ b/examples/network_routing.cc @@ -91,25 +91,25 @@ DEFINE_bool(focus_lns, true, "Focus LNS on highest cost arcs."); namespace operations_research { // ---------- Data and Data Generation ---------- - -namespace { -#if defined(_MSC_VER) - // The following class defines a hash function for arcs - class ArcHasher : public stdext::hash_compare > { - public: - size_t operator() (const pair& a) const { - uint32 x = a.first; - uint32 y = 0x9e3779b9UL; - uint32 z = a.second; - mix(x, y, z); - return z; - } - bool operator() (const pair& a1, const pair& a2) const { - return a1.first < a2.first || - (a1.first == a2.first && a1.second < a2.second); - } - }; -#endif + +namespace { +#if defined(_MSC_VER) + // The following class defines a hash function for arcs + class ArcHasher : public stdext::hash_compare > { + public: + size_t operator() (const pair& a) const { + uint32 x = a.first; + uint32 y = 0x9e3779b9UL; + uint32 z = a.second; + mix(x, y, z); + return z; + } + bool operator() (const pair& a1, const pair& a2) const { + return a1.first < a2.first || + (a1.first == a2.first && a1.second < a2.second); + } + }; +#endif } // namespace static const int64 kDisconnectedDistance = -1LL; @@ -165,9 +165,9 @@ class NetworkRoutingData { int num_nodes_; int max_capacity_; int fixed_charge_cost_; -#if defined(_MSC_VER) - hash_map, int, ArcHasher> all_arcs_; - hash_map, int, ArcHasher> all_demands_; +#if defined(_MSC_VER) + hash_map, int, ArcHasher> all_arcs_; + hash_map, int, ArcHasher> all_demands_; #else hash_map, int> all_arcs_; hash_map, int> all_demands_;