C/C++ API Reference
Loading...
Searching...
No Matches
generic_queue.h
1// Copyright 2025 The Pigweed Authors
2//
3// Licensed under the Apache License, Version 2.0 (the "License"); you may not
4// use this file except in compliance with the License. You may obtain a copy of
5// the License at
6//
7// https://www.apache.org/licenses/LICENSE-2.0
8//
9// Unless required by applicable law or agreed to in writing, software
10// distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
11// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
12// License for the specific language governing permissions and limitations under
13// the License.
14#pragma once
15
16#include <utility>
17
18namespace pw::containers::internal {
19
20// Generic array-based deque class. Uses CRTP to access the underlying deque and
21// handle potentially resizing it.
22//
23// Extended by pw::InlineQueue and pw::DynamicQueue.
24template <typename Derived, typename Deque>
26 public:
27 using const_iterator = typename Deque::const_iterator;
28 using const_pointer = typename Deque::const_pointer;
29 using const_reference = typename Deque::const_reference;
30 using difference_type = typename Deque::difference_type;
31 using iterator = typename Deque::iterator;
32 using pointer = typename Deque::pointer;
33 using reference = typename Deque::reference;
34 using size_type = typename Deque::size_type;
35 using value_type = typename Deque::value_type;
36
37 // Access
38
39 reference front() { return deque().front(); }
40 const_reference front() const { return deque().front(); }
41
42 reference back() { return deque().back(); }
43 const_reference back() const { return deque().back(); }
44
45 // Size
46 [[nodiscard]] bool empty() const noexcept { return deque().empty(); }
47
48 [[nodiscard]] constexpr bool full() const noexcept { return deque().full(); }
49
50 size_type size() const noexcept { return deque().size(); }
51
52 size_type max_size() const noexcept { return deque().max_size(); }
53
54 size_type capacity() const noexcept { return deque().capacity(); }
55
56 // Modify
57
59 void clear() { deque().clear(); }
60
61 void push(const value_type& value) { deque().push_back(value); }
62
63 void push(value_type&& value) { deque().push_back(std::move(value)); }
64
65 template <typename... Args>
66 void emplace(Args&&... args) {
67 deque().emplace_back(std::forward<Args>(args)...);
68 }
69
70 void pop() { deque().pop_front(); }
71
72 protected:
73 constexpr GenericQueue() noexcept = default;
74
75 // `GenericQueue` may not be used with `unique_ptr` or `delete`.
76 ~GenericQueue() = default;
77
78 constexpr Deque& deque() { return static_cast<Derived&>(*this).deque(); }
79 constexpr const Deque& deque() const {
80 return static_cast<const Derived&>(*this).deque();
81 }
82};
83
84} // namespace pw::containers::internal
constexpr size_type size() const noexcept
Returns the number of elements in the deque.
Definition: generic_deque.h:69
constexpr size_type capacity() const noexcept
Returns the maximum number of elements in the deque.
Definition: generic_deque.h:74
Definition: generic_queue.h:25
void clear()
Removes all elements from the queue.
Definition: generic_queue.h:59