renaming to hagerup

Author: lrvideckis

library/trees/uncommon/linear_kth_par.hpp …brary/trees/uncommon/hagerup_kth_par.hpplibrary/trees/uncommon/linear_kth_par.hpp renamed to library/trees/uncommon/hagerup_kth_par.hpp library/trees/uncommon/linear_kth_par.hpp renamed to library/trees/uncommon/hagerup_kth_par.hpp

@@ -2,17 +2,17 @@
 //! https://codeforces.com/blog/entry/126580
 //! @code
 //!   vector<basic_string<int>> g(n);
-//!   linear_kth_par kp(g);
+//!   hagerup kp(g);
 //!   kp.kth_par(v, k); // k edges up from v
 //!   kp.kth_par(v, 1); // v's parent
 //! @endcode
 //! @time O(n*max((2*K+3)/K,2*K) + q)
 //! @space O(n*max((2*K+3)/K,2*K))
-template<int K = 2> struct linear_kth_par {
+template<int K = 2> struct hagerup {
   int n;
   vi d, leaf, pos, jmp;
   vector<vi> lad;
-  linear_kth_par(const auto& g):
+  hagerup(const auto& g):
     n(sz(g)), d(n), leaf(n), pos(n), jmp(2 * n), lad(n) {
     static_assert(K >= 1);
     int t = 1;

tests/library_checker_aizu_tests/trees/kth_path_linear.test.cpp

@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/jump_on_tree"
 #include "../template.hpp"
 #include "../../../library/trees/linear_lca.hpp"
-#include "../../../library/trees/uncommon/linear_kth_par.hpp"
+#include "../../../library/trees/uncommon/hagerup_kth_par.hpp"
 #include "../../../library/trees/lca_rmq.hpp"
 #include "../compress_tree_asserts.hpp"
 int main() {
@@ -17,10 +17,10 @@ int main() {
     adj[v].push_back(u);
   }
   linear_lca lin_lca(adj);
-  linear_kth_par<1> lin_kp_1(adj);
-  linear_kth_par<2> lin_kp_2(adj);
-  linear_kth_par<3> lin_kp_3(adj);
-  linear_kth_par<4> lin_kp_4(adj);
+  hagerup<1> lin_kp_1(adj);
+  hagerup<2> lin_kp_2(adj);
+  hagerup<3> lin_kp_3(adj);
+  hagerup<4> lin_kp_4(adj);
   LCA lc(adj);
   compress_tree_asserts(adj, lc);
   auto get_kth_par = [&](int v, int k) -> int {