/usr/include/GDF/pointerpool.h is in libgdf-dev 0.1.2-2build3.
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 | //
// This file is part of libGDF.
//
// libGDF 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 3 of
// the License, or (at your option) any later version.
//
// libGDF 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 libGDF. If not, see <http://www.gnu.org/licenses/>.
//
// Copyright 2010 Martin Billinger
#ifndef POINTERPOOL_H
#define POINTERPOOL_H
#include <list>
#include <iostream>
template<typename T>
class PointerPool
{
public:
/// Constructor
PointerPool( T type_template, size_t num_el = 1000 )
{
if( num_el == 0 )
throw std::invalid_argument( "PointerPool must not be empty." );
m_size_increment = num_el;
m_avail = num_el;
m_instances.resize( num_el, type_template );
typename std::list<T>::iterator it = m_instances.begin( );
for( ; it != m_instances.end(); it++ )
m_free_pointers.push_back( &(*it) );
std::cout << "PointerPool::PointerPool( )" << std::endl;
}
/// Destructor
virtual ~PointerPool( )
{
std::cout << "PointerPool::~PointerPool( )" << std::endl;
}
/// Add new elements to pool
void expand( size_t num_el )
{
std::cout << "PointerPool::expand( )" << std::endl;
for( size_t i=0; i<num_el; i++ )
{
m_instances.push_back( m_instances.front( ) ); // insert copies of the first element
m_free_pointers.push_back( &m_instances.back() );
}
m_avail += num_el;
}
/// Get a free element from the pool
T* pop( )
{
if( m_avail == 0 )
expand( m_size_increment );
T* ptr = m_free_pointers.front( );
m_free_pointers.pop_front( );
m_avail--;
return ptr;
}
/// Get a free element from the pool and initialize with src
/*T* pop( const T &src )
{
if( m_avail == 0 )
expand( m_size_increment );
T* ptr = m_free_pointers.front( );
m_free_pointers.pop_front( );
m_avail--;
*ptr = src;
return ptr;
}*/
void push( T* ptr )
{
m_free_pointers.push_back( ptr );
m_avail++;
}
private:
size_t m_size_increment;
size_t m_avail;
std::list<T> m_instances;
std::list<T*> m_free_pointers;
};
#endif // POINTERPOOL_H
|