Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: code/branches/resource/src/orxonox/overlays/notifications/NotificationManager.cc @ 3346

Last change on this file since 3346 was 3196, checked in by rgrieder, 15 years ago

Merged pch branch back to trunk.

  • Property svn:eol-style set to native
File size: 7.5 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
31    @brief Implementation of the NotificationManager class.
32*/
33
34#include "NotificationManager.h"
35
36#include <set>
37
38#include "core/CoreIncludes.h"
39#include "Notification.h"
40#include "NotificationQueue.h"
41
42namespace orxonox
43{
44
45    const std::string NotificationManager::ALL = "all";
46    const std::string NotificationManager::NONE = "none";
47
48    NotificationManager* NotificationManager::singletonRef_s = NULL;
49
50    /**
51    @brief
52        Constructor. Registers the Object.
53    */
54    NotificationManager::NotificationManager()
55    {
56        RegisterRootObject(NotificationManager);
57
58        assert(singletonRef_s == 0);
59        singletonRef_s = this;
60
61        this->highestIndex_ = 0;
62    }
63
64    /**
65    @brief
66        Destructor.
67    */
68    NotificationManager::~NotificationManager()
69    {
70    }
71
72    /**
73    @brief
74        Returns the current (and single) instance of the NotificationManager. Creates one, if there isn't one to begin with.
75    @return
76        Returns a reference to the single instance of the NotificationManager.
77    */
78    /*static*/ NotificationManager & NotificationManager::getInstance()
79    {
80        assert(singletonRef_s);
81        return *singletonRef_s;
82    }
83   
84    /**
85    @brief
86        Registers a Notification within the NotificationManager and makes sure that the Notification is displayed in all the NotificationQueues associated with its sender.
87    @param notification
88        The Notification to be registered.
89    @return
90        Returns true if successful.
91    */
92    bool NotificationManager::registerNotification(Notification* notification)
93    {
94   
95        if(notification == NULL) //!< A NULL-Notification cannot be registered.
96            return false;
97       
98        std::time_t time = std::time(0); //TDO: Doesn't this expire? //!< Get current time.
99       
100        this->allNotificationsList_.insert(std::pair<std::time_t,Notification*>(time,notification));
101       
102        if(notification->getSender() == NONE) //!< If the sender has no specific name, then the Notification is only added to the list of all Notifications.
103            return true;
104       
105        bool all = false;
106        if(notification->getSender() == ALL) //!< If all are the sender, then the Notifications is added to every NotificationQueue.
107            all = true;
108       
109        //!< Insert the notification in all queues that have its sender as target.
110        for(std::map<NotificationQueue*,int>::iterator it = this->queueList_.begin(); it != this->queueList_.end(); it++) //!< Iterate through all queues.
111        {
112            std::set<std::string> set = it->first->getTargetsSet();
113            if(all || set.find(notification->getSender()) != set.end() || set.find(ALL) != set.end()) //TDO: Make sure this works.
114            {
115                this->notificationLists_[it->second]->insert(std::pair<std::time_t,Notification*>(time,notification)); //!< Insert the Notification in the Notifications list of the current NotificationQueue.
116                it->first->update(notification, time); //!< Update the queue.
117            }
118        }
119       
120        COUT(3) << "Notification registered with the NotificationManager." << std::endl;
121       
122        return true;
123    }
124   
125    /**
126    @brief
127        Registers a NotificationQueue within the NotificationManager.
128    @param queue
129        The NotificationQueue to be registered.
130    @return
131        Returns true if successful.
132    */
133    bool NotificationManager::registerQueue(NotificationQueue* queue)
134    {
135        this->highestIndex_ += 1;
136        int index = this->highestIndex_;
137       
138        this->queueList_[queue] = index; //!< Add the NotificationQueue to the list of queues.
139       
140        std::set<std::string> set = queue->getTargetsSet(); //TDO: Works this?
141       
142        //! If all senders are the target of the queue, then the list of notification for that specific queue is te same as the list of all Notifications.
143        if(set.find(ALL) != set.end())
144        {
145            this->notificationLists_[index] = &this->allNotificationsList_;
146            COUT(3) << "NotificationQueue registered with the NotificationManager." << std::endl;
147            return true;
148        }
149       
150        this->notificationLists_[index] = new std::multimap<std::time_t,Notification*>;
151        std::multimap<std::time_t,Notification*> map = *this->notificationLists_[index];
152       
153        //! Iterate through all Notifications to determine whether any of them should belong to the newly registered NotificationQueue.
154        for(std::multimap<std::time_t,Notification*>::iterator it = this->allNotificationsList_.begin(); it != this->allNotificationsList_.end(); it++)
155        {
156            if(set.find(it->second->getSender()) != set.end()) //!< Checks whether the overlay has the sender of the current notification as target.
157            {
158                map.insert(std::pair<std::time_t,Notification*>(it->first, it->second));
159            }
160        }
161       
162        queue->update(); //!< Update the queue.
163
164        COUT(3) << "NotificationQueue registered with the NotificationManager." << std::endl;
165       
166        return true;
167    }
168   
169    /**
170    @brief
171        Fetches the Notifications for a specific NotificationQueue in a specified timeframe.
172    @param queue
173        The NotificationQueue the Notifications are fetched for.
174    @param map
175        A multimap, in which the notifications are stored.
176    @param timeFrameStart
177        The start time of the timeframe.
178    @param timeFrameEnd
179        The end time of the timeframe.
180    @return
181        Returns true if successful.
182    */
183    bool NotificationManager::getNotifications(NotificationQueue* queue, std::multimap<std::time_t,Notification*>* map, const std::time_t & timeFrameStart, const std::time_t & timeFrameEnd)
184    {
185        if(queue == NULL || map == NULL)
186            return false;
187
188        std::multimap<std::time_t,Notification*>* notifications = this->notificationLists_[this->queueList_[queue]]; //!< The Notifications for the input NotificationQueue.
189       
190        if(notifications == NULL) //!< Returns NULL, if there are no Notifications.
191            return true;
192   
193        std::multimap<std::time_t,Notification*>::iterator it, itLowest, itHighest;
194        itLowest = notifications->lower_bound(timeFrameStart);
195        itHighest = notifications->upper_bound(timeFrameStart);
196       
197        for(it = itLowest; it != itHighest; it++) //!< Iterate through the Notifications from the start of the time Frame to the end of it.
198        {
199            map->insert(std::pair<std::time_t,Notification*>(it->first,it->second)); //!< Add the found Notifications to the map.
200        }
201       
202        return true;
203    }
204
205}
Note: See TracBrowser for help on using the repository browser.