1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
// TimePred.hh --- Time Predicate
//
// Copyright (C) 2001, 2002, 2003, 2005 Rob Caelers <robc@krandor.org>
// All rights reserved.
//
// Time-stamp: <2005-09-12 19:19:10 robc>
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2, or (at your option)
// any later version.
//
// This program 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 General Public License for more details.
//
// $Id: TimePred.hh,v 1.2 2005/09/23 19:22:33 rcaelers Exp $
//
#ifndef TIMEPRED_HH
#define TIMEPRED_HH
#if TIME_WITH_SYS_TIME
# include <sys/time.h>
# include <time.h>
#else
# if HAVE_SYS_TIME_H
# include <sys/time.h>
# else
# include <time.h>
# endif
#endif
using namespace std;
//! A time predicate.
/*! Given a previous time that matched, it computes the next time that matches
* a certain time-predicate. This is used for, for example, daily limits.
* Given the last daily limit (or the current time if there was no previous
* daily limit), a time predicate computes the time of the next daily limit.
*
* This is base class for all time predicates (e.g. daily, weekly,...)
*/
class TimePred
{
public:
virtual ~TimePred() {}
//! Set the last time the predicate matched.
virtual void set_last(time_t lastTime)
{
last_time = lastTime;
}
//! Computes the next time the predicate matches given the time of the previous match.
virtual time_t get_next() = 0;
//! Returns the string representation of this predicate.
virtual string to_string() const = 0;
protected:
//! Last time the predicate matched.
time_t last_time;
};
#endif // TIMEPRED_HH
|
