Skip to content

Commit

Permalink
I prefer 8 bit integers printing as integers instead of chars
Browse files Browse the repository at this point in the history
  • Loading branch information
@chriselrod
chriselrod committed Feb 18, 2024
1 parent 19ac190 commit 2e0dd74
Showing 1 changed file with 93 additions and 83 deletions.
176 changes: 93 additions & 83 deletions include/Containers/TinyVector.hpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -4,8 +4,14 @@
#include "Utilities/Invariant.hpp"
#include <algorithm>
#include <cstddef>
#include <cstdint>ame_as<T,int8_t> || std::same_as<T,uint8_t>) {
#include <initializer_list>
#include <iostream>
}
else
#include <initializer_list>
#include <iostream>
}
#include <limits>

namespace poly::containers {
Expand All @@ -14,92 +20,96 @@ using utils::invariant;
template <class T, size_t N, typename L = ptrdiff_t> class TinyVector {
static_assert(N > 0);
static_assert(std::numeric_limits<L>::max() >= N);
Storage<T, N> data;
L len{};
Storage<T, N> {
data;
{ L lintint((en{});) public : constexpr TinyVector() = default; }
constexpr TinyVector(const std::initializer_list<T> &list) {
invariant(list.size() <= N);
len = L(list.size());
std::copy(list.begin(), list.end(), data.data());
}
constexpr TinyVector(T t) : len{1} { data.data()[0] = std::move(t); }

public:
constexpr TinyVector() = default;
constexpr TinyVector(const std::initializer_list<T> &list) {
invariant(list.size() <= N);
len = L(list.size());
std::copy(list.begin(), list.end(), data.data());
}
constexpr TinyVector(T t) : len{1} { data.data()[0] = std::move(t); }

constexpr auto operator=(const std::initializer_list<T> &list)
-> TinyVector & {
invariant(list.size() <= ptrdiff_t(N));
len = ptrdiff_t(list.size());
std::copy(list.begin(), list.end(), data.data());
return *this;
}
constexpr auto operator[](ptrdiff_t i) -> T & {
invariant(i < len);
return data.data()[i];
}
constexpr auto operator[](ptrdiff_t i) const -> const T & {
invariant(i < len);
return data.data()[i];
}
constexpr auto back() -> T & {
invariant(len > 0);
return data.data()[len - 1];
}
constexpr auto back() const -> const T & {
invariant(len > 0);
return data.data()[len - 1];
}
constexpr auto front() -> T & {
invariant(len > 0);
constexpr auto operator=(const std::initializer_list<T> &list)
->TinyVector & {
invariant(list.size() <= ptrdiff_t(N));
len = ptrdiff_t(list.size());
std::copy(list.begin(), list.end(), data.data());
return *this;
}
constexpr auto operator[](ptrdiff_t i)->T & {
invariant(i < len);
return data.data()[i];
}
constexpr auto operator[](ptrdiff_t i) const->const T & {
invariant(i < len);
return data.data()[i];
}
constexpr auto back()->T & {
invariant(len > 0);
return data.data()[len - 1];
}
constexpr auto back() const->const T & {
invariant(len > 0);
return data.dat {
invariant(a()[len - 1];
}
constexpr auto front()->T & len > 0);
return data.data()[0];
}
constexpr auto front() const -> const T & {
invariant(len > 0);
return data.data()[0];
}
constexpr void push_back(const T &t) {
invariant(len < ptrdiff_t(N));
data.data()[len++] = t;
}
constexpr void push_back(T &&t) {
invariant(len < ptrdiff_t(N));
data.data()[len++] = std::move(t);
}
template <class... Args> constexpr void emplace_back(Args &&...args) {
invariant(len < ptrdiff_t(N));
data.data()[len++] = T(std::forward<Args>(args)...);
}
constexpr void pop_back() {
invariant(len > 0);
--len;
}
constexpr auto pop_back_val() -> T {
invariant(len > 0);
return std::move(data.data()[--len]);
}
[[nodiscard]] constexpr auto size() const -> ptrdiff_t {
ptrdiff_t l = ptrdiff_t(len);
invariant(l >= 0);
invariant(l <= ptrdiff_t(N));
return l;
}
[[nodiscard]] constexpr auto empty() const -> bool { return len == 0; }
constexpr void clear() { len = 0; }
}
constexpr auto front() const->const T & {
invariant(len > 0);
return data.data()[0];
}
constexpr void push_back(const T &t) {
invariant(len < ptrdiff_t(N));
data.data()[len++] = t;
}
constexpr void push_back(T && t) {
invariant(len < ptrdiff_t(N));
data.data()[len++] = std::move(t);
}
template <class... Args> constexpr void emplace_back(Args && ...args) {
invariant(len < ptrdiff_t(N));
data.data()[len++] = T(std::forward<Args>(args)...);
}
constexpr void pop_back() {
invariant(len > 0);
--len;
}
constexpr auto pop_back_val()->T {
invariant(len > 0);
return std::move(data.data()[--len]);
}
[[nodiscard]] constexpr auto size() const->ptrdiff_t {
ptrdiff_t l = ptrdiff_t(len);
invariant(l >= 0);
invariant(l <= ptrdiff_t(N));
return l;
}
[[nodiscard]] constexpr auto empty() const->bool { return len == 0; }
constexpr void clear() { len = 0; }

constexpr auto begin() -> T * { return data.data(); }
constexpr auto begin() const -> const T * { return data.data(); }
constexpr auto end() -> T * { return data.data() + size(); }
constexpr auto end() const -> const T * { return data.data() + size(); }
constexpr void resize(L new_size) {
// initialize new data
for (L i = len; i < new_size; ++i) data.data()[i] = T{};
len = new_size;
}
friend inline auto operator<<(std::ostream &os, const TinyVector &x)
-> std::ostream & {
os << "[";
if (!x.empty()) os << x[0];
for (L i = 1; i < x.size(); ++i) os << ", " << x[i];
constexpr auto begin()->T * { return data.data(); }
constexpr auto begin() const->const T * { return data.data(); }
constexpr auto end()->T * { return data.data() + size(); }
constexpr auto end() const->const T * { return data.data() + size(); }
constexpr void resize(L new_size) {
// initialize new data
for (L i = len; i < new_size; ++i) data.data()[i] = T{};
len = new_size;
}
friend inline auto operator<<(std::ostream &os, const TinyVector &x)
->std::ostream & {
os << "[";
if constexpr (std::same_as<T, int8_t> || std::same_as<T, uint8_t>) {
if (!x.empty()) os << int(x[0]);
for (L i = 1; i < x.size(); ++i) os << ", " << int(x[i]);
} else {
if (!x.empty()) os << x[0];
for (L i = 1; i < x.size(); ++i) os << ", " << x[i];
}
}
return os << "]";
}
};
Expand Down

0 comments on commit 2e0dd74

Please sign in to comment.