2 The software in this package is distributed under the GNU General
3 Public License version 2 (with a special exception described below).
5 A copy of GNU General Public License (GPL) is included in this distribution,
6 in the file COPYING.GPL.
8 As a special exception, if other files instantiate templates or use macros
9 or inline functions from this file, or you compile this file and link it
10 with other works to produce a work based on this file, this file
11 does not by itself cause the resulting work to be covered
12 by the GNU General Public License.
14 However the source code for this file must still be made available
15 in accordance with section (3) of the GNU General Public License.
17 This exception does not invalidate any other reasons why a work based
18 on this file might be covered by the GNU General Public License.
21 * @brief time related functions.
23 * @copyright Copyright © 2001-2008 by Intra2net AG
39 #include <sys/timeb.h>
40 #include <sys/syscall.h>
42 #include <timefunc.hxx>
46 // define missing POSIX.1b constants...
48 #ifndef CLOCK_REALTIME
49 #define CLOCK_REALTIME 0
51 #ifndef CLOCK_MONOTONIC
52 #define CLOCK_MONOTONIC 1
59 double prec_time(void)
66 ret=tb.time+(static_cast<float>(tb.millitm)/1000);
71 // converts ISO-DATE: 2003-06-13
72 time_t date_to_seconds(const std::string &date)
75 int year = -1, month = -1, day = -1;
77 string::size_type pos = date.find("-");
78 if (pos == string::npos)
81 istringstream in(string(date,0,pos));
85 string dstr(date, pos+1);
86 if ((pos = dstr.find("-")) == string::npos)
90 in.str(string(dstr, 0, pos));
95 in.str(string(dstr, pos+1));
98 if (year < 0 || month == -1 || day == -1)
102 memset(&tm_struct, 0, sizeof(struct tm));
103 tm_struct.tm_year = year;
104 tm_struct.tm_mon = month;
105 tm_struct.tm_mday = day;
106 tm_struct.tm_isdst = -1;
108 rtn = mktime (&tm_struct);
112 string make_nice_time(int seconds)
116 int days=seconds/86400;
120 split_daysec(seconds,&hours,&minutes,&seconds);
123 out << i18n("1 day") << ", ";
125 out << days << ' ' << i18n("days") << ", ";
128 out << setw(2) << hours << ':' << setw(2) << minutes << ':' << setw(2) << seconds;
133 string format_full_time(time_t seconds)
138 if (localtime_r((time_t *)&seconds, &ta) == NULL)
139 memset (&ta, 0, sizeof(struct tm));
141 strftime (buf, 49, "%d.%m.%Y %H:%M", &ta);
145 void seconds_to_hour_minute(int seconds, int *hour, int *minute)
149 while (seconds >= 3600) {
155 if (minute != NULL) {
157 while (seconds >= 60) {
165 * Split seconds into hours, minutes and seconds
166 * @param [in] daysec Seconds since start of day
167 * @param [out] outhours hours
168 * @param [out] outminutes minutes
169 * @param [out] outseconds seconds
171 void split_daysec(int daysec, int *outhours, int *outminutes, int *outseconds)
173 int hours=daysec/3600;
176 int minutes=daysec/60;
189 std::string output_hour_minute(int hour, int minute, bool h_for_00, int seconds)
193 if (hour >= 0 && hour < 10)
197 if (!h_for_00 || minute != 0 || seconds > 0)
200 if (minute >= 0 && minute < 10)
210 if (seconds > 0 && seconds < 10)
218 string get_month_name(unsigned char month)
223 rtn = i18n("January");
226 rtn = i18n("February");
244 rtn = i18n("August");
247 rtn = i18n("September");
250 rtn = i18n("October");
253 rtn = i18n("November");
256 rtn = i18n("December");
261 out << i18n("Illegal month:") << " " << month;
271 ** implementaion of Interval
276 * @brief clears the interval (make it empty).
278 void Interval::clear()
280 m_lower_bound = m_upper_bound = 0;
281 } // eo Interval::clear()
285 * @brief tests if there is some overlapping with another interval
286 * @param other the other interval
287 * @return @a true if the two intervals have a non empty intersection.
289 bool Interval::intersects(const Interval& other) const
292 // // other start within this:
293 (other.m_lower_bound >= m_lower_bound and other.m_lower_bound < m_upper_bound )
294 // // other end within this:
295 or (other.m_upper_bound > m_lower_bound and other.m_upper_bound <= m_upper_bound )
296 // // other contains this
297 or (other.m_lower_bound <= m_lower_bound and other.m_upper_bound >= m_upper_bound )
299 } // eo Interval::intersects(const Interval&)
303 * @brief tests if the current interval (fully) contains another one.
304 * @param other the other interval.
305 * @return @a true if the current interval fully contains the other interval.
307 bool Interval::contains(const Interval& other) const
309 return (other.m_lower_bound >= m_lower_bound)
310 and (other.m_upper_bound <= m_upper_bound)
312 } // eo Interval::contains(const Interval& other) const
316 ** implementation of Intervals:
320 Intervals::Intervals()
322 } // eo Intervals::Intervals
325 void Intervals::clear()
328 } // eo Intervals::clear()
331 * @brief tests if one of the intervals of the list intersects with the given interval.
332 * @param other the interval to check for intersection.
333 * @return @a true if there is an intersection.
335 bool Intervals::intersects(const Interval& other) const
337 for(const_iterator it= begin();
341 if ( it->intersects(other) )
347 } // eo Intervals::intersects(const Interval&) const
351 * @brief tests if we have at least one intersection with another Intervals instance.
352 * @param other the other instance.
353 * @return @a true if there is an intersection.
355 bool Intervals::intersects(const Intervals& other) const
357 for(const_iterator it= begin();
361 if ( other.intersects( *it ) )
367 } // eo Intervals::intersects(const Intervals&) const
371 * @brief adds a new interval to the list.
372 * @param new_frame the new interval.
374 * Adds the interval to the list and joins overlapping intervals.
376 * @internal complexity O(n).
378 void Intervals::add(const Interval& new_frame)
380 if (not new_frame.is_valid() or new_frame.empty())
382 // well... we will not insert invalid or empty frames!
385 for (IntervalList::iterator it= m_intervals.begin();
386 it != m_intervals.end();
389 Interval& current_frame = *it;
390 if ( new_frame.m_lower_bound > current_frame.m_upper_bound )
392 // new_frame begins later than current end; go on:
395 // at this point: the begin of the new frame is less then the current end.
396 // now let's determine how we can insert the new frame:
398 if ( new_frame.m_upper_bound < current_frame.m_lower_bound )
400 // new disjoint frame; insert it before the current frame:
401 m_intervals.insert( it, new_frame );
405 // at this point: the end of the new frame is >= current begin.
406 if ( new_frame.m_upper_bound <= current_frame.m_upper_bound )
408 // the end of the new frame is within our current frame; we need to combine
409 if (new_frame.m_lower_bound < current_frame.m_lower_bound)
411 // the new interval starts earlier; we need to adjust our current frame:
412 current_frame.m_lower_bound = new_frame.m_lower_bound;
413 current_frame.m_changed = true;
415 // NOTE no "else" part needed since in that case our current frame already
416 // contains the new one!
421 // at this point: end of new frame > end of current frame
422 // so we need to extend the current frame; at least the end.
423 // But we need to deal with intersects of following frames... *sigh*
425 // first the simple part: let's see if we need to move the start:
426 if ( new_frame.m_lower_bound < current_frame.m_lower_bound)
428 // yes, we need to move the start:
429 current_frame.m_lower_bound = new_frame.m_lower_bound;
430 current_frame.m_changed= true;
433 // now let's extend the end:
434 current_frame.m_upper_bound = new_frame.m_upper_bound;
435 current_frame.m_changed = true;
437 // well... let's walk through the following frames; looking for more joins...:
438 IntervalList::iterator it2 = it;
439 while( ++(it2=it) != m_intervals.end()
440 and current_frame.m_upper_bound >= it2->m_lower_bound
443 Interval next_frame= *it2;
444 if ( current_frame.m_upper_bound < next_frame.m_upper_bound )
446 // in this case our end is within the next frame.
448 current_frame.m_upper_bound = next_frame.m_upper_bound;
450 // and remove the next frame since the current frame contains it (now):
451 m_intervals.erase(it2);
456 // at this point: new frame starts later than the last frame ends
457 // append the new frame:
458 m_intervals.push_back( new_frame );
459 } // eo Intervals::add(const Interval&)
463 * @brief subtracts a time interval from the list.
464 * @param del_frame the time interval to subtract.
466 * removes the time interval from the list; cut off parts from or remove existing
467 * intervals if they overlap.
469 * @internal complexity O(n).
471 void Intervals::sub(const Interval& del_frame)
473 if (not del_frame.is_valid() or del_frame.empty() )
477 for (IntervalList::iterator it= m_intervals.begin();
478 it != m_intervals.end();
481 Interval& current_frame = *it;
482 if ( del_frame.m_lower_bound >= current_frame.m_upper_bound )
484 // del_frame begins later than current end; go on:
488 // at this point: the begin of the del frame is less then the current end.
489 if ( del_frame.m_upper_bound < current_frame.m_lower_bound )
491 // end is before our start; nothing to do.
494 // at this point: the end of the del frame is >= current begin.
495 if ( del_frame.m_upper_bound < current_frame.m_upper_bound )
497 // del frame end point is within our interval.
498 if ( del_frame.m_lower_bound > current_frame.m_lower_bound)
500 // the del frame is within our interval... we need to split:
501 m_intervals.insert(it, Interval( current_frame.m_lower_bound, del_frame.m_lower_bound ) );
503 // adjust start of current frame:
504 if (current_frame.m_lower_bound < del_frame.m_upper_bound)
506 current_frame.m_lower_bound= del_frame.m_upper_bound;
507 current_frame.m_changed= true;
512 // at this point the end of the del frame is >= current end
513 if ( del_frame.m_lower_bound > current_frame.m_lower_bound )
515 // a part of the current interval needs to be preserved..
517 current_frame.m_upper_bound= del_frame.m_lower_bound;
518 current_frame.m_changed= true;
519 // and continue with the next interval:
523 // at this point; the whole frame needs to be deleted..
524 if ( it == m_intervals.begin())
526 m_intervals.erase(it);
527 it= m_intervals.begin();
531 IntervalList::iterator it2= it++;
532 m_intervals.erase(it2);
535 } // eo Intervals::sub(const Interval&)
539 * @brief returns if we contain an interval.
540 * @param other the interval to check.
541 * @return @a true if we cover the given interval, too.
543 bool Intervals::contains(const Interval& other) const
545 for(const_iterator it= begin();
549 if ( it->contains( other ))
555 } // eo Intervals::contains(const Interval&) const
559 * @brief returns if we contain an exact interval.
560 * @param other the interval to check.
561 * @return @a true if we axactly contains the given interval.
563 * @note thsi differs from contain in the way, that we return only @a true
564 * iff we have the given interval in our list; not only cover it.
566 bool Intervals::contains_exact(const Interval& other) const
568 for(const_iterator it= begin();
578 } // eo Intervals::contains_exact(const Interval&)const
582 * @brief returns if we contain another interval combination.
583 * @param other the intervals to check.
584 * @return @a true if we cover the given intervals, too.
586 * @internal we rely on the fact that the lists are sorted and contain
587 * disjoint intervals.
589 * So this method has a complexity of O(n).
591 bool Intervals::contains(const Intervals& other) const
593 const_iterator my_it= begin();
594 const_iterator other_it= other.begin();
595 while( my_it != end() and other_it!= other.end() )
597 // seek the first interval which contains the lower bound of the current other interval
598 while (my_it != end()
599 and my_it->m_lower_bound > other_it->m_lower_bound
600 and other_it->m_lower_bound >= my_it->m_upper_bound
609 if (not my_it->contains( *other_it ))
611 // if we don't contain the current other; we're done:
614 //else check the next other interval:
617 return (other_it == other.end());
618 } // eo Intervals::contains(const Intervals&) const
622 * @brief combines to interval combinates for equality
623 * @param other the other instance.
624 * @return @a true if the other is equal to the current.
626 * @internal since the lists are sorted, we compare the interval lists.
627 * Thus we have a complexity of O(n).
629 bool Intervals::operator==(const Intervals& other) const
631 // since we keep sorted lists: just compare the lists :-)
632 return m_intervals == other.m_intervals;
633 } // eo Intervals::operator==(const Intervals&)
636 Intervals& Intervals::operator+=(const Interval& other)
640 } // eo operator+=(const Interval&)
643 Intervals& Intervals::operator-=(const Interval& other)
647 } // eo operator-=(const Interval&)
651 * @brief adds the intervals of a second instance to us.
652 * @param other the other instance.
653 * @return self reference (allow chaining).
655 * @internal since we do simple loops over the other and our intervals
656 * we have a complexity of O(n^2).
658 * @todo optimize if complexity becomes a problem.
660 Intervals& Intervals::operator+=(const Intervals& other)
662 for(const_iterator it= other.begin();
669 } // eo operator+=(const Intervals&)
673 * @brief subtracts the intervals of a second instance from us.
674 * @param other the other instance.
675 * @return self reference (allow chaining).
677 * @internal since we do simple loops over the other and our intervals
678 * we have a complexity of O(n^2).
680 * @todo optimize if complexity becomes a problem.
682 Intervals& Intervals::operator-=(const Intervals& other)
690 for(const_iterator it= other.begin();
698 } // eo operator-=(const Intervals&)
708 * @brief fetches the value from the monotonic clock source.
709 * @param[out] seconds the seconds.
710 * @param[out] nano_seconds the nano seconds.
711 * @return @a true if the clock was successfully read.
713 bool monotonic_clock_gettime(long int& seconds, long int& nano_seconds)
715 struct timespec tp[1];
716 int res= ::syscall(__NR_clock_gettime, CLOCK_MONOTONIC, tp);
720 nano_seconds= tp->tv_nsec;
723 } // eo monotonic_clock_gettime(long int&,long int&)
727 * @brief fetches the value from the monotonic clock source.
728 * @return the time since system start in nanoseconds, 0 if read was unsuccessful
730 long long monotonic_clock_gettime_nano()
733 long int nano_seconds;
736 if (monotonic_clock_gettime(seconds,nano_seconds))
747 * @brief fetches the value from the monotonic clock source.
748 * @param[out] seconds the seconds.
749 * @param[out] nano_seconds the nano seconds.
750 * @return @a true if the clock was successfully read.
752 bool realtime_clock_gettime(long int& seconds, long int& nano_seconds)
754 struct timespec tp[1];
755 int res= ::syscall(__NR_clock_gettime, CLOCK_REALTIME, tp);
759 nano_seconds= tp->tv_nsec;
762 } // eo realtime_clock_gettime(long int&,long int&)