OMKEventAssociationList.cpp

Go to the documentation of this file.
00001 /*
00002  * This file is part of openMask © INRIA, CNRS, Universite de Rennes 1 1993-2002, thereinafter the Software
00003  * 
00004  * The Software has been developped within the Siames Project. 
00005  * INRIA, the University of Rennes 1 and CNRS jointly hold intellectual property rights
00006  * 
00007  * The Software has been registered with the Agence pour la Protection des
00008  * Programmes (APP) under registration number IDDN.FR.001.510008.00.S.P.2001.000.41200
00009  *  
00010  * This file may be distributed under the terms of the Q Public License
00011  * version 1.0 as defined by Trolltech AS of Norway and appearing in the file
00012  * LICENSE.QPL included in the packaging of this file.
00013  *
00014  * Licensees holding valid specific licenses issued by INRIA, CNRS or Université de Rennes 1 
00015  * for the software may use this file in accordance with that specific license
00016  *
00017  */
00018 #include "OMKEventAssociationList.h"
00019 
00020 using namespace std ;
00021 using namespace OMK ;
00022 
00023 EventAssociationList::EventAssociationList() 
00024 {
00025 
00026 }
00027 
00028 EventAssociationList::~EventAssociationList() 
00029 {
00030 
00031 }
00032 
00033 Event * EventAssociationList::remove (Event * event)
00034 {
00035    Event * result = NULL ;
00036    std::list<pair<Event *,Event * > >::iterator i = _associatedEventList.begin() ;
00037    std::list<pair<Event *,Event * > >::iterator toRemove ;
00038    while (i != _associatedEventList.end() )
00039       {
00040         if ( ( i->first = event ) ) 
00041             {
00042                result = i->second ;
00043                toRemove = i ;
00044                i = _associatedEventList.end() ;
00045                _associatedEventList.erase (toRemove) ;
00046             }
00047         else if ( ( i->second = event ) )
00048             {
00049                result = i->first ;
00050                toRemove = i ;
00051                i = _associatedEventList.end() ;
00052                _associatedEventList.erase (toRemove) ;
00053             }
00054         else
00055             {
00056                i++ ;
00057             }
00058       }
00059    return result ;
00060 }
00061 
00062 void EventAssociationList::associate (Event * evt1, Event * evt2)
00063 {
00064    //push_front because it will probably be the next removed element and that removal starts at the beginning of the list
00065    _associatedEventList.push_front( pair<Event *,Event * > (evt1, evt2) ) ;
00066 }
00067 
00068 

logo OpenMask

Documentation generated on Mon Jun 9 11:45:56 2008

Generated with doxygen by Dimitri van Heesch ,   1997-2007