-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathscm-deque.hpp
More file actions
63 lines (45 loc) · 1.69 KB
/
scm-deque.hpp
File metadata and controls
63 lines (45 loc) · 1.69 KB
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
// Copyright (C) 2011-2016 Robert Kooima
//
// LIBSCM is free software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the Free Software
// Foundation; either version 2 of the License, or (at your option) any later
// version.
//
// This program is distributed in the hope that it will be useful, but WITH-
// OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
// more details.
#ifndef SCM_DEQUE_HPP
#define SCM_DEQUE_HPP
#include <string>
#include <list>
#include "scm-state.hpp"
//------------------------------------------------------------------------------
/// An scm_deque defines a sequence of scm_state objects
class scm_deque
{
public:
/// @name Constructors
/// @{
scm_deque();
/// @}
/// @name Basic accessors
/// @{
scm_state& front() { return sequence.front(); }
scm_state& back() { return sequence.back(); }
const scm_state& front() const { return sequence.front(); }
const scm_state& back() const { return sequence.back(); }
bool empty() const { return sequence.empty(); }
/// @}
/// @name Basic mutators
/// @{
void push_front(const scm_state& s) { sequence.push_front(s); }
void push_back (const scm_state& s) { sequence.push_back (s); }
void pop_front() { sequence.pop_front(); }
void pop_back () { sequence.pop_back (); }
void clear() { sequence.clear(); }
private:
std::list<scm_state> sequence; ///< Sequence of states
};
//------------------------------------------------------------------------------
#endif