diff options
| author | Vadim Dashevskiy <watcherhd@gmail.com> | 2012-05-15 10:38:20 +0000 |
|---|---|---|
| committer | Vadim Dashevskiy <watcherhd@gmail.com> | 2012-05-15 10:38:20 +0000 |
| commit | 48540940b6c28bb4378abfeb500ec45a625b37b6 (patch) | |
| tree | 2ef294c0763e802f91d868bdef4229b6868527de /include/m_system_cpp.h | |
| parent | 5c350913f011e119127baeb32a6aedeb4f0d33bc (diff) | |
initial commit
git-svn-id: http://svn.miranda-ng.org/main/trunk@2 1316c22d-e87f-b044-9b9b-93d7a3e3ba9c
Diffstat (limited to 'include/m_system_cpp.h')
| -rw-r--r-- | include/m_system_cpp.h | 184 |
1 files changed, 184 insertions, 0 deletions
diff --git a/include/m_system_cpp.h b/include/m_system_cpp.h new file mode 100644 index 0000000000..8c19d7c6f8 --- /dev/null +++ b/include/m_system_cpp.h @@ -0,0 +1,184 @@ +/*
+
+Miranda IM: the free IM client for Microsoft* Windows*
+
+Copyright 2000-2008 Miranda ICQ/IM project,
+all portions of this codebase are copyrighted to the people
+listed in contributors.txt.
+
+This program 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.
+
+This program 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 this program; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+*/
+#ifndef M_SYSTEM_CPP_H__
+#define M_SYSTEM_CPP_H__ 1
+
+#include "m_system.h"
+
+#if defined( __cplusplus ) && MIRANDA_VER >= 0x0600
+extern LIST_INTERFACE li;
+
+#define NumericKeySortT -1
+#define HandleKeySortT -2
+#define PtrKeySortT -3
+
+template<class T> struct LIST
+{
+ typedef int ( *FTSortFunc )( const T* p1, const T* p2 );
+
+ __inline LIST( int aincr, FTSortFunc afunc = NULL )
+ { memset( this, 0, sizeof( *this ));
+ increment = aincr;
+ sortFunc = afunc;
+ }
+
+ __inline LIST( int aincr, INT_PTR id )
+ { memset( this, 0, sizeof( *this ));
+ increment = aincr;
+ sortFunc = FTSortFunc( id );
+ }
+
+ __inline T* operator[]( int idx ) const { return ( idx >= 0 && idx < count ) ? items[idx] : NULL; }
+ __inline int getCount( void ) const { return count; }
+ __inline T** getArray( void ) const { return items; }
+
+ #if defined( _STATIC )
+ __inline LIST( const LIST& x )
+ { items = NULL;
+ List_Copy(( SortedList* )&x, ( SortedList* )this, sizeof( T ));
+ }
+
+ __inline int getIndex( T* p ) const
+ { int idx;
+ return ( !List_GetIndex(( SortedList* )this, p, &idx )) ? -1 : idx;
+ }
+
+ __inline void destroy( void ) { List_Destroy(( SortedList* )this ); }
+
+ __inline T* find( T* p ) { return ( T* )List_Find(( SortedList* )this, p ); }
+ __inline int indexOf( T* p ) { return List_IndexOf(( SortedList* )this, p ); }
+ __inline int insert( T* p, int idx ) { return List_Insert(( SortedList* )this, p, idx ); }
+ __inline int remove( int idx ) { return List_Remove(( SortedList* )this, idx ); }
+
+ __inline int insert( T* p ) { return List_InsertPtr(( SortedList* )this, p ); }
+ __inline int remove( T* p ) { return List_RemovePtr(( SortedList* )this, p ); }
+ #else
+ __inline LIST( const LIST& x )
+ { items = NULL;
+ li.List_Copy(( SortedList* )&x, ( SortedList* )this, sizeof( T ));
+ }
+
+ __inline int getIndex( T* p ) const
+ { int idx;
+ return ( !li.List_GetIndex(( SortedList* )this, p, &idx )) ? -1 : idx;
+ }
+
+ __inline void destroy( void ) { li.List_Destroy(( SortedList* )this ); }
+
+ __inline T* find( T* p ) { return ( T* )li.List_Find(( SortedList* )this, p ); }
+ __inline int indexOf( T* p ) { return li.List_IndexOf(( SortedList* )this, p ); }
+ __inline int insert( T* p, int idx ) { return li.List_Insert(( SortedList* )this, p, idx ); }
+ __inline int remove( int idx ) { return li.List_Remove(( SortedList* )this, idx ); }
+
+ __inline int insert( T* p ) { return li.List_InsertPtr(( SortedList* )this, p ); }
+ __inline int remove( T* p ) { return li.List_RemovePtr(( SortedList* )this, p ); }
+ #endif
+
+protected:
+ T** items;
+ int count, limit, increment;
+ FTSortFunc sortFunc;
+};
+
+template<class T> struct OBJLIST : public LIST<T>
+{
+ typedef int ( *FTSortFunc )( const T* p1, const T* p2 );
+
+ __inline OBJLIST( int aincr, FTSortFunc afunc = NULL ) :
+ LIST<T>( aincr, afunc )
+ {}
+
+ __inline OBJLIST( int aincr, INT_PTR id ) :
+ LIST<T>( aincr, ( FTSortFunc ) id )
+ {}
+
+ __inline OBJLIST( const OBJLIST& x ) :
+ LIST<T>( x.increment, x.sortFunc )
+ { items = NULL;
+ #if defined( _STATIC )
+ List_ObjCopy(( SortedList* )&x, ( SortedList* )this, sizeof( T ));
+ #else
+ li.List_ObjCopy(( SortedList* )&x, ( SortedList* )this, sizeof( T ));
+ #endif
+ }
+
+ __inline OBJLIST& operator=( const OBJLIST& x )
+ { destroy();
+ #if defined( _STATIC )
+ List_ObjCopy(( SortedList* )&x, ( SortedList* )this, sizeof( T ));
+ #else
+ li.List_ObjCopy(( SortedList* )&x, ( SortedList* )this, sizeof( T ));
+ #endif
+ return *this;
+ }
+
+ ~OBJLIST()
+ {
+ #if !defined( _STATIC )
+ if (li.cbSize != 0)
+ #endif
+ destroy();
+ }
+
+ __inline void destroy( void )
+ {
+ for ( int i=0; i < this->count; i++ )
+ delete this->items[i];
+
+ #if defined( _STATIC )
+ List_Destroy(( SortedList* )this );
+ #else
+ li.List_Destroy(( SortedList* )this );
+ #endif
+ }
+
+ __inline int remove( int idx ) {
+ delete this->items[idx];
+ #if defined( _STATIC )
+ return List_Remove(( SortedList* )this, idx );
+ #else
+ return li.List_Remove(( SortedList* )this, idx );
+ #endif
+ }
+
+ __inline int remove( T* p )
+ {
+ #if defined( _STATIC )
+ if ( li.List_RemovePtr(( SortedList* )this, p ) != -1 )
+ #else
+ if ( li.List_RemovePtr(( SortedList* )this, p ) != -1 )
+ #endif
+ {
+ delete p;
+ return 1;
+ }
+ return 0;
+ }
+
+ __inline T& operator[]( int idx ) const { return *this->items[idx]; }
+};
+
+#endif
+
+#endif // M_SYSTEM_CPP_H
+
|