Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: code/branches/ipv6/src/orxonox/pickup/PickupIdentifier.cc @ 7389

Last change on this file since 7389 was 7163, checked in by dafrick, 14 years ago

Merged presentation3 branch into trunk.

  • Property svn:eol-style set to native
File size: 5.4 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 *      Damian 'Mozork' Frick
24 *   Co-authors:
25 *      ...
26 *
27 */
28
29/**
30    @file PickupIdentifier.cc
31    @brief Implementation of the PickupIdentifier class.
32*/
33
34#include "PickupIdentifier.h"
35
36#include "core/CoreIncludes.h"
37#include "interfaces/Pickupable.h"
38
39namespace orxonox
40{
41
42    /**
43    @brief
44        Constructor. Registers the object and initializes member variables.
45    */
46    PickupIdentifier::PickupIdentifier(Pickupable* pickup)
47    {
48        RegisterRootObject(PickupIdentifier);
49
50        if(pickup == NULL)
51            COUT(1) << "Error, PickupIdentifier was created without a valid Pickupable." << std::endl;
52
53        this->pickup_ = pickup;
54    }
55
56    PickupIdentifier::~PickupIdentifier()
57    {
58
59    }
60
61    /**
62    @brief
63        Compares two PickupIdentifiers and returns 0 if a == b, <0 if a < b and >0 if a > b for a.compare(b).
64    @param identifier
65        Pointer to the second PickupIdentifier, b.
66    @return
67        Returns an integer. 0 if the two compared PickupIdentifiers are the same, <0 if a < b and >0 if a > b.
68    */
69    int PickupIdentifier::compare(const PickupIdentifier* identifier) const
70    {
71        if(identifier == NULL)
72        {
73            return 1;
74            COUT(1) << "Error in PickupIdentifier::compare: Input Identifier is NULL." << std::endl;
75        }
76
77        if(identifier->pickup_ == NULL && this->pickup_ == NULL)
78        {
79            return 0;
80            COUT(1) << "Error in PickupIdentifier::compare: Pickup stored by Identifier is NULL." << std::endl;
81        }
82
83        if(identifier->pickup_ == NULL)
84        {
85            return 1;
86            COUT(1) << "Error in PickupIdentifier::compare: Pickup stored by Identifier is NULL." << std::endl;
87        }
88
89        if(this->pickup_ == NULL)
90        {
91            return -1;
92            COUT(1) << "Error in PickupIdentifier::compare: Pickup stored by Identifier is NULL." << std::endl;
93        }
94
95        //! If the classIdentifiers are not the same (meaning the PickupIdentifiers identify different classes), the obviously the two Pickupables identified by the PickupIdentifiers cannot be the same. An ordering is established through the alphabetical ordering of the respective classnames.
96        if(!identifier->pickup_->getIdentifier()->isExactlyA(this->pickup_->getIdentifier()))
97            return this->pickup_->getIdentifier()->getName().compare(identifier->pickup_->getIdentifier()->getName());
98
99        //! If the class is the same for both PickupIdentifiers we go on to check the parameters of the class.
100        //! If the two have a different number of parameters then obviusly something is very wrong.
101        if(!(this->parameters_.size() == identifier->parameters_.size()))
102        {
103            COUT(1) << "Something went wrong in PickupIdentifier!" << std::endl;
104            return this->parameters_.size()-identifier->parameters_.size();
105        }
106
107        //! We iterate through all parameters and compare their values (which are strings). The first parameter is the most significant. The ordering is once again established by the alphabetical comparison of the two value strings.
108        for(std::map<std::string, std::string>::const_iterator it = this->parameters_.begin(); it != this->parameters_.end(); it++)
109        {
110            //!< If a parameter present in one of the identifiers is not found in the other, once again, something is very wrong.
111            if(identifier->parameters_.find(it->first) == identifier->parameters_.end())
112            {
113                COUT(1) << "Something went wrong in PickupIdentifier!" << std::endl;
114                return -1;
115            }
116            if(identifier->parameters_.find(it->first)->second != it->second)
117                return it->second.compare(identifier->parameters_.find(it->first)->second);
118        }
119
120        return 0;
121    }
122
123    /**
124    @brief
125        Add a parameter to the PickupIdentifier.
126    @param name
127        The name of the parameter.
128    @param value
129        The value of the parameter.
130    @return
131        Returns false if the parameter already existed, true if not.
132    */
133    bool PickupIdentifier::addParameter(std::string & name, std::string & value)
134    {
135        COUT(4) << "PickupIdentifier " << name << ", " << value << std::endl;
136
137        if(!(this->parameters_.find(name) == this->parameters_.end()))
138        {
139            COUT(4) << "Request for adding a parameter that already exists for the PickupIdentififer was denied. name: '" << name << "', value: '" << value << "'."<<  std::endl;
140            return false;
141        }
142
143        this->parameters_[name] = value;
144
145        return true;
146    }
147
148}
Note: See TracBrowser for help on using the repository browser.