Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: code/trunk/src/core/ObjectListBase.cc @ 3003

Last change on this file since 3003 was 2784, checked in by rgrieder, 16 years ago
  • Using std::vector instead of std::list in register/unregister Iterator/ObjectListIterator. That is approximately 6 times faster because the list has very few elements.
  • Inlined getIdentifier() for sure by exporting the heavy part to another function.
  • Also eliminated the need of isFirstCall() because the "static initialisation chaos" only applies to variables that cannot be evaluated at compile time.
  • Property svn:eol-style set to native
File size: 3.3 KB
Line 
1/*
2 *   ORXONOX - the hottest 3D action shooter ever to exist
3 *                    > www.orxonox.net <
4 *
5 *
6 *   License notice:
7 *
8 *   This program is free software; you can redistribute it and/or
9 *   modify it under the terms of the GNU General Public License
10 *   as published by the Free Software Foundation; either version 2
11 *   of the License, or (at your option) any later version.
12 *
13 *   This program is distributed in the hope that it will be useful,
14 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
15 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
16 *   GNU General Public License for more details.
17 *
18 *   You should have received a copy of the GNU General Public License
19 *   along with this program; if not, write to the Free Software
20 *   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
21 *
22 *   Author:
23 *      Fabian 'x3n' Landau
24 *   Co-authors:
25 *      ...
26 *
27 */
28
29/**
30    @file
31    @brief Implementation of the ObjectListBase class.
32
33    The ObjectListBase is a double-linked list, used by Identifiers to store all objects of a given class.
34    Newly created objects are added through the RegisterObject-macro in its constructor.
35*/
36
37#include <set>
38
39#include "CorePrereqs.h"
40
41#include "ObjectListBase.h"
42#include "Identifier.h"
43#include "Iterator.h"
44
45namespace orxonox
46{
47    /**
48        @brief Constructor: Sets default values.
49    */
50    ObjectListBase::ObjectListBase(Identifier* identifier)
51    {
52        this->identifier_ = identifier;
53        this->first_ = 0;
54        this->last_ = 0;
55    }
56
57    /**
58        @brief Destructor: Deletes all list-elements, but NOT THE OBJECTS.
59    */
60    ObjectListBase::~ObjectListBase()
61    {
62        ObjectListBaseElement* temp;
63        while (this->first_)
64        {
65            temp = this->first_->next_;
66            delete this->first_;
67            this->first_ = temp;
68        }
69    }
70
71    /**
72        @brief Increases all Iterators that currently point on the given element (because it gets removed).
73        @param element The element that gets removed
74    */
75    void ObjectListBase::notifyIterators(OrxonoxClass* object) const
76    {
77        for (std::vector<void*>::const_iterator it = this->iterators_.begin(); it != this->iterators_.end(); ++it)
78            ((Iterator<OrxonoxClass>*)(*it))->incrementIfEqual(object);
79        for (std::vector<void*>::const_iterator it = this->objectListIterators_.begin(); it != this->objectListIterators_.end(); ++it)
80            ((ObjectListIterator<OrxonoxClass>*)(*it))->incrementIfEqual(object);
81    }
82
83    /**
84        @brief Adds a new object to the end of the list.
85        @param object The object to add
86        @return The pointer to the new ObjectListBaseElement, needed by the MetaObjectList of the added object
87    */
88    ObjectListBaseElement* ObjectListBase::add(ObjectListBaseElement* element)
89    {
90        if (!this->last_)
91        {
92            // If the list is empty
93            this->last_ = element;
94            this->first_ = this->last_; // There's only one object in the list now
95        }
96        else
97        {
98            // If the list isn't empty
99            ObjectListBaseElement* temp = this->last_;
100            this->last_ = element;
101            this->last_->prev_ = temp;
102            temp->next_ = this->last_;
103        }
104
105        return this->last_;
106    }
107}
Note: See TracBrowser for help on using the repository browser.