C/C++ API Reference
Loading...
Searching...
No Matches
dynamic_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
18#include "pw_allocator/allocator.h"
19#include "pw_containers/dynamic_deque.h"
20#include "pw_containers/internal/generic_queue.h"
21
22namespace pw {
23
25
28
36template <typename T, typename SizeType = uint16_t>
38 : public containers::internal::GenericQueue<DynamicQueue<T, SizeType>,
39 DynamicDeque<T, SizeType>> {
40 private:
42
43 public:
44 using const_iterator = typename Deque::const_iterator;
45 using const_pointer = typename Deque::const_pointer;
46 using const_reference = typename Deque::const_reference;
47 using difference_type = typename Deque::difference_type;
48 using iterator = typename Deque::iterator;
49 using pointer = typename Deque::pointer;
50 using reference = typename Deque::reference;
51 using size_type = typename Deque::size_type;
52 using value_type = typename Deque::value_type;
53
55 explicit constexpr DynamicQueue(pw::Allocator& allocator)
56 : deque_(allocator) {}
57
58 // Disable copy since it can fail.
59 DynamicQueue(const DynamicQueue&) = delete;
60 DynamicQueue& operator=(const DynamicQueue&) = delete;
61
63 constexpr DynamicQueue(DynamicQueue&&) = default;
64 DynamicQueue& operator=(DynamicQueue&&) = default;
65
67 void clear() { deque_.clear(); }
68
70 [[nodiscard]] bool try_push(const value_type& value) {
71 return deque_.try_push_back(value);
72 }
73
75 [[nodiscard]] bool try_push(value_type&& value) {
76 return deque_.try_push_back(std::move(value));
77 }
78
80 template <typename... Args>
81 [[nodiscard]] bool try_emplace(Args&&... args) {
82 return deque_.try_emplace_back(std::forward<Args>(args)...);
83 }
84
86 void reserve(size_type capacity) { deque_.reserve(capacity); }
87
90 [[nodiscard]] bool try_reserve(size_type capacity) {
91 return deque_.try_reserve(capacity);
92 }
93
95 void reserve_exact(size_type capacity) { deque_.reserve_exact(capacity); }
96
98 [[nodiscard]] bool try_reserve_exact(size_type capacity) {
99 return deque_.try_reserve_exact(capacity);
100 }
101
103 void shrink_to_fit() { deque_.shrink_to_fit(); }
104
106 void swap(DynamicQueue& other) { deque_.swap(other.deque_); }
107
108 private:
109 template <typename, typename>
110 friend class containers::internal::GenericQueue;
111
112 Deque& deque() { return deque_; }
113 const Deque& deque() const { return deque_; }
114
115 Deque deque_;
116};
117
118} // namespace pw
Definition: allocator.h:36
Definition: dynamic_deque.h:60
Definition: dynamic_queue.h:39
void clear()
Removes all elements from the queue.
Definition: dynamic_queue.h:67
bool try_reserve_exact(size_type capacity)
Attempts to set the queue capacity to max(capacity, size()) elements.
Definition: dynamic_queue.h:98
void reserve(size_type new_capacity)
Increases capacity() to at least new_capacity. Crashes on failure.
Definition: dynamic_deque.h:151
void reserve(size_type capacity)
Sets the queue capacity to at least max(capacity, size()) elements.
Definition: dynamic_queue.h:86
constexpr DynamicQueue(pw::Allocator &allocator)
Constructs a DynamicQueue using the provided allocator.
Definition: dynamic_queue.h:55
constexpr DynamicQueue(DynamicQueue &&)=default
Move operations are supported and incur no allocations.
void reserve_exact(size_type new_capacity)
Increases capacity() to exactly new_capacity. Crashes on failure.
Definition: dynamic_deque.h:167
void swap(DynamicDeque &other) noexcept
Swaps the contents of two deques. No allocations occur.
Definition: dynamic_deque.h:182
bool try_reserve(size_type new_capacity)
Definition: dynamic_deque.h:240
void swap(DynamicQueue &other)
Swaps the contents with another queue.
Definition: dynamic_queue.h:106
void shrink_to_fit()
Attempts to reduce capacity() to size(). Not guaranteed to succeed.
Definition: dynamic_deque.h:261
bool try_reserve_exact(size_type new_capacity)
Definition: dynamic_deque.h:162
bool try_push(const value_type &value)
Attempts to add an element to the back of the queue.
Definition: dynamic_queue.h:70
bool try_push(value_type &&value)
Attempts to add an element to the back of the queue (move version).
Definition: dynamic_queue.h:75
bool try_reserve(size_type capacity)
Definition: dynamic_queue.h:90
void shrink_to_fit()
Reduces memory usage by releasing unused capacity, if possible.
Definition: dynamic_queue.h:103
bool try_emplace(Args &&... args)
Attempts to construct an element in place at the back of the queue.
Definition: dynamic_queue.h:81
void reserve_exact(size_type capacity)
Sets the queue capacity to max(capacity, size()) elements.
Definition: dynamic_queue.h:95
The Pigweed namespace.
Definition: alignment.h:27