This is the complete list of members for ice::ShardContainer, including all inherited members.

_allocator	ice::Array< ice::Shard >
_capacity	ice::Array< ice::Shard >
_count	ice::Array< ice::Shard >
_data	ice::Array< ice::Shard >
Array(ice::Allocator &alloc) noexcept	ice::Array< ice::Shard >	inlineexplicit
begin(this Self &&self) noexcept -> ice::container::Iterator< Self >	ice::container::ContiguousContainer	inline
capacity() const noexcept -> SizeType	ice::Array< ice::Shard >	inline
clear() noexcept	ice::Array< ice::Shard >	inline
ConstContainerValueType typedef	ice::Array< ice::Shard >
ConstIterator typedef	ice::Array< ice::Shard >
ConstReverseIterator typedef	ice::Array< ice::Shard >
ContainerTag typedef	ice::Array< ice::Shard >
contains(ice::ShardID shardid) const noexcept	ice::ShardContainer	inline
count_of(ice::ShardID shardid) const noexcept -> ice::ncount	ice::ShardContainer	inline
data(this Self &self) noexcept -> ice::container::ValuePtr< Self >	ice::Array< ice::Shard >	inline
data_view(this Array const &self) noexcept -> ice::Data	ice::Array< ice::Shard >	inline
end(this Self &&self) noexcept -> ice::container::Iterator< Self >	ice::container::ContiguousContainer	inline
find_first_of(ice::ShardID shardid, ice::nindex offset=ice::nindex_none) const noexcept -> ice::Shard	ice::ShardContainer	inline
find_last_of(ice::ShardID shardid, ice::nindex offset=ice::nindex_none) const noexcept -> ice::Shard	ice::ShardContainer	inline
first(this Self &&self) noexcept -> ice::container::ValueRef< Self >	ice::container::ContiguousContainer	inline
for_each(ice::ShardID shardid, Fn &&callback, Args &&... args) const noexcept -> ice::ncount	ice::ShardContainer	inline
grow(this Self &self, ice::ncount min_capacity=ice::ncount_none) noexcept	ice::container::ResizableContainer	inline
headspan(this Self &&self, ice::ncount count=1) noexcept -> ice::container::SpanType< Self >	ice::container::ContiguousContainer	inline
index_of(this Self const &self, ice::container::ValueRef< Self > value) noexcept -> ice::nindex	ice::container::ContiguousContainer	inline
index_of(this Self const &self, Predicate const &predicate, Args const &... args) noexcept -> ice::nindex	ice::container::ContiguousContainer	inline
inspect_all(ice::ShardID shardid, ice::Array< T, Logic > &payloads) const noexcept -> ice::ncount	ice::ShardContainer	inline
inspect_each(ice::ShardID shardid, Fn &&callback) noexcept -> ice::ncount	ice::ShardContainer	inline
inspect_first(ice::ShardID shardid, T &payload) const noexcept	ice::ShardContainer	inline
inspect_last(ice::ShardID shard, T &payload) const noexcept	ice::ShardContainer	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::Array< ice::Shard >
last(this Self &&self) noexcept -> ice::container::ValueRef< Self >	ice::container::ContiguousContainer	inline
meminfo(this Self const &self) noexcept -> ice::meminfo	ice::container::ContiguousContainer	inline
memory_view(this Array &self) noexcept -> ice::Memory	ice::Array< ice::Shard >	inline
memset(this Self const &self, ice::u8 value) noexcept -> ice::Memory	ice::container::ContiguousContainer	inline
not_empty(this Self const &self) noexcept	ice::container::BasicContainer	inline
not_full(this Self const &self) noexcept	ice::container::ResizableContainer	inline
operator ice::Span< ice::Shard >() noexcept	ice::Array< ice::Shard >	inline
operator ice::Span< ice::Shard const >() const noexcept	ice::Array< ice::Shard >	inline
operator=(Array &&other) noexcept -> Array &	ice::Array< ice::Shard >	inline
operator[](this Self &&self, ice::nindex index) noexcept -> ice::container::ValueRef< Self >	ice::container::ContiguousContainer	inline
pop_back(ice::ncount count=1_count) noexcept	ice::Array< ice::Shard >	inline
push_back(ice::Shard const(&shards_array)[Count]) noexcept	ice::ShardContainer	inline
ice::Array< ice::Shard >::push_back(ItemType &&item) noexcept	ice::Array< ice::Shard >	inline
rbegin(this Self &&self) noexcept -> ice::container::ReverseIterator< Self >	ice::container::ContiguousContainer	inline
remove_all_of(this ShardContainer &self, ice::ShardID shardid) noexcept	ice::ShardContainer	inline
remove_at(ice::nindex index) noexcept	ice::Array< ice::Shard >	inline
rend(this Self &&self) noexcept -> ice::container::ReverseIterator< Self >	ice::container::ContiguousContainer	inline
reserve(this Self &self, ice::ncount min_capacity) noexcept	ice::container::ResizableContainer	inline
resize(SizeType new_size) noexcept	ice::Array< ice::Shard >	inline
ReverseIterator typedef	ice::Array< ice::Shard >
set_capacity(SizeType new_capacity) noexcept	ice::Array< ice::Shard >	inline
shrink(this Self &self) noexcept	ice::container::ResizableContainer	inline
size() const noexcept -> SizeType	ice::Array< ice::Shard >	inline
SizeType typedef	ice::Array< ice::Shard >
subspan(this Self &&self, ice::nindex from, ice::ncount count=ice::ncount_none) noexcept -> ice::container::SpanType< Self >	ice::container::ContiguousContainer	inline
subspan(this Self &&self, ice::ref32 refval) noexcept -> ice::container::SpanType< Self >	ice::container::ContiguousContainer	inline
tailspan(this Self &&self, ice::nindex offset=1) noexcept -> ice::container::SpanType< Self >	ice::container::ContiguousContainer	inline
ValueType typedef	ice::Array< ice::Shard >
~Array() noexcept	ice::Array< ice::Shard >	inline