120ca87015
git-svn-id: https://free-cad.svn.sourceforge.net/svnroot/free-cad/trunk@5000 e8eeb9e2-ec13-0410-a4a9-efa5cf37419d
97 lines
2.7 KiB
C++
97 lines
2.7 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 WM4THASHSET_H
|
|
#define WM4THASHSET_H
|
|
|
|
#include "Wm4FoundationLIB.h"
|
|
|
|
// The class TKEY is either native data or is class data that has the
|
|
// following member functions:
|
|
// TKEY::TKEY ()
|
|
// TKEY& TKEY::operator= (const TKEY&)
|
|
// bool TKEY::operator== (const TKEY&) const
|
|
// bool TKEY::operator!= (const TKEY&) const
|
|
// TKEY::operator unsigned int () const
|
|
// The implicit conversion to unsigned int is used to select a hash table
|
|
// index for the T object. The return value need not be within the range of
|
|
// hash table indices. THashSet will use modular arithmetic to make this
|
|
// happen.
|
|
|
|
#include "Wm4System.h"
|
|
|
|
namespace Wm4
|
|
{
|
|
|
|
template <class TKEY>
|
|
class THashSet
|
|
{
|
|
public:
|
|
// construction and destruction
|
|
THashSet (int iTableSize);
|
|
~THashSet ();
|
|
|
|
// element access
|
|
int GetQuantity () const;
|
|
|
|
// A pointer to the actual storage is returned so that the caller has
|
|
// direct access to it. This allows a subset of TKEY members to be used
|
|
// in key comparison.
|
|
TKEY* Insert (const TKEY& rtKey);
|
|
|
|
// If the input key exists, a pointer to the actual storage is returned.
|
|
// This allows a subset of TKEY members to be used in key comparison,
|
|
// but gives the caller a chance to modify other TKEY members.
|
|
TKEY* Get (const TKEY& rtKey) const;
|
|
|
|
bool Remove (const TKEY& rtKey);
|
|
void RemoveAll ();
|
|
|
|
// linear traversal of map
|
|
TKEY* GetFirst () const;
|
|
TKEY* GetNext () const;
|
|
|
|
// user-specified key-to-index construction
|
|
int (*UserHashFunction)(const TKEY&);
|
|
|
|
private:
|
|
class HashItem
|
|
{
|
|
public:
|
|
TKEY m_tKey;
|
|
HashItem* m_pkNext;
|
|
};
|
|
|
|
// Default key-to-index construction (override by user-specified when
|
|
// requested).
|
|
int HashFunction (const TKEY& rtKey) const;
|
|
|
|
// hash table
|
|
int m_iTableSize;
|
|
int m_iQuantity;
|
|
HashItem** m_apkTable;
|
|
|
|
// iterator for traversal
|
|
mutable int m_iIndex;
|
|
mutable HashItem* m_pkItem;
|
|
};
|
|
|
|
}
|
|
|
|
#include "Wm4THashSet.inl"
|
|
|
|
#endif
|