/usr/include/bliss/kstack.hh is in libbliss-dev 0.72-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 | #ifndef BLISS_KSTACK_H
#define BLISS_KSTACK_H
/*
Copyright (c) 2006-2011 Tommi Junttila
Released under the GNU General Public License version 3.
This file is part of bliss.
bliss is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License version 3
as published by the Free Software Foundation.
bliss is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with Foobar. If not, see <http://www.gnu.org/licenses/>.
*/
#include <cstdlib>
#include "defs.hh"
namespace bliss {
/** \internal
* \brief A very simple implementation of a stack with fixed capacity.
*/
template <class Type>
class KStack {
public:
/**
* Create a new stack with zero capacity.
* The function init() should be called next.
*/
KStack();
/**
* Create a new stack with the capacity to hold at most \a N elements.
*/
KStack(int N);
~KStack();
/**
* Initialize the stack to have the capacity to hold at most \a N elements.
*/
void init(int N);
/**
* Is the stack empty?
*/
bool is_empty() const {return(cursor == entries); }
/**
* Return (but don't remove) the top element of the stack.
*/
Type top() const {BLISS_ASSERT(cursor > entries); return *cursor; }
/**
* Pop (remove) the top element of the stack.
*/
Type pop()
{
return *cursor--;
}
/**
* Push the element \a e in the stack.
*/
void push(Type e)
{
*(++cursor) = e;
}
/** Remove all the elements in the stack. */
void clean() {cursor = entries; }
/**
* Get the number of elements in the stack.
*/
unsigned int size() const {return(cursor - entries); }
/**
* Return the i:th element in the stack, where \a i is in the range
* 0,...,this.size()-1; the 0:th element is the bottom element
* in the stack.
*/
Type element_at(unsigned int i)
{
assert(i < size());
return entries[i+1];
}
/** Return the capacity (NOT the number of elements) of the stack. */
int capacity() {return kapacity; }
private:
int kapacity;
Type *entries;
Type *cursor;
};
template <class Type>
KStack<Type>::KStack()
{
kapacity = 0;
entries = 0;
cursor = 0;
}
template <class Type>
KStack<Type>::KStack(int k)
{
assert(k > 0);
kapacity = k;
entries = (Type*)malloc((k+1) * sizeof(Type));
cursor = entries;
}
template <class Type>
void KStack<Type>::init(int k)
{
assert(k > 0);
if(entries)
free(entries);
kapacity = k;
entries = (Type*)malloc((k+1) * sizeof(Type));
cursor = entries;
}
template <class Type>
KStack<Type>::~KStack()
{
free(entries);
}
} // namespace bliss
#endif
|