-
Notifications
You must be signed in to change notification settings - Fork 14.9k
[libc++] Require fancy pointer to be correctly convertible #152989
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Changes from all commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Original file line number | Diff line number | Diff line change | ||||
---|---|---|---|---|---|---|
|
@@ -96,7 +96,7 @@ struct __hash_node_base { | |||||
__next_pointer __next_; | ||||||
|
||||||
_LIBCPP_HIDE_FROM_ABI __next_pointer __ptr() _NOEXCEPT { | ||||||
return static_cast<__next_pointer>(pointer_traits<__node_base_pointer>::pointer_to(*this)); | ||||||
return pointer_traits<__node_base_pointer>::pointer_to(*this); | ||||||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Do I understand correctly that this would be the "right" way to perform this cast if we only want to use the requirements in https://eel.is/c++draft/allocator.requirements.general ?
Suggested change
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Conversion via |
||||||
} | ||||||
|
||||||
_LIBCPP_HIDE_FROM_ABI __node_pointer __upcast() _NOEXCEPT { | ||||||
|
@@ -1499,9 +1499,9 @@ __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_multi(const_iterator __p | |||||
while (__pp->__next_ != __np) | ||||||
__pp = __pp->__next_; | ||||||
__cp->__next_ = __np; | ||||||
__pp->__next_ = static_cast<__next_pointer>(__cp); | ||||||
__pp->__next_ = __cp; | ||||||
++size(); | ||||||
return iterator(static_cast<__next_pointer>(__cp)); | ||||||
return iterator(__cp); | ||||||
} | ||||||
return __node_insert_multi(__cp); | ||||||
} | ||||||
|
@@ -1547,9 +1547,9 @@ __hash_table<_Tp, _Hash, _Equal, _Alloc>::__emplace_unique_key_args(_Key const& | |||||
__bucket_list_[std::__constrain_hash(__h->__next_->__hash(), __bc)] = __h.get()->__ptr(); | ||||||
} else { | ||||||
__h->__next_ = __pn->__next_; | ||||||
__pn->__next_ = static_cast<__next_pointer>(__h.get()); | ||||||
__pn->__next_ = __h.get(); | ||||||
} | ||||||
__nd = static_cast<__next_pointer>(__h.release()); | ||||||
__nd = __h.release(); | ||||||
// increment size | ||||||
++size(); | ||||||
__inserted = true; | ||||||
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please add a release note and mention the potential for breakage. In particular, what kind of code would break after this change and what users should do to fix it.