Opcode::SAP_PairData Class Reference

#include <Opcode.h>

Public Member Functions
	SAP_PairData ()
	~SAP_PairData ()
bool	Init (udword nb_objects)
void	AddPair (udword id1, udword id2)
void	RemovePair (udword id1, udword id2)
void	DumpPairs (Pairs &pairs) const
void	DumpPairs (PairCallback callback, void *user_data) const

Detailed Description

Definition at line 39 of file Opcode.h.

Constructor & Destructor Documentation

SAP_PairData::SAP_PairData

(

)

Constructor.

Definition at line 109 of file OPC_SweepAndPrune.cpp.

                           :
    mNbElements     (0),
    mNbUsedElements (0),
    mElementPool    (null),
    mFirstFree      (null),
    mNbObjects      (0),
    mArray          (null)
{
}

SAP_PairData::~SAP_PairData

(

)

Destructor.

Definition at line 124 of file OPC_SweepAndPrune.cpp.

{
    Release();
}

Member Function Documentation

void SAP_PairData::AddPair	(	udword	id1,
		udword	id2
	)

Definition at line 242 of file OPC_SweepAndPrune.cpp.

References Delta(), Opcode::SAP_Element::mID, Opcode::SAP_Element::mNext, null, OPASSERT, Remap(), and Sort().

Referenced by Opcode::SweepAndPrune::Init(), and Opcode::SweepAndPrune::UpdateObject().

{
    // Order the ids
    Sort(id1, id2);

    OPASSERT(id1<mNbObjects);
    if(id1>=mNbObjects) return;

    // Select the right list from "mArray".
    SAP_Element* Current = mArray[id1];

    if(!Current)
    {
        // Empty slot => create new element
        mArray[id1] = GetFreeElem(id2, null);
    }
    else if(Current->mID>id2)
    {
        // The list is not empty but all elements are greater than id2 => insert id2 in the front.
        mArray[id1] = GetFreeElem(id2, mArray[id1]);
    }
    else
    {
        // Else find the correct location in the sorted list (ascending order) and insert id2 there.
        while(Current->mNext)
        {
            if(Current->mNext->mID > id2)   break;

            Current = Current->mNext;
        }

        if(Current->mID==id2)   return; // The pair already exists
        
//      Current->mNext = GetFreeElem(id2, Current->mNext);
        udword Delta;
        SAP_Element* E = GetFreeElem(id2, Current->mNext, &Delta);
        if(Delta)   Remap(Current, Delta);
        Current->mNext = E;
    }
}

void SAP_PairData::DumpPairs

(

Pairs &

pairs)

const

Definition at line 325 of file OPC_SweepAndPrune.cpp.

References Pairs::AddPair(), Opcode::SAP_Element::mID, Opcode::SAP_Element::mNext, and OPASSERT.

Referenced by Opcode::SweepAndPrune::GetPairs().

{
    // ### Ugly and slow
    for(udword i=0;i<mNbObjects;i++)
    {
        SAP_Element* Current = mArray[i];
        while(Current)
        {
            OPASSERT(Current->mID<mNbObjects);

            pairs.AddPair(i, Current->mID);
            Current = Current->mNext;
        }
    }
}

void SAP_PairData::DumpPairs	(	PairCallback	callback,
		void *	user_data
	)		const

Definition at line 341 of file OPC_SweepAndPrune.cpp.

References Opcode::SAP_Element::mID, Opcode::SAP_Element::mNext, and OPASSERT.

{
    if(!callback)   return;

    // ### Ugly and slow
    for(udword i=0;i<mNbObjects;i++)
    {
        SAP_Element* Current = mArray[i];
        while(Current)
        {
            OPASSERT(Current->mID<mNbObjects);

            if(!(callback)(i, Current->mID, user_data)) return;
            Current = Current->mNext;
        }
    }
}

bool SAP_PairData::Init

(

udword

nb_objects)

Initializes.

Parameters

nb_objects

[in]

Returns

true if success

Definition at line 145 of file OPC_SweepAndPrune.cpp.

Referenced by Opcode::SweepAndPrune::Init().

{
    // Make sure everything has been released
    Release();
    if(!nb_objects) return false;

    mArray = new SAP_Element*[nb_objects];
    CHECKALLOC(mArray);
    ZeroMemory(mArray, nb_objects*sizeof(SAP_Element*));
    mNbObjects = nb_objects;

    return true;
}

void SAP_PairData::RemovePair	(	udword	id1,
		udword	id2
	)

Definition at line 284 of file OPC_SweepAndPrune.cpp.

References Opcode::SAP_Element::mID, Opcode::SAP_Element::mNext, and Sort().

Referenced by Opcode::SweepAndPrune::UpdateObject().

{
    // Order the ids.
    Sort(id1, id2);

    // Exit if the pair doesn't exist in the set
    if(id1>=mNbObjects) return;

    // Otherwise, select the correct list.
    SAP_Element* Current = mArray[id1];

    // If this list is empty, the pair doesn't exist.
    if(!Current) return;

    // Otherwise, if id2 is the first element, delete it.
    if(Current->mID==id2)
    {
        mArray[id1] = Current->mNext;
        FreeElem(Current);
    }
    else
    {
        // If id2 is not the first element, start traversing the sorted list.
        while(Current->mNext)
        {
            // If we have moved too far away without hitting id2, then the pair doesn't exist
            if(Current->mNext->mID > id2)   return;

            // Otherwise, delete id2.
            if(Current->mNext->mID == id2)
            {
                SAP_Element* Temp = Current->mNext;
                Current->mNext = Temp->mNext;
                FreeElem(Temp);
                return;
            }
            Current = Current->mNext;
        }
    }
}

---

The documentation for this class was generated from the following files:

• src/cmd/collide2/OPC_SweepAndPrune.h
• src/cmd/collide2/OPC_SweepAndPrune.cpp