GitHub/amxmodx
2
0
Fork 0
mirror of https://github.com/alliedmodders/amxmodx.git synced 2025-01-12 06:48:04 +03:00
Code Issues Projects Releases Wiki Activity

added a size() function (for get_modulesnum native)

Browse Source
This commit is contained in:
Pavol Marko 2004-02-27 11:07:58 +00:00
parent 17cbec1f63
commit 62bf5f66c6
1 changed files with 37 additions and 31 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
amxmodx/CList.h
View File

@ -1,21 +1,20 @@
/* AMX Mod X
/*
* Copyright (c) 2002-2003 Aleksander Naszko
*
* by the AMX Mod X Development Team
* originally developed by OLO
* This file is part of AMX Mod.
*
*
* This program is free software; you can redistribute it and/or modify it
* AMX Mod 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
* AMX Mod 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,
* along with AMX Mod; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* In addition, as a special exception, the author gives permission to
@ -27,6 +26,7 @@
* to your version of the file, but you are not obligated to do so. If
* you do not wish to do so, delete this exception statement from your
* version.
*
*/
#ifndef CLIST_H
@ -51,15 +51,21 @@ public:
};
private:
CListEle *head;
size_t cur_size;
public:
CList<T,F>() { head = 0; }
CList<T,F>() { head = 0; cur_size = 0; }
~CList<T,F>() { clear(); }
void clear() {
iterator a = begin();
while( a ) a.remove();
cur_size = 0;
}
void put( T* a ) {
head = new CListEle( a , head );
++cur_size;
}
size_t size() {
return cur_size;
}
class iterator {
CListEle** a;