62 lines
2.7 KiB
C
62 lines
2.7 KiB
C
|
/*
|
||
|
* ICE / OPCODE - Optimized Collision Detection
|
||
|
* http://www.codercorner.com/Opcode.htm
|
||
|
*
|
||
|
* Copyright (c) 2001-2008 Pierre Terdiman, pierre@codercorner.com
|
||
|
|
||
|
This software is provided 'as-is', without any express or implied warranty.
|
||
|
In no event will the authors be held liable for any damages arising from the use of this software.
|
||
|
Permission is granted to anyone to use this software for any purpose,
|
||
|
including commercial applications, and to alter it and redistribute it freely,
|
||
|
subject to the following restrictions:
|
||
|
|
||
|
1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
|
||
|
2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
|
||
|
3. This notice may not be removed or altered from any source distribution.
|
||
|
*/
|
||
|
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||
|
/**
|
||
|
* Contains a simple pair class.
|
||
|
* \file IcePairs.h
|
||
|
* \author Pierre Terdiman
|
||
|
* \date January, 13, 2003
|
||
|
*/
|
||
|
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||
|
|
||
|
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||
|
// Include Guard
|
||
|
#ifndef __ICEPAIRS_H__
|
||
|
#define __ICEPAIRS_H__
|
||
|
|
||
|
//! A generic couple structure
|
||
|
struct ICECORE_API Pair
|
||
|
{
|
||
|
inline_ Pair() {}
|
||
|
inline_ Pair(udword i0, udword i1) : id0(i0), id1(i1) {}
|
||
|
|
||
|
udword id0; //!< First index of the pair
|
||
|
udword id1; //!< Second index of the pair
|
||
|
};
|
||
|
|
||
|
class ICECORE_API Pairs : private Container
|
||
|
{
|
||
|
public:
|
||
|
// Constructor / Destructor
|
||
|
Pairs() {}
|
||
|
~Pairs() {}
|
||
|
|
||
|
inline_ udword GetNbPairs() const { return GetNbEntries()>>1; }
|
||
|
inline_ const Pair* GetPairs() const { return (const Pair*)GetEntries(); }
|
||
|
inline_ const Pair* GetPair(udword i) const { return (const Pair*)&GetEntries()[i+i]; }
|
||
|
|
||
|
inline_ BOOL HasPairs() const { return IsNotEmpty(); }
|
||
|
|
||
|
inline_ void ResetPairs() { Reset(); }
|
||
|
inline_ void DeleteLastPair() { DeleteLastEntry(); DeleteLastEntry(); }
|
||
|
|
||
|
inline_ void AddPair(const Pair& p) { Add(p.id0).Add(p.id1); }
|
||
|
inline_ void AddPair(udword id0, udword id1) { Add(id0).Add(id1); }
|
||
|
};
|
||
|
|
||
|
#endif // __ICEPAIRS_H__
|