simSet.cpp 31 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137
  1. //-----------------------------------------------------------------------------
  2. // Copyright (c) 2012 GarageGames, LLC
  3. //
  4. // Permission is hereby granted, free of charge, to any person obtaining a copy
  5. // of this software and associated documentation files (the "Software"), to
  6. // deal in the Software without restriction, including without limitation the
  7. // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
  8. // sell copies of the Software, and to permit persons to whom the Software is
  9. // furnished to do so, subject to the following conditions:
  10. //
  11. // The above copyright notice and this permission notice shall be included in
  12. // all copies or substantial portions of the Software.
  13. //
  14. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  19. // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  20. // IN THE SOFTWARE.
  21. //-----------------------------------------------------------------------------
  22. #include "platform/platform.h"
  23. #include "console/simSet.h"
  24. #include "core/stringTable.h"
  25. #include "console/console.h"
  26. #include "console/engineAPI.h"
  27. #include "core/stream/fileStream.h"
  28. #include "sim/actionMap.h"
  29. #include "core/fileObject.h"
  30. #include "console/consoleInternal.h"
  31. #include "console/engineAPI.h"
  32. #include "platform/profiler.h"
  33. #include "console/typeValidators.h"
  34. #include "core/frameAllocator.h"
  35. #include "math/mMathFn.h"
  36. IMPLEMENT_CONOBJECT_CHILDREN( SimSet );
  37. IMPLEMENT_CONOBJECT( SimGroup );
  38. ConsoleDocClass( SimSet,
  39. "@brief A collection of SimObjects.\n\n"
  40. "It is often necessary to keep track of an arbitrary set of SimObjects. "
  41. "For instance, Torque's networking code needs to not only keep track of "
  42. "the set of objects which need to be ghosted, but also the set of objects "
  43. "which must <i>always</i> be ghosted. It does this by working with two "
  44. "sets. The first of these is the RootGroup (which is actually a SimGroup) "
  45. "and the second is the GhostAlwaysSet, which contains objects which must "
  46. "always be ghosted to the client.\n\n"
  47. "Some general notes on SimSets:\n\n"
  48. "- Membership is not exclusive. A SimObject may be a member of multiple "
  49. "SimSets.\n\n"
  50. "- A SimSet does not destroy subobjects when it is destroyed.\n\n"
  51. "- A SimSet may hold an arbitrary number of objects.\n\n"
  52. "@ingroup Console\n"
  53. "@ingroup Scripting"
  54. );
  55. ConsoleDocClass( SimGroup,
  56. "@brief A collection of SimObjects that are owned by the group.\n\n"
  57. "A SimGroup is a stricter form of SimSet. SimObjects may only be a member "
  58. "of a single SimGroup at a time. The SimGroup will automatically enforce "
  59. "the single-group-membership rule (ie. adding an object to a SimGroup will "
  60. "cause it to be removed from its current SimGroup, if any).\n\n"
  61. "Deleting a SimGroup will also delete all SimObjects in the SimGroup.\n\n"
  62. "@tsexample\n"
  63. "// Create a SimGroup for particle emitters\n"
  64. "new SimGroup(Emitters)\n"
  65. "{\n"
  66. " canSaveDynamicFields = \"1\";\n\n"
  67. " new ParticleEmitterNode(CrystalEmmiter) {\n"
  68. " active = \"1\";\n"
  69. " emitter = \"dustEmitter\";\n"
  70. " velocity = \"1\";\n"
  71. " dataBlock = \"GenericSmokeEmitterNode\";\n"
  72. " position = \"-61.6276 2.1142 4.45027\";\n"
  73. " rotation = \"1 0 0 0\";\n"
  74. " scale = \"1 1 1\";\n"
  75. " canSaveDynamicFields = \"1\";\n"
  76. " };\n\n"
  77. " new ParticleEmitterNode(Steam1) {\n"
  78. " active = \"1\";\n"
  79. " emitter = \"SlowSteamEmitter\";\n"
  80. " velocity = \"1\";\n"
  81. " dataBlock = \"GenericSmokeEmitterNode\";\n"
  82. " position = \"-25.0458 1.55289 2.51308\";\n"
  83. " rotation = \"1 0 0 0\";\n"
  84. " scale = \"1 1 1\";\n"
  85. " canSaveDynamicFields = \"1\";\n"
  86. " };\n"
  87. "};\n\n"
  88. "@endtsexample\n\n"
  89. "@ingroup Console\n"
  90. "@ingroup Scripting"
  91. );
  92. IMPLEMENT_CALLBACK( SimSet, onObjectAdded, void, ( SimObject* object ), ( object ),
  93. "Called when an object is added to the set.\n"
  94. "@param object The object that was added." );
  95. IMPLEMENT_CALLBACK( SimSet, onObjectRemoved, void, ( SimObject* object ), ( object ),
  96. "Called when an object is removed from the set.\n"
  97. "@param object The object that was removed." );
  98. //=============================================================================
  99. // SimSet.
  100. //=============================================================================
  101. // MARK: ---- SimSet ----
  102. //-----------------------------------------------------------------------------
  103. SimSet::SimSet()
  104. {
  105. VECTOR_SET_ASSOCIATION(mObjectList);
  106. mMutex = Mutex::createMutex();
  107. }
  108. //-----------------------------------------------------------------------------
  109. SimSet::~SimSet()
  110. {
  111. Mutex::destroyMutex( mMutex );
  112. }
  113. //-----------------------------------------------------------------------------
  114. void SimSet::addObject( SimObject* obj )
  115. {
  116. // Prevent SimSet being added to itself.
  117. if( obj == this )
  118. return;
  119. lock();
  120. const bool added = mObjectList.pushBack( obj );
  121. if( added )
  122. deleteNotify( obj );
  123. unlock();
  124. if( added )
  125. {
  126. getSetModificationSignal().trigger( SetObjectAdded, this, obj );
  127. if( obj->isProperlyAdded() )
  128. onObjectAdded_callback( obj );
  129. }
  130. }
  131. //-----------------------------------------------------------------------------
  132. void SimSet::removeObject( SimObject* obj )
  133. {
  134. lock();
  135. const bool removed = mObjectList.remove( obj );
  136. if( removed )
  137. clearNotify( obj );
  138. unlock();
  139. if( removed )
  140. {
  141. getSetModificationSignal().trigger( SetObjectRemoved, this, obj );
  142. if( obj->isProperlyAdded() )
  143. onObjectRemoved_callback( obj );
  144. }
  145. }
  146. //-----------------------------------------------------------------------------
  147. void SimSet::pushObject( SimObject* obj )
  148. {
  149. if( obj == this )
  150. return;
  151. lock();
  152. bool added = mObjectList.pushBackForce( obj );
  153. if( added )
  154. deleteNotify( obj );
  155. unlock();
  156. if( added )
  157. {
  158. getSetModificationSignal().trigger( SetObjectAdded, this, obj );
  159. if( obj->isProperlyAdded() )
  160. onObjectAdded_callback( obj );
  161. }
  162. }
  163. //-----------------------------------------------------------------------------
  164. void SimSet::popObject()
  165. {
  166. if(mObjectList.empty() )
  167. {
  168. AssertWarn(false, "Stack underflow in SimSet::popObject");
  169. return;
  170. }
  171. lock();
  172. SimObject* object = mObjectList.last();
  173. mObjectList.pop_back();
  174. clearNotify( object );
  175. unlock();
  176. getSetModificationSignal().trigger( SetObjectRemoved, this, object );
  177. if( object->isProperlyAdded() )
  178. onObjectRemoved_callback( object );
  179. }
  180. //-----------------------------------------------------------------------------
  181. void SimSet::scriptSort( const String &scriptCallbackFn )
  182. {
  183. lock();
  184. mObjectList.scriptSort( scriptCallbackFn );
  185. unlock();
  186. }
  187. //-----------------------------------------------------------------------------
  188. void SimSet::callOnChildren( const String &method, S32 argc, ConsoleValueRef argv[], bool executeOnChildGroups )
  189. {
  190. // Prep the arguments for the console exec...
  191. // Make sure and leave args[1] empty.
  192. ConsoleValueRef args[21] = { };
  193. ConsoleValue name_method;
  194. name_method.setStackStringValue(method.c_str());
  195. args[0] = ConsoleValueRef::fromValue(&name_method);
  196. for (S32 i = 0; i < argc; i++)
  197. args[i + 2] = argv[i];
  198. for( iterator i = begin(); i != end(); i++ )
  199. {
  200. SimObject *childObj = static_cast<SimObject*>(*i);
  201. if( childObj->isMethod( method.c_str() ) )
  202. Con::execute(childObj, argc + 2, args);
  203. if( executeOnChildGroups )
  204. {
  205. SimSet* childSet = dynamic_cast<SimSet*>(*i);
  206. if ( childSet )
  207. childSet->callOnChildren( method, argc, argv, executeOnChildGroups );
  208. }
  209. }
  210. }
  211. //-----------------------------------------------------------------------------
  212. U32 SimSet::sizeRecursive()
  213. {
  214. U32 count = 0;
  215. for ( iterator i = begin(); i != end(); i++ )
  216. {
  217. count++;
  218. SimSet* childSet = dynamic_cast<SimSet*>(*i);
  219. if ( childSet )
  220. count += childSet->sizeRecursive();
  221. }
  222. return count;
  223. }
  224. //-----------------------------------------------------------------------------
  225. bool SimSet::reOrder( SimObject *obj, SimObject *target )
  226. {
  227. MutexHandle handle;
  228. handle.lock(mMutex);
  229. iterator itrS, itrD;
  230. if ( (itrS = find(begin(),end(),obj)) == end() )
  231. {
  232. // object must be in list
  233. return false;
  234. }
  235. if ( obj == target )
  236. {
  237. // don't reorder same object but don't indicate error
  238. return true;
  239. }
  240. if ( !target )
  241. {
  242. // if no target, then put to back of list
  243. // don't move if already last object
  244. if ( itrS != (end()-1) )
  245. {
  246. // remove object from its current location and push to back of list
  247. mObjectList.erase(itrS);
  248. mObjectList.push_back(obj);
  249. }
  250. }
  251. else
  252. {
  253. // if target, insert object in front of target
  254. if ( (itrD = find(begin(),end(),target)) == end() )
  255. // target must be in list
  256. return false;
  257. mObjectList.erase(itrS);
  258. // once itrS has been erased, itrD won't be pointing at the
  259. // same place anymore - re-find...
  260. itrD = find(begin(),end(),target);
  261. mObjectList.insert(itrD, obj);
  262. }
  263. return true;
  264. }
  265. //-----------------------------------------------------------------------------
  266. void SimSet::onDeleteNotify(SimObject *object)
  267. {
  268. removeObject(object);
  269. Parent::onDeleteNotify(object);
  270. }
  271. //-----------------------------------------------------------------------------
  272. void SimSet::onRemove()
  273. {
  274. MutexHandle handle;
  275. handle.lock( mMutex );
  276. if( !mObjectList.empty() )
  277. {
  278. mObjectList.sortId();
  279. // This backwards iterator loop doesn't work if the
  280. // list is empty, check the size first.
  281. for( SimObjectList::iterator ptr = mObjectList.end() - 1;
  282. ptr >= mObjectList.begin(); ptr -- )
  283. clearNotify( *ptr );
  284. }
  285. handle.unlock();
  286. Parent::onRemove();
  287. }
  288. //-----------------------------------------------------------------------------
  289. void SimSet::write(Stream &stream, U32 tabStop, U32 flags)
  290. {
  291. MutexHandle handle;
  292. handle.lock(mMutex);
  293. // export selected only?
  294. if((flags & SelectedOnly) && !isSelected())
  295. {
  296. for(U32 i = 0; i < size(); i++)
  297. (*this)[i]->write(stream, tabStop, flags);
  298. return;
  299. }
  300. stream.writeTabs( tabStop );
  301. char buffer[ 2048 ];
  302. const U32 bufferWriteLen = dSprintf( buffer, sizeof( buffer ), "new %s(%s) {\r\n", getClassName(), getName() && !( flags & NoName ) ? getName() : "" );
  303. stream.write( bufferWriteLen, buffer );
  304. writeFields( stream, tabStop + 1 );
  305. if(size())
  306. {
  307. stream.write(2, "\r\n");
  308. for(U32 i = 0; i < size(); i++)
  309. {
  310. SimObject* child = ( *this )[ i ];
  311. if( child->getCanSave() )
  312. child->write(stream, tabStop + 1, flags);
  313. }
  314. }
  315. stream.writeTabs(tabStop);
  316. stream.write(4, "};\r\n");
  317. }
  318. //-----------------------------------------------------------------------------
  319. void SimSet::clear()
  320. {
  321. lock();
  322. while( !empty() )
  323. popObject();
  324. unlock();
  325. getSetModificationSignal().trigger( SetCleared, this, NULL );
  326. }
  327. //-----------------------------------------------------------------------------
  328. //UNSAFE
  329. void SimSet::deleteAllObjects()
  330. {
  331. lock();
  332. while( !empty() )
  333. {
  334. SimObject* object = mObjectList.last();
  335. mObjectList.pop_back();
  336. object->deleteObject();
  337. }
  338. unlock();
  339. }
  340. //-----------------------------------------------------------------------------
  341. SimObject* SimSet::findObject( SimObject* object )
  342. {
  343. bool found = false;
  344. lock();
  345. for( SimSet::iterator iter = begin(); iter != end(); ++ iter )
  346. if( *iter == object )
  347. {
  348. found = true;
  349. break;
  350. }
  351. unlock();
  352. if( found )
  353. return object;
  354. return NULL;
  355. }
  356. //-----------------------------------------------------------------------------
  357. SimObject* SimSet::findObject( const char *namePath )
  358. {
  359. // find the end of the object name
  360. S32 len;
  361. for(len = 0; namePath[len] != 0 && namePath[len] != '/'; len++)
  362. ;
  363. StringTableEntry stName = StringTable->lookupn(namePath, len);
  364. if(!stName)
  365. return NULL;
  366. lock();
  367. for(SimSet::iterator i = begin(); i != end(); i++)
  368. {
  369. if((*i)->getName() == stName)
  370. {
  371. unlock();
  372. if(namePath[len] == 0)
  373. return *i;
  374. return (*i)->findObject(namePath + len + 1);
  375. }
  376. }
  377. unlock();
  378. return NULL;
  379. }
  380. //-----------------------------------------------------------------------------
  381. SimObject* SimSet::findObjectByInternalName(StringTableEntry internalName, bool searchChildren)
  382. {
  383. iterator i;
  384. for (i = begin(); i != end(); i++)
  385. {
  386. SimObject *childObj = static_cast<SimObject*>(*i);
  387. if(childObj->getInternalName() == internalName)
  388. return childObj;
  389. else if (searchChildren)
  390. {
  391. SimSet* childSet = dynamic_cast<SimSet*>(*i);
  392. if (childSet)
  393. {
  394. SimObject* found = childSet->findObjectByInternalName(internalName, searchChildren);
  395. if (found) return found;
  396. }
  397. }
  398. }
  399. return NULL;
  400. }
  401. //-----------------------------------------------------------------------------
  402. SimObject* SimSet::findObjectByLineNumber(const char* fileName, S32 declarationLine, bool searchChildren)
  403. {
  404. if (!fileName)
  405. return NULL;
  406. if (declarationLine < 0)
  407. return NULL;
  408. StringTableEntry fileEntry = StringTable->insert(fileName);
  409. for (iterator i = begin(); i != end(); i++)
  410. {
  411. SimObject *childObj = static_cast<SimObject*>(*i);
  412. if(childObj->getFilename() == fileEntry && childObj->getDeclarationLine() == declarationLine)
  413. return childObj;
  414. else if (searchChildren)
  415. {
  416. SimSet* childSet = dynamic_cast<SimSet*>(*i);
  417. if (childSet)
  418. {
  419. SimObject* found = childSet->findObjectByLineNumber(fileName, declarationLine, searchChildren);
  420. if (found)
  421. return found;
  422. }
  423. }
  424. }
  425. return NULL;
  426. }
  427. //-----------------------------------------------------------------------------
  428. SimObject* SimSet::getRandom()
  429. {
  430. if (size() > 0)
  431. return mObjectList[mRandI(0, size() - 1)];
  432. return NULL;
  433. }
  434. //-----------------------------------------------------------------------------
  435. SimSet* SimSet::clone()
  436. {
  437. // Clone the set object.
  438. SimObject* object = Parent::clone();
  439. SimSet* set = dynamic_cast< SimSet* >( object );
  440. if( !set )
  441. {
  442. object->deleteObject();
  443. return NULL;
  444. }
  445. // Add all object in the set.
  446. for( iterator iter = begin(); iter != end(); ++ iter )
  447. set->addObject( *iter );
  448. return set;
  449. }
  450. //-----------------------------------------------------------------------------
  451. inline void SimSetIterator::Stack::push_back(SimSet* set)
  452. {
  453. increment();
  454. last().set = set;
  455. last().itr = set->begin();
  456. }
  457. //-----------------------------------------------------------------------------
  458. SimSetIterator::SimSetIterator(SimSet* set)
  459. {
  460. VECTOR_SET_ASSOCIATION(stack);
  461. if (!set->empty())
  462. stack.push_back(set);
  463. }
  464. //-----------------------------------------------------------------------------
  465. SimObject* SimSetIterator::operator++()
  466. {
  467. SimSet* set;
  468. if ((set = dynamic_cast<SimSet*>(*stack.last().itr)) != 0)
  469. {
  470. if (!set->empty())
  471. {
  472. stack.push_back(set);
  473. return *stack.last().itr;
  474. }
  475. }
  476. while (++stack.last().itr == stack.last().set->end())
  477. {
  478. stack.pop_back();
  479. if (stack.empty())
  480. return 0;
  481. }
  482. return *stack.last().itr;
  483. }
  484. //=============================================================================
  485. // SimGroup.
  486. //=============================================================================
  487. // MARK: ---- SimGroup ----
  488. //-----------------------------------------------------------------------------
  489. SimGroup::~SimGroup()
  490. {
  491. for( iterator itr = begin(); itr != end(); itr ++ )
  492. mNameDictionary.remove(*itr);
  493. }
  494. //-----------------------------------------------------------------------------
  495. void SimGroup::_addObject( SimObject* obj, bool forcePushBack )
  496. {
  497. // Make sure we aren't adding ourself. This isn't the most robust check
  498. // but it should be good enough to prevent some self-foot-shooting.
  499. if( obj == this )
  500. {
  501. Con::errorf( "SimGroup::addObject - (%d) can't add self!", getIdString() );
  502. return;
  503. }
  504. if( obj->getGroup() == this )
  505. return;
  506. lock();
  507. obj->incRefCount();
  508. if( obj->getGroup() )
  509. obj->getGroup()->removeObject( obj );
  510. if( forcePushBack ? mObjectList.pushBack( obj ) : mObjectList.pushBackForce( obj ) )
  511. {
  512. mNameDictionary.insert( obj );
  513. obj->mGroup = this;
  514. obj->onGroupAdd();
  515. getSetModificationSignal().trigger( SetObjectAdded, this, obj );
  516. if( obj->isProperlyAdded() )
  517. onObjectAdded_callback( obj );
  518. }
  519. else
  520. obj->decRefCount();
  521. unlock();
  522. // SimObjects will automatically remove them from their group
  523. // when deleted so we don't hook up a delete notification.
  524. }
  525. //-----------------------------------------------------------------------------
  526. void SimGroup::addObject( SimObject* obj )
  527. {
  528. _addObject( obj );
  529. }
  530. //-----------------------------------------------------------------------------
  531. void SimGroup::removeObject( SimObject* obj )
  532. {
  533. lock();
  534. _removeObjectNoLock( obj );
  535. unlock();
  536. }
  537. //-----------------------------------------------------------------------------
  538. void SimGroup::_removeObjectNoLock( SimObject* obj )
  539. {
  540. if( obj->mGroup == this )
  541. {
  542. obj->onGroupRemove();
  543. mNameDictionary.remove( obj );
  544. mObjectList.remove( obj );
  545. obj->mGroup = 0;
  546. getSetModificationSignal().trigger( SetObjectRemoved, this, obj );
  547. if( obj->isProperlyAdded() )
  548. onObjectRemoved_callback( obj );
  549. obj->decRefCount();
  550. }
  551. }
  552. //-----------------------------------------------------------------------------
  553. void SimGroup::pushObject( SimObject* object )
  554. {
  555. _addObject( object, true );
  556. }
  557. //-----------------------------------------------------------------------------
  558. void SimGroup::popObject()
  559. {
  560. MutexHandle handle;
  561. handle.lock( mMutex );
  562. if(mObjectList.empty() )
  563. {
  564. AssertWarn( false, "SimGroup::popObject - Stack underflow" );
  565. return;
  566. }
  567. SimObject* object = mObjectList.last();
  568. mObjectList.pop_back();
  569. object->onGroupRemove();
  570. object->mGroup = NULL;
  571. clearNotify( object );
  572. mNameDictionary.remove( object );
  573. getSetModificationSignal().trigger( SetObjectAdded, this, object );
  574. if( object->isProperlyAdded() )
  575. onObjectRemoved_callback( object );
  576. object->decRefCount();
  577. }
  578. //-----------------------------------------------------------------------------
  579. void SimGroup::onRemove()
  580. {
  581. lock();
  582. if( !mObjectList.empty() )
  583. {
  584. mObjectList.sortId();
  585. clear();
  586. }
  587. SimObject::onRemove();
  588. unlock();
  589. }
  590. //-----------------------------------------------------------------------------
  591. void SimGroup::clear()
  592. {
  593. lock();
  594. while( size() > 0 )
  595. {
  596. SimObject* object = mObjectList.last();
  597. object->onGroupRemove();
  598. mObjectList.pop_back();
  599. mNameDictionary.remove( object );
  600. object->mGroup = 0;
  601. getSetModificationSignal().trigger( SetObjectRemoved, this, object );
  602. if( object->isProperlyAdded() )
  603. onObjectRemoved_callback( object );
  604. if( engineAPI::gUseConsoleInterop )
  605. object->deleteObject();
  606. else
  607. object->decRefCount();
  608. }
  609. unlock();
  610. getSetModificationSignal().trigger( SetCleared, this, NULL );
  611. }
  612. //-----------------------------------------------------------------------------
  613. SimObject *SimGroup::findObject(const char *namePath)
  614. {
  615. // find the end of the object name
  616. S32 len;
  617. for(len = 0; namePath[len] != 0 && namePath[len] != '/'; len++)
  618. ;
  619. StringTableEntry stName = StringTable->lookupn(namePath, len);
  620. if(!stName)
  621. return NULL;
  622. SimObject *root = mNameDictionary.find( stName );
  623. if( !root )
  624. return NULL;
  625. if(namePath[len] == 0)
  626. return root;
  627. return root->findObject(namePath + len + 1);
  628. }
  629. //-----------------------------------------------------------------------------
  630. SimGroup* SimGroup::clone()
  631. {
  632. // Skip SimSet::clone since we do not want to steal the child objects
  633. // from this group.
  634. SimObject* object = SimObject::clone();
  635. SimGroup* group = dynamic_cast< SimGroup* >( object );
  636. if( !group )
  637. {
  638. object->deleteObject();
  639. return NULL;
  640. }
  641. return group;
  642. }
  643. //-----------------------------------------------------------------------------
  644. SimGroup* SimGroup::deepClone()
  645. {
  646. // Clone the group object.
  647. SimObject* object = Parent::deepClone();
  648. SimGroup* group = dynamic_cast< SimGroup* >( object );
  649. if( !group )
  650. {
  651. object->deleteObject();
  652. return NULL;
  653. }
  654. // Clone all child objects.
  655. for( iterator iter = begin(); iter != end(); ++ iter )
  656. group->addObject( ( *iter )->deepClone() );
  657. return group;
  658. }
  659. //-----------------------------------------------------------------------------
  660. bool SimGroup::processArguments(S32, ConsoleValueRef *argv)
  661. {
  662. return true;
  663. }
  664. SimObject* SimGroup::getObject(const S32& index)
  665. {
  666. if (index < 0 || index >= size())
  667. {
  668. Con::errorf("Set::getObject - index out of range.");
  669. return NULL;
  670. }
  671. return (*this)[index];
  672. }
  673. //-----------------------------------------------------------------------------
  674. SimObject* SimGroupIterator::operator++()
  675. {
  676. SimGroup* set;
  677. if ((set = dynamic_cast<SimGroup*>(*stack.last().itr)) != 0)
  678. {
  679. if (!set->empty())
  680. {
  681. stack.push_back(set);
  682. return *stack.last().itr;
  683. }
  684. }
  685. while (++stack.last().itr == stack.last().set->end())
  686. {
  687. stack.pop_back();
  688. if (stack.empty())
  689. return 0;
  690. }
  691. return *stack.last().itr;
  692. }
  693. //=============================================================================
  694. // API.
  695. //=============================================================================
  696. // MARK: ---- API ----
  697. //-----------------------------------------------------------------------------
  698. DefineEngineMethod( SimSet, listObjects, void, (),,
  699. "Dump a list of all objects contained in the set to the console." )
  700. {
  701. object->lock();
  702. SimSet::iterator itr;
  703. for(itr = object->begin(); itr != object->end(); itr++)
  704. {
  705. SimObject *obj = *itr;
  706. bool isSet = dynamic_cast<SimSet *>(obj) != 0;
  707. const char *name = obj->getName();
  708. if(name)
  709. Con::printf(" %d,\"%s\": %s %s", obj->getId(), name,
  710. obj->getClassName(), isSet ? "(g)":"");
  711. else
  712. Con::printf(" %d: %s %s", obj->getId(), obj->getClassName(),
  713. isSet ? "(g)" : "");
  714. }
  715. object->unlock();
  716. }
  717. //-----------------------------------------------------------------------------
  718. DefineEngineStringlyVariadicMethod( SimSet, add, void, 3, 0,
  719. "( SimObject objects... ) Add the given objects to the set.\n"
  720. "@param objects The objects to add to the set." )
  721. {
  722. for(S32 i = 2; i < argc; i++)
  723. {
  724. SimObject *obj = Sim::findObject( argv[ i ] );
  725. if(obj)
  726. object->addObject( obj );
  727. else
  728. Con::printf("Set::add: Object \"%s\" doesn't exist to add to %s", (const char*)argv[ i ], object->getName() );
  729. }
  730. }
  731. //-----------------------------------------------------------------------------
  732. DefineEngineStringlyVariadicMethod( SimSet, remove, void, 3, 0,
  733. "( SimObject objects... ) Remove the given objects from the set.\n"
  734. "@param objects The objects to remove from the set." )
  735. {
  736. for(S32 i = 2; i < argc; i++)
  737. {
  738. SimObject *obj = Sim::findObject(argv[i]);
  739. object->lock();
  740. if(obj && object->find(object->begin(),object->end(),obj) != object->end())
  741. object->removeObject(obj);
  742. else
  743. Con::printf("Set::remove: Object \"%s\" does not exist in set %s", (const char*)argv[i], object->getName());
  744. object->unlock();
  745. }
  746. }
  747. //-----------------------------------------------------------------------------
  748. DefineEngineMethod( SimSet, clear, void, (),,
  749. "Remove all objects from the set." )
  750. {
  751. object->clear();
  752. }
  753. //-----------------------------------------------------------------------------
  754. //UNSAFE; don't want this in the new API
  755. DefineEngineMethod( SimSet, deleteAllObjects, void, (), , "() Delete all objects in the set." )
  756. {
  757. object->deleteAllObjects();
  758. }
  759. //-----------------------------------------------------------------------------
  760. DefineEngineMethod( SimSet, getRandom, SimObject*, (),,
  761. "Return a random object from the set.\n"
  762. "@return A randomly selected object from the set or -1 if the set is empty." )
  763. {
  764. return object->getRandom();
  765. }
  766. //-----------------------------------------------------------------------------
  767. DefineEngineStringlyVariadicMethod( SimSet, callOnChildren, void, 3, 0,
  768. "( string method, string args... ) Call a method on all objects contained in the set.\n\n"
  769. "@param method The name of the method to call.\n"
  770. "@param args The arguments to the method.\n\n"
  771. "@note This method recurses into all SimSets that are children to the set.\n\n"
  772. "@see callOnChildrenNoRecurse" )
  773. {
  774. object->callOnChildren( (const char*)argv[2], argc - 3, argv + 3 );
  775. }
  776. //-----------------------------------------------------------------------------
  777. DefineEngineStringlyVariadicMethod( SimSet, callOnChildrenNoRecurse, void, 3, 0,
  778. "( string method, string args... ) Call a method on all objects contained in the set.\n\n"
  779. "@param method The name of the method to call.\n"
  780. "@param args The arguments to the method.\n\n"
  781. "@note This method does not recurse into child SimSets.\n\n"
  782. "@see callOnChildren" )
  783. {
  784. object->callOnChildren( (const char*)argv[2], argc - 3, argv + 3, false );
  785. }
  786. //-----------------------------------------------------------------------------
  787. DefineEngineMethod( SimSet, reorderChild, void, ( SimObject* child1, SimObject* child2 ),,
  788. "Make sure child1 is ordered right before child2 in the set.\n"
  789. "@param child1 The first child. The object must already be contained in the set.\n"
  790. "@param child2 The second child. The object must already be contained in the set." )
  791. {
  792. SimObject* pObject = child1;
  793. SimObject* pTarget = child2;
  794. if(pObject && pTarget)
  795. {
  796. object->reOrder(pObject,pTarget);
  797. }
  798. }
  799. //-----------------------------------------------------------------------------
  800. DefineEngineMethod( SimSet, getCount, S32, (),,
  801. "Get the number of objects contained in the set.\n"
  802. "@return The number of objects contained in the set." )
  803. {
  804. return object->size();
  805. }
  806. //-----------------------------------------------------------------------------
  807. DEFINE_CALLIN( fnSimSet_getCountRecursive, getCountRecursive, SimSet, U32, ( SimSet* set ),,,
  808. "Get the number of direct and indirect child objects contained in the set.\n"
  809. "@return The number of objects contained in the set as well as in other sets contained directly or indirectly in the set." )
  810. {
  811. return set->sizeRecursive();
  812. }
  813. DefineEngineMethod( SimSet, getFullCount, S32, (), , "() Get the number of direct and indirect child objects contained in the set.\n"
  814. "@return The number of objects contained in the set as well as in other sets contained directly or indirectly in the set." )
  815. {
  816. return object->sizeRecursive();
  817. }
  818. //-----------------------------------------------------------------------------
  819. DefineEngineMethod( SimSet, getObject, SimObject*, ( U32 index ),,
  820. "Get the object at the given index.\n"
  821. "@param index The object index.\n"
  822. "@return The object at the given index or -1 if index is out of range." )
  823. {
  824. if( index < 0 || index >= object->size() )
  825. {
  826. Con::errorf( "Set::getObject - index out of range." );
  827. return NULL;
  828. }
  829. return ( *object )[ index ];
  830. }
  831. //-----------------------------------------------------------------------------
  832. DefineEngineMethod( SimSet, getObjectIndex, S32, ( SimObject* obj ),,
  833. "Return the index of the given object in this set.\n"
  834. "@param obj The object for which to return the index. Must be contained in the set.\n"
  835. "@return The index of the object or -1 if the object is not contained in the set." )
  836. {
  837. if( !obj )
  838. return -1;
  839. object->lock();
  840. S32 count = 0;
  841. for( SimSet::iterator i = object->begin(); i != object->end(); i++)
  842. {
  843. if( *i == obj )
  844. {
  845. object->unlock();
  846. return count;
  847. }
  848. ++count;
  849. }
  850. object->unlock();
  851. return -1;
  852. }
  853. //-----------------------------------------------------------------------------
  854. DefineEngineMethod( SimSet, isMember, bool, ( SimObject* obj ),,
  855. "Test whether the given object belongs to the set.\n"
  856. "@param obj The object.\n"
  857. "@return True if the object is contained in the set; false otherwise." )
  858. {
  859. if( !obj )
  860. return false;
  861. return ( object->find( object->begin(), object->end(), obj ) != object->end() );
  862. }
  863. //-----------------------------------------------------------------------------
  864. DefineEngineMethod( SimSet, findObjectByInternalName, SimObject*, ( const char* internalName, bool searchChildren ), ( false ),
  865. "Find an object in the set by its internal name.\n"
  866. "@param internalName The internal name of the object to look for.\n"
  867. "@param searchChildren If true, SimSets contained in the set will be recursively searched for the object.\n"
  868. "@return The object with the given internal name or 0 if no match was found.\n" )
  869. {
  870. StringTableEntry pcName = StringTable->insert( internalName );
  871. return object->findObjectByInternalName( pcName, searchChildren );
  872. }
  873. //-----------------------------------------------------------------------------
  874. DefineEngineMethod( SimSet, bringToFront, void, ( SimObject* obj ),,
  875. "Make the given object the first object in the set.\n"
  876. "@param obj The object to bring to the frontmost position. Must be contained in the set." )
  877. {
  878. if( obj )
  879. object->bringObjectToFront( obj );
  880. }
  881. //-----------------------------------------------------------------------------
  882. DefineEngineMethod( SimSet, pushToBack, void, ( SimObject* obj ),,
  883. "Make the given object the last object in the set.\n"
  884. "@param obj The object to bring to the last position. Must be contained in the set." )
  885. {
  886. if( obj )
  887. object->pushObjectToBack( obj );
  888. }
  889. //-----------------------------------------------------------------------------
  890. DefineEngineMethod( SimSet, sort, void, ( const char * callbackFunction ), , "( string callbackFunction ) Sort the objects in the set using the given comparison function.\n"
  891. "@param callbackFunction Name of a function that takes two object arguments A and B and returns -1 if A is less, 1 if B is less, and 0 if both are equal." )
  892. {
  893. object->scriptSort( callbackFunction );
  894. }
  895. //-----------------------------------------------------------------------------
  896. DefineEngineMethod( SimSet, acceptsAsChild, bool, ( SimObject* obj ),,
  897. "Test whether the given object may be added to the set.\n"
  898. "@param obj The object to test for potential membership.\n"
  899. "@return True if the object may be added to the set, false otherwise." )
  900. {
  901. if( !obj )
  902. return false;
  903. return object->acceptsAsChild( obj );
  904. }