120ca87015
git-svn-id: https://free-cad.svn.sourceforge.net/svnroot/free-cad/trunk@5000 e8eeb9e2-ec13-0410-a4a9-efa5cf37419d
82 lines
2.4 KiB
C++
82 lines
2.4 KiB
C++
// Wild Magic Source Code
|
|
// David Eberly
|
|
// http://www.geometrictools.com
|
|
// Copyright (c) 1998-2007
|
|
//
|
|
// This library is free software; you can redistribute it and/or modify it
|
|
// under the terms of the GNU Lesser General Public License as published by
|
|
// the Free Software Foundation; either version 2.1 of the License, or (at
|
|
// your option) any later version. The license is available for reading at
|
|
// either of the locations:
|
|
// http://www.gnu.org/copyleft/lgpl.html
|
|
// http://www.geometrictools.com/License/WildMagicLicense.pdf
|
|
// The license applies to versions 0 through 4 of Wild Magic.
|
|
//
|
|
// Version: 4.0.0 (2006/06/28)
|
|
|
|
#ifndef WM4TSET_H
|
|
#define WM4TSET_H
|
|
|
|
#include "Wm4FoundationLIB.h"
|
|
#include "Wm4Memory.h"
|
|
|
|
// This template class is for unordered sets of objects. The intent is that
|
|
// the sets are not too large. If you do not plan on searching the set and
|
|
// you know that the elements to be added are unique, then the size of the
|
|
// set is irrelevant since a member function is provided that inserts an
|
|
// element without checking to see if one already exists.
|
|
//
|
|
// The class T is either native data or is class data that has the following
|
|
// member functions:
|
|
// T::T ()
|
|
// T::T (const T&);
|
|
// T& T::operator= (const T&)
|
|
|
|
namespace Wm4
|
|
{
|
|
|
|
template <class T>
|
|
class TSmallUnorderedSet
|
|
{
|
|
public:
|
|
// construction and destruction
|
|
TSmallUnorderedSet ();
|
|
TSmallUnorderedSet (int iMaxQuantity, int iGrowBy);
|
|
TSmallUnorderedSet (const TSmallUnorderedSet& rkSet);
|
|
~TSmallUnorderedSet ();
|
|
|
|
// assignment
|
|
TSmallUnorderedSet& operator= (const TSmallUnorderedSet& rkSet);
|
|
|
|
// member access
|
|
int GetMaxQuantity () const;
|
|
int GetGrowBy () const;
|
|
int GetQuantity () const;
|
|
T* GetElements ();
|
|
const T* GetElements () const;
|
|
T& operator[] (int i);
|
|
const T& operator[] (int i) const;
|
|
|
|
// insertion, removal, searching
|
|
bool Insert (const T& rkElement);
|
|
void InsertNoCheck (const T& rkElement);
|
|
bool Remove (const T& rkElement);
|
|
bool Exists (const T& rkElement);
|
|
|
|
// make empty set, keep quantity and growth parameters
|
|
void Clear ();
|
|
|
|
// make empty set, reallocate using new quantity and growth parameters
|
|
void Clear (int iMaxQuantity, int iGrowBy);
|
|
|
|
private:
|
|
int m_iQuantity, m_iMaxQuantity, m_iGrowBy;
|
|
T* m_atElement;
|
|
};
|
|
|
|
}
|
|
|
|
#include "Wm4TSmallUnorderedSet.inl"
|
|
|
|
#endif
|