We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Deque::storage_len
len
Storage
binary_heap::OldestOrdered
Queue::capacity
Queue::storage_capacity
spsc
View
SortedLinkLinst
Iter
FindMut
Vec
storage_capacity
capacity
const
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Deque::storage_len
tolen
: Implement DequeView on top of #486 #490 (comment)Storage
generic onbinary_heap::OldestOrdered
. The view version can become the version that is always used.Queue::capacity
andQueue::storage_capacity
should be changedspsc
: The iterators, consumers and producers should be made to only have theView
variantsSortedLinkLinst
:Iter
andFindMut
should be made to only exist in theView
version.Vec
: renamestorage_capacity
tocapacity
and remove theconst
versionThe text was updated successfully, but these errors were encountered: