ladybird/AK/Array.h

114 lines
3.4 KiB
C
Raw Normal View History

2020-09-06 19:13:34 +00:00
/*
* Copyright (c) 2020, the SerenityOS developers.
*
* SPDX-License-Identifier: BSD-2-Clause
2020-09-06 19:13:34 +00:00
*/
#pragma once
#include <AK/Iterator.h>
#include <AK/Span.h>
namespace AK {
template<typename T, size_t Size>
struct Array {
[[nodiscard]] constexpr T const* data() const { return __data; }
[[nodiscard]] constexpr T* data() { return __data; }
2020-09-06 19:13:34 +00:00
[[nodiscard]] constexpr size_t size() const { return Size; }
2020-09-06 19:13:34 +00:00
[[nodiscard]] constexpr Span<T const> span() const { return { __data, Size }; }
[[nodiscard]] constexpr Span<T> span() { return { __data, Size }; }
2020-09-06 19:13:34 +00:00
[[nodiscard]] constexpr T const& at(size_t index) const
2020-09-06 19:13:34 +00:00
{
VERIFY(index < size());
return __data[index];
2020-09-06 19:13:34 +00:00
}
[[nodiscard]] constexpr T& at(size_t index)
2020-09-06 19:13:34 +00:00
{
VERIFY(index < size());
return __data[index];
2020-09-06 19:13:34 +00:00
}
[[nodiscard]] constexpr T const& front() const { return at(0); }
[[nodiscard]] constexpr T& front() { return at(0); }
2020-09-06 19:13:34 +00:00
[[nodiscard]] constexpr T const& back() const requires(Size > 0) { return at(Size - 1); }
[[nodiscard]] constexpr T& back() requires(Size > 0) { return at(Size - 1); }
2020-09-06 19:13:34 +00:00
[[nodiscard]] constexpr bool is_empty() const { return size() == 0; }
2020-09-06 19:13:34 +00:00
[[nodiscard]] constexpr T const& operator[](size_t index) const { return at(index); }
[[nodiscard]] constexpr T& operator[](size_t index) { return at(index); }
2020-09-06 19:13:34 +00:00
template<typename T2, size_t Size2>
[[nodiscard]] constexpr bool operator==(Array<T2, Size2> const& other) const { return span() == other.span(); }
2021-07-21 16:21:15 +00:00
using ConstIterator = SimpleIterator<Array const, T const>;
2020-09-06 19:13:34 +00:00
using Iterator = SimpleIterator<Array, T>;
[[nodiscard]] constexpr ConstIterator begin() const { return ConstIterator::begin(*this); }
[[nodiscard]] constexpr Iterator begin() { return Iterator::begin(*this); }
2020-09-06 19:13:34 +00:00
[[nodiscard]] constexpr ConstIterator end() const { return ConstIterator::end(*this); }
[[nodiscard]] constexpr Iterator end() { return Iterator::end(*this); }
2020-09-06 19:13:34 +00:00
[[nodiscard]] constexpr operator Span<T const>() const { return span(); }
[[nodiscard]] constexpr operator Span<T>() { return span(); }
2020-09-06 19:13:34 +00:00
2021-07-21 16:21:15 +00:00
constexpr size_t fill(T const& value)
{
for (size_t idx = 0; idx < Size; ++idx)
__data[idx] = value;
return Size;
}
[[nodiscard]] constexpr T max() requires(requires(T x, T y) { x < y; })
{
static_assert(Size > 0, "No values to max() over");
T value = __data[0];
for (size_t i = 1; i < Size; ++i)
value = AK::max(__data[i], value);
return value;
}
[[nodiscard]] constexpr T min() requires(requires(T x, T y) { x > y; })
{
static_assert(Size > 0, "No values to min() over");
T value = __data[0];
for (size_t i = 1; i < Size; ++i)
value = AK::min(__data[i], value);
return value;
}
2020-09-06 19:13:34 +00:00
T __data[Size];
};
template<typename T, typename... Types>
Array(T, Types...) -> Array<T, sizeof...(Types) + 1>;
namespace Detail {
template<typename T, size_t... Is>
2021-07-21 16:21:15 +00:00
constexpr auto integer_sequence_generate_array([[maybe_unused]] T const offset, IntegerSequence<T, Is...>) -> Array<T, sizeof...(Is)>
{
return { { (offset + Is)... } };
}
}
template<typename T, T N>
2021-07-21 16:21:15 +00:00
constexpr static auto iota_array(T const offset = {})
{
static_assert(N >= T {}, "Negative sizes not allowed in iota_array()");
return Detail::integer_sequence_generate_array<T>(offset, MakeIntegerSequence<T, N>());
}
2020-09-06 19:13:34 +00:00
}
using AK::Array;
using AK::iota_array;