blob: 2db0ea213b8a0a6e72d240fb1f16fb8e05fc214b (
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
// Copyright 2016 The Draco 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.
//
// File defining a coherent interface for different queuing strategies.
#ifndef DRACO_COMPRESSION_POINT_CLOUD_ALGORITHMS_QUEUING_POLICY_H_
#define DRACO_COMPRESSION_POINT_CLOUD_ALGORITHMS_QUEUING_POLICY_H_
#include <queue>
#include <stack>
#include <utility>
namespace draco {
template <class T>
class Queue {
public:
bool empty() const { return q_.empty(); }
typename std::queue<T>::size_type size() const { return q_.size(); }
void clear() { return q_.clear(); }
void push(const T &value) { q_.push(value); }
void push(T &&value) { q_.push(std::move(value)); }
void pop() { q_.pop(); }
typename std::queue<T>::const_reference front() const { return q_.front(); }
private:
std::queue<T> q_;
};
template <class T>
class Stack {
public:
bool empty() const { return s_.empty(); }
typename std::stack<T>::size_type size() const { return s_.size(); }
void clear() { return s_.clear(); }
void push(const T &value) { s_.push(value); }
void push(T &&value) { s_.push(std::move(value)); }
void pop() { s_.pop(); }
typename std::stack<T>::const_reference front() const { return s_.top(); }
private:
std::stack<T> s_;
};
template <class T, class Compare = std::less<T> >
class PriorityQueue {
typedef std::priority_queue<T, std::vector<T>, Compare> QType;
public:
bool empty() const { return s_.empty(); }
typename QType::size_type size() const { return s_.size(); }
void clear() { return s_.clear(); }
void push(const T &value) { s_.push(value); }
void push(T &&value) { s_.push(std::move(value)); }
void pop() { s_.pop(); }
typename QType::const_reference front() const { return s_.top(); }
private:
QType s_;
};
} // namespace draco
#endif // DRACO_COMPRESSION_POINT_CLOUD_ALGORITHMS_QUEUING_POLICY_H_
|
