├── example_test.go ├── cronexpr ├── main.go └── README.md ├── README.md ├── cronexpr.go ├── cronexpr_next.go ├── cronexpr_test.go ├── APLv2 ├── cronexpr_parse.go └── GPLv3 /example_test.go: -------------------------------------------------------------------------------- 1 | /*! 2 | * Copyright 2013 Raymond Hill 3 | * 4 | * Project: github.com/gorhill/example_test.go 5 | * File: example_test.go 6 | * Version: 1.0 7 | * License: GPL v3 see 8 | * 9 | */ 10 | 11 | package cronexpr_test 12 | 13 | /******************************************************************************/ 14 | 15 | import ( 16 | "fmt" 17 | "time" 18 | 19 | "github.com/gorhill/cronexpr" 20 | ) 21 | 22 | /******************************************************************************/ 23 | 24 | // ExampleMustParse 25 | func ExampleMustParse() { 26 | t := time.Date(2013, time.August, 31, 0, 0, 0, 0, time.UTC) 27 | nextTimes := cronexpr.MustParse("0 0 29 2 *").NextN(t, 5) 28 | for i := range nextTimes { 29 | fmt.Println(nextTimes[i].Format(time.RFC1123)) 30 | // Output: 31 | // Mon, 29 Feb 2016 00:00:00 UTC 32 | // Sat, 29 Feb 2020 00:00:00 UTC 33 | // Thu, 29 Feb 2024 00:00:00 UTC 34 | // Tue, 29 Feb 2028 00:00:00 UTC 35 | // Sun, 29 Feb 2032 00:00:00 UTC 36 | } 37 | } 38 | -------------------------------------------------------------------------------- /cronexpr/main.go: -------------------------------------------------------------------------------- 1 | /*! 2 | * Copyright 2013 Raymond Hill 3 | * 4 | * Project: github.com/gorhill/cronexpr 5 | * File: main.go 6 | * Version: 1.0 7 | * License: GPL v3 see 8 | * 9 | */ 10 | 11 | package main 12 | 13 | /******************************************************************************/ 14 | 15 | import ( 16 | "flag" 17 | "fmt" 18 | "os" 19 | "time" 20 | 21 | "github.com/gorhill/cronexpr" 22 | ) 23 | 24 | /******************************************************************************/ 25 | 26 | var ( 27 | usage = func() { 28 | fmt.Fprintf(os.Stderr, "usage:\n %s [options] \"{cron expression}\"\noptions:\n", os.Args[0]) 29 | flag.PrintDefaults() 30 | } 31 | inTimeStr string 32 | outTimeCount uint 33 | outTimeLayout string 34 | ) 35 | 36 | /******************************************************************************/ 37 | 38 | func main() { 39 | var err error 40 | 41 | flag.Usage = usage 42 | flag.StringVar(&inTimeStr, "t", "", `whole or partial RFC3339 time value (i.e. "2006-01-02T15:04:05Z07:00") against which the cron expression is evaluated, now if not present`) 43 | flag.UintVar(&outTimeCount, "n", 1, `number of resulting time values to output`) 44 | flag.StringVar(&outTimeLayout, "l", "Mon, 02 Jan 2006 15:04:05 MST", `Go-compliant time layout to use for outputting time value(s), see `) 45 | flag.Parse() 46 | 47 | cronStr := flag.Arg(0) 48 | if len(cronStr) == 0 { 49 | flag.Usage() 50 | return 51 | } 52 | 53 | inTime := time.Now() 54 | inTimeLayout := "" 55 | timeStrLen := len(inTimeStr) 56 | if timeStrLen == 2 { 57 | inTimeLayout = "06" 58 | } else if timeStrLen >= 4 { 59 | inTimeLayout += "2006" 60 | if timeStrLen >= 7 { 61 | inTimeLayout += "-01" 62 | if timeStrLen >= 10 { 63 | inTimeLayout += "-02" 64 | if timeStrLen >= 13 { 65 | inTimeLayout += "T15" 66 | if timeStrLen >= 16 { 67 | inTimeLayout += ":04" 68 | if timeStrLen >= 19 { 69 | inTimeLayout += ":05" 70 | if timeStrLen >= 20 { 71 | inTimeLayout += "Z07:00" 72 | } 73 | } 74 | } 75 | } 76 | } 77 | } 78 | } 79 | 80 | if len(inTimeLayout) > 0 { 81 | // default to local time zone 82 | if timeStrLen < 20 { 83 | inTime, err = time.ParseInLocation(inTimeLayout, inTimeStr, time.Local) 84 | } else { 85 | inTime, err = time.Parse(inTimeLayout, inTimeStr) 86 | } 87 | if err != nil { 88 | fmt.Fprintf(os.Stderr, "# error: unparseable time value: \"%s\"\n", inTimeStr) 89 | os.Exit(1) 90 | } 91 | } 92 | 93 | expr, err := cronexpr.Parse(cronStr) 94 | if err != nil { 95 | fmt.Fprintf(os.Stderr, "# %s: %s\n", os.Args[0], err) 96 | os.Exit(1) 97 | } 98 | 99 | // Anything on the output which starts with '#' can be ignored if the caller 100 | // is interested only in the time values. There is only one time 101 | // value per line, and they are always in chronological ascending order. 102 | fmt.Printf("# \"%s\" + \"%s\" =\n", cronStr, inTime.Format(time.RFC3339)) 103 | 104 | if outTimeCount < 1 { 105 | outTimeCount = 1 106 | } 107 | outTimes := expr.NextN(inTime, outTimeCount) 108 | for _, outTime := range outTimes { 109 | fmt.Println(outTime.Format(outTimeLayout)) 110 | } 111 | } 112 | -------------------------------------------------------------------------------- /cronexpr/README.md: -------------------------------------------------------------------------------- 1 | cronexpr: command-line utility 2 | ============================== 3 | 4 | A command-line utility written in Go to evaluate cron time expressions. 5 | 6 | It is based on the standalone Go library . 7 | 8 | ## Install 9 | 10 | go get github.com/gorhill/cronexpr 11 | go install github.com/gorhill/cronexpr 12 | 13 | ## Usage 14 | 15 | cronexpr [options] "{cron expression}" 16 | 17 | ## Options 18 | 19 | `-l`: 20 | 21 | Go-compliant time layout to use for outputting time value(s), see . 22 | 23 | Default is `"Mon, 02 Jan 2006 15:04:05 MST"` 24 | 25 | `-n`: 26 | 27 | Number of resulting time values to output. 28 | 29 | Default is 1. 30 | 31 | `-t`: 32 | 33 | Whole or partial RFC3339 time value (i.e. `2006-01-02T15:04:05Z07:00`) against which the cron expression is evaluated. Examples of valid values include (assuming EST time zone): 34 | 35 | `13` = 2013-01-01T00:00:00-05:00 36 | `2013` = 2013-01-01T00:00:00-05:00 37 | `2013-08` = 2013-08-01T00:00:00-05:00 38 | `2013-08-31` = 2013-08-31T00:00:00-05:00 39 | `2013-08-31T12` = 2013-08-31T12:00:00-05:00 40 | `2013-08-31T12:40` = 2013-08-31T12:40:00-05:00 41 | `2013-08-31T12:40:35` = 2013-08-31T12:40:35-05:00 42 | `2013-08-31T12:40:35-10:00` = 2013-08-31T12:40:35-10:00 43 | 44 | Default time is current time, and default time zone is local time zone. 45 | 46 | ## Examples 47 | 48 | #### Example 1 49 | 50 | Midnight on December 31st of any year. 51 | 52 | Command: 53 | 54 | cronexpr -t="2013-08-31" -n=5 "0 0 31 12 *" 55 | 56 | Output (assuming computer is in EST time zone): 57 | 58 | # "0 0 31 12 *" + "2013-08-31T00:00:00-04:00" = 59 | Tue, 31 Dec 2013 00:00:00 EST 60 | Wed, 31 Dec 2014 00:00:00 EST 61 | Thu, 31 Dec 2015 00:00:00 EST 62 | Sat, 31 Dec 2016 00:00:00 EST 63 | Sun, 31 Dec 2017 00:00:00 EST 64 | 65 | #### Example 2 66 | 67 | 2pm on February 29th of any year. 68 | 69 | Command: 70 | 71 | cronexpr -t=2000 -n=10 "0 14 29 2 *" 72 | 73 | Output (assuming computer is in EST time zone): 74 | 75 | # "0 14 29 2 *" + "2000-01-01T00:00:00-05:00" = 76 | Tue, 29 Feb 2000 14:00:00 EST 77 | Sun, 29 Feb 2004 14:00:00 EST 78 | Fri, 29 Feb 2008 14:00:00 EST 79 | Wed, 29 Feb 2012 14:00:00 EST 80 | Mon, 29 Feb 2016 14:00:00 EST 81 | Sat, 29 Feb 2020 14:00:00 EST 82 | Thu, 29 Feb 2024 14:00:00 EST 83 | Tue, 29 Feb 2028 14:00:00 EST 84 | Sun, 29 Feb 2032 14:00:00 EST 85 | Fri, 29 Feb 2036 14:00:00 EST 86 | 87 | #### Example 3 88 | 89 | 12pm on the work day closest to the 15th of March and every three month 90 | thereafter. 91 | 92 | Command: 93 | 94 | cronexpr -t=2013-09-01 -n=5 "0 12 15W 3/3 *" 95 | 96 | Output (assuming computer is in EST time zone): 97 | 98 | # "0 12 15W 3/3 *" + "2013-09-01T00:00:00-04:00" = 99 | Mon, 16 Sep 2013 12:00:00 EDT 100 | Mon, 16 Dec 2013 12:00:00 EST 101 | Fri, 14 Mar 2014 12:00:00 EDT 102 | Mon, 16 Jun 2014 12:00:00 EDT 103 | Mon, 15 Sep 2014 12:00:00 EDT 104 | 105 | #### Example 4 106 | 107 | Midnight on the fifth Saturday of any month (twist: not all months have a 5th 108 | specific day of week). 109 | 110 | Command: 111 | 112 | cronexpr -t=2013-09-02 -n 5 "0 0 * * 6#5" 113 | 114 | Output (assuming computer is in EST time zone): 115 | 116 | # "0 0 * * 6#5" + "2013-09-02T00:00:00-04:00" = 117 | Sat, 30 Nov 2013 00:00:00 EST 118 | Sat, 29 Mar 2014 00:00:00 EDT 119 | Sat, 31 May 2014 00:00:00 EDT 120 | Sat, 30 Aug 2014 00:00:00 EDT 121 | Sat, 29 Nov 2014 00:00:00 EST 122 | 123 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | Golang Cron expression parser 2 | ============================= 3 | Given a cron expression and a time stamp, you can get the next time stamp which satisfies the cron expression. 4 | 5 | In another project, I decided to use cron expression syntax to encode scheduling information. Thus this standalone library to parse and apply time stamps to cron expressions. 6 | 7 | The time-matching algorithm in this implementation is efficient, it avoids as much as possible to guess the next matching time stamp, a common technique seen in a number of implementations out there. 8 | 9 | There is also a companion command-line utility to evaluate cron time expressions: (which of course uses this library). 10 | 11 | Implementation 12 | -------------- 13 | The reference documentation for this implementation is found at 14 | , which I copy/pasted here (laziness!) with modifications where this implementation differs: 15 | 16 | Field name Mandatory? Allowed values Allowed special characters 17 | ---------- ---------- -------------- -------------------------- 18 | Seconds No 0-59 * / , - 19 | Minutes Yes 0-59 * / , - 20 | Hours Yes 0-23 * / , - 21 | Day of month Yes 1-31 * / , - L W 22 | Month Yes 1-12 or JAN-DEC * / , - 23 | Day of week Yes 0-6 or SUN-SAT * / , - L # 24 | Year No 1970–2099 * / , - 25 | 26 | #### Asterisk ( * ) 27 | The asterisk indicates that the cron expression matches for all values of the field. E.g., using an asterisk in the 4th field (month) indicates every month. 28 | 29 | #### Slash ( / ) 30 | Slashes describe increments of ranges. For example `3-59/15` in the minute field indicate the third minute of the hour and every 15 minutes thereafter. The form `*/...` is equivalent to the form "first-last/...", that is, an increment over the largest possible range of the field. 31 | 32 | #### Comma ( , ) 33 | Commas are used to separate items of a list. For example, using `MON,WED,FRI` in the 5th field (day of week) means Mondays, Wednesdays and Fridays. 34 | 35 | #### Hyphen ( - ) 36 | Hyphens define ranges. For example, 2000-2010 indicates every year between 2000 and 2010 AD, inclusive. 37 | 38 | #### L 39 | `L` stands for "last". When used in the day-of-week field, it allows you to specify constructs such as "the last Friday" (`5L`) of a given month. In the day-of-month field, it specifies the last day of the month. 40 | 41 | #### W 42 | The `W` character is allowed for the day-of-month field. This character is used to specify the business day (Monday-Friday) nearest the given day. As an example, if you were to specify `15W` as the value for the day-of-month field, the meaning is: "the nearest business day to the 15th of the month." 43 | 44 | So, if the 15th is a Saturday, the trigger fires on Friday the 14th. If the 15th is a Sunday, the trigger fires on Monday the 16th. If the 15th is a Tuesday, then it fires on Tuesday the 15th. However if you specify `1W` as the value for day-of-month, and the 1st is a Saturday, the trigger fires on Monday the 3rd, as it does not 'jump' over the boundary of a month's days. 45 | 46 | The `W` character can be specified only when the day-of-month is a single day, not a range or list of days. 47 | 48 | The `W` character can also be combined with `L`, i.e. `LW` to mean "the last business day of the month." 49 | 50 | #### Hash ( # ) 51 | `#` is allowed for the day-of-week field, and must be followed by a number between one and five. It allows you to specify constructs such as "the second Friday" of a given month. 52 | 53 | Predefined cron expressions 54 | --------------------------- 55 | (Copied from , with text modified according to this implementation) 56 | 57 | Entry Description Equivalent to 58 | @annually Run once a year at midnight in the morning of January 1 0 0 0 1 1 * * 59 | @yearly Run once a year at midnight in the morning of January 1 0 0 0 1 1 * * 60 | @monthly Run once a month at midnight in the morning of the first of the month 0 0 0 1 * * * 61 | @weekly Run once a week at midnight in the morning of Sunday 0 0 0 * * 0 * 62 | @daily Run once a day at midnight 0 0 0 * * * * 63 | @hourly Run once an hour at the beginning of the hour 0 0 * * * * * 64 | @reboot Not supported 65 | 66 | Other details 67 | ------------- 68 | * If only six fields are present, a `0` second field is prepended, that is, `* * * * * 2013` internally become `0 * * * * * 2013`. 69 | * If only five fields are present, a `0` second field is prepended and a wildcard year field is appended, that is, `* * * * Mon` internally become `0 * * * * Mon *`. 70 | * Domain for day-of-week field is [0-7] instead of [0-6], 7 being Sunday (like 0). This to comply with http://linux.die.net/man/5/crontab#. 71 | * As of now, the behavior of the code is undetermined if a malformed cron expression is supplied 72 | 73 | Install 74 | ------- 75 | go get github.com/gorhill/cronexpr 76 | 77 | Usage 78 | ----- 79 | Import the library: 80 | 81 | import "github.com/gorhill/cronexpr" 82 | import "time" 83 | 84 | Simplest way: 85 | 86 | nextTime := cronexpr.MustParse("0 0 29 2 *").Next(time.Now()) 87 | 88 | Assuming `time.Now()` is "2013-08-29 09:28:00", then `nextTime` will be "2016-02-29 00:00:00". 89 | 90 | You can keep the returned Expression pointer around if you want to reuse it: 91 | 92 | expr := cronexpr.MustParse("0 0 29 2 *") 93 | nextTime := expr.Next(time.Now()) 94 | ... 95 | nextTime = expr.Next(nextTime) 96 | 97 | Use `time.IsZero()` to find out whether a valid time was returned. For example, 98 | 99 | cronexpr.MustParse("* * * * * 1980").Next(time.Now()).IsZero() 100 | 101 | will return `true`, whereas 102 | 103 | cronexpr.MustParse("* * * * * 2050").Next(time.Now()).IsZero() 104 | 105 | will return `false` (as of 2013-08-29...) 106 | 107 | You may also query for `n` next time stamps: 108 | 109 | cronexpr.MustParse("0 0 29 2 *").NextN(time.Now(), 5) 110 | 111 | which returns a slice of time.Time objects, containing the following time stamps (as of 2013-08-30): 112 | 113 | 2016-02-29 00:00:00 114 | 2020-02-29 00:00:00 115 | 2024-02-29 00:00:00 116 | 2028-02-29 00:00:00 117 | 2032-02-29 00:00:00 118 | 119 | The time zone of time values returned by `Next` and `NextN` is always the 120 | time zone of the time value passed as argument, unless a zero time value is 121 | returned. 122 | 123 | API 124 | --- 125 | 126 | 127 | License 128 | ------- 129 | 130 | License: pick the one which suits you best: 131 | 132 | - GPL v3 see 133 | - APL v2 see 134 | 135 | -------------------------------------------------------------------------------- /cronexpr.go: -------------------------------------------------------------------------------- 1 | /*! 2 | * Copyright 2013 Raymond Hill 3 | * 4 | * Project: github.com/gorhill/cronexpr 5 | * File: cronexpr.go 6 | * Version: 1.0 7 | * License: pick the one which suits you : 8 | * GPL v3 see 9 | * APL v2 see 10 | * 11 | */ 12 | 13 | // Package cronexpr parses cron time expressions. 14 | package cronexpr 15 | 16 | /******************************************************************************/ 17 | 18 | import ( 19 | "fmt" 20 | "sort" 21 | "time" 22 | ) 23 | 24 | /******************************************************************************/ 25 | 26 | // A Expression represents a specific cron time expression as defined at 27 | // 28 | type Expression struct { 29 | expression string 30 | secondList []int 31 | minuteList []int 32 | hourList []int 33 | daysOfMonth map[int]bool 34 | workdaysOfMonth map[int]bool 35 | lastDayOfMonth bool 36 | lastWorkdayOfMonth bool 37 | daysOfMonthRestricted bool 38 | actualDaysOfMonthList []int 39 | monthList []int 40 | daysOfWeek map[int]bool 41 | specificWeekDaysOfWeek map[int]bool 42 | lastWeekDaysOfWeek map[int]bool 43 | daysOfWeekRestricted bool 44 | yearList []int 45 | } 46 | 47 | /******************************************************************************/ 48 | 49 | // MustParse returns a new Expression pointer. It expects a well-formed cron 50 | // expression. If a malformed cron expression is supplied, it will `panic`. 51 | // See for documentation 52 | // about what is a well-formed cron expression from this library's point of 53 | // view. 54 | func MustParse(cronLine string) *Expression { 55 | expr, err := Parse(cronLine) 56 | if err != nil { 57 | panic(err) 58 | } 59 | return expr 60 | } 61 | 62 | /******************************************************************************/ 63 | 64 | // Parse returns a new Expression pointer. An error is returned if a malformed 65 | // cron expression is supplied. 66 | // See for documentation 67 | // about what is a well-formed cron expression from this library's point of 68 | // view. 69 | func Parse(cronLine string) (*Expression, error) { 70 | 71 | // Maybe one of the built-in aliases is being used 72 | cron := cronNormalizer.Replace(cronLine) 73 | 74 | indices := fieldFinder.FindAllStringIndex(cron, -1) 75 | fieldCount := len(indices) 76 | if fieldCount < 5 { 77 | return nil, fmt.Errorf("missing field(s)") 78 | } 79 | // ignore fields beyond 7th 80 | if fieldCount > 7 { 81 | fieldCount = 7 82 | } 83 | 84 | var expr = Expression{} 85 | var field = 0 86 | var err error 87 | 88 | // second field (optional) 89 | if fieldCount == 7 { 90 | err = expr.secondFieldHandler(cron[indices[field][0]:indices[field][1]]) 91 | if err != nil { 92 | return nil, err 93 | } 94 | field += 1 95 | } else { 96 | expr.secondList = []int{0} 97 | } 98 | 99 | // minute field 100 | err = expr.minuteFieldHandler(cron[indices[field][0]:indices[field][1]]) 101 | if err != nil { 102 | return nil, err 103 | } 104 | field += 1 105 | 106 | // hour field 107 | err = expr.hourFieldHandler(cron[indices[field][0]:indices[field][1]]) 108 | if err != nil { 109 | return nil, err 110 | } 111 | field += 1 112 | 113 | // day of month field 114 | err = expr.domFieldHandler(cron[indices[field][0]:indices[field][1]]) 115 | if err != nil { 116 | return nil, err 117 | } 118 | field += 1 119 | 120 | // month field 121 | err = expr.monthFieldHandler(cron[indices[field][0]:indices[field][1]]) 122 | if err != nil { 123 | return nil, err 124 | } 125 | field += 1 126 | 127 | // day of week field 128 | err = expr.dowFieldHandler(cron[indices[field][0]:indices[field][1]]) 129 | if err != nil { 130 | return nil, err 131 | } 132 | field += 1 133 | 134 | // year field 135 | if field < fieldCount { 136 | err = expr.yearFieldHandler(cron[indices[field][0]:indices[field][1]]) 137 | if err != nil { 138 | return nil, err 139 | } 140 | } else { 141 | expr.yearList = yearDescriptor.defaultList 142 | } 143 | 144 | return &expr, nil 145 | } 146 | 147 | /******************************************************************************/ 148 | 149 | // Next returns the closest time instant immediately following `fromTime` which 150 | // matches the cron expression `expr`. 151 | // 152 | // The `time.Location` of the returned time instant is the same as that of 153 | // `fromTime`. 154 | // 155 | // The zero value of time.Time is returned if no matching time instant exists 156 | // or if a `fromTime` is itself a zero value. 157 | func (expr *Expression) Next(fromTime time.Time) time.Time { 158 | // Special case 159 | if fromTime.IsZero() { 160 | return fromTime 161 | } 162 | 163 | // Since expr.nextSecond()-expr.nextMonth() expects that the 164 | // supplied time stamp is a perfect match to the underlying cron 165 | // expression, and since this function is an entry point where `fromTime` 166 | // does not necessarily matches the underlying cron expression, 167 | // we first need to ensure supplied time stamp matches 168 | // the cron expression. If not, this means the supplied time 169 | // stamp falls in between matching time stamps, thus we move 170 | // to closest future matching immediately upon encountering a mismatching 171 | // time stamp. 172 | 173 | // year 174 | v := fromTime.Year() 175 | i := sort.SearchInts(expr.yearList, v) 176 | if i == len(expr.yearList) { 177 | return time.Time{} 178 | } 179 | if v != expr.yearList[i] { 180 | return expr.nextYear(fromTime) 181 | } 182 | // month 183 | v = int(fromTime.Month()) 184 | i = sort.SearchInts(expr.monthList, v) 185 | if i == len(expr.monthList) { 186 | return expr.nextYear(fromTime) 187 | } 188 | if v != expr.monthList[i] { 189 | return expr.nextMonth(fromTime) 190 | } 191 | 192 | expr.actualDaysOfMonthList = expr.calculateActualDaysOfMonth(fromTime.Year(), int(fromTime.Month())) 193 | if len(expr.actualDaysOfMonthList) == 0 { 194 | return expr.nextMonth(fromTime) 195 | } 196 | 197 | // day of month 198 | v = fromTime.Day() 199 | i = sort.SearchInts(expr.actualDaysOfMonthList, v) 200 | if i == len(expr.actualDaysOfMonthList) { 201 | return expr.nextMonth(fromTime) 202 | } 203 | if v != expr.actualDaysOfMonthList[i] { 204 | return expr.nextDayOfMonth(fromTime) 205 | } 206 | // hour 207 | v = fromTime.Hour() 208 | i = sort.SearchInts(expr.hourList, v) 209 | if i == len(expr.hourList) { 210 | return expr.nextDayOfMonth(fromTime) 211 | } 212 | if v != expr.hourList[i] { 213 | return expr.nextHour(fromTime) 214 | } 215 | // minute 216 | v = fromTime.Minute() 217 | i = sort.SearchInts(expr.minuteList, v) 218 | if i == len(expr.minuteList) { 219 | return expr.nextHour(fromTime) 220 | } 221 | if v != expr.minuteList[i] { 222 | return expr.nextMinute(fromTime) 223 | } 224 | // second 225 | v = fromTime.Second() 226 | i = sort.SearchInts(expr.secondList, v) 227 | if i == len(expr.secondList) { 228 | return expr.nextMinute(fromTime) 229 | } 230 | 231 | // If we reach this point, there is nothing better to do 232 | // than to move to the next second 233 | 234 | return expr.nextSecond(fromTime) 235 | } 236 | 237 | /******************************************************************************/ 238 | 239 | // NextN returns a slice of `n` closest time instants immediately following 240 | // `fromTime` which match the cron expression `expr`. 241 | // 242 | // The time instants in the returned slice are in chronological ascending order. 243 | // The `time.Location` of the returned time instants is the same as that of 244 | // `fromTime`. 245 | // 246 | // A slice with len between [0-`n`] is returned, that is, if not enough existing 247 | // matching time instants exist, the number of returned entries will be less 248 | // than `n`. 249 | func (expr *Expression) NextN(fromTime time.Time, n uint) []time.Time { 250 | nextTimes := make([]time.Time, 0, n) 251 | if n > 0 { 252 | fromTime = expr.Next(fromTime) 253 | for { 254 | if fromTime.IsZero() { 255 | break 256 | } 257 | nextTimes = append(nextTimes, fromTime) 258 | n -= 1 259 | if n == 0 { 260 | break 261 | } 262 | fromTime = expr.nextSecond(fromTime) 263 | } 264 | } 265 | return nextTimes 266 | } 267 | -------------------------------------------------------------------------------- /cronexpr_next.go: -------------------------------------------------------------------------------- 1 | /*! 2 | * Copyright 2013 Raymond Hill 3 | * 4 | * Project: github.com/gorhill/cronexpr 5 | * File: cronexpr_next.go 6 | * Version: 1.0 7 | * License: pick the one which suits you : 8 | * GPL v3 see 9 | * APL v2 see 10 | * 11 | */ 12 | 13 | package cronexpr 14 | 15 | /******************************************************************************/ 16 | 17 | import ( 18 | "sort" 19 | "time" 20 | ) 21 | 22 | /******************************************************************************/ 23 | 24 | var dowNormalizedOffsets = [][]int{ 25 | {1, 8, 15, 22, 29}, 26 | {2, 9, 16, 23, 30}, 27 | {3, 10, 17, 24, 31}, 28 | {4, 11, 18, 25}, 29 | {5, 12, 19, 26}, 30 | {6, 13, 20, 27}, 31 | {7, 14, 21, 28}, 32 | } 33 | 34 | /******************************************************************************/ 35 | 36 | func (expr *Expression) nextYear(t time.Time) time.Time { 37 | // Find index at which item in list is greater or equal to 38 | // candidate year 39 | i := sort.SearchInts(expr.yearList, t.Year()+1) 40 | if i == len(expr.yearList) { 41 | return time.Time{} 42 | } 43 | // Year changed, need to recalculate actual days of month 44 | expr.actualDaysOfMonthList = expr.calculateActualDaysOfMonth(expr.yearList[i], expr.monthList[0]) 45 | if len(expr.actualDaysOfMonthList) == 0 { 46 | return expr.nextMonth(time.Date( 47 | expr.yearList[i], 48 | time.Month(expr.monthList[0]), 49 | 1, 50 | expr.hourList[0], 51 | expr.minuteList[0], 52 | expr.secondList[0], 53 | 0, 54 | t.Location())) 55 | } 56 | return time.Date( 57 | expr.yearList[i], 58 | time.Month(expr.monthList[0]), 59 | expr.actualDaysOfMonthList[0], 60 | expr.hourList[0], 61 | expr.minuteList[0], 62 | expr.secondList[0], 63 | 0, 64 | t.Location()) 65 | } 66 | 67 | /******************************************************************************/ 68 | 69 | func (expr *Expression) nextMonth(t time.Time) time.Time { 70 | // Find index at which item in list is greater or equal to 71 | // candidate month 72 | i := sort.SearchInts(expr.monthList, int(t.Month())+1) 73 | if i == len(expr.monthList) { 74 | return expr.nextYear(t) 75 | } 76 | // Month changed, need to recalculate actual days of month 77 | expr.actualDaysOfMonthList = expr.calculateActualDaysOfMonth(t.Year(), expr.monthList[i]) 78 | if len(expr.actualDaysOfMonthList) == 0 { 79 | return expr.nextMonth(time.Date( 80 | t.Year(), 81 | time.Month(expr.monthList[i]), 82 | 1, 83 | expr.hourList[0], 84 | expr.minuteList[0], 85 | expr.secondList[0], 86 | 0, 87 | t.Location())) 88 | } 89 | 90 | return time.Date( 91 | t.Year(), 92 | time.Month(expr.monthList[i]), 93 | expr.actualDaysOfMonthList[0], 94 | expr.hourList[0], 95 | expr.minuteList[0], 96 | expr.secondList[0], 97 | 0, 98 | t.Location()) 99 | } 100 | 101 | /******************************************************************************/ 102 | 103 | func (expr *Expression) nextDayOfMonth(t time.Time) time.Time { 104 | // Find index at which item in list is greater or equal to 105 | // candidate day of month 106 | i := sort.SearchInts(expr.actualDaysOfMonthList, t.Day()+1) 107 | if i == len(expr.actualDaysOfMonthList) { 108 | return expr.nextMonth(t) 109 | } 110 | 111 | return time.Date( 112 | t.Year(), 113 | t.Month(), 114 | expr.actualDaysOfMonthList[i], 115 | expr.hourList[0], 116 | expr.minuteList[0], 117 | expr.secondList[0], 118 | 0, 119 | t.Location()) 120 | } 121 | 122 | /******************************************************************************/ 123 | 124 | func (expr *Expression) nextHour(t time.Time) time.Time { 125 | // Find index at which item in list is greater or equal to 126 | // candidate hour 127 | i := sort.SearchInts(expr.hourList, t.Hour()+1) 128 | if i == len(expr.hourList) { 129 | return expr.nextDayOfMonth(t) 130 | } 131 | 132 | return time.Date( 133 | t.Year(), 134 | t.Month(), 135 | t.Day(), 136 | expr.hourList[i], 137 | expr.minuteList[0], 138 | expr.secondList[0], 139 | 0, 140 | t.Location()) 141 | } 142 | 143 | /******************************************************************************/ 144 | 145 | func (expr *Expression) nextMinute(t time.Time) time.Time { 146 | // Find index at which item in list is greater or equal to 147 | // candidate minute 148 | i := sort.SearchInts(expr.minuteList, t.Minute()+1) 149 | if i == len(expr.minuteList) { 150 | return expr.nextHour(t) 151 | } 152 | 153 | return time.Date( 154 | t.Year(), 155 | t.Month(), 156 | t.Day(), 157 | t.Hour(), 158 | expr.minuteList[i], 159 | expr.secondList[0], 160 | 0, 161 | t.Location()) 162 | } 163 | 164 | /******************************************************************************/ 165 | 166 | func (expr *Expression) nextSecond(t time.Time) time.Time { 167 | // nextSecond() assumes all other fields are exactly matched 168 | // to the cron expression 169 | 170 | // Find index at which item in list is greater or equal to 171 | // candidate second 172 | i := sort.SearchInts(expr.secondList, t.Second()+1) 173 | if i == len(expr.secondList) { 174 | return expr.nextMinute(t) 175 | } 176 | 177 | return time.Date( 178 | t.Year(), 179 | t.Month(), 180 | t.Day(), 181 | t.Hour(), 182 | t.Minute(), 183 | expr.secondList[i], 184 | 0, 185 | t.Location()) 186 | } 187 | 188 | /******************************************************************************/ 189 | 190 | func (expr *Expression) calculateActualDaysOfMonth(year, month int) []int { 191 | actualDaysOfMonthMap := make(map[int]bool) 192 | firstDayOfMonth := time.Date(year, time.Month(month), 1, 0, 0, 0, 0, time.UTC) 193 | lastDayOfMonth := firstDayOfMonth.AddDate(0, 1, -1) 194 | 195 | // As per crontab man page (http://linux.die.net/man/5/crontab#): 196 | // "The day of a command's execution can be specified by two 197 | // "fields - day of month, and day of week. If both fields are 198 | // "restricted (ie, aren't *), the command will be run when 199 | // "either field matches the current time" 200 | 201 | // If both fields are not restricted, all days of the month are a hit 202 | if expr.daysOfMonthRestricted == false && expr.daysOfWeekRestricted == false { 203 | return genericDefaultList[1 : lastDayOfMonth.Day()+1] 204 | } 205 | 206 | // day-of-month != `*` 207 | if expr.daysOfMonthRestricted { 208 | // Last day of month 209 | if expr.lastDayOfMonth { 210 | actualDaysOfMonthMap[lastDayOfMonth.Day()] = true 211 | } 212 | // Last work day of month 213 | if expr.lastWorkdayOfMonth { 214 | actualDaysOfMonthMap[workdayOfMonth(lastDayOfMonth, lastDayOfMonth)] = true 215 | } 216 | // Days of month 217 | for v := range expr.daysOfMonth { 218 | // Ignore days beyond end of month 219 | if v <= lastDayOfMonth.Day() { 220 | actualDaysOfMonthMap[v] = true 221 | } 222 | } 223 | // Work days of month 224 | // As per Wikipedia: month boundaries are not crossed. 225 | for v := range expr.workdaysOfMonth { 226 | // Ignore days beyond end of month 227 | if v <= lastDayOfMonth.Day() { 228 | actualDaysOfMonthMap[workdayOfMonth(firstDayOfMonth.AddDate(0, 0, v-1), lastDayOfMonth)] = true 229 | } 230 | } 231 | } 232 | 233 | // day-of-week != `*` 234 | if expr.daysOfWeekRestricted { 235 | // How far first sunday is from first day of month 236 | offset := 7 - int(firstDayOfMonth.Weekday()) 237 | // days of week 238 | // offset : (7 - day_of_week_of_1st_day_of_month) 239 | // target : 1 + (7 * week_of_month) + (offset + day_of_week) % 7 240 | for v := range expr.daysOfWeek { 241 | w := dowNormalizedOffsets[(offset+v)%7] 242 | actualDaysOfMonthMap[w[0]] = true 243 | actualDaysOfMonthMap[w[1]] = true 244 | actualDaysOfMonthMap[w[2]] = true 245 | actualDaysOfMonthMap[w[3]] = true 246 | if len(w) > 4 && w[4] <= lastDayOfMonth.Day() { 247 | actualDaysOfMonthMap[w[4]] = true 248 | } 249 | } 250 | // days of week of specific week in the month 251 | // offset : (7 - day_of_week_of_1st_day_of_month) 252 | // target : 1 + (7 * week_of_month) + (offset + day_of_week) % 7 253 | for v := range expr.specificWeekDaysOfWeek { 254 | v = 1 + 7*(v/7) + (offset+v)%7 255 | if v <= lastDayOfMonth.Day() { 256 | actualDaysOfMonthMap[v] = true 257 | } 258 | } 259 | // Last days of week of the month 260 | lastWeekOrigin := firstDayOfMonth.AddDate(0, 1, -7) 261 | offset = 7 - int(lastWeekOrigin.Weekday()) 262 | for v := range expr.lastWeekDaysOfWeek { 263 | v = lastWeekOrigin.Day() + (offset+v)%7 264 | if v <= lastDayOfMonth.Day() { 265 | actualDaysOfMonthMap[v] = true 266 | } 267 | } 268 | } 269 | 270 | return toList(actualDaysOfMonthMap) 271 | } 272 | 273 | func workdayOfMonth(targetDom, lastDom time.Time) int { 274 | // If saturday, then friday 275 | // If sunday, then monday 276 | dom := targetDom.Day() 277 | dow := targetDom.Weekday() 278 | if dow == time.Saturday { 279 | if dom > 1 { 280 | dom -= 1 281 | } else { 282 | dom += 2 283 | } 284 | } else if dow == time.Sunday { 285 | if dom < lastDom.Day() { 286 | dom += 1 287 | } else { 288 | dom -= 2 289 | } 290 | } 291 | return dom 292 | } 293 | -------------------------------------------------------------------------------- /cronexpr_test.go: -------------------------------------------------------------------------------- 1 | /*! 2 | * Copyright 2013 Raymond Hill 3 | * 4 | * Project: github.com/gorhill/cronexpr 5 | * File: cronexpr_test.go 6 | * Version: 1.0 7 | * License: pick the one which suits you best: 8 | * GPL v3 see 9 | * APL v2 see 10 | * 11 | */ 12 | 13 | package cronexpr_test 14 | 15 | /******************************************************************************/ 16 | 17 | import ( 18 | "testing" 19 | "time" 20 | 21 | "github.com/gorhill/cronexpr" 22 | ) 23 | 24 | /******************************************************************************/ 25 | 26 | type crontimes struct { 27 | from string 28 | next string 29 | } 30 | 31 | type crontest struct { 32 | expr string 33 | layout string 34 | times []crontimes 35 | } 36 | 37 | var crontests = []crontest{ 38 | // Seconds 39 | { 40 | "* * * * * * *", 41 | "2006-01-02 15:04:05", 42 | []crontimes{ 43 | {"2013-01-01 00:00:00", "2013-01-01 00:00:01"}, 44 | {"2013-01-01 00:00:59", "2013-01-01 00:01:00"}, 45 | {"2013-01-01 00:59:59", "2013-01-01 01:00:00"}, 46 | {"2013-01-01 23:59:59", "2013-01-02 00:00:00"}, 47 | {"2013-02-28 23:59:59", "2013-03-01 00:00:00"}, 48 | {"2016-02-28 23:59:59", "2016-02-29 00:00:00"}, 49 | {"2012-12-31 23:59:59", "2013-01-01 00:00:00"}, 50 | }, 51 | }, 52 | 53 | // every 5 Second 54 | { 55 | "*/5 * * * * * *", 56 | "2006-01-02 15:04:05", 57 | []crontimes{ 58 | {"2013-01-01 00:00:00", "2013-01-01 00:00:05"}, 59 | {"2013-01-01 00:00:59", "2013-01-01 00:01:00"}, 60 | {"2013-01-01 00:59:59", "2013-01-01 01:00:00"}, 61 | {"2013-01-01 23:59:59", "2013-01-02 00:00:00"}, 62 | {"2013-02-28 23:59:59", "2013-03-01 00:00:00"}, 63 | {"2016-02-28 23:59:59", "2016-02-29 00:00:00"}, 64 | {"2012-12-31 23:59:59", "2013-01-01 00:00:00"}, 65 | }, 66 | }, 67 | 68 | // Minutes 69 | { 70 | "* * * * *", 71 | "2006-01-02 15:04:05", 72 | []crontimes{ 73 | {"2013-01-01 00:00:00", "2013-01-01 00:01:00"}, 74 | {"2013-01-01 00:00:59", "2013-01-01 00:01:00"}, 75 | {"2013-01-01 00:59:00", "2013-01-01 01:00:00"}, 76 | {"2013-01-01 23:59:00", "2013-01-02 00:00:00"}, 77 | {"2013-02-28 23:59:00", "2013-03-01 00:00:00"}, 78 | {"2016-02-28 23:59:00", "2016-02-29 00:00:00"}, 79 | {"2012-12-31 23:59:00", "2013-01-01 00:00:00"}, 80 | }, 81 | }, 82 | 83 | // Minutes with interval 84 | { 85 | "17-43/5 * * * *", 86 | "2006-01-02 15:04:05", 87 | []crontimes{ 88 | {"2013-01-01 00:00:00", "2013-01-01 00:17:00"}, 89 | {"2013-01-01 00:16:59", "2013-01-01 00:17:00"}, 90 | {"2013-01-01 00:30:00", "2013-01-01 00:32:00"}, 91 | {"2013-01-01 00:50:00", "2013-01-01 01:17:00"}, 92 | {"2013-01-01 23:50:00", "2013-01-02 00:17:00"}, 93 | {"2013-02-28 23:50:00", "2013-03-01 00:17:00"}, 94 | {"2016-02-28 23:50:00", "2016-02-29 00:17:00"}, 95 | {"2012-12-31 23:50:00", "2013-01-01 00:17:00"}, 96 | }, 97 | }, 98 | 99 | // Minutes interval, list 100 | { 101 | "15-30/4,55 * * * *", 102 | "2006-01-02 15:04:05", 103 | []crontimes{ 104 | {"2013-01-01 00:00:00", "2013-01-01 00:15:00"}, 105 | {"2013-01-01 00:16:00", "2013-01-01 00:19:00"}, 106 | {"2013-01-01 00:30:00", "2013-01-01 00:55:00"}, 107 | {"2013-01-01 00:55:00", "2013-01-01 01:15:00"}, 108 | {"2013-01-01 23:55:00", "2013-01-02 00:15:00"}, 109 | {"2013-02-28 23:55:00", "2013-03-01 00:15:00"}, 110 | {"2016-02-28 23:55:00", "2016-02-29 00:15:00"}, 111 | {"2012-12-31 23:54:00", "2012-12-31 23:55:00"}, 112 | {"2012-12-31 23:55:00", "2013-01-01 00:15:00"}, 113 | }, 114 | }, 115 | 116 | // Days of week 117 | { 118 | "0 0 * * MON", 119 | "Mon 2006-01-02 15:04", 120 | []crontimes{ 121 | {"2013-01-01 00:00:00", "Mon 2013-01-07 00:00"}, 122 | {"2013-01-28 00:00:00", "Mon 2013-02-04 00:00"}, 123 | {"2013-12-30 00:30:00", "Mon 2014-01-06 00:00"}, 124 | }, 125 | }, 126 | { 127 | "0 0 * * friday", 128 | "Mon 2006-01-02 15:04", 129 | []crontimes{ 130 | {"2013-01-01 00:00:00", "Fri 2013-01-04 00:00"}, 131 | {"2013-01-28 00:00:00", "Fri 2013-02-01 00:00"}, 132 | {"2013-12-30 00:30:00", "Fri 2014-01-03 00:00"}, 133 | }, 134 | }, 135 | { 136 | "0 0 * * 6,7", 137 | "Mon 2006-01-02 15:04", 138 | []crontimes{ 139 | {"2013-01-01 00:00:00", "Sat 2013-01-05 00:00"}, 140 | {"2013-01-28 00:00:00", "Sat 2013-02-02 00:00"}, 141 | {"2013-12-30 00:30:00", "Sat 2014-01-04 00:00"}, 142 | }, 143 | }, 144 | 145 | // Specific days of week 146 | { 147 | "0 0 * * 6#5", 148 | "Mon 2006-01-02 15:04", 149 | []crontimes{ 150 | {"2013-09-02 00:00:00", "Sat 2013-11-30 00:00"}, 151 | }, 152 | }, 153 | 154 | // Work day of month 155 | { 156 | "0 0 14W * *", 157 | "Mon 2006-01-02 15:04", 158 | []crontimes{ 159 | {"2013-03-31 00:00:00", "Mon 2013-04-15 00:00"}, 160 | {"2013-08-31 00:00:00", "Fri 2013-09-13 00:00"}, 161 | }, 162 | }, 163 | 164 | // Work day of month -- end of month 165 | { 166 | "0 0 30W * *", 167 | "Mon 2006-01-02 15:04", 168 | []crontimes{ 169 | {"2013-03-02 00:00:00", "Fri 2013-03-29 00:00"}, 170 | {"2013-06-02 00:00:00", "Fri 2013-06-28 00:00"}, 171 | {"2013-09-02 00:00:00", "Mon 2013-09-30 00:00"}, 172 | {"2013-11-02 00:00:00", "Fri 2013-11-29 00:00"}, 173 | }, 174 | }, 175 | 176 | // Last day of month 177 | { 178 | "0 0 L * *", 179 | "Mon 2006-01-02 15:04", 180 | []crontimes{ 181 | {"2013-09-02 00:00:00", "Mon 2013-09-30 00:00"}, 182 | {"2014-01-01 00:00:00", "Fri 2014-01-31 00:00"}, 183 | {"2014-02-01 00:00:00", "Fri 2014-02-28 00:00"}, 184 | {"2016-02-15 00:00:00", "Mon 2016-02-29 00:00"}, 185 | }, 186 | }, 187 | 188 | // Last work day of month 189 | { 190 | "0 0 LW * *", 191 | "Mon 2006-01-02 15:04", 192 | []crontimes{ 193 | {"2013-09-02 00:00:00", "Mon 2013-09-30 00:00"}, 194 | {"2013-11-02 00:00:00", "Fri 2013-11-29 00:00"}, 195 | {"2014-08-15 00:00:00", "Fri 2014-08-29 00:00"}, 196 | }, 197 | }, 198 | 199 | // TODO: more tests 200 | } 201 | 202 | func TestExpressions(t *testing.T) { 203 | for _, test := range crontests { 204 | for _, times := range test.times { 205 | from, _ := time.Parse("2006-01-02 15:04:05", times.from) 206 | expr, err := cronexpr.Parse(test.expr) 207 | if err != nil { 208 | t.Errorf(`cronexpr.Parse("%s") returned "%s"`, test.expr, err.Error()) 209 | } 210 | next := expr.Next(from) 211 | nextstr := next.Format(test.layout) 212 | if nextstr != times.next { 213 | t.Errorf(`("%s").Next("%s") = "%s", got "%s"`, test.expr, times.from, times.next, nextstr) 214 | } 215 | } 216 | } 217 | } 218 | 219 | /******************************************************************************/ 220 | 221 | func TestZero(t *testing.T) { 222 | from, _ := time.Parse("2006-01-02", "2013-08-31") 223 | next := cronexpr.MustParse("* * * * * 1980").Next(from) 224 | if next.IsZero() == false { 225 | t.Error(`("* * * * * 1980").Next("2013-08-31").IsZero() returned 'false', expected 'true'`) 226 | } 227 | 228 | next = cronexpr.MustParse("* * * * * 2050").Next(from) 229 | if next.IsZero() == true { 230 | t.Error(`("* * * * * 2050").Next("2013-08-31").IsZero() returned 'true', expected 'false'`) 231 | } 232 | 233 | next = cronexpr.MustParse("* * * * * 2099").Next(time.Time{}) 234 | if next.IsZero() == false { 235 | t.Error(`("* * * * * 2014").Next(time.Time{}).IsZero() returned 'true', expected 'false'`) 236 | } 237 | } 238 | 239 | /******************************************************************************/ 240 | 241 | func TestNextN(t *testing.T) { 242 | expected := []string{ 243 | "Sat, 30 Nov 2013 00:00:00", 244 | "Sat, 29 Mar 2014 00:00:00", 245 | "Sat, 31 May 2014 00:00:00", 246 | "Sat, 30 Aug 2014 00:00:00", 247 | "Sat, 29 Nov 2014 00:00:00", 248 | } 249 | from, _ := time.Parse("2006-01-02 15:04:05", "2013-09-02 08:44:30") 250 | result := cronexpr.MustParse("0 0 * * 6#5").NextN(from, uint(len(expected))) 251 | if len(result) != len(expected) { 252 | t.Errorf(`MustParse("0 0 * * 6#5").NextN("2013-09-02 08:44:30", 5):\n"`) 253 | t.Errorf(` Expected %d returned time values but got %d instead`, len(expected), len(result)) 254 | } 255 | for i, next := range result { 256 | nextStr := next.Format("Mon, 2 Jan 2006 15:04:15") 257 | if nextStr != expected[i] { 258 | t.Errorf(`MustParse("0 0 * * 6#5").NextN("2013-09-02 08:44:30", 5):\n"`) 259 | t.Errorf(` result[%d]: expected "%s" but got "%s"`, i, expected[i], nextStr) 260 | } 261 | } 262 | } 263 | 264 | func TestNextN_every5min(t *testing.T) { 265 | expected := []string{ 266 | "Mon, 2 Sep 2013 08:45:00", 267 | "Mon, 2 Sep 2013 08:50:00", 268 | "Mon, 2 Sep 2013 08:55:00", 269 | "Mon, 2 Sep 2013 09:00:00", 270 | "Mon, 2 Sep 2013 09:05:00", 271 | } 272 | from, _ := time.Parse("2006-01-02 15:04:05", "2013-09-02 08:44:32") 273 | result := cronexpr.MustParse("*/5 * * * *").NextN(from, uint(len(expected))) 274 | if len(result) != len(expected) { 275 | t.Errorf(`MustParse("*/5 * * * *").NextN("2013-09-02 08:44:30", 5):\n"`) 276 | t.Errorf(` Expected %d returned time values but got %d instead`, len(expected), len(result)) 277 | } 278 | for i, next := range result { 279 | nextStr := next.Format("Mon, 2 Jan 2006 15:04:05") 280 | if nextStr != expected[i] { 281 | t.Errorf(`MustParse("*/5 * * * *").NextN("2013-09-02 08:44:30", 5):\n"`) 282 | t.Errorf(` result[%d]: expected "%s" but got "%s"`, i, expected[i], nextStr) 283 | } 284 | } 285 | } 286 | 287 | /******************************************************************************/ 288 | 289 | var benchmarkExpressions = []string{ 290 | "* * * * *", 291 | "@hourly", 292 | "@weekly", 293 | "@yearly", 294 | "30 3 15W 3/3 *", 295 | "30 0 0 1-31/5 Oct-Dec * 2000,2006,2008,2013-2015", 296 | "0 0 0 * Feb-Nov/2 thu#3 2000-2050", 297 | } 298 | var benchmarkExpressionsLen = len(benchmarkExpressions) 299 | 300 | func BenchmarkParse(b *testing.B) { 301 | for i := 0; i < b.N; i++ { 302 | _ = cronexpr.MustParse(benchmarkExpressions[i%benchmarkExpressionsLen]) 303 | } 304 | } 305 | 306 | func BenchmarkNext(b *testing.B) { 307 | exprs := make([]*cronexpr.Expression, benchmarkExpressionsLen) 308 | for i := 0; i < benchmarkExpressionsLen; i++ { 309 | exprs[i] = cronexpr.MustParse(benchmarkExpressions[i]) 310 | } 311 | from := time.Now() 312 | b.ResetTimer() 313 | for i := 0; i < b.N; i++ { 314 | expr := exprs[i%benchmarkExpressionsLen] 315 | next := expr.Next(from) 316 | next = expr.Next(next) 317 | next = expr.Next(next) 318 | next = expr.Next(next) 319 | next = expr.Next(next) 320 | } 321 | } 322 | -------------------------------------------------------------------------------- /APLv2: -------------------------------------------------------------------------------- 1 | 2 | Apache License 3 | Version 2.0, January 2004 4 | http://www.apache.org/licenses/ 5 | 6 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 7 | 8 | 1. Definitions. 9 | 10 | "License" shall mean the terms and conditions for use, reproduction, 11 | and distribution as defined by Sections 1 through 9 of this document. 12 | 13 | "Licensor" shall mean the copyright owner or entity authorized by 14 | the copyright owner that is granting the License. 15 | 16 | "Legal Entity" shall mean the union of the acting entity and all 17 | other entities that control, are controlled by, or are under common 18 | control with that entity. For the purposes of this definition, 19 | "control" means (i) the power, direct or indirect, to cause the 20 | direction or management of such entity, whether by contract or 21 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 22 | outstanding shares, or (iii) beneficial ownership of such entity. 23 | 24 | "You" (or "Your") shall mean an individual or Legal Entity 25 | exercising permissions granted by this License. 26 | 27 | "Source" form shall mean the preferred form for making modifications, 28 | including but not limited to software source code, documentation 29 | source, and configuration files. 30 | 31 | "Object" form shall mean any form resulting from mechanical 32 | transformation or translation of a Source form, including but 33 | not limited to compiled object code, generated documentation, 34 | and conversions to other media types. 35 | 36 | "Work" shall mean the work of authorship, whether in Source or 37 | Object form, made available under the License, as indicated by a 38 | copyright notice that is included in or attached to the work 39 | (an example is provided in the Appendix below). 40 | 41 | "Derivative Works" shall mean any work, whether in Source or Object 42 | form, that is based on (or derived from) the Work and for which the 43 | editorial revisions, annotations, elaborations, or other modifications 44 | represent, as a whole, an original work of authorship. For the purposes 45 | of this License, Derivative Works shall not include works that remain 46 | separable from, or merely link (or bind by name) to the interfaces of, 47 | the Work and Derivative Works thereof. 48 | 49 | "Contribution" shall mean any work of authorship, including 50 | the original version of the Work and any modifications or additions 51 | to that Work or Derivative Works thereof, that is intentionally 52 | submitted to Licensor for inclusion in the Work by the copyright owner 53 | or by an individual or Legal Entity authorized to submit on behalf of 54 | the copyright owner. For the purposes of this definition, "submitted" 55 | means any form of electronic, verbal, or written communication sent 56 | to the Licensor or its representatives, including but not limited to 57 | communication on electronic mailing lists, source code control systems, 58 | and issue tracking systems that are managed by, or on behalf of, the 59 | Licensor for the purpose of discussing and improving the Work, but 60 | excluding communication that is conspicuously marked or otherwise 61 | designated in writing by the copyright owner as "Not a Contribution." 62 | 63 | "Contributor" shall mean Licensor and any individual or Legal Entity 64 | on behalf of whom a Contribution has been received by Licensor and 65 | subsequently incorporated within the Work. 66 | 67 | 2. Grant of Copyright License. Subject to the terms and conditions of 68 | this License, each Contributor hereby grants to You a perpetual, 69 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 70 | copyright license to reproduce, prepare Derivative Works of, 71 | publicly display, publicly perform, sublicense, and distribute the 72 | Work and such Derivative Works in Source or Object form. 73 | 74 | 3. Grant of Patent License. Subject to the terms and conditions of 75 | this License, each Contributor hereby grants to You a perpetual, 76 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 77 | (except as stated in this section) patent license to make, have made, 78 | use, offer to sell, sell, import, and otherwise transfer the Work, 79 | where such license applies only to those patent claims licensable 80 | by such Contributor that are necessarily infringed by their 81 | Contribution(s) alone or by combination of their Contribution(s) 82 | with the Work to which such Contribution(s) was submitted. If You 83 | institute patent litigation against any entity (including a 84 | cross-claim or counterclaim in a lawsuit) alleging that the Work 85 | or a Contribution incorporated within the Work constitutes direct 86 | or contributory patent infringement, then any patent licenses 87 | granted to You under this License for that Work shall terminate 88 | as of the date such litigation is filed. 89 | 90 | 4. Redistribution. You may reproduce and distribute copies of the 91 | Work or Derivative Works thereof in any medium, with or without 92 | modifications, and in Source or Object form, provided that You 93 | meet the following conditions: 94 | 95 | (a) You must give any other recipients of the Work or 96 | Derivative Works a copy of this License; and 97 | 98 | (b) You must cause any modified files to carry prominent notices 99 | stating that You changed the files; and 100 | 101 | (c) You must retain, in the Source form of any Derivative Works 102 | that You distribute, all copyright, patent, trademark, and 103 | attribution notices from the Source form of the Work, 104 | excluding those notices that do not pertain to any part of 105 | the Derivative Works; and 106 | 107 | (d) If the Work includes a "NOTICE" text file as part of its 108 | distribution, then any Derivative Works that You distribute must 109 | include a readable copy of the attribution notices contained 110 | within such NOTICE file, excluding those notices that do not 111 | pertain to any part of the Derivative Works, in at least one 112 | of the following places: within a NOTICE text file distributed 113 | as part of the Derivative Works; within the Source form or 114 | documentation, if provided along with the Derivative Works; or, 115 | within a display generated by the Derivative Works, if and 116 | wherever such third-party notices normally appear. The contents 117 | of the NOTICE file are for informational purposes only and 118 | do not modify the License. You may add Your own attribution 119 | notices within Derivative Works that You distribute, alongside 120 | or as an addendum to the NOTICE text from the Work, provided 121 | that such additional attribution notices cannot be construed 122 | as modifying the License. 123 | 124 | You may add Your own copyright statement to Your modifications and 125 | may provide additional or different license terms and conditions 126 | for use, reproduction, or distribution of Your modifications, or 127 | for any such Derivative Works as a whole, provided Your use, 128 | reproduction, and distribution of the Work otherwise complies with 129 | the conditions stated in this License. 130 | 131 | 5. Submission of Contributions. Unless You explicitly state otherwise, 132 | any Contribution intentionally submitted for inclusion in the Work 133 | by You to the Licensor shall be under the terms and conditions of 134 | this License, without any additional terms or conditions. 135 | Notwithstanding the above, nothing herein shall supersede or modify 136 | the terms of any separate license agreement you may have executed 137 | with Licensor regarding such Contributions. 138 | 139 | 6. Trademarks. This License does not grant permission to use the trade 140 | names, trademarks, service marks, or product names of the Licensor, 141 | except as required for reasonable and customary use in describing the 142 | origin of the Work and reproducing the content of the NOTICE file. 143 | 144 | 7. Disclaimer of Warranty. Unless required by applicable law or 145 | agreed to in writing, Licensor provides the Work (and each 146 | Contributor provides its Contributions) on an "AS IS" BASIS, 147 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 148 | implied, including, without limitation, any warranties or conditions 149 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 150 | PARTICULAR PURPOSE. You are solely responsible for determining the 151 | appropriateness of using or redistributing the Work and assume any 152 | risks associated with Your exercise of permissions under this License. 153 | 154 | 8. Limitation of Liability. In no event and under no legal theory, 155 | whether in tort (including negligence), contract, or otherwise, 156 | unless required by applicable law (such as deliberate and grossly 157 | negligent acts) or agreed to in writing, shall any Contributor be 158 | liable to You for damages, including any direct, indirect, special, 159 | incidental, or consequential damages of any character arising as a 160 | result of this License or out of the use or inability to use the 161 | Work (including but not limited to damages for loss of goodwill, 162 | work stoppage, computer failure or malfunction, or any and all 163 | other commercial damages or losses), even if such Contributor 164 | has been advised of the possibility of such damages. 165 | 166 | 9. Accepting Warranty or Additional Liability. While redistributing 167 | the Work or Derivative Works thereof, You may choose to offer, 168 | and charge a fee for, acceptance of support, warranty, indemnity, 169 | or other liability obligations and/or rights consistent with this 170 | License. However, in accepting such obligations, You may act only 171 | on Your own behalf and on Your sole responsibility, not on behalf 172 | of any other Contributor, and only if You agree to indemnify, 173 | defend, and hold each Contributor harmless for any liability 174 | incurred by, or claims asserted against, such Contributor by reason 175 | of your accepting any such warranty or additional liability. 176 | 177 | END OF TERMS AND CONDITIONS 178 | 179 | APPENDIX: How to apply the Apache License to your work. 180 | 181 | To apply the Apache License to your work, attach the following 182 | boilerplate notice, with the fields enclosed by brackets "[]" 183 | replaced with your own identifying information. (Don't include 184 | the brackets!) The text should be enclosed in the appropriate 185 | comment syntax for the file format. We also recommend that a 186 | file or class name and description of purpose be included on the 187 | same "printed page" as the copyright notice for easier 188 | identification within third-party archives. 189 | 190 | Copyright [yyyy] [name of copyright owner] 191 | 192 | Licensed under the Apache License, Version 2.0 (the "License"); 193 | you may not use this file except in compliance with the License. 194 | You may obtain a copy of the License at 195 | 196 | http://www.apache.org/licenses/LICENSE-2.0 197 | 198 | Unless required by applicable law or agreed to in writing, software 199 | distributed under the License is distributed on an "AS IS" BASIS, 200 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 201 | See the License for the specific language governing permissions and 202 | limitations under the License. 203 | -------------------------------------------------------------------------------- /cronexpr_parse.go: -------------------------------------------------------------------------------- 1 | /*! 2 | * Copyright 2013 Raymond Hill 3 | * 4 | * Project: github.com/gorhill/cronexpr 5 | * File: cronexpr_parse.go 6 | * Version: 1.0 7 | * License: pick the one which suits you best: 8 | * GPL v3 see 9 | * APL v2 see 10 | * 11 | */ 12 | 13 | package cronexpr 14 | 15 | /******************************************************************************/ 16 | 17 | import ( 18 | "fmt" 19 | "regexp" 20 | "sort" 21 | "strings" 22 | ) 23 | 24 | /******************************************************************************/ 25 | 26 | var ( 27 | genericDefaultList = []int{ 28 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 29 | 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 30 | 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 31 | 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 32 | 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 33 | 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 34 | } 35 | yearDefaultList = []int{ 36 | 1970, 1971, 1972, 1973, 1974, 1975, 1976, 1977, 1978, 1979, 37 | 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 38 | 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 39 | 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 40 | 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 41 | 2020, 2021, 2022, 2023, 2024, 2025, 2026, 2027, 2028, 2029, 42 | 2030, 2031, 2032, 2033, 2034, 2035, 2036, 2037, 2038, 2039, 43 | 2040, 2041, 2042, 2043, 2044, 2045, 2046, 2047, 2048, 2049, 44 | 2050, 2051, 2052, 2053, 2054, 2055, 2056, 2057, 2058, 2059, 45 | 2060, 2061, 2062, 2063, 2064, 2065, 2066, 2067, 2068, 2069, 46 | 2070, 2071, 2072, 2073, 2074, 2075, 2076, 2077, 2078, 2079, 47 | 2080, 2081, 2082, 2083, 2084, 2085, 2086, 2087, 2088, 2089, 48 | 2090, 2091, 2092, 2093, 2094, 2095, 2096, 2097, 2098, 2099, 49 | } 50 | ) 51 | 52 | /******************************************************************************/ 53 | 54 | var ( 55 | numberTokens = map[string]int{ 56 | "0": 0, "1": 1, "2": 2, "3": 3, "4": 4, "5": 5, "6": 6, "7": 7, "8": 8, "9": 9, 57 | "00": 0, "01": 1, "02": 2, "03": 3, "04": 4, "05": 5, "06": 6, "07": 7, "08": 8, "09": 9, 58 | "10": 10, "11": 11, "12": 12, "13": 13, "14": 14, "15": 15, "16": 16, "17": 17, "18": 18, "19": 19, 59 | "20": 20, "21": 21, "22": 22, "23": 23, "24": 24, "25": 25, "26": 26, "27": 27, "28": 28, "29": 29, 60 | "30": 30, "31": 31, "32": 32, "33": 33, "34": 34, "35": 35, "36": 36, "37": 37, "38": 38, "39": 39, 61 | "40": 40, "41": 41, "42": 42, "43": 43, "44": 44, "45": 45, "46": 46, "47": 47, "48": 48, "49": 49, 62 | "50": 50, "51": 51, "52": 52, "53": 53, "54": 54, "55": 55, "56": 56, "57": 57, "58": 58, "59": 59, 63 | "1970": 1970, "1971": 1971, "1972": 1972, "1973": 1973, "1974": 1974, "1975": 1975, "1976": 1976, "1977": 1977, "1978": 1978, "1979": 1979, 64 | "1980": 1980, "1981": 1981, "1982": 1982, "1983": 1983, "1984": 1984, "1985": 1985, "1986": 1986, "1987": 1987, "1988": 1988, "1989": 1989, 65 | "1990": 1990, "1991": 1991, "1992": 1992, "1993": 1993, "1994": 1994, "1995": 1995, "1996": 1996, "1997": 1997, "1998": 1998, "1999": 1999, 66 | "2000": 2000, "2001": 2001, "2002": 2002, "2003": 2003, "2004": 2004, "2005": 2005, "2006": 2006, "2007": 2007, "2008": 2008, "2009": 2009, 67 | "2010": 2010, "2011": 2011, "2012": 2012, "2013": 2013, "2014": 2014, "2015": 2015, "2016": 2016, "2017": 2017, "2018": 2018, "2019": 2019, 68 | "2020": 2020, "2021": 2021, "2022": 2022, "2023": 2023, "2024": 2024, "2025": 2025, "2026": 2026, "2027": 2027, "2028": 2028, "2029": 2029, 69 | "2030": 2030, "2031": 2031, "2032": 2032, "2033": 2033, "2034": 2034, "2035": 2035, "2036": 2036, "2037": 2037, "2038": 2038, "2039": 2039, 70 | "2040": 2040, "2041": 2041, "2042": 2042, "2043": 2043, "2044": 2044, "2045": 2045, "2046": 2046, "2047": 2047, "2048": 2048, "2049": 2049, 71 | "2050": 2050, "2051": 2051, "2052": 2052, "2053": 2053, "2054": 2054, "2055": 2055, "2056": 2056, "2057": 2057, "2058": 2058, "2059": 2059, 72 | "2060": 2060, "2061": 2061, "2062": 2062, "2063": 2063, "2064": 2064, "2065": 2065, "2066": 2066, "2067": 2067, "2068": 2068, "2069": 2069, 73 | "2070": 2070, "2071": 2071, "2072": 2072, "2073": 2073, "2074": 2074, "2075": 2075, "2076": 2076, "2077": 2077, "2078": 2078, "2079": 2079, 74 | "2080": 2080, "2081": 2081, "2082": 2082, "2083": 2083, "2084": 2084, "2085": 2085, "2086": 2086, "2087": 2087, "2088": 2088, "2089": 2089, 75 | "2090": 2090, "2091": 2091, "2092": 2092, "2093": 2093, "2094": 2094, "2095": 2095, "2096": 2096, "2097": 2097, "2098": 2098, "2099": 2099, 76 | } 77 | monthTokens = map[string]int{ 78 | `1`: 1, `jan`: 1, `january`: 1, 79 | `2`: 2, `feb`: 2, `february`: 2, 80 | `3`: 3, `mar`: 3, `march`: 3, 81 | `4`: 4, `apr`: 4, `april`: 4, 82 | `5`: 5, `may`: 5, 83 | `6`: 6, `jun`: 6, `june`: 6, 84 | `7`: 7, `jul`: 7, `july`: 7, 85 | `8`: 8, `aug`: 8, `august`: 8, 86 | `9`: 9, `sep`: 9, `september`: 9, 87 | `10`: 10, `oct`: 10, `october`: 10, 88 | `11`: 11, `nov`: 11, `november`: 11, 89 | `12`: 12, `dec`: 12, `december`: 12, 90 | } 91 | dowTokens = map[string]int{ 92 | `0`: 0, `sun`: 0, `sunday`: 0, 93 | `1`: 1, `mon`: 1, `monday`: 1, 94 | `2`: 2, `tue`: 2, `tuesday`: 2, 95 | `3`: 3, `wed`: 3, `wednesday`: 3, 96 | `4`: 4, `thu`: 4, `thursday`: 4, 97 | `5`: 5, `fri`: 5, `friday`: 5, 98 | `6`: 6, `sat`: 6, `saturday`: 6, 99 | `7`: 0, 100 | } 101 | ) 102 | 103 | /******************************************************************************/ 104 | 105 | func atoi(s string) int { 106 | return numberTokens[s] 107 | } 108 | 109 | type fieldDescriptor struct { 110 | name string 111 | min, max int 112 | defaultList []int 113 | valuePattern string 114 | atoi func(string) int 115 | } 116 | 117 | var ( 118 | secondDescriptor = fieldDescriptor{ 119 | name: "second", 120 | min: 0, 121 | max: 59, 122 | defaultList: genericDefaultList[0:60], 123 | valuePattern: `0?[0-9]|[1-5][0-9]`, 124 | atoi: atoi, 125 | } 126 | minuteDescriptor = fieldDescriptor{ 127 | name: "minute", 128 | min: 0, 129 | max: 59, 130 | defaultList: genericDefaultList[0:60], 131 | valuePattern: `0?[0-9]|[1-5][0-9]`, 132 | atoi: atoi, 133 | } 134 | hourDescriptor = fieldDescriptor{ 135 | name: "hour", 136 | min: 0, 137 | max: 23, 138 | defaultList: genericDefaultList[0:24], 139 | valuePattern: `0?[0-9]|1[0-9]|2[0-3]`, 140 | atoi: atoi, 141 | } 142 | domDescriptor = fieldDescriptor{ 143 | name: "day-of-month", 144 | min: 1, 145 | max: 31, 146 | defaultList: genericDefaultList[1:32], 147 | valuePattern: `0?[1-9]|[12][0-9]|3[01]`, 148 | atoi: atoi, 149 | } 150 | monthDescriptor = fieldDescriptor{ 151 | name: "month", 152 | min: 1, 153 | max: 12, 154 | defaultList: genericDefaultList[1:13], 155 | valuePattern: `0?[1-9]|1[012]|jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec|january|february|march|april|march|april|june|july|august|september|october|november|december`, 156 | atoi: func(s string) int { 157 | return monthTokens[s] 158 | }, 159 | } 160 | dowDescriptor = fieldDescriptor{ 161 | name: "day-of-week", 162 | min: 0, 163 | max: 6, 164 | defaultList: genericDefaultList[0:7], 165 | valuePattern: `0?[0-7]|sun|mon|tue|wed|thu|fri|sat|sunday|monday|tuesday|wednesday|thursday|friday|saturday`, 166 | atoi: func(s string) int { 167 | return dowTokens[s] 168 | }, 169 | } 170 | yearDescriptor = fieldDescriptor{ 171 | name: "year", 172 | min: 1970, 173 | max: 2099, 174 | defaultList: yearDefaultList[:], 175 | valuePattern: `19[789][0-9]|20[0-9]{2}`, 176 | atoi: atoi, 177 | } 178 | ) 179 | 180 | /******************************************************************************/ 181 | 182 | var ( 183 | layoutWildcard = `^\*$|^\?$` 184 | layoutValue = `^(%value%)$` 185 | layoutRange = `^(%value%)-(%value%)$` 186 | layoutWildcardAndInterval = `^\*/(\d+)$` 187 | layoutValueAndInterval = `^(%value%)/(\d+)$` 188 | layoutRangeAndInterval = `^(%value%)-(%value%)/(\d+)$` 189 | layoutLastDom = `^l$` 190 | layoutWorkdom = `^(%value%)w$` 191 | layoutLastWorkdom = `^lw$` 192 | layoutDowOfLastWeek = `^(%value%)l$` 193 | layoutDowOfSpecificWeek = `^(%value%)#([1-5])$` 194 | fieldFinder = regexp.MustCompile(`\S+`) 195 | entryFinder = regexp.MustCompile(`[^,]+`) 196 | layoutRegexp = make(map[string]*regexp.Regexp) 197 | ) 198 | 199 | /******************************************************************************/ 200 | 201 | var cronNormalizer = strings.NewReplacer( 202 | "@yearly", "0 0 0 1 1 * *", 203 | "@annually", "0 0 0 1 1 * *", 204 | "@monthly", "0 0 0 1 * * *", 205 | "@weekly", "0 0 0 * * 0 *", 206 | "@daily", "0 0 0 * * * *", 207 | "@hourly", "0 0 * * * * *") 208 | 209 | /******************************************************************************/ 210 | 211 | func (expr *Expression) secondFieldHandler(s string) error { 212 | var err error 213 | expr.secondList, err = genericFieldHandler(s, secondDescriptor) 214 | return err 215 | } 216 | 217 | /******************************************************************************/ 218 | 219 | func (expr *Expression) minuteFieldHandler(s string) error { 220 | var err error 221 | expr.minuteList, err = genericFieldHandler(s, minuteDescriptor) 222 | return err 223 | } 224 | 225 | /******************************************************************************/ 226 | 227 | func (expr *Expression) hourFieldHandler(s string) error { 228 | var err error 229 | expr.hourList, err = genericFieldHandler(s, hourDescriptor) 230 | return err 231 | } 232 | 233 | /******************************************************************************/ 234 | 235 | func (expr *Expression) monthFieldHandler(s string) error { 236 | var err error 237 | expr.monthList, err = genericFieldHandler(s, monthDescriptor) 238 | return err 239 | } 240 | 241 | /******************************************************************************/ 242 | 243 | func (expr *Expression) yearFieldHandler(s string) error { 244 | var err error 245 | expr.yearList, err = genericFieldHandler(s, yearDescriptor) 246 | return err 247 | } 248 | 249 | /******************************************************************************/ 250 | 251 | const ( 252 | none = 0 253 | one = 1 254 | span = 2 255 | all = 3 256 | ) 257 | 258 | type cronDirective struct { 259 | kind int 260 | first int 261 | last int 262 | step int 263 | sbeg int 264 | send int 265 | } 266 | 267 | func genericFieldHandler(s string, desc fieldDescriptor) ([]int, error) { 268 | directives, err := genericFieldParse(s, desc) 269 | if err != nil { 270 | return nil, err 271 | } 272 | values := make(map[int]bool) 273 | for _, directive := range directives { 274 | switch directive.kind { 275 | case none: 276 | return nil, fmt.Errorf("syntax error in %s field: '%s'", desc.name, s[directive.sbeg:directive.send]) 277 | case one: 278 | populateOne(values, directive.first) 279 | case span: 280 | populateMany(values, directive.first, directive.last, directive.step) 281 | case all: 282 | return desc.defaultList, nil 283 | } 284 | } 285 | return toList(values), nil 286 | } 287 | 288 | func (expr *Expression) dowFieldHandler(s string) error { 289 | expr.daysOfWeekRestricted = true 290 | expr.daysOfWeek = make(map[int]bool) 291 | expr.lastWeekDaysOfWeek = make(map[int]bool) 292 | expr.specificWeekDaysOfWeek = make(map[int]bool) 293 | 294 | directives, err := genericFieldParse(s, dowDescriptor) 295 | if err != nil { 296 | return err 297 | } 298 | 299 | for _, directive := range directives { 300 | switch directive.kind { 301 | case none: 302 | sdirective := s[directive.sbeg:directive.send] 303 | snormal := strings.ToLower(sdirective) 304 | // `5L` 305 | pairs := makeLayoutRegexp(layoutDowOfLastWeek, dowDescriptor.valuePattern).FindStringSubmatchIndex(snormal) 306 | if len(pairs) > 0 { 307 | populateOne(expr.lastWeekDaysOfWeek, dowDescriptor.atoi(snormal[pairs[2]:pairs[3]])) 308 | } else { 309 | // `5#3` 310 | pairs := makeLayoutRegexp(layoutDowOfSpecificWeek, dowDescriptor.valuePattern).FindStringSubmatchIndex(snormal) 311 | if len(pairs) > 0 { 312 | populateOne(expr.specificWeekDaysOfWeek, (dowDescriptor.atoi(snormal[pairs[4]:pairs[5]])-1)*7+(dowDescriptor.atoi(snormal[pairs[2]:pairs[3]])%7)) 313 | } else { 314 | return fmt.Errorf("syntax error in day-of-week field: '%s'", sdirective) 315 | } 316 | } 317 | case one: 318 | populateOne(expr.daysOfWeek, directive.first) 319 | case span: 320 | populateMany(expr.daysOfWeek, directive.first, directive.last, directive.step) 321 | case all: 322 | populateMany(expr.daysOfWeek, directive.first, directive.last, directive.step) 323 | expr.daysOfWeekRestricted = false 324 | } 325 | } 326 | return nil 327 | } 328 | 329 | func (expr *Expression) domFieldHandler(s string) error { 330 | expr.daysOfMonthRestricted = true 331 | expr.lastDayOfMonth = false 332 | expr.lastWorkdayOfMonth = false 333 | expr.daysOfMonth = make(map[int]bool) // days of month map 334 | expr.workdaysOfMonth = make(map[int]bool) // work days of month map 335 | 336 | directives, err := genericFieldParse(s, domDescriptor) 337 | if err != nil { 338 | return err 339 | } 340 | 341 | for _, directive := range directives { 342 | switch directive.kind { 343 | case none: 344 | sdirective := s[directive.sbeg:directive.send] 345 | snormal := strings.ToLower(sdirective) 346 | // `L` 347 | if makeLayoutRegexp(layoutLastDom, domDescriptor.valuePattern).MatchString(snormal) { 348 | expr.lastDayOfMonth = true 349 | } else { 350 | // `LW` 351 | if makeLayoutRegexp(layoutLastWorkdom, domDescriptor.valuePattern).MatchString(snormal) { 352 | expr.lastWorkdayOfMonth = true 353 | } else { 354 | // `15W` 355 | pairs := makeLayoutRegexp(layoutWorkdom, domDescriptor.valuePattern).FindStringSubmatchIndex(snormal) 356 | if len(pairs) > 0 { 357 | populateOne(expr.workdaysOfMonth, domDescriptor.atoi(snormal[pairs[2]:pairs[3]])) 358 | } else { 359 | return fmt.Errorf("syntax error in day-of-month field: '%s'", sdirective) 360 | } 361 | } 362 | } 363 | case one: 364 | populateOne(expr.daysOfMonth, directive.first) 365 | case span: 366 | populateMany(expr.daysOfMonth, directive.first, directive.last, directive.step) 367 | case all: 368 | populateMany(expr.daysOfMonth, directive.first, directive.last, directive.step) 369 | expr.daysOfMonthRestricted = false 370 | } 371 | } 372 | return nil 373 | } 374 | 375 | /******************************************************************************/ 376 | 377 | func populateOne(values map[int]bool, v int) { 378 | values[v] = true 379 | } 380 | 381 | func populateMany(values map[int]bool, min, max, step int) { 382 | for i := min; i <= max; i += step { 383 | values[i] = true 384 | } 385 | } 386 | 387 | func toList(set map[int]bool) []int { 388 | list := make([]int, len(set)) 389 | i := 0 390 | for k := range set { 391 | list[i] = k 392 | i += 1 393 | } 394 | sort.Ints(list) 395 | return list 396 | } 397 | 398 | /******************************************************************************/ 399 | 400 | func genericFieldParse(s string, desc fieldDescriptor) ([]*cronDirective, error) { 401 | // At least one entry must be present 402 | indices := entryFinder.FindAllStringIndex(s, -1) 403 | if len(indices) == 0 { 404 | return nil, fmt.Errorf("%s field: missing directive", desc.name) 405 | } 406 | 407 | directives := make([]*cronDirective, 0, len(indices)) 408 | 409 | for i := range indices { 410 | directive := cronDirective{ 411 | sbeg: indices[i][0], 412 | send: indices[i][1], 413 | } 414 | snormal := strings.ToLower(s[indices[i][0]:indices[i][1]]) 415 | 416 | // `*` 417 | if makeLayoutRegexp(layoutWildcard, desc.valuePattern).MatchString(snormal) { 418 | directive.kind = all 419 | directive.first = desc.min 420 | directive.last = desc.max 421 | directive.step = 1 422 | directives = append(directives, &directive) 423 | continue 424 | } 425 | // `5` 426 | if makeLayoutRegexp(layoutValue, desc.valuePattern).MatchString(snormal) { 427 | directive.kind = one 428 | directive.first = desc.atoi(snormal) 429 | directives = append(directives, &directive) 430 | continue 431 | } 432 | // `5-20` 433 | pairs := makeLayoutRegexp(layoutRange, desc.valuePattern).FindStringSubmatchIndex(snormal) 434 | if len(pairs) > 0 { 435 | directive.kind = span 436 | directive.first = desc.atoi(snormal[pairs[2]:pairs[3]]) 437 | directive.last = desc.atoi(snormal[pairs[4]:pairs[5]]) 438 | directive.step = 1 439 | directives = append(directives, &directive) 440 | continue 441 | } 442 | // `*/2` 443 | pairs = makeLayoutRegexp(layoutWildcardAndInterval, desc.valuePattern).FindStringSubmatchIndex(snormal) 444 | if len(pairs) > 0 { 445 | directive.kind = span 446 | directive.first = desc.min 447 | directive.last = desc.max 448 | directive.step = atoi(snormal[pairs[2]:pairs[3]]) 449 | directives = append(directives, &directive) 450 | continue 451 | } 452 | // `5/2` 453 | pairs = makeLayoutRegexp(layoutValueAndInterval, desc.valuePattern).FindStringSubmatchIndex(snormal) 454 | if len(pairs) > 0 { 455 | directive.kind = span 456 | directive.first = desc.atoi(snormal[pairs[2]:pairs[3]]) 457 | directive.last = desc.max 458 | directive.step = atoi(snormal[pairs[4]:pairs[5]]) 459 | directives = append(directives, &directive) 460 | continue 461 | } 462 | // `5-20/2` 463 | pairs = makeLayoutRegexp(layoutRangeAndInterval, desc.valuePattern).FindStringSubmatchIndex(snormal) 464 | if len(pairs) > 0 { 465 | directive.kind = span 466 | directive.first = desc.atoi(snormal[pairs[2]:pairs[3]]) 467 | directive.last = desc.atoi(snormal[pairs[4]:pairs[5]]) 468 | directive.step = atoi(snormal[pairs[6]:pairs[7]]) 469 | directives = append(directives, &directive) 470 | continue 471 | } 472 | // No behavior for this one, let caller deal with it 473 | directive.kind = none 474 | directives = append(directives, &directive) 475 | } 476 | return directives, nil 477 | } 478 | 479 | /******************************************************************************/ 480 | 481 | func makeLayoutRegexp(layout, value string) *regexp.Regexp { 482 | layout = strings.Replace(layout, `%value%`, value, -1) 483 | re := layoutRegexp[layout] 484 | if re == nil { 485 | re = regexp.MustCompile(layout) 486 | layoutRegexp[layout] = re 487 | } 488 | return re 489 | } 490 | -------------------------------------------------------------------------------- /GPLv3: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. {http://fsf.org/} 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see {http://www.gnu.org/licenses/}. 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | cronexpr Copyright (C) 2013 Raymond Hill 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | {http://www.gnu.org/licenses/}. 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | {http://www.gnu.org/philosophy/why-not-lgpl.html}. 675 | --------------------------------------------------------------------------------