chore(util): remove dead code

src/util/CMakeLists.txt

@@ -1,6 +1,5 @@
 add_library(util OBJECT object_ref.cpp name.cpp name_set.cpp fresh_name.cpp
   escaped.cpp bit_tricks.cpp safe_arith.cpp ascii.cpp shared_mutex.cpp
   path.cpp lean_path.cpp lbool.cpp bitap_fuzzy_search.cpp
-  init_module.cpp name_map.cpp list_fn.cpp file_lock.cpp
-  timeit.cpp timer.cpp cancellable.cpp
+  init_module.cpp list_fn.cpp file_lock.cpp timeit.cpp timer.cpp cancellable.cpp
   parser_exception.cpp name_generator.cpp kvmap.cpp)

src/util/name_map.cpp

@@ -1,17 +0,0 @@
-/*
-Copyright (c) 2014 Microsoft Corporation. All rights reserved.
-Released under Apache 2.0 license as described in the file LICENSE.
-
-Author: Leonardo de Moura
-*/
-#include "util/name_map.h"
-
-namespace lean {
-name const & rename_map::find(name const & k) const {
-    name const * it = &k;
-    while (name const * new_it = name_map<name>::find(*it)) {
-        it = new_it;
-    }
-    return *it;
-}
-}

src/util/name_map.h

@@ -9,12 +9,4 @@ Author: Leonardo de Moura
 #include "util/name.h"
 namespace lean {
 template<typename T> using name_map = rb_map<name, T, name_quick_cmp>;
-
-class rename_map : public name_map<name> {
-public:
-    // Similar to name_map::find, but it "follows" the sequence of renames.
-    // Example, if map contains "A->B" and "B->C", then find(A) returns C.
-    // Moreover, if k is not in the map, the result is \c k
-    name const & find(name const & k) const;
-};
 }