--- src/s2/util/gtl/compact_array.h.orig	2026-04-23 03:51:32.000000000 +0800
+++ src/s2/util/gtl/compact_array.h	2026-07-11 17:37:33.000000000 +0800
@@ -49,7 +49,7 @@
 #include <type_traits>
 #include <utility>
 
-#include "absl/base/internal/throw_delegate.h"
+#include "absl/base/throw_delegate.h"
 #include "absl/base/macros.h"
 #include "absl/base/optimization.h"
 #include "absl/log/absl_check.h"
@@ -246,7 +246,7 @@
   iterator Insert(const_iterator p, const value_type& v) {
     if (ABSL_PREDICT_FALSE(size() >= kMaxSize)) {
       // NOLINTNEXTLINE(build/namespaces)
-      absl::base_internal::ThrowStdLengthError("compact_array size exceeded");
+      absl::lts_20260526::ThrowStdLengthError("compact_array size exceeded");
     }
     iterator r = make_hole(p, 1);
     *r = v;
@@ -261,7 +261,7 @@
   void insert(const_iterator p, size_type n, const value_type& v) {
     if (ABSL_PREDICT_FALSE(n > kMaxSize - size())) {
       // NOLINTNEXTLINE(build/namespaces)
-      absl::base_internal::ThrowStdLengthError("compact_array size exceeded");
+      absl::lts_20260526::ThrowStdLengthError("compact_array size exceeded");
     }
     value_insert(p, n, v);
   }
@@ -322,7 +322,7 @@
   reference at(size_type n) {
     if (ABSL_PREDICT_FALSE(n >= size_)) {
       // NOLINTNEXTLINE(build/namespaces)
-      absl::base_internal::ThrowStdOutOfRange("compact_array_base::at");
+      absl::lts_20260526::ThrowStdOutOfRange("compact_array_base::at");
     }
     return Array()[n];
   }
@@ -330,7 +330,7 @@
   const_reference at(size_type n) const {
     if (ABSL_PREDICT_FALSE(n >= size_)) {
       // NOLINTNEXTLINE(build/namespaces)
-      absl::base_internal::ThrowStdOutOfRange("compact_array_base::at");
+      absl::lts_20260526::ThrowStdOutOfRange("compact_array_base::at");
     }
     return ConstArray()[n];
   }
@@ -478,7 +478,7 @@
   void value_insert(const_iterator p, size_type n, const value_type& v) {
     if (ABSL_PREDICT_FALSE(n > kMaxSize - size())) {
       // NOLINTNEXTLINE(build/namespaces)
-      absl::base_internal::ThrowStdLengthError("compact_array size exceeded");
+      absl::lts_20260526::ThrowStdLengthError("compact_array size exceeded");
     }
     iterator hole = make_hole(p, n);
     std::fill(hole, hole + n, v);
@@ -499,7 +499,7 @@
     size_type n = std::distance(first, last);
     if (ABSL_PREDICT_FALSE(n > kMaxSize - size())) {
       // NOLINTNEXTLINE(build/namespaces)
-      absl::base_internal::ThrowStdLengthError("compact_array size exceeded");
+      absl::lts_20260526::ThrowStdLengthError("compact_array size exceeded");
     }
     std::copy(first, last, make_hole(p, n));
   }