@@ -897,7 +897,6 @@ public:
897
897
return __value_comp_;
898
898
}
899
899
900
-
901
900
private:
902
901
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 const __node_allocator& __node_alloc () const _NOEXCEPT {
903
902
return __node_alloc_;
@@ -912,10 +911,10 @@ private:
912
911
public:
913
912
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __node_pointer __root () const _NOEXCEPT {
914
913
// double t = __end_node()->__left_;
915
- // using __ptr_traits = pointer_traits<__node_pointer>;
916
- // using __element_type = typename __ptr_traits::element_type;
917
- // typename __element_type_type x{};
918
- // double t = x;
914
+ // using __ptr_traits = pointer_traits<__node_pointer>;
915
+ // using __element_type = typename __ptr_traits::element_type;
916
+ // typename __element_type_type x{};
917
+ // double t = x;
919
918
return std::__static_fancy_pointer_cast<__node_pointer>(__end_node ()->__left_ );
920
919
// return static_cast<__node_pointer>(__end_node()->__left_);
921
920
}
@@ -1908,8 +1907,7 @@ pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
1908
1907
1909
1908
// TODO: collapse into one branch
1910
1909
if (__libcpp_is_constant_evaluated ()) {
1911
- __insert_node_at (__parent, __child,
1912
- std::__static_fancy_pointer_cast<__node_base_pointer>(__h.get ()));
1910
+ __insert_node_at (__parent, __child, std::__static_fancy_pointer_cast<__node_base_pointer>(__h.get ()));
1913
1911
} else {
1914
1912
__insert_node_at (__parent, __child, static_cast <__node_base_pointer>(__h.get ()));
1915
1913
}
0 commit comments