blob: 39133b9ca0be5773b3846fe1f8532d885371ea2e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
/*
* Copyright 2019 The libgav1 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 LIBGAV1_SRC_UTILS_STACK_H_
#define LIBGAV1_SRC_UTILS_STACK_H_
#include <cassert>
#include <utility>
namespace libgav1 {
// A LIFO stack of a fixed capacity. The elements are moved using std::move, so
// the element type T has to be movable.
//
// WARNING: No error checking is performed.
template <typename T, int capacity>
class Stack {
public:
// Pushes the element |value| to the top of the stack. It is an error to call
// Push() when the stack is full.
void Push(T value) {
++top_;
assert(top_ < capacity);
elements_[top_] = std::move(value);
}
// Returns the element at the top of the stack and removes it from the stack.
// It is an error to call Pop() when the stack is empty.
T Pop() {
assert(top_ >= 0);
return std::move(elements_[top_--]);
}
// Returns true if the stack is empty.
bool Empty() const { return top_ < 0; }
private:
static_assert(capacity > 0, "");
T elements_[capacity];
// The array index of the top of the stack. The stack is empty if top_ is -1.
int top_ = -1;
};
} // namespace libgav1
#endif // LIBGAV1_SRC_UTILS_STACK_H_
|
