inline_deque.h

// Copyright 2023 The Pigweed 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
//
//     https://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.
#pragma once
 
#include <cstddef>
#include <cstdint>
#include <initializer_list>
#include <limits>
#include <type_traits>
#include <utility>
 
#include "pw_assert/assert.h"
#include "pw_containers/internal/count_and_capacity.h"
#include "pw_containers/internal/generic_deque.h"
#include "pw_containers/internal/raw_storage.h"
#include "pw_toolchain/constexpr_tag.h"
 
namespace pw {
namespace containers::internal {
 
// Forward declarations.
template <typename T, typename CountAndCapacityType, size_t kCapacity>
class BasicInlineDequeImpl;
 
}  // namespace containers::internal
 
 
template <typename ValueType,
          typename SizeType,
          size_t kCapacity = containers::internal::kGenericSized>
using BasicInlineDeque = containers::internal::BasicInlineDequeImpl<
    ValueType,
    containers::internal::CountAndCapacity<SizeType>,
    kCapacity>;
 
template <typename T, size_t kCapacity = containers::internal::kGenericSized>
using InlineDeque = BasicInlineDeque<T, uint16_t, kCapacity>;
 
 
namespace containers::internal {
 
template <typename ValueType, typename CountAndCapacityType, size_t kCapacity>
class BasicInlineDequeImpl
    : public RawStorage<
          BasicInlineDequeImpl<ValueType, CountAndCapacityType, kGenericSized>,
          ValueType,
          kCapacity> {
 private:
  using Base =
      BasicInlineDequeImpl<ValueType, CountAndCapacityType, kGenericSized>;
 
 public:
  using typename Base::const_iterator;
  using typename Base::const_pointer;
  using typename Base::const_reference;
  using typename Base::difference_type;
  using typename Base::iterator;
  using typename Base::pointer;
  using typename Base::reference;
  using typename Base::size_type;
  using typename Base::value_type;
 
  BasicInlineDequeImpl() noexcept {}
 
  // Explicit zero element constexpr constructor. Using this constructor will
  // place the entire object in .data, which will increase ROM size. Use with
  // caution if working with large capacity sizes.
  constexpr BasicInlineDequeImpl(ConstexprTag /*constexpr_tag*/) noexcept {}
 
  BasicInlineDequeImpl(size_type count, const_reference value) {
    Base::assign(count, value);
  }
 
  explicit BasicInlineDequeImpl(size_type count)
      : BasicInlineDequeImpl(count, value_type()) {}
 
  template <typename InputIterator,
            typename = EnableIfInputIterator<InputIterator>>
  BasicInlineDequeImpl(InputIterator start, InputIterator finish) {
    Base::assign(start, finish);
  }
 
  BasicInlineDequeImpl(const BasicInlineDequeImpl& other) { *this = other; }
 
  template <size_t kOtherCapacity>
  BasicInlineDequeImpl(const BasicInlineDequeImpl<ValueType,
                                                  CountAndCapacityType,
                                                  kOtherCapacity>& other) {
    *this = other;
  }
 
  BasicInlineDequeImpl(BasicInlineDequeImpl&& other) noexcept {
    *this = std::move(other);
  }
 
  template <size_t kOtherCapacity>
  BasicInlineDequeImpl(
      BasicInlineDequeImpl<ValueType, CountAndCapacityType, kOtherCapacity>&&
          other) noexcept {
    *this = std::move(other);
  }
 
  BasicInlineDequeImpl(const std::initializer_list<value_type>& list) {
    *this = list;
  }
 
  template <typename T, typename = EnableIfIterable<T>>
  BasicInlineDequeImpl(const T& other) {
    *this = other;
  }
 
  // Assignment operators
  //
  // These operators delegate to the base class implementations in order to
  // maximize code reuse. The wrappers are required so that `operator=`
  // returns the correct type of reference.
  //
  // The `static_cast`s below are unfortunately necessary: without them,
  // overload resolution prefers to use the "iterable" operators rather than
  // upcast the RHS.
 
  BasicInlineDequeImpl& operator=(
      const std::initializer_list<value_type>& list) {
    Base::operator=(list);
    return *this;
  }
 
  BasicInlineDequeImpl& operator=(const BasicInlineDequeImpl& other) {
    Base::operator=(static_cast<const Base&>(other));
    return *this;
  }
 
  template <size_t kOtherCapacity>
  BasicInlineDequeImpl& operator=(
      const BasicInlineDequeImpl<ValueType,
                                 CountAndCapacityType,
                                 kOtherCapacity>& other) {
    Base::operator=(static_cast<const Base&>(other));
    return *this;
  }
 
  BasicInlineDequeImpl& operator=(BasicInlineDequeImpl&& other) noexcept {
    Base::operator=(static_cast<Base&&>(std::move(other)));
    return *this;
  }
 
  template <size_t kOtherCapacity>
  BasicInlineDequeImpl& operator=(
      BasicInlineDequeImpl<ValueType, CountAndCapacityType, kOtherCapacity>&&
          other) noexcept {
    Base::operator=(static_cast<Base&&>(std::move(other)));
    return *this;
  }
 
  template <typename T, typename = EnableIfIterable<T>>
  BasicInlineDequeImpl& operator=(const T& other) {
    Base::operator=(other);
    return *this;
  }
 
  // Size
 
  static constexpr size_type max_size() { return capacity(); }
  static constexpr size_type capacity() { return kCapacity; }
};
 
// Defines the generic-sized BasicInlineDequeImpl<T> specialization, which
// serves as the base class for BasicInlineDequeImpl<T> of any capacity.
//
// Except for constructors and destructors, all other methods should be
// implemented on this generic-sized specialization.
//
// NOTE: this size-polymorphic base class must not be used inside of
// ``std::unique_ptr`` or ``delete``.
template <typename ValueType, typename CountAndCapacityType>
class BasicInlineDequeImpl<ValueType, CountAndCapacityType, kGenericSized>
    : public GenericDeque<
          BasicInlineDequeImpl<ValueType, CountAndCapacityType, kGenericSized>,
          ValueType,
          CountAndCapacityType> {
 private:
  using Base = GenericDeque<
      BasicInlineDequeImpl<ValueType, CountAndCapacityType, kGenericSized>,
      ValueType,
      CountAndCapacityType>;
 
 public:
  using typename Base::const_iterator;
  using typename Base::const_pointer;
  using typename Base::const_reference;
  using typename Base::difference_type;
  using typename Base::iterator;
  using typename Base::pointer;
  using typename Base::reference;
  using typename Base::size_type;
  using typename Base::value_type;
 
  // Polymorphic-sized `pw::InlineDeque<T>` may not be constructed directly.
  BasicInlineDequeImpl() = delete;
 
  BasicInlineDequeImpl& operator=(const BasicInlineDequeImpl& other) {
    Base::assign(other.begin(), other.end());
    return *this;
  }
 
  BasicInlineDequeImpl& operator=(BasicInlineDequeImpl&& other) noexcept {
    Base::clear();
    for (auto&& item : other) {
      Base::emplace_back(std::move(item));
    }
    other.clear();
    return *this;
  }
 
  using Base::operator=;
 
  size_type max_size() const noexcept { return Base::capacity(); }
 
  [[nodiscard]] bool full() const noexcept {
    return Base::size() == Base::capacity();
  }
 
 protected:
  constexpr BasicInlineDequeImpl(size_type capacity) noexcept
      : Base(capacity) {}
 
  // Polymorphic-sized `pw::InlineDeque<T>` may not be used with `unique_ptr`
  // or `delete`. `delete` could be supported using C++20's destroying delete.
  ~BasicInlineDequeImpl() = default;
 
  template <size_t kCapacity>
  using Derived = RawStorage<
      BasicInlineDequeImpl<ValueType, CountAndCapacityType, kGenericSized>,
      ValueType,
      kCapacity>;
 
  // The underlying RawStorage is not part of the generic-sized class. It is
  // provided in the derived class from which this instance was constructed. To
  // access the data, down-cast this to a known max size specialization, and
  // return the RawStorage's data, which is the same for all sizes.
  pointer data() { return static_cast<Derived<0>*>(this)->data(); }
  const_pointer data() const {
    return static_cast<const Derived<0>*>(this)->data();
  }
 
 private:
  friend Base;
 
  static constexpr bool kFixedCapacity = true;  // uses static allocation
};
 
}  // namespace containers::internal
}  // namespace pw