mirror of
https://github.com/encounter/dawn-cmake.git
synced 2025-06-16 19:43:31 +00:00
e700a6a764
In order to remove the kMaxBindingsPerGroup limit in Dawn, some static ityp::arrays need to be made dynamically sized. This CL adds ityp::vector wrapping std::vector. This CL also fixes the assumption that ityp::stack_vec iterators are pointers Bug: dawn:442, dawn:443 Change-Id: I8698cbba3ea80ac063ab918a77f223c527720d08 Reviewed-on: https://dawn-review.googlesource.com/c/dawn/+/24480 Commit-Queue: Austin Eng <enga@chromium.org> Reviewed-by: Stephen White <senorblanco@chromium.org>
104 lines
3.0 KiB
C++
104 lines
3.0 KiB
C++
// Copyright 2020 The Dawn Authors
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
#ifndef COMMON_ITYP_STACK_VEC_H_
|
|
#define COMMON_ITYP_STACK_VEC_H_
|
|
|
|
#include "common/Assert.h"
|
|
#include "common/StackContainer.h"
|
|
#include "common/UnderlyingType.h"
|
|
|
|
namespace ityp {
|
|
|
|
template <typename Index, typename Value, size_t StaticCapacity>
|
|
class stack_vec : private StackVector<Value, StaticCapacity> {
|
|
using I = UnderlyingType<Index>;
|
|
using Base = StackVector<Value, StaticCapacity>;
|
|
using VectorBase = std::vector<Value, StackAllocator<Value, StaticCapacity>>;
|
|
static_assert(StaticCapacity <= std::numeric_limits<I>::max(), "");
|
|
|
|
public:
|
|
stack_vec() : Base() {
|
|
}
|
|
stack_vec(Index size) : Base() {
|
|
this->container().resize(static_cast<I>(size));
|
|
}
|
|
|
|
Value& operator[](Index i) {
|
|
ASSERT(i < size());
|
|
return Base::operator[](static_cast<I>(i));
|
|
}
|
|
|
|
constexpr const Value& operator[](Index i) const {
|
|
ASSERT(i < size());
|
|
return Base::operator[](static_cast<I>(i));
|
|
}
|
|
|
|
void resize(Index size) {
|
|
this->container().resize(static_cast<I>(size));
|
|
}
|
|
|
|
void reserve(Index size) {
|
|
this->container().reserve(static_cast<I>(size));
|
|
}
|
|
|
|
Value* data() {
|
|
return this->container().data();
|
|
}
|
|
|
|
const Value* data() const {
|
|
return this->container().data();
|
|
}
|
|
|
|
typename VectorBase::iterator begin() noexcept {
|
|
return this->container().begin();
|
|
}
|
|
|
|
typename VectorBase::const_iterator begin() const noexcept {
|
|
return this->container().begin();
|
|
}
|
|
|
|
typename VectorBase::iterator end() noexcept {
|
|
return this->container().end();
|
|
}
|
|
|
|
typename VectorBase::const_iterator end() const noexcept {
|
|
return this->container().end();
|
|
}
|
|
|
|
typename VectorBase::reference front() {
|
|
return this->container().front();
|
|
}
|
|
|
|
typename VectorBase::const_reference front() const {
|
|
return this->container().front();
|
|
}
|
|
|
|
typename VectorBase::reference back() {
|
|
return this->container().back();
|
|
}
|
|
|
|
typename VectorBase::const_reference back() const {
|
|
return this->container().back();
|
|
}
|
|
|
|
Index size() const {
|
|
return Index(static_cast<I>(this->container().size()));
|
|
}
|
|
};
|
|
|
|
} // namespace ityp
|
|
|
|
#endif // COMMON_ITYP_STACK_VEC_H_
|