| _allocator | ice::Queue< Type, Logic > | |
| _capacity | ice::Queue< Type, Logic > | |
| _count | ice::Queue< Type, Logic > | |
| _data | ice::Queue< Type, Logic > | |
| _offset | ice::Queue< Type, Logic > | |
| back(this Self &&self) noexcept -> ice::container::ValueRef< Self > | ice::Queue< Type, Logic > | inline |
| capacity() const noexcept -> ice::ncount | ice::Queue< Type, Logic > | inline |
| clear() noexcept | ice::Queue< Type, Logic > | |
| ConstContainerValueType typedef | ice::Queue< Type, Logic > | |
| ConstIterator typedef | ice::Queue< Type, Logic > | |
| ConstReverseIterator typedef | ice::Queue< Type, Logic > | |
| ContainerTag typedef | ice::Queue< Type, Logic > | |
| for_each(this Self &&self, Fn &&fn) noexcept | ice::Queue< Type, Logic > | inline |
| for_each_reverse(this Self &&self, Fn &&fn) noexcept | ice::Queue< Type, Logic > | inline |
| front(this Self &&self) noexcept -> ice::container::ValueRef< Self > | ice::Queue< Type, Logic > | inline |
| grow(this Self &self, ice::ncount min_capacity=ice::ncount_none) noexcept | ice::container::ResizableContainer | inline |
| is_empty(this Self const &self) noexcept | ice::container::BasicContainer | inline |
| is_full(this Self const &self) noexcept | ice::container::ResizableContainer | inline |
| Iterator typedef | ice::Queue< Type, Logic > | |
| memory_view(this Queue &self) noexcept -> ice::Memory | ice::Queue< Type, Logic > | inline |
| not_empty(this Self const &self) noexcept | ice::container::BasicContainer | inline |
| not_full(this Self const &self) noexcept | ice::container::ResizableContainer | inline |
| operator=(Queue &&other) noexcept -> Queue & | ice::Queue< Type, Logic > | inline |
| operator=(Queue const &other) noexcept -> Queue & | ice::Queue< Type, Logic > | inline |
| operator[](this Self &&self, ice::nindex idx) noexcept -> ice::container::ValueRef< Self > | ice::Queue< Type, Logic > | |
| pop_back(ice::ncount count=1_count) noexcept | ice::Queue< Type, Logic > | inline |
| pop_front(ice::ncount count=1_count) noexcept | ice::Queue< Type, Logic > | inline |
| push_back(ItemType &&item) noexcept | ice::Queue< Type, Logic > | inline |
| push_back(ContainerT const &other) noexcept | ice::Queue< Type, Logic > | inline |
| push_front(ItemType &&item) noexcept | ice::Queue< Type, Logic > | inline |
| push_front(ContainerT const &other) noexcept | ice::Queue< Type, Logic > | |
| Queue(ice::Allocator &alloc) noexcept | ice::Queue< Type, Logic > | inlineexplicit |
| Queue(Queue &&other) noexcept | ice::Queue< Type, Logic > | inline |
| Queue(Queue const &other) noexcept | ice::Queue< Type, Logic > | inline |
| reserve(this Self &self, ice::ncount min_capacity) noexcept | ice::container::ResizableContainer | inline |
| resize(ice::ncount new_size) noexcept | ice::Queue< Type, Logic > | inline |
| ReverseIterator typedef | ice::Queue< Type, Logic > | |
| set_capacity(ice::ncount new_capacity) noexcept | ice::Queue< Type, Logic > | inline |
| shrink(this Self &self) noexcept | ice::container::ResizableContainer | inline |
| size() const noexcept -> ice::ncount | ice::Queue< Type, Logic > | inline |
| SizeType typedef | ice::Queue< Type, Logic > | |
| take_front(this Self &&self, ice::Span< Type > out_values) noexcept -> ice::ncount | ice::Queue< Type, Logic > | inline |
| ValueType typedef | ice::Queue< Type, Logic > | |
| ~Queue() noexcept | ice::Queue< Type, Logic > | inline |
1.18.0