IceShard 1
A personal game engine project, with development focused on 2D/2.5D games.
Loading...
Searching...
No Matches
ice::container::ContiguousContainer Struct Reference

#include <ice/container/contiguous_container.hxx>

Inheritance diagram for ice::container::ContiguousContainer:
ice::container::BasicContainer ice::Array< ice::Shard > ice::Array< ice::Task<> > ice::Span< ice::container::ConstCorrectContainerValueType< ContainerT > > ice::Span< ice::I18NReference > ice::Array< Type, Logic > ice::Span< Type > ice::ShardContainer

Public Member Functions

template<ice::concepts::ContiguousContainer Self>
constexpr auto first (this Self &&self) noexcept -> ice::container::ValueRef< Self >
template<ice::concepts::ContiguousContainer Self>
constexpr auto last (this Self &&self) noexcept -> ice::container::ValueRef< Self >
template<ice::concepts::ContiguousContainer Self>
constexpr auto subspan (this Self &&self, ice::nindex from, ice::ncount count=ice::ncount_none) noexcept -> ice::container::SpanType< Self >
template<ice::concepts::ContiguousContainer Self>
constexpr auto subspan (this Self &&self, ice::ref32 refval) noexcept -> ice::container::SpanType< Self >
template<ice::concepts::ContiguousContainer Self>
constexpr auto headspan (this Self &&self, ice::ncount count=1) noexcept -> ice::container::SpanType< Self >
template<ice::concepts::ContiguousContainer Self>
constexpr auto tailspan (this Self &&self, ice::nindex offset=1) noexcept -> ice::container::SpanType< Self >
template<ice::concepts::ContiguousContainer Self>
constexpr auto begin (this Self &&self) noexcept -> ice::container::Iterator< Self >
template<ice::concepts::ContiguousContainer Self>
constexpr auto end (this Self &&self) noexcept -> ice::container::Iterator< Self >
template<ice::concepts::ContiguousContainer Self>
constexpr auto rbegin (this Self &&self) noexcept -> ice::container::ReverseIterator< Self >
template<ice::concepts::ContiguousContainer Self>
constexpr auto rend (this Self &&self) noexcept -> ice::container::ReverseIterator< Self >
template<ice::concepts::ContiguousContainer Self>
constexpr auto index_of (this Self const &self, ice::container::ValueRef< Self > value) noexcept -> ice::nindex
template<ice::concepts::ContiguousContainer Self, typename Predicate, typename... Args>
constexpr auto index_of (this Self const &self, Predicate const &predicate, Args const &... args) noexcept -> ice::nindex
template<ice::concepts::ContiguousContainer Self>
constexpr auto operator[] (this Self &&self, ice::nindex index) noexcept -> ice::container::ValueRef< Self >
template<ice::concepts::ContiguousContainer Self>
auto meminfo (this Self const &self) noexcept -> ice::meminfo
template<ice::concepts::ContiguousResizableContainer Self>
requires (ice::concepts::TrivialContainerLogic<Self>)
auto memset (this Self const &self, ice::u8 value) noexcept -> ice::Memory
Public Member Functions inherited from ice::container::BasicContainer
template<ice::concepts::Container Self>
constexpr bool is_empty (this Self const &self) noexcept
template<ice::concepts::Container Self>
constexpr bool not_empty (this Self const &self) noexcept

Member Function Documentation

◆ begin()

auto ice::container::ContiguousContainer::begin ( this Self && self) -> ice::container::Iterator< Self >
inlineconstexprnoexcept

◆ end()

auto ice::container::ContiguousContainer::end ( this Self && self) -> ice::container::Iterator< Self >
inlineconstexprnoexcept

◆ first()

auto ice::container::ContiguousContainer::first ( this Self && self) -> ice::container::ValueRef< Self >
inlineconstexprnoexcept

◆ headspan()

auto ice::container::ContiguousContainer::headspan ( this Self && self,
ice::ncount count = 1 ) -> ice::container::SpanType< Self >
inlineconstexprnoexcept

◆ index_of() [1/2]

auto ice::container::ContiguousContainer::index_of ( this Self const & self,
ice::container::ValueRef< Self > value ) -> ice::nindex
inlineconstexprnoexcept

◆ index_of() [2/2]

template<ice::concepts::ContiguousContainer Self, typename Predicate, typename... Args>
auto ice::container::ContiguousContainer::index_of ( this Self const & self,
Predicate const & predicate,
Args const &... args ) -> ice::nindex
inlineconstexprnoexcept

◆ last()

auto ice::container::ContiguousContainer::last ( this Self && self) -> ice::container::ValueRef< Self >
inlineconstexprnoexcept

◆ meminfo()

auto ice::container::ContiguousContainer::meminfo ( this Self const & self) -> ice::meminfo
inlinenoexcept

◆ memset()

auto ice::container::ContiguousContainer::memset ( this Self const & self,
ice::u8 value ) -> ice::Memory
inlinenoexcept

◆ operator[]()

auto ice::container::ContiguousContainer::operator[] ( this Self && self,
ice::nindex index ) -> ice::container::ValueRef< Self >
inlineconstexprnoexcept

◆ rbegin()

auto ice::container::ContiguousContainer::rbegin ( this Self && self) -> ice::container::ReverseIterator< Self >
inlineconstexprnoexcept

◆ rend()

auto ice::container::ContiguousContainer::rend ( this Self && self) -> ice::container::ReverseIterator< Self >
inlineconstexprnoexcept

◆ subspan() [1/2]

auto ice::container::ContiguousContainer::subspan ( this Self && self,
ice::nindex from,
ice::ncount count = ice::ncount_none ) -> ice::container::SpanType< Self >
inlineconstexprnoexcept

◆ subspan() [2/2]

auto ice::container::ContiguousContainer::subspan ( this Self && self,
ice::ref32 refval ) -> ice::container::SpanType< Self >
inlineconstexprnoexcept

◆ tailspan()

auto ice::container::ContiguousContainer::tailspan ( this Self && self,
ice::nindex offset = 1 ) -> ice::container::SpanType< Self >
inlineconstexprnoexcept

The documentation for this struct was generated from the following file: