/usr/include/claw/tree.hpp is in libclaw-dev 1.7.3-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 | /*
CLAW - a C++ Library Absolutely Wonderful
CLAW is a free library without any particular aim but being useful to
anyone.
Copyright (C) 2005-2011 Julien Jorge
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
contact: julien.jorge@gamned.org
*/
/**
* \file tree.hpp
* \brief A tree structure with any number of children.
* \author Julien Jorge
*/
#ifndef __CLAW_TREE_HPP__
#define __CLAW_TREE_HPP__
#include <list>
namespace claw
{
/**
* \brief A tree structure with any number of children.
* \author Julien Jorge
*/
template<typename T>
class tree
{
public:
/** \brief The type of the value stored in the nodes. */
typedef T value_type;
/** \brief The type of the current class. */
typedef tree<T> self_type;
private:
/** \brief The type of the list in which are stored the children. */
typedef std::list< tree<T> > child_list;
public:
typedef typename child_list::iterator iterator;
typedef typename child_list::const_iterator const_iterator;
public:
tree();
explicit tree( const T& that );
bool operator==( const self_type& that ) const;
bool is_leaf() const;
self_type& add_child( const T& v );
self_type& add_child( const self_type& v );
iterator find( const T& v );
const_iterator find( const T& v ) const;
iterator begin();
iterator end();
const_iterator begin() const;
const_iterator end() const;
public:
/** \brief The value in this node. */
T value;
private:
/** \brief The children of this node. */
child_list m_child;
}; // class tree
} // namespace claw
#include <claw/impl/tree.tpp>
#endif // __CLAW_TREE_HPP__
|