-/*\r
-Copyright (C) 1999-2007 id Software, Inc. and contributors.\r
-For a list of contributors, see the accompanying CONTRIBUTORS file.\r
-\r
-This file is part of GtkRadiant.\r
-\r
-GtkRadiant is free software; you can redistribute it and/or modify\r
-it under the terms of the GNU General Public License as published by\r
-the Free Software Foundation; either version 2 of the License, or\r
-(at your option) any later version.\r
-\r
-GtkRadiant is distributed in the hope that it will be useful,\r
-but WITHOUT ANY WARRANTY; without even the implied warranty of\r
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
-GNU General Public License for more details.\r
-\r
-You should have received a copy of the GNU General Public License\r
-along with GtkRadiant; if not, write to the Free Software\r
-Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\r
-*/\r
-\r
-#ifndef __UTIL_LIST_H__\r
-#define __UTIL_LIST_H__\r
-\r
-#include <stdlib.h>\r
-#include <assert.h>\r
-\r
-template< class type >\r
-class idList {\r
-private:\r
- int m_num;\r
- int m_size;\r
- int m_granularity;\r
- type *m_list;\r
-\r
-public:\r
- idList( int granularity = 16 );\r
- ~idList<type>();\r
- void Clear( void );\r
- int Num( void );\r
- void SetNum( int num );\r
- void SetGranularity( int granularity );\r
- void Condense( void );\r
- int Size( void );\r
- void Resize( int size );\r
- type operator[]( int index ) const;\r
- type &operator[]( int index );\r
- int Append( type const & obj );\r
- int AddUnique( type const & obj );\r
- type *Find( type const & obj, int *index = NULL );\r
- bool RemoveIndex( int index );\r
- bool Remove( type const & obj );\r
- typedef int cmp_t(const void *, const void *);\r
- void Sort( cmp_t *compare );\r
-};\r
-\r
-/*\r
-================\r
-idList<type>::idList( int )\r
-================\r
-*/\r
-template< class type >\r
-inline idList<type>::idList( int granularity ) {\r
- assert( granularity > 0 );\r
-\r
- m_list = NULL;\r
- m_granularity = granularity;\r
- Clear();\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::~idList<type>\r
-================\r
-*/\r
-template< class type >\r
-inline idList<type>::~idList() {\r
- Clear();\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::Clear\r
-================\r
-*/\r
-template< class type >\r
-inline void idList<type>::Clear( void ) {\r
- if ( m_list ) {\r
- delete[] m_list;\r
- }\r
-\r
- m_list = NULL;\r
- m_num = 0;\r
- m_size = 0;\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::Num\r
-================\r
-*/\r
-template< class type >\r
-inline int idList<type>::Num( void ) {\r
- return m_num;\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::SetNum\r
-================\r
-*/\r
-template< class type >\r
-inline void idList<type>::SetNum( int num ) {\r
- assert( num >= 0 );\r
- if ( num > m_size ) {\r
- // resize it up to the closest level of granularity\r
- Resize( ( ( num + m_granularity - 1 ) / m_granularity ) * m_granularity );\r
- }\r
- m_num = num;\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::SetGranularity\r
-================\r
-*/\r
-template< class type >\r
-inline void idList<type>::SetGranularity( int granularity ) {\r
- int newsize;\r
-\r
- assert( granularity > 0 );\r
- m_granularity = granularity;\r
-\r
- if ( m_list ) {\r
- // resize it to the closest level of granularity\r
- newsize = ( ( m_num + m_granularity - 1 ) / m_granularity ) * m_granularity;\r
- if ( newsize != m_size ) {\r
- Resize( newsize );\r
- }\r
- }\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::Condense\r
-\r
-Resizes the array to exactly the number of elements it contains\r
-================\r
-*/\r
-template< class type >\r
-inline void idList<type>::Condense( void ) {\r
- if ( m_list ) {\r
- if ( m_num ) {\r
- Resize( m_num );\r
- } else {\r
- Clear();\r
- }\r
- }\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::Size\r
-================\r
-*/\r
-template< class type >\r
-inline int idList<type>::Size( void ) {\r
- return m_size;\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::Resize\r
-================\r
-*/\r
-template< class type >\r
-inline void idList<type>::Resize( int size ) {\r
- type *temp;\r
- int i;\r
-\r
- assert( size > 0 );\r
-\r
- if ( size <= 0 ) {\r
- Clear();\r
- return;\r
- }\r
-\r
- temp = m_list;\r
- m_size = size;\r
- if ( m_size < m_num ) {\r
- m_num = m_size;\r
- }\r
-\r
- m_list = new type[ m_size ];\r
- for( i = 0; i < m_num; i++ ) {\r
- m_list[ i ] = temp[ i ];\r
- }\r
-\r
- if ( temp ) {\r
- delete[] temp;\r
- }\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::operator[] const\r
-================\r
-*/\r
-template< class type >\r
-inline type idList<type>::operator[]( int index ) const {\r
- assert( index >= 0 );\r
- assert( index < m_num );\r
-\r
- return m_list[ index ];\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::operator[]\r
-================\r
-*/\r
-template< class type >\r
-inline type &idList<type>::operator[]( int index ) {\r
- assert( index >= 0 );\r
- assert( index < m_num );\r
-\r
- return m_list[ index ];\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::Append\r
-================\r
-*/\r
-template< class type >\r
-inline int idList<type>::Append( type const & obj ) {\r
- if ( !m_list ) {\r
- Resize( m_granularity );\r
- }\r
-\r
- if ( m_num == m_size ) {\r
- Resize( m_size + m_granularity );\r
- }\r
-\r
- m_list[ m_num ] = obj;\r
- m_num++;\r
-\r
- return m_num - 1;\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::AddUnique\r
-================\r
-*/\r
-template< class type >\r
-inline int idList<type>::AddUnique( type const & obj ) {\r
- int index;\r
-\r
- if ( !Find( obj, &index ) ) {\r
- index = Append( obj );\r
- }\r
-\r
- return index;\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::Find\r
-================\r
-*/\r
-template< class type >\r
-inline type *idList<type>::Find( type const & obj, int *index ) {\r
- int i;\r
-\r
- for( i = 0; i < m_num; i++ ) {\r
- if ( m_list[ i ] == obj ) {\r
- if ( index ) {\r
- *index = i;\r
- }\r
- return &m_list[ i ];\r
- }\r
- }\r
-\r
- return NULL;\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::RemoveIndex\r
-================\r
-*/\r
-template< class type >\r
-inline bool idList<type>::RemoveIndex( int index ) {\r
- int i;\r
-\r
- if ( !m_list || !m_num ) {\r
- return false;\r
- }\r
-\r
- assert( index >= 0 );\r
- assert( index < m_num );\r
-\r
- if ( ( index < 0 ) || ( index >= m_num ) ) {\r
- return false;\r
- }\r
-\r
- m_num--;\r
- for( i = index; i < m_num; i++ ) {\r
- m_list[ i ] = m_list[ i + 1 ];\r
- }\r
-\r
- return true;\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::Remove\r
-================\r
-*/\r
-template< class type >\r
-inline bool idList<type>::Remove( type const & obj ) {\r
- int index;\r
-\r
- if ( Find( obj, &index ) ) {\r
- return RemoveIndex( index );\r
- }\r
- \r
- return false;\r
-}\r
-\r
-/*\r
-================\r
-idList<type>::Sort\r
-================\r
-*/\r
-template< class type >\r
-inline void idList<type>::Sort( cmp_t *compare ) {\r
- if ( !m_list ) {\r
- return;\r
- }\r
-\r
- qsort( ( void * )m_list, ( size_t )m_num, sizeof( type ), compare );\r
-}\r
-\r
-#endif /* !__UTIL_LIST_H__ */\r
+/*
+Copyright (C) 1999-2007 id Software, Inc. and contributors.
+For a list of contributors, see the accompanying CONTRIBUTORS file.
+
+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 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
+*/
+
+#ifndef __UTIL_LIST_H__
+#define __UTIL_LIST_H__
+
+#include <stdlib.h>
+#include <assert.h>
+
+template< class type >
+class idList {
+private:
+ 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<type>::idList( int )
+================
+*/
+template< class type >
+inline idList<type>::idList( int granularity ) {
+ assert( granularity > 0 );
+
+ m_list = NULL;
+ m_granularity = granularity;
+ Clear();
+}
+
+/*
+================
+idList<type>::~idList<type>
+================
+*/
+template< class type >
+inline idList<type>::~idList() {
+ 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;
+}
+
+/*
+================
+idList<type>::Num
+================
+*/
+template< class type >
+inline int idList<type>::Num( void ) {
+ return m_num;
+}
+
+/*
+================
+idList<type>::SetNum
+================
+*/
+template< class type >
+inline void idList<type>::SetNum( int num ) {
+ assert( num >= 0 );
+ if ( num > m_size ) {
+ // resize it up to the closest level of granularity
+ Resize( ( ( num + m_granularity - 1 ) / m_granularity ) * m_granularity );
+ }
+ m_num = num;
+}
+
+/*
+================
+idList<type>::SetGranularity
+================
+*/
+template< class type >
+inline void idList<type>::SetGranularity( int granularity ) {
+ int newsize;
+
+ assert( granularity > 0 );
+ m_granularity = granularity;
+
+ if ( m_list ) {
+ // resize it to the closest level of granularity
+ newsize = ( ( m_num + m_granularity - 1 ) / m_granularity ) * m_granularity;
+ if ( newsize != m_size ) {
+ Resize( newsize );
+ }
+ }
+}
+
+/*
+================
+idList<type>::Condense
+
+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 {
+ Clear();
+ }
+ }
+}
+
+/*
+================
+idList<type>::Size
+================
+*/
+template< class type >
+inline int idList<type>::Size( void ) {
+ return m_size;
+}
+
+/*
+================
+idList<type>::Resize
+================
+*/
+template< class type >
+inline void idList<type>::Resize( int size ) {
+ type *temp;
+ int i;
+
+ assert( size > 0 );
+
+ if ( size <= 0 ) {
+ Clear();
+ return;
+ }
+
+ 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++ ) {
+ m_list[ i ] = temp[ i ];
+ }
+
+ if ( temp ) {
+ delete[] temp;
+ }
+}
+
+/*
+================
+idList<type>::operator[] const
+================
+*/
+template< class type >
+inline type idList<type>::operator[]( int index ) const {
+ assert( index >= 0 );
+ assert( index < m_num );
+
+ return m_list[ index ];
+}
+
+/*
+================
+idList<type>::operator[]
+================
+*/
+template< class type >
+inline type &idList<type>::operator[]( int index ) {
+ assert( index >= 0 );
+ assert( index < m_num );
+
+ return m_list[ index ];
+}
+
+/*
+================
+idList<type>::Append
+================
+*/
+template< class type >
+inline int idList<type>::Append( type const & obj ) {
+ if ( !m_list ) {
+ Resize( m_granularity );
+ }
+
+ if ( m_num == m_size ) {
+ Resize( m_size + m_granularity );
+ }
+
+ m_list[ m_num ] = obj;
+ m_num++;
+
+ return m_num - 1;
+}
+
+/*
+================
+idList<type>::AddUnique
+================
+*/
+template< class type >
+inline int idList<type>::AddUnique( type const & obj ) {
+ int index;
+
+ if ( !Find( obj, &index ) ) {
+ index = Append( obj );
+ }
+
+ return index;
+}
+
+/*
+================
+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++ ) {
+ if ( m_list[ i ] == obj ) {
+ if ( index ) {
+ *index = i;
+ }
+ return &m_list[ i ];
+ }
+ }
+
+ return NULL;
+}
+
+/*
+================
+idList<type>::RemoveIndex
+================
+*/
+template< class type >
+inline bool idList<type>::RemoveIndex( int index ) {
+ int i;
+
+ if ( !m_list || !m_num ) {
+ return false;
+ }
+
+ assert( index >= 0 );
+ assert( index < m_num );
+
+ if ( ( index < 0 ) || ( index >= m_num ) ) {
+ return false;
+ }
+
+ m_num--;
+ for( i = index; i < m_num; i++ ) {
+ m_list[ i ] = m_list[ i + 1 ];
+ }
+
+ return true;
+}
+
+/*
+================
+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
+================
+*/
+template< class type >
+inline void idList<type>::Sort( cmp_t *compare ) {
+ if ( !m_list ) {
+ return;
+ }
+
+ qsort( ( void * )m_list, ( size_t )m_num, sizeof( type ), compare );
+}
+
+#endif /* !__UTIL_LIST_H__ */
projects / xonotic / netradiant.git / blobdiff