143 lines
3.4 KiB
C++
143 lines
3.4 KiB
C++
/*
|
|
* Copyright (C) 2018-2022 Intel Corporation
|
|
*
|
|
* SPDX-License-Identifier: MIT
|
|
*
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <cstddef>
|
|
#include <utility>
|
|
|
|
template <typename DataType>
|
|
class ArrayRef {
|
|
public:
|
|
using iterator = DataType *;
|
|
using const_iterator = const DataType *;
|
|
|
|
template <typename IteratorType>
|
|
ArrayRef(IteratorType begIt, IteratorType endIt) {
|
|
if (begIt != nullptr) {
|
|
this->begIt = &*begIt;
|
|
this->endIt = &*(endIt - 1) + 1;
|
|
} else {
|
|
this->begIt = nullptr;
|
|
this->endIt = nullptr;
|
|
}
|
|
}
|
|
|
|
template <typename IteratorType>
|
|
ArrayRef(IteratorType first, size_t size)
|
|
: ArrayRef(first, (size > 0) ? (first + size) : first) {
|
|
}
|
|
|
|
template <typename SequentialContainerType>
|
|
ArrayRef(SequentialContainerType &ctr)
|
|
: begIt((ctr.size() > 0) ? &*ctr.begin() : nullptr), endIt((ctr.size() > 0) ? (&*(ctr.end() - 1) + 1) : nullptr) {
|
|
}
|
|
|
|
template <typename SequentialContainerType>
|
|
ArrayRef(const SequentialContainerType &ctr)
|
|
: begIt((ctr.size() > 0) ? &*ctr.begin() : nullptr), endIt((ctr.size() > 0) ? (&*(ctr.end() - 1) + 1) : nullptr) {
|
|
}
|
|
|
|
template <size_t Size>
|
|
ArrayRef(DataType (&array)[Size])
|
|
: begIt(&array[0]), endIt(&array[Size]) {
|
|
}
|
|
|
|
ArrayRef() = default;
|
|
|
|
ArrayRef(const ArrayRef &src)
|
|
: begIt(src.begIt), endIt(src.endIt) {
|
|
}
|
|
|
|
ArrayRef &operator=(const ArrayRef &src) {
|
|
this->begIt = src.begIt;
|
|
this->endIt = src.endIt;
|
|
return *this;
|
|
}
|
|
|
|
void clear() {
|
|
endIt = begIt;
|
|
}
|
|
|
|
size_t size() const {
|
|
return endIt - begIt;
|
|
}
|
|
|
|
bool empty() const {
|
|
return (0U == size());
|
|
}
|
|
|
|
DataType &operator[](std::size_t idx) {
|
|
return begIt[idx];
|
|
}
|
|
|
|
const DataType &operator[](std::size_t idx) const {
|
|
return begIt[idx];
|
|
}
|
|
|
|
iterator begin() {
|
|
return begIt;
|
|
}
|
|
|
|
const_iterator begin() const {
|
|
return begIt;
|
|
}
|
|
|
|
iterator end() {
|
|
return endIt;
|
|
}
|
|
|
|
const_iterator end() const {
|
|
return endIt;
|
|
}
|
|
|
|
void swap(ArrayRef &rhs) {
|
|
std::swap(begIt, rhs.begIt);
|
|
std::swap(endIt, rhs.endIt);
|
|
}
|
|
|
|
operator ArrayRef<const DataType>() {
|
|
return ArrayRef<const DataType>(begIt, endIt);
|
|
}
|
|
|
|
template <typename AnyT>
|
|
static ArrayRef<DataType> fromAny(AnyT *any, size_t anyCount) {
|
|
static_assert((sizeof(AnyT) == sizeof(DataType)) || ((sizeof(AnyT) % sizeof(DataType)) == 0), "Unhandled type conversion");
|
|
return ArrayRef<DataType>(reinterpret_cast<iterator>(any), (anyCount * sizeof(AnyT)) / sizeof(DataType));
|
|
}
|
|
|
|
template <typename AnyT>
|
|
ArrayRef<AnyT> toArrayRef() {
|
|
static_assert((sizeof(AnyT) == sizeof(DataType)) || ((sizeof(DataType) % sizeof(AnyT)) == 0), "Unhandled type conversion");
|
|
return ArrayRef<AnyT>(reinterpret_cast<typename ArrayRef<AnyT>::iterator>(begIt), (this->size() * sizeof(DataType)) / sizeof(AnyT));
|
|
}
|
|
|
|
private:
|
|
DataType *begIt = nullptr;
|
|
DataType *endIt = nullptr;
|
|
};
|
|
|
|
template <typename T>
|
|
bool operator==(const ArrayRef<T> &lhs,
|
|
const ArrayRef<T> &rhs) {
|
|
if (lhs.size() != rhs.size()) {
|
|
return false;
|
|
}
|
|
|
|
auto lhsIt = lhs.begin();
|
|
auto lhsEnd = lhs.end();
|
|
auto rhsIt = rhs.begin();
|
|
|
|
for (; lhsIt != lhsEnd; ++lhsIt, ++rhsIt) {
|
|
if (*lhsIt != *rhsIt) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|