You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
98 lines
3.0 KiB
98 lines
3.0 KiB
/**
|
|
* \file container.h
|
|
*
|
|
* \brief Definition eines Container-Templates
|
|
*
|
|
* Hiermit können alle möglichen Daten organisiert werden.
|
|
|
|
* \author Georg Steffers <georg@steffers.org> [gs]
|
|
*
|
|
* \date 04.12.2003
|
|
*
|
|
* \version ..2002 [gs]: erste funktionierende Implementation
|
|
* \version 04.12.2003 [gs]: beginn der Dokumentation via doxygen
|
|
* \version 19.12.2003 [gs]: <ul><li>
|
|
* Vergleichsoperator hinzugefügt.
|
|
* </li><li>
|
|
* die Methode contains hinzugefügt, die
|
|
* über den Vergleichsoperator eines
|
|
* Elements prüft ob es in diesem Container
|
|
* existiert.
|
|
* </li></ul>
|
|
*/
|
|
|
|
/*
|
|
* Copyright (C)2003 Georg Steffers
|
|
*
|
|
* 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 __container_h__
|
|
#define __container_h__
|
|
|
|
#include <stdlib.h>
|
|
|
|
template <class C>
|
|
class container {
|
|
protected:
|
|
C* content;
|
|
unsigned count;
|
|
|
|
public:
|
|
container();
|
|
container(const C& c);
|
|
container(const C* c, unsigned co);
|
|
container(const container<C>& c);
|
|
virtual ~container();
|
|
|
|
virtual const container<C>& operator=(const container<C>& c);
|
|
virtual bool operator==(const container<C>& c) const {
|
|
if(count==c.count) {
|
|
for(unsigned i=0; i<count; i++)
|
|
if(!(content[i]==c[i]))
|
|
return false;
|
|
}
|
|
else
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
const C& operator[](unsigned index) const;
|
|
C& operator[](unsigned index);
|
|
|
|
//! Prüft ob ein Element in dem Container ist.
|
|
//! Gibt -1 zurück falls nicht, ansonsten den index an dem
|
|
//! sich das Element vefindet
|
|
int contains(const C& c) {
|
|
for(unsigned i=0; i<count; i++)
|
|
if(content[i]==c)
|
|
return i;
|
|
|
|
return -1;
|
|
}
|
|
|
|
void sort(int (*comp)(const void*, const void*)) {
|
|
qsort(content, count, sizeof(C), comp);
|
|
}
|
|
|
|
void resize(unsigned size);
|
|
unsigned card(void) const { return count; }
|
|
virtual void insert(unsigned idx, const C& value);
|
|
};
|
|
|
|
#include "container_tpl.h"
|
|
|
|
#endif // __container_h__
|