cannam@134: // Copyright (c) 2013-2014 Sandstorm Development Group, Inc. and contributors cannam@134: // Licensed under the MIT License: cannam@134: // cannam@134: // Permission is hereby granted, free of charge, to any person obtaining a copy cannam@134: // of this software and associated documentation files (the "Software"), to deal cannam@134: // in the Software without restriction, including without limitation the rights cannam@134: // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell cannam@134: // copies of the Software, and to permit persons to whom the Software is cannam@134: // furnished to do so, subject to the following conditions: cannam@134: // cannam@134: // The above copyright notice and this permission notice shall be included in cannam@134: // all copies or substantial portions of the Software. cannam@134: // cannam@134: // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR cannam@134: // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, cannam@134: // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE cannam@134: // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER cannam@134: // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, cannam@134: // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN cannam@134: // THE SOFTWARE. cannam@134: cannam@134: #ifndef KJ_VECTOR_H_ cannam@134: #define KJ_VECTOR_H_ cannam@134: cannam@134: #if defined(__GNUC__) && !KJ_HEADER_WARNINGS cannam@134: #pragma GCC system_header cannam@134: #endif cannam@134: cannam@134: #include "array.h" cannam@134: cannam@134: namespace kj { cannam@134: cannam@134: template cannam@134: class Vector { cannam@134: // Similar to std::vector, but based on KJ framework. cannam@134: // cannam@134: // This implementation always uses move constructors when growing the backing array. If the cannam@134: // move constructor throws, the Vector is left in an inconsistent state. This is acceptable cannam@134: // under KJ exception theory which assumes that exceptions leave things in inconsistent states. cannam@134: cannam@134: // TODO(someday): Allow specifying a custom allocator. cannam@134: cannam@134: public: cannam@134: inline Vector() = default; cannam@134: inline explicit Vector(size_t capacity): builder(heapArrayBuilder(capacity)) {} cannam@134: cannam@134: inline operator ArrayPtr() { return builder; } cannam@134: inline operator ArrayPtr() const { return builder; } cannam@134: inline ArrayPtr asPtr() { return builder.asPtr(); } cannam@134: inline ArrayPtr asPtr() const { return builder.asPtr(); } cannam@134: cannam@134: inline size_t size() const { return builder.size(); } cannam@134: inline bool empty() const { return size() == 0; } cannam@134: inline size_t capacity() const { return builder.capacity(); } cannam@134: inline T& operator[](size_t index) const { return builder[index]; } cannam@134: cannam@134: inline const T* begin() const { return builder.begin(); } cannam@134: inline const T* end() const { return builder.end(); } cannam@134: inline const T& front() const { return builder.front(); } cannam@134: inline const T& back() const { return builder.back(); } cannam@134: inline T* begin() { return builder.begin(); } cannam@134: inline T* end() { return builder.end(); } cannam@134: inline T& front() { return builder.front(); } cannam@134: inline T& back() { return builder.back(); } cannam@134: cannam@134: inline Array releaseAsArray() { cannam@134: // TODO(perf): Avoid a copy/move by allowing Array to point to incomplete space? cannam@134: if (!builder.isFull()) { cannam@134: setCapacity(size()); cannam@134: } cannam@134: return builder.finish(); cannam@134: } cannam@134: cannam@134: template cannam@134: inline T& add(Params&&... params) { cannam@134: if (builder.isFull()) grow(); cannam@134: return builder.add(kj::fwd(params)...); cannam@134: } cannam@134: cannam@134: template cannam@134: inline void addAll(Iterator begin, Iterator end) { cannam@134: size_t needed = builder.size() + (end - begin); cannam@134: if (needed > builder.capacity()) grow(needed); cannam@134: builder.addAll(begin, end); cannam@134: } cannam@134: cannam@134: template cannam@134: inline void addAll(Container&& container) { cannam@134: addAll(container.begin(), container.end()); cannam@134: } cannam@134: cannam@134: inline void removeLast() { cannam@134: builder.removeLast(); cannam@134: } cannam@134: cannam@134: inline void resize(size_t size) { cannam@134: if (size > builder.capacity()) grow(size); cannam@134: while (builder.size() < size) { cannam@134: builder.add(T()); cannam@134: } cannam@134: while (builder.size() > size) { cannam@134: builder.removeLast(); cannam@134: } cannam@134: } cannam@134: cannam@134: inline void operator=(decltype(nullptr)) { cannam@134: builder = nullptr; cannam@134: } cannam@134: cannam@134: inline void clear() { cannam@134: while (builder.size() > 0) { cannam@134: builder.removeLast(); cannam@134: } cannam@134: } cannam@134: cannam@134: inline void truncate(size_t size) { cannam@134: while (builder.size() > size) { cannam@134: builder.removeLast(); cannam@134: } cannam@134: } cannam@134: cannam@134: private: cannam@134: ArrayBuilder builder; cannam@134: cannam@134: void grow(size_t minCapacity = 0) { cannam@134: setCapacity(kj::max(minCapacity, capacity() == 0 ? 4 : capacity() * 2)); cannam@134: } cannam@134: void setCapacity(size_t newSize) { cannam@134: ArrayBuilder newBuilder = heapArrayBuilder(newSize); cannam@134: size_t moveCount = kj::min(newSize, builder.size()); cannam@134: for (size_t i = 0; i < moveCount; i++) { cannam@134: newBuilder.add(kj::mv(builder[i])); cannam@134: } cannam@134: builder = kj::mv(newBuilder); cannam@134: } cannam@134: }; cannam@134: cannam@134: template cannam@134: inline auto KJ_STRINGIFY(const Vector& v) -> decltype(toCharSequence(v.asPtr())) { cannam@134: return toCharSequence(v.asPtr()); cannam@134: } cannam@134: cannam@134: } // namespace kj cannam@134: cannam@134: #endif // KJ_VECTOR_H_