real::detail::static_vec< T, Cap > Class Template Reference

Fixed-capacity vector backed by an inline array (no heap): the subset of std::vector the Pike VM uses, for the static storage mode. More...

#include <storage.hpp>

Public Member Functions
constexpr	static_vec () noexcept
	Value-initializes data_ during constant evaluation only.
constexpr void	push_back (const T &value)
	Appends value.
constexpr void	clear ()
	Removes all elements (capacity unchanged).
constexpr void	assign (std::size_t count, const T &value)
	Resizes to count copies of value.
constexpr void	ensure_size (std::size_t count)
	Ensures at least count live elements without re-filling or shrinking.
constexpr std::size_t	size () const
	Returns the number of elements.
constexpr bool	empty () const
	Returns true if empty.
constexpr T &	operator[] (std::size_t i)
	Returns reference to the element at i.
constexpr const T &	operator[] (std::size_t i) const
	Returns const reference to the element at i.
constexpr T &	back ()
	Returns reference to the last element. Precondition: the vector is non-empty.
constexpr void	pop_back ()
	Removes the last element. Precondition: the vector is non-empty.

Private Attributes
std::array< T, Cap >	data_
	Inline element storage, deliberately NOT value-initialized at run time.
std::size_t	size_ {}
	Number of elements in use.

Detailed Description

template<typename T, std::size_t Cap>
class real::detail::static_vec< T, Cap >

Fixed-capacity vector backed by an inline array (no heap): the subset of std::vector the Pike VM uses, for the static storage mode.

static_storage bounds every engine container from its measure pass, so the length_error guards are an unreachable safety net (hence absent from run-time coverage).

Template Parameters

T	Element type.
Cap	Inline capacity.

Constructor & Destructor Documentation

static_vec()

template<typename T , std::size_t Cap>

constexpr real::detail::static_vec< T, Cap >::static_vec ( )

inlineconstexprnoexcept

Value-initializes data_ during constant evaluation only.

MSVC's constant evaluator rejects an indeterminate subobject even when unread (C2131); the run-time path keeps the trivial initialization (P1331R2), which is the point of data_.

Member Function Documentation

assign()

template<typename T , std::size_t Cap>

constexpr void real::detail::static_vec< T, Cap >::assign ( std::size_t  count, const T &  value  )

inlineconstexpr

Resizes to count copies of value.

Parameters

[in]	count	Number of elements.
[in]	value	The value to fill with.

Exceptions

std::length_error

if count exceeds the capacity Cap.

back()

template<typename T , std::size_t Cap>

constexpr T & real::detail::static_vec< T, Cap >::back ( )

inlineconstexpr

Returns reference to the last element. Precondition: the vector is non-empty.

Returns

A reference to the last element.

empty()

template<typename T , std::size_t Cap>

constexpr bool real::detail::static_vec< T, Cap >::empty ( ) const

inlineconstexpr

Returns true if empty.

Returns

Whether the vector holds no elements.

ensure_size()

template<typename T , std::size_t Cap>

constexpr void real::detail::static_vec< T, Cap >::ensure_size ( std::size_t  count )

inlineconstexpr

Ensures at least count live elements without re-filling or shrinking.

Reused capture storage already holds the slot count after the first match and the writer overwrites every used index, so a full assign of npos would be dead work. New elements are NOT written: the caller writes every slot it later reads. Never shrinks: a multi-group path may already be sized to slot_count before a span write.

Parameters

[in]

count

Minimum size.

Exceptions

std::length_error

if count exceeds the capacity Cap.

operator[]() [1/2]

template<typename T , std::size_t Cap>

constexpr T & real::detail::static_vec< T, Cap >::operator[] ( std::size_t  i )

inlineconstexpr

Returns reference to the element at i.

Parameters

[in]

i

Index.

Returns

Reference to the element at i.

operator[]() [2/2]

template<typename T , std::size_t Cap>

constexpr const T & real::detail::static_vec< T, Cap >::operator[] ( std::size_t  i ) const

inlineconstexpr

Returns const reference to the element at i.

Parameters

[in]

i

Index.

Returns

Const reference to the element at i.

push_back()

template<typename T , std::size_t Cap>

constexpr void real::detail::static_vec< T, Cap >::push_back ( const T &  value )

inlineconstexpr

Appends value.

Parameters

[in]

value

The element to append.

Exceptions

std::length_error

if the capacity Cap is exceeded.

size()

template<typename T , std::size_t Cap>

constexpr std::size_t real::detail::static_vec< T, Cap >::size ( ) const

inlineconstexpr

Returns the number of elements.

Returns

The element count.

Member Data Documentation

data_

template<typename T , std::size_t Cap>

std::array<T, Cap> real::detail::static_vec< T, Cap >::data_

private

Inline element storage, deliberately NOT value-initialized at run time.

A stateless static_regex builds a fresh state per search(), and clearing the worst-case capacity each call would be most of a short-subject search. Nothing reads above size_; in a constant expression a read before a write is diagnosed.

---

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

• include/real/storage.hpp