-// Copyright (C) 2014-20xx CEA/DEN, EDF R&D
-
-// File: Events_Loop.hxx
-// Created: Thu Mar 13 2014
-// Author: Mikhail PONIKAROV
+// Copyright (C) 2014-2023 CEA, EDF
+//
+// This library is free software; you can redistribute it and/or
+// modify it under the terms of the GNU Lesser General Public
+// License as published by the Free Software Foundation; either
+// version 2.1 of the License, or (at your option) any later version.
+//
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+// Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public
+// License along with this library; if not, write to the Free Software
+// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+//
+// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
+//
#include <Events_Loop.h>
#include <Events_MessageGroup.h>
aFindID->second[theSender] = std::list<Events_Listener*>();
aFindSender = aFindID->second.find(theSender);
}
- // check that listener was not registered wit hsuch parameters before
+ // check that listener was not registered with such parameters before
std::list<Events_Listener*>& aListeners = aFindSender->second;
for (std::list<Events_Listener*>::iterator aL = aListeners.begin(); aL != aListeners.end(); aL++)
if (*aL == theListener)
aLMap.erase(aLIt->first);
myListeners[anIt->first] = aLMap;
if (aLMap.empty())
- break; // avoid incrementation of the iterator if the the container is empty
+ break; // avoid incrementation of the iterator if the container is empty
}
aLIt++;
}
if (anIt->second.empty()) {
myListeners.erase(anIt->first);
if (myListeners.empty())
- break; // avoid incrementation of the iterator if the the container is empty
+ break; // avoid incrementation of the iterator if the container is empty
}
anIt++;
}
if (anImIt->second == theListener) {
myImmediateListeners.erase(anImIt->first);
if (myImmediateListeners.empty())
- break; // avoid incrementation of the iterator if the the container is empty
+ break; // avoid incrementation of the iterator if the container is empty
}
anImIt++;
}
{
if (!myFlushActive)
return;
+ bool hasEventsToFlush = !myGroups.empty();
std::map<char*, std::shared_ptr<Events_Message> >::iterator aMyGroup;
for(aMyGroup = myGroups.find(theID.eventText());
aMyGroup != myGroups.end(); aMyGroup = myGroups.find(theID.eventText()))
// TODO: Stabilization fix. Check later.
if(myFlushed.find(theID.myID) != myFlushed.end()) {
myFlushed.erase(myFlushed.find(theID.myID));
- } else {
+ }
+#ifdef _DEBUG
+ else {
bool aProblem = true;
}
+#endif
}
// send accumulated messages to "groupListeners"
std::map<char*, std::map<void*, std::list<Events_Listener*> > >::iterator aFindID =
}
}
}
+ if (hasEventsToFlush && myGroups.empty() && myFlushed.empty()) {
+ // no more messages left in the queue, so, finalize the sketch processing
+ static Events_ID anID = Events_Loop::eventByName("SketchPrepared");
+ std::shared_ptr<Events_Message> aMsg(new Events_Message(anID, this));
+ Events_Loop::loop()->send(aMsg, false);
+ }
}
void Events_Loop::eraseMessages(const Events_ID& theID)
}
}
-void Events_Loop::autoFlush(const Events_ID& theID, const bool theAuto)
-{
- if (theAuto)
- myFlushed.insert(theID.myID);
- else
- myFlushed.erase(myFlushed.find(theID.myID));
-}
-
bool Events_Loop::isFlushed(const Events_ID& theID)
{
return myFlushed.find(theID.myID) != myFlushed.end();
else
myFlushed.erase(myFlushed.find(theID.myID));
}
+
+bool Events_Loop::hasGrouppedEvent(const Events_ID& theID)
+{
+ return myGroups.find(theID.myID) != myGroups.end();
+}
\ No newline at end of file