OpenTracker

An Open Architecture for Reconfigurable Tracking based on XML | Contact

EventQueueImplementation.cxx

Go to the documentation of this file.
00001 /* ========================================================================
00002  * Copyright (c) 2006,
00003  * Institute for Computer Graphics and Vision
00004  * Graz University of Technology
00005  * All rights reserved.
00006  *
00007  * Redistribution and use in source and binary forms, with or without
00008  * modification, are permitted provided that the following conditions are
00009  * met:
00010  *
00011  * Redistributions of source code must retain the above copyright notice,
00012  * this list of conditions and the following disclaimer.
00013  *
00014  * Redistributions in binary form must reproduce the above copyright
00015  * notice, this list of conditions and the following disclaimer in the
00016  * documentation and/or other materials provided with the distribution.
00017  *
00018  * Neither the name of the Graz University of Technology nor the names of
00019  * its contributors may be used to endorse or promote products derived from
00020  * this software without specific prior written permission.
00021  *
00022  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
00023  * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
00024  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
00025  * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
00026  * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00027  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00028  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00029  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00030  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00031  * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00032  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00033  * ========================================================================
00034  * PROJECT: OpenTracker
00035  * ======================================================================== */
00042 /* ======================================================================= */
00043 
00044 #include "EventQueueImplementation.h"
00045 
00046 #include <algorithm>
00047 
00048 namespace ot {
00049 
00051     struct SameOrAfter {
00052         double time;
00053 
00054         SameOrAfter( double time_ ) :
00055             time( time_ )
00056         {}
00057 
00058         bool operator()( const Event & event )
00059         {
00060             return (event.time >= time);
00061         }
00062     };
00063 
00064     // Destructor method.
00065 
00066     EventQueueImplementation::~EventQueueImplementation()
00067     {
00068         queue.clear();
00069     }
00070 
00071     // returns the event number n back in time starting with the newest for n = 0
00072 
00073     Event& EventQueueImplementation::getEvent(unsigned int number)
00074     {
00075         if( number < queue.size())
00076         {
00077             return queue[number];
00078         }
00079         return Event::null;
00080     }
00081 
00082     // returns the event closes to the given point in time
00083 
00084     Event& EventQueueImplementation::getEventNearTime(double time)
00085     {
00086         EventQueue::iterator index = std::find_if(queue.begin(), queue.end(), SameOrAfter( time ));
00087         if( index != queue.end())
00088         {
00089             if( index == queue.begin() )
00090             {
00091                 return (*index);
00092             }
00093             EventQueue::iterator pre = index - 1;
00094             if( (*pre).time - time < time - (*index).time )
00095             {
00096                 return (*pre);
00097             } else
00098             {
00099                 return (*index);
00100             }
00101         }
00102         return queue[queue.size()-1];
00103     }
00104 
00105     // returns the size of the queue
00106 
00107     unsigned int EventQueueImplementation::getSize()
00108     {
00109         return queue.size();
00110     }
00111 
00112     // inserts an event so that it is in order in time with the other events
00113 
00114     void EventQueueImplementation::insertAtTime(Event& event)
00115     {
00116         EventQueue::iterator index = std::find_if(queue.begin(), queue.end(), SameOrAfter( event.time ));
00117         if( index != queue.end())
00118         {
00119             if( (*index).time == event.time )
00120             {
00121                 (*index) = event;
00122             }
00123             else
00124             {
00125                 queue.insert( index, event );
00126             }
00127         }
00128         else
00129         {
00130             queue.push_back( event );
00131         }
00132     }
00133 
00134 } // namespace ot
00135 
00136 /* 
00137  * ------------------------------------------------------------
00138  *   End of EventQueueImplementation.h
00139  * ------------------------------------------------------------
00140  *   Automatic Emacs configuration follows.
00141  *   Local Variables:
00142  *   mode:c++
00143  *   c-basic-offset: 4
00144  *   eval: (c-set-offset 'substatement-open 0)
00145  *   eval: (c-set-offset 'case-label '+)
00146  *   eval: (c-set-offset 'statement 'c-lineup-runin-statements)
00147  *   eval: (setq indent-tabs-mode nil)
00148  *   End:
00149  * ------------------------------------------------------------ 
00150  */

copyright (c) 2006 Graz University of Technology