1 // Copyright (C) 2014-20xx CEA/DEN, EDF R&D
3 // File: Events_Loop.hxx
4 // Created: Thu Mar 13 2014
5 // Author: Mikhail PONIKAROV
7 #include <Events_Loop.h>
8 #include <Events_MessageGroup.h>
15 Events_Loop* Events_Loop::loop()
17 // initialized on initialization of the application
18 static Events_Loop MAIN_LOOP;
22 Events_ID Events_Loop::eventByName(const char* theName)
24 ///! All events created in this session, uniquely identified by the text and char pointer
25 static map<string, char*> CREATED_EVENTS;
27 string aName(theName);
28 map<string, char*>::iterator aFound = CREATED_EVENTS.find(aName);
29 if (aFound == CREATED_EVENTS.end()) { //not created yet
31 aResult = _strdup(theName); // copy to make unique internal pointer
33 aResult = strdup(theName); // copy to make unique internal pointer
35 CREATED_EVENTS[aName] = aResult;
37 aResult = aFound->second;
39 return Events_ID(aResult);
42 void Events_Loop::send(const std::shared_ptr<Events_Message>& theMessage, bool isGroup)
44 if (myImmediateListeners.find(theMessage->eventID().eventText()) != myImmediateListeners.end()) {
45 myImmediateListeners[theMessage->eventID().eventText()]->processEvent(theMessage);
47 // if it is grouped message, just accumulate it
48 if (isGroup && myFlushed.find(theMessage->eventID().myID) == myFlushed.end()) {
49 std::shared_ptr<Events_MessageGroup> aGroup =
50 std::dynamic_pointer_cast<Events_MessageGroup>(theMessage);
52 std::map<char*, std::shared_ptr<Events_Message> >::iterator aMyGroup = myGroups.find(
53 aGroup->eventID().eventText());
54 if (aMyGroup == myGroups.end()) { // create a new group of messages for accumulation
55 myGroups[aGroup->eventID().eventText()] = aGroup->newEmpty();
56 aMyGroup = myGroups.find(aGroup->eventID().eventText());
58 std::shared_ptr<Events_MessageGroup> aStored =
59 std::dynamic_pointer_cast<Events_MessageGroup>(aMyGroup->second);
60 aStored->Join(aGroup);
65 map<char*, map<void*, list<Events_Listener*> > >::iterator aFindID = myListeners.find(
66 theMessage->eventID().eventText());
67 if (aFindID != myListeners.end()) {
68 map<void*, list<Events_Listener*> >::iterator aFindSender = aFindID->second.find(
69 theMessage->sender());
70 if (aFindSender != aFindID->second.end()) {
71 list<Events_Listener*>& aListeners = aFindSender->second;
72 for (list<Events_Listener*>::iterator aL = aListeners.begin(); aL != aListeners.end(); aL++)
73 (*aL)->processEvent(theMessage);
75 if (theMessage->sender()) { // also call for NULL senders registered
76 aFindSender = aFindID->second.find(NULL);
77 if (aFindSender != aFindID->second.end()) {
78 list<Events_Listener*>& aListeners = aFindSender->second;
79 for (list<Events_Listener*>::iterator aL = aListeners.begin(); aL != aListeners.end(); aL++)
80 (*aL)->processEvent(theMessage);
86 void Events_Loop::registerListener(Events_Listener* theListener, const Events_ID theID,
87 void* theSender, bool theImmediate)
89 if (theImmediate) { // just register as an immediate
90 myImmediateListeners[theID.eventText()] = theListener;
93 map<char*, map<void*, list<Events_Listener*> > >::iterator aFindID = myListeners.find(
95 if (aFindID == myListeners.end()) { // create container associated with ID
96 myListeners[theID.eventText()] = map<void*, list<Events_Listener*> >();
97 aFindID = myListeners.find(theID.eventText());
100 map<void*, list<Events_Listener*> >::iterator aFindSender = aFindID->second.find(theSender);
101 if (aFindSender == aFindID->second.end()) { // create container associated with sender
102 aFindID->second[theSender] = list<Events_Listener*>();
103 aFindSender = aFindID->second.find(theSender);
105 // check that listener was not registered wit hsuch parameters before
106 list<Events_Listener*>& aListeners = aFindSender->second;
107 for (list<Events_Listener*>::iterator aL = aListeners.begin(); aL != aListeners.end(); aL++)
108 if (*aL == theListener)
109 return; // avoid duplicates
111 aListeners.push_back(theListener);
114 void Events_Loop::removeListener(Events_Listener* theListener)
116 // remove the listener in myListeners map
117 std::map<char*, std::map<void*, std::list<Events_Listener*> > >::const_reverse_iterator
118 anIt = myListeners.rbegin();
119 while(anIt != myListeners.rend()) {
120 std::map<void*, std::list<Events_Listener*> > aLMap = anIt->second;
121 std::map<void*, std::list<Events_Listener*> >::const_reverse_iterator aLIt = aLMap.rbegin();
122 while (aLIt != aLMap.rend()) {
123 std::list<Events_Listener*> aListeners = aLIt->second;
124 std::list<Events_Listener*>::const_reverse_iterator aLsIt = aListeners.rbegin();
125 for (; aLsIt != aListeners.rend(); aLsIt++) {
126 if (*aLsIt == theListener) {
127 aListeners.remove(theListener);
128 aLMap[aLIt->first] = aListeners;
129 myListeners[anIt->first] = aLMap;
133 if (aListeners.empty()) {
134 aLMap.erase(aLIt->first);
135 myListeners[anIt->first] = aLMap;
137 break; // avoid incrementation of the iterator if the the container is empty
141 if (anIt->second.empty()) {
142 myListeners.erase(anIt->first);
143 if (myListeners.empty())
144 break; // avoid incrementation of the iterator if the the container is empty
149 // remove the listener in myImmediateListeners map
150 std::map<char*, Events_Listener*>::const_reverse_iterator anImIt = myImmediateListeners.rbegin();
151 while(anImIt != myImmediateListeners.rend()) {
152 if (anImIt->second == theListener) {
153 myImmediateListeners.erase(anImIt->first);
154 if (myImmediateListeners.empty())
155 break; // avoid incrementation of the iterator if the the container is empty
161 void Events_Loop::flush(const Events_ID& theID)
165 std::map<char*, std::shared_ptr<Events_Message> >::iterator aMyGroup;
166 for(aMyGroup = myGroups.find(theID.eventText());
167 aMyGroup != myGroups.end(); aMyGroup = myGroups.find(theID.eventText()))
169 bool aWasFlushed = myFlushed.find(theID.myID) != myFlushed.end();
171 myFlushed.insert(theID.myID);
172 std::shared_ptr<Events_Message> aGroup = aMyGroup->second;
173 myGroups.erase(aMyGroup);
177 // TODO: Stabilization fix. Check later.
178 if(myFlushed.find(theID.myID) != myFlushed.end()) {
179 myFlushed.erase(myFlushed.find(theID.myID));
184 void Events_Loop::eraseMessages(const Events_ID& theID)
186 std::map<char*, std::shared_ptr<Events_Message> >::iterator aMyGroup =
187 myGroups.find(theID.eventText());
188 if (aMyGroup != myGroups.end()) {
189 myGroups.erase(aMyGroup);
194 bool Events_Loop::activateFlushes(const bool theActivate)
196 bool isActive = myFlushActive;
197 myFlushActive = theActivate;
201 void Events_Loop::clear(const Events_ID& theID)
203 std::map<char*, std::shared_ptr<Events_Message>>::iterator aMyGroup =
204 myGroups.find(theID.eventText());
205 if (aMyGroup != myGroups.end()) { // really sends
206 myGroups.erase(aMyGroup);
210 void Events_Loop::autoFlush(const Events_ID& theID, const bool theAuto)
213 myFlushed.insert(theID.myID);
215 myFlushed.erase(myFlushed.find(theID.myID));
218 bool Events_Loop::isFlushed(const Events_ID& theID)
220 return myFlushed.find(theID.myID) != myFlushed.end();
223 void Events_Loop::setFlushed(const Events_ID& theID, const bool theValue)
226 myFlushed.insert(theID.myID);
228 myFlushed.erase(myFlushed.find(theID.myID));