Repository navigation
Expand file tree
/
Copy pathcron.h
More file actions
118 lines (97 loc) · 7.98 KB
/
Copy pathcron.h
File metadata and controls
118 lines (97 loc) · 7.98 KB
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
/* croncpp (Version 0.1 - 2022/06)
<https://github.com/peychart/croncpp>
Copyright (C) 2022 - peychart
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 3 of
the License, 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.
You should have received a copy of the GNU General Public
License along with this program.
If not, see <http://www.gnu.org/licenses/>.
Details of this licence are available online under:
http://www.gnu.org/licenses/gpl-3.0.html
*/
#ifndef HEADER_F2542F1C2196442
#define HEADER_F2542F1C2196442
#include <bitset>
#include <string>
#include <vector>
#include <sstream>
#include <ctime>
namespace cronTab
{
typedef char unsigned byte;
typedef short unsigned int ushort;
#define SCOPE_OF_YEARS 8
enum field_name {second, minute, hour_of_day, day_of_month, month, day_of_week, year, expr=194 + SCOPE_OF_YEARS*2 + 1}; // Adressage : field_name::hour
static const byte field_size[] = {60,60,24,31,12, 7, SCOPE_OF_YEARS*2 + 1}; // expr == sum ...
static byte field_offset[] = { 0, 0, 0, 1, 1, 0, SCOPE_OF_YEARS};
static const char* weekDay[] = { "SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT" };
static const char* monthName[] = { "JAN", "FEB", "MAR", "APR", "MAY", "JUN", "JUL", "AUG", "SEP", "OCT", "NOV", "DEC" };
static const byte npos = byte(-1);
class cron : std::bitset<field_name::expr>
{
public:
cron( void ) :_err(false) {init();};
cron( std::string s ) :_err(false) {init(); assign( s );};
~cron( void ) {clear();};
inline const std::string expression ( void ) {return _expression;};
inline const bool error ( void ) {return convError();};
inline cron& clear ( void ) {for( byte i(0); i<field_name::expr; i++ ) set( i, false ); _expression.clear(); _lastIsSet=false; convError(true); return *this;};
cron& assign ( std::string s );
inline cron& operator= ( std::string s ) {return assign( s );};
inline const time_t nextDate ( std::tm* t ) {return dateAround( *t );};
inline const time_t nextDate ( const time_t* rawtime ) {return nextDate( localtime( rawtime ) );};
inline const time_t nextDate ( const time_t& rawtime ) {return nextDate( localtime( &rawtime ) );};
inline const time_t previousDate( std::tm* t ) {return dateAround( *t, false );};
inline const time_t previousDate( const time_t* rawtime ) {return previousDate( localtime( rawtime ) );};
inline const time_t previousDate( const time_t& rawtime ) {return previousDate( localtime( &rawtime ) );};
private:
bool _err, _lastIsSet;
ushort _year;
std::string _expression;
cron( const std::tm* t ) :_err(false) {init(); assign( t );};
inline void init ( void ) {time_t rawtime(time(NULL)); _year = localtime(&rawtime)->tm_year;};
cron& assign ( const std::tm* );
inline cron& assign ( const time_t* t ) {return assign( localtime( t ) );};
inline cron& operator= ( const std::tm* t ) {return assign( t );};
inline cron& operator= ( const time_t* t ) {return assign( t );};
byte index ( field_name const );
void setField ( field_name const, std::string, bool );
inline void setField ( byte const n, std::string s, bool v ) {return( setField( field_name(n), s, v ) );};
inline void setScope ( field_name const nfield, bool v, byte begin, byte end, byte delta=1 ){
for( byte i( begin ); i<=end && !convError(); i += delta ) setBit( nfield, i - field_offset[nfield], v );};
inline void setBit ( byte const nfield, byte i, bool v ){return setBit( field_name(nfield), i - field_offset[nfield], v );};
inline void setBit ( field_name const nfield, byte i, bool v ){
if( existingBit(nfield, i) ) this->set(index(nfield)+i, v); else convError( true );};
inline bool setField ( field_name const nfield, bool v ) {if( !existingField(nfield) ) return false; for( byte i(index(nfield)), j(i+field_size[nfield]); i<j; i++) set( i, v ); return true;};
inline bool setField ( byte const nfield, bool v ) {return( setField( field_name(nfield), v ) );};
inline bool isSet ( field_name const nfield, byte i ) {return( (existingField(nfield) && i<field_size[nfield]) ?test(index(nfield)+i) :false );};
inline bool isSet ( byte const nfield, byte i ) {return( isSet( field_name(nfield), i - field_offset[nfield] ) );};
inline bool isSet ( field_name const nfield ) {if( !existingField(nfield) ) return false; for( byte i(0); i<field_size[nfield]; i++ ) if( !test(index(nfield)+i) ) return false; return true;};
inline bool isSet ( byte const nfield ) {return( isSet( field_name(nfield) ) );};
inline bool isNotSet ( field_name const nfield ) {if( existingField(nfield) ) for( byte i(index(nfield)), j(i+field_size[nfield]); i<j; i++) if( test(i) ) return false; return true;};
inline byte findBit ( field_name const nfield, byte n=0 ) {if( !existingField(nfield) ) return npos; for( byte i(n); i<field_size[nfield]; i++ ) if( isSet(nfield, i) ) return (i); return npos;};
inline byte findBit ( byte const nfield, byte n=0 ) {return( findBit( field_name(nfield)-field_offset[n], n ) );};
inline bool existingField ( field_name const nfield ) {return( nfield<=field_name::year );};
inline bool existingField ( byte const nfield ) {return( nfield<=field_name::year );};
inline bool existingBit ( field_name const nfield, byte n ) {return( existingField(nfield) && n<field_size[nfield] );};
inline void convError ( bool b ) {_err=b;};
inline bool convError ( void ) {return _err;};
time_t dateAround ( const std::tm&, bool=true );
bool splitString ( std::string&, std::string, std::string& );
inline bool isNumeric ( std::string& s ) {for( byte i(0); i<s.size(); i++ ) if( !isdigit( s[i] ) ) return false; return s.size();};
inline std::string& toUpper ( std::string& s ) {for( auto &x : s ) x=static_cast<char>( std::toupper(x) ); return s;};
std::string& trimString ( std::string& );
std::string& normalizeField ( field_name const, std::string& );
inline std::string& normalizeField ( byte const nfield, std::string& s ) {return( normalizeField( field_name(nfield), s ) );};
cron& initRef ( std::tm&, int*[] );
int sizeOfMonth ( const std::tm&, bool=false );
};
}
using namespace cronTab;
#endif