/*
-Copyright (C) 1999-2006 Id Software, Inc. and contributors.
-For a list of contributors, see the accompanying CONTRIBUTORS file.
+ Copyright (C) 1999-2006 Id Software, Inc. and contributors.
+ For a list of contributors, see the accompanying CONTRIBUTORS file.
-This file is part of GtkRadiant.
+ This file is part of GtkRadiant.
-GtkRadiant 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.
+ GtkRadiant 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.
-GtkRadiant 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.
+ GtkRadiant 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 GtkRadiant; if not, write to the Free Software
-Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
-*/
+ You should have received a copy of the GNU General Public License
+ along with GtkRadiant; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+ */
#ifndef __UTIL_LIST_H__
#define __UTIL_LIST_H__
template< class type >
class idList {
private:
- int m_num;
- int m_size;
- int m_granularity;
- type *m_list;
+int m_num;
+int m_size;
+int m_granularity;
+type *m_list;
public:
- idList( int granularity = 16 );
- ~idList<type>();
- void Clear( void );
- int Num( void );
- void SetNum( int num );
- void SetGranularity( int granularity );
- void Condense( void );
- int Size( void );
- void Resize( int size );
- type operator[]( int index ) const;
- type &operator[]( int index );
- int Append( type const & obj );
- int AddUnique( type const & obj );
- type *Find( type const & obj, int *index = NULL );
- bool RemoveIndex( int index );
- bool Remove( type const & obj );
- typedef int cmp_t(const void *, const void *);
- void Sort( cmp_t *compare );
+idList( int granularity = 16 );
+~idList<type>();
+void Clear( void );
+int Num( void );
+void SetNum( int num );
+void SetGranularity( int granularity );
+void Condense( void );
+int Size( void );
+void Resize( int size );
+type operator[]( int index ) const;
+type &operator[]( int index );
+int Append( type const & obj );
+int AddUnique( type const & obj );
+type *Find( type const & obj, int *index = NULL );
+bool RemoveIndex( int index );
+bool Remove( type const & obj );
+typedef int cmp_t ( const void *, const void * );
+void Sort( cmp_t *compare );
};
/*
-================
-idList<type>::idList( int )
-================
-*/
+ ================
+ idList<type>::idList( int )
+ ================
+ */
template< class type >
inline idList<type>::idList( int granularity ) {
assert( granularity > 0 );
- m_list = NULL;
- m_granularity = granularity;
+ m_list = NULL;
+ m_granularity = granularity;
Clear();
}
/*
-================
-idList<type>::~idList<type>
-================
-*/
+ ================
+ idList<type>::~idList<type>
+ ================
+ */
template< class type >
inline idList<type>::~idList() {
Clear();
}
/*
-================
-idList<type>::Clear
-================
-*/
+ ================
+ idList<type>::Clear
+ ================
+ */
template< class type >
inline void idList<type>::Clear( void ) {
if ( m_list ) {
delete[] m_list;
}
- m_list = NULL;
- m_num = 0;
- m_size = 0;
+ m_list = NULL;
+ m_num = 0;
+ m_size = 0;
}
/*
-================
-idList<type>::Num
-================
-*/
+ ================
+ idList<type>::Num
+ ================
+ */
template< class type >
inline int idList<type>::Num( void ) {
return m_num;
}
/*
-================
-idList<type>::SetNum
-================
-*/
+ ================
+ idList<type>::SetNum
+ ================
+ */
template< class type >
inline void idList<type>::SetNum( int num ) {
assert( num >= 0 );
}
/*
-================
-idList<type>::SetGranularity
-================
-*/
+ ================
+ idList<type>::SetGranularity
+ ================
+ */
template< class type >
inline void idList<type>::SetGranularity( int granularity ) {
int newsize;
}
/*
-================
-idList<type>::Condense
+ ================
+ idList<type>::Condense
-Resizes the array to exactly the number of elements it contains
-================
-*/
+ Resizes the array to exactly the number of elements it contains
+ ================
+ */
template< class type >
inline void idList<type>::Condense( void ) {
if ( m_list ) {
if ( m_num ) {
Resize( m_num );
- } else {
+ }
+ else {
Clear();
}
}
}
/*
-================
-idList<type>::Size
-================
-*/
+ ================
+ idList<type>::Size
+ ================
+ */
template< class type >
inline int idList<type>::Size( void ) {
return m_size;
}
/*
-================
-idList<type>::Resize
-================
-*/
+ ================
+ idList<type>::Resize
+ ================
+ */
template< class type >
inline void idList<type>::Resize( int size ) {
- type *temp;
- int i;
+ type *temp;
+ int i;
assert( size > 0 );
return;
}
- temp = m_list;
- m_size = size;
+ temp = m_list;
+ m_size = size;
if ( m_size < m_num ) {
m_num = m_size;
}
m_list = new type[ m_size ];
- for( i = 0; i < m_num; i++ ) {
+ for ( i = 0; i < m_num; i++ ) {
m_list[ i ] = temp[ i ];
}
}
/*
-================
-idList<type>::operator[] const
-================
-*/
+ ================
+ idList<type>::operator[] const
+ ================
+ */
template< class type >
inline type idList<type>::operator[]( int index ) const {
assert( index >= 0 );
}
/*
-================
-idList<type>::operator[]
-================
-*/
+ ================
+ idList<type>::operator[]
+ ================
+ */
template< class type >
inline type &idList<type>::operator[]( int index ) {
assert( index >= 0 );
}
/*
-================
-idList<type>::Append
-================
-*/
+ ================
+ idList<type>::Append
+ ================
+ */
template< class type >
inline int idList<type>::Append( type const & obj ) {
if ( !m_list ) {
}
/*
-================
-idList<type>::AddUnique
-================
-*/
+ ================
+ idList<type>::AddUnique
+ ================
+ */
template< class type >
inline int idList<type>::AddUnique( type const & obj ) {
int index;
}
/*
-================
-idList<type>::Find
-================
-*/
+ ================
+ idList<type>::Find
+ ================
+ */
template< class type >
inline type *idList<type>::Find( type const & obj, int *index ) {
int i;
- for( i = 0; i < m_num; i++ ) {
+ for ( i = 0; i < m_num; i++ ) {
if ( m_list[ i ] == obj ) {
if ( index ) {
*index = i;
}
/*
-================
-idList<type>::RemoveIndex
-================
-*/
+ ================
+ idList<type>::RemoveIndex
+ ================
+ */
template< class type >
inline bool idList<type>::RemoveIndex( int index ) {
int i;
}
m_num--;
- for( i = index; i < m_num; i++ ) {
+ for ( i = index; i < m_num; i++ ) {
m_list[ i ] = m_list[ i + 1 ];
}
}
/*
-================
-idList<type>::Remove
-================
-*/
+ ================
+ idList<type>::Remove
+ ================
+ */
template< class type >
inline bool idList<type>::Remove( type const & obj ) {
int index;
if ( Find( obj, &index ) ) {
return RemoveIndex( index );
}
-
+
return false;
}
/*
-================
-idList<type>::Sort
-================
-*/
+ ================
+ idList<type>::Sort
+ ================
+ */
template< class type >
inline void idList<type>::Sort( cmp_t *compare ) {
if ( !m_list ) {
projects / xonotic / netradiant.git / blobdiff