mirror of
https://github.com/TorqueGameEngines/Torque3D.git
synced 2026-01-20 12:44:46 +00:00
131 lines
3.5 KiB
C++
131 lines
3.5 KiB
C++
|
|
//-----------------------------------------------------------------------------
|
||
|
|
// Copyright (c) 2012 GarageGames, LLC
|
||
|
|
//
|
||
|
|
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
||
|
|
// of this software and associated documentation files (the "Software"), to
|
||
|
|
// deal in the Software without restriction, including without limitation the
|
||
|
|
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
||
|
|
// sell copies of the Software, and to permit persons to whom the Software is
|
||
|
|
// furnished to do so, subject to the following conditions:
|
||
|
|
//
|
||
|
|
// The above copyright notice and this permission notice shall be included in
|
||
|
|
// all copies or substantial portions of the Software.
|
||
|
|
//
|
||
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||
|
|
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||
|
|
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||
|
|
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||
|
|
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
||
|
|
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
||
|
|
// IN THE SOFTWARE.
|
||
|
|
//-----------------------------------------------------------------------------
|
||
|
|
|
||
|
|
#include "platform/platform.h"
|
||
|
|
#include "console/simObjectList.h"
|
||
|
|
|
||
|
|
#include "console/console.h"
|
||
|
|
#include "console/sim.h"
|
||
|
|
#include "console/simObject.h"
|
||
|
|
|
||
|
|
|
||
|
|
String SimObjectList::smSortScriptCallbackFn;
|
||
|
|
|
||
|
|
bool SimObjectList::pushBack(SimObject* obj)
|
||
|
|
{
|
||
|
|
if (find(begin(),end(),obj) == end())
|
||
|
|
{
|
||
|
|
push_back(obj);
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool SimObjectList::pushBackForce(SimObject* obj)
|
||
|
|
{
|
||
|
|
iterator itr = find(begin(),end(),obj);
|
||
|
|
if (itr == end())
|
||
|
|
{
|
||
|
|
push_back(obj);
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
else
|
||
|
|
{
|
||
|
|
// Move to the back...
|
||
|
|
//
|
||
|
|
SimObject* pBack = *itr;
|
||
|
|
removeStable(pBack);
|
||
|
|
push_back(pBack);
|
||
|
|
}
|
||
|
|
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool SimObjectList::pushFront(SimObject* obj)
|
||
|
|
{
|
||
|
|
if (find(begin(),end(),obj) == end())
|
||
|
|
{
|
||
|
|
push_front(obj);
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool SimObjectList::remove(SimObject* obj)
|
||
|
|
{
|
||
|
|
iterator ptr = find(begin(),end(),obj);
|
||
|
|
if (ptr != end())
|
||
|
|
{
|
||
|
|
erase(ptr);
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool SimObjectList::removeStable(SimObject* obj)
|
||
|
|
{
|
||
|
|
iterator ptr = find(begin(),end(),obj);
|
||
|
|
if (ptr != end())
|
||
|
|
{
|
||
|
|
erase(ptr);
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
S32 QSORT_CALLBACK SimObjectList::_compareId(const void* a,const void* b)
|
||
|
|
{
|
||
|
|
return (*reinterpret_cast<const SimObject* const*>(a))->getId() -
|
||
|
|
(*reinterpret_cast<const SimObject* const*>(b))->getId();
|
||
|
|
}
|
||
|
|
|
||
|
|
void SimObjectList::sortId()
|
||
|
|
{
|
||
|
|
dQsort(address(),size(),sizeof(value_type),_compareId);
|
||
|
|
}
|
||
|
|
|
||
|
|
S32 QSORT_CALLBACK SimObjectList::_callbackSort( const void *a, const void *b )
|
||
|
|
{
|
||
|
|
const SimObject *objA = *reinterpret_cast<const SimObject* const*>( a );
|
||
|
|
const SimObject *objB = *reinterpret_cast<const SimObject* const*>( b );
|
||
|
|
|
||
|
|
static char idA[64];
|
||
|
|
dSprintf( idA, sizeof( idA ), "%d", objA->getId() );
|
||
|
|
static char idB[64];
|
||
|
|
dSprintf( idB, sizeof( idB ), "%d", objB->getId() );
|
||
|
|
|
||
|
|
return dAtoi( Con::executef( smSortScriptCallbackFn, idA, idB ) );
|
||
|
|
}
|
||
|
|
|
||
|
|
void SimObjectList::scriptSort( const String &scriptCallback )
|
||
|
|
{
|
||
|
|
AssertFatal( smSortScriptCallbackFn.isEmpty(), "SimObjectList::scriptSort() - The script sort is not reentrant!" );
|
||
|
|
|
||
|
|
smSortScriptCallbackFn = scriptCallback;
|
||
|
|
dQsort( address(), size(), sizeof(value_type), _callbackSort );
|
||
|
|
smSortScriptCallbackFn = String::EmptyString;
|
||
|
|
}
|