├── .dockerignore ├── .github └── FUNDING.yml ├── .gitignore ├── Dockerfile.bullseye ├── Dockerfile.generic ├── Dockerfile.upload ├── LICENSE ├── LICENSE3 ├── MANIFEST.in ├── Makefile ├── README.rst ├── changelog.txt ├── crontab ├── __init__.py └── _crontab.py ├── docker-compose.yaml ├── pyproject.toml ├── requirements.txt ├── requirements_old.txt ├── setup.py └── tests ├── __init__.py └── test_crontab.py /.dockerignore: -------------------------------------------------------------------------------- 1 | Makefile 2 | 3 | -------------------------------------------------------------------------------- /.github/FUNDING.yml: -------------------------------------------------------------------------------- 1 | github: [josiahcarlson] 2 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | *.pyc 2 | MANIFEST 3 | build/* 4 | dist/* 5 | -------------------------------------------------------------------------------- /Dockerfile.bullseye: -------------------------------------------------------------------------------- 1 | ARG PYTHON_VERSION="3.11" 2 | 3 | FROM python:${PYTHON_VERSION}-bullseye 4 | ARG PYTHON_VERSION 5 | ARG PY="python${PYTHON_VERSION}" 6 | 7 | ENV PYTHON_VERSION=$PYTHON_VERSION 8 | 9 | WORKDIR /app 10 | 11 | RUN ${PY} -m pip install --upgrade pip 12 | COPY requirements_old.txt . 13 | RUN ${PY} -m pip install -r requirements_old.txt 14 | 15 | # need crontab 16 | COPY crontab/*.py crontab/ 17 | # and need the tests too 18 | COPY tests/* crontab_tests/ 19 | 20 | CMD ${PY} -m crontab_tests.test_crontab 21 | -------------------------------------------------------------------------------- /Dockerfile.generic: -------------------------------------------------------------------------------- 1 | ARG PYTHON_VERSION="2.7" 2 | 3 | FROM python:${PYTHON_VERSION} 4 | ARG PYTHON_VERSION 5 | ARG PY="python${PYTHON_VERSION}" 6 | 7 | ENV PYTHON_VERSION=$PYTHON_VERSION 8 | 9 | WORKDIR /app 10 | 11 | RUN ${PY} -m pip install --upgrade pip 12 | COPY requirements_old.txt . 13 | RUN ${PY} -m pip install -r requirements_old.txt 14 | 15 | # need crontab 16 | COPY crontab/*.py crontab/ 17 | # and need the tests too 18 | COPY tests/* crontab_tests/ 19 | 20 | CMD ${PY} -m crontab_tests.test_crontab 21 | -------------------------------------------------------------------------------- /Dockerfile.upload: -------------------------------------------------------------------------------- 1 | ARG PYTHON_VERSION="3.11" 2 | 3 | FROM python:${PYTHON_VERSION}-bullseye 4 | ARG PYTHON_VERSION 5 | ARG PY="python${PYTHON_VERSION}" 6 | 7 | ENV PYTHON_VERSION=$PYTHON_VERSION 8 | 9 | WORKDIR /app 10 | 11 | RUN ${PY} -m pip install --upgrade pip 12 | COPY requirements.txt . 13 | RUN ${PY} -m pip install -r requirements.txt 14 | 15 | # need crontab 16 | COPY crontab/*.py crontab/ 17 | # and need the tests too 18 | COPY tests/* crontab_tests/ 19 | 20 | CMD ${PY} -m crontab_tests.test_crontab 21 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU LESSER GENERAL PUBLIC LICENSE 2 | Version 2.1, February 1999 3 | 4 | Copyright (C) 1991, 1999 Free Software Foundation, Inc. 5 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 6 | Everyone is permitted to copy and distribute verbatim copies 7 | of this license document, but changing it is not allowed. 8 | 9 | [This is the first released version of the Lesser GPL. It also counts 10 | as the successor of the GNU Library Public License, version 2, hence 11 | the version number 2.1.] 12 | 13 | Preamble 14 | 15 | The licenses for most software are designed to take away your 16 | freedom to share and change it. By contrast, the GNU General Public 17 | Licenses are intended to guarantee your freedom to share and change 18 | free software--to make sure the software is free for all its users. 19 | 20 | This license, the Lesser General Public License, applies to some 21 | specially designated software packages--typically libraries--of the 22 | Free Software Foundation and other authors who decide to use it. You 23 | can use it too, but we suggest you first think carefully about whether 24 | this license or the ordinary General Public License is the better 25 | strategy to use in any particular case, based on the explanations below. 26 | 27 | When we speak of free software, we are referring to freedom of use, 28 | not price. Our General Public Licenses are designed to make sure that 29 | you have the freedom to distribute copies of free software (and charge 30 | for this service if you wish); that you receive source code or can get 31 | it if you want it; that you can change the software and use pieces of 32 | it in new free programs; and that you are informed that you can do 33 | these things. 34 | 35 | To protect your rights, we need to make restrictions that forbid 36 | distributors to deny you these rights or to ask you to surrender these 37 | rights. These restrictions translate to certain responsibilities for 38 | you if you distribute copies of the library or if you modify it. 39 | 40 | For example, if you distribute copies of the library, whether gratis 41 | or for a fee, you must give the recipients all the rights that we gave 42 | you. You must make sure that they, too, receive or can get the source 43 | code. If you link other code with the library, you must provide 44 | complete object files to the recipients, so that they can relink them 45 | with the library after making changes to the library and recompiling 46 | it. And you must show them these terms so they know their rights. 47 | 48 | We protect your rights with a two-step method: (1) we copyright the 49 | library, and (2) we offer you this license, which gives you legal 50 | permission to copy, distribute and/or modify the library. 51 | 52 | To protect each distributor, we want to make it very clear that 53 | there is no warranty for the free library. Also, if the library is 54 | modified by someone else and passed on, the recipients should know 55 | that what they have is not the original version, so that the original 56 | author's reputation will not be affected by problems that might be 57 | introduced by others. 58 | 59 | Finally, software patents pose a constant threat to the existence of 60 | any free program. We wish to make sure that a company cannot 61 | effectively restrict the users of a free program by obtaining a 62 | restrictive license from a patent holder. Therefore, we insist that 63 | any patent license obtained for a version of the library must be 64 | consistent with the full freedom of use specified in this license. 65 | 66 | Most GNU software, including some libraries, is covered by the 67 | ordinary GNU General Public License. This license, the GNU Lesser 68 | General Public License, applies to certain designated libraries, and 69 | is quite different from the ordinary General Public License. We use 70 | this license for certain libraries in order to permit linking those 71 | libraries into non-free programs. 72 | 73 | When a program is linked with a library, whether statically or using 74 | a shared library, the combination of the two is legally speaking a 75 | combined work, a derivative of the original library. The ordinary 76 | General Public License therefore permits such linking only if the 77 | entire combination fits its criteria of freedom. The Lesser General 78 | Public License permits more lax criteria for linking other code with 79 | the library. 80 | 81 | We call this license the "Lesser" General Public License because it 82 | does Less to protect the user's freedom than the ordinary General 83 | Public License. It also provides other free software developers Less 84 | of an advantage over competing non-free programs. These disadvantages 85 | are the reason we use the ordinary General Public License for many 86 | libraries. However, the Lesser license provides advantages in certain 87 | special circumstances. 88 | 89 | For example, on rare occasions, there may be a special need to 90 | encourage the widest possible use of a certain library, so that it becomes 91 | a de-facto standard. To achieve this, non-free programs must be 92 | allowed to use the library. A more frequent case is that a free 93 | library does the same job as widely used non-free libraries. In this 94 | case, there is little to gain by limiting the free library to free 95 | software only, so we use the Lesser General Public License. 96 | 97 | In other cases, permission to use a particular library in non-free 98 | programs enables a greater number of people to use a large body of 99 | free software. For example, permission to use the GNU C Library in 100 | non-free programs enables many more people to use the whole GNU 101 | operating system, as well as its variant, the GNU/Linux operating 102 | system. 103 | 104 | Although the Lesser General Public License is Less protective of the 105 | users' freedom, it does ensure that the user of a program that is 106 | linked with the Library has the freedom and the wherewithal to run 107 | that program using a modified version of the Library. 108 | 109 | The precise terms and conditions for copying, distribution and 110 | modification follow. Pay close attention to the difference between a 111 | "work based on the library" and a "work that uses the library". The 112 | former contains code derived from the library, whereas the latter must 113 | be combined with the library in order to run. 114 | 115 | GNU LESSER GENERAL PUBLIC LICENSE 116 | TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 117 | 118 | 0. This License Agreement applies to any software library or other 119 | program which contains a notice placed by the copyright holder or 120 | other authorized party saying it may be distributed under the terms of 121 | this Lesser General Public License (also called "this License"). 122 | Each licensee is addressed as "you". 123 | 124 | A "library" means a collection of software functions and/or data 125 | prepared so as to be conveniently linked with application programs 126 | (which use some of those functions and data) to form executables. 127 | 128 | The "Library", below, refers to any such software library or work 129 | which has been distributed under these terms. A "work based on the 130 | Library" means either the Library or any derivative work under 131 | copyright law: that is to say, a work containing the Library or a 132 | portion of it, either verbatim or with modifications and/or translated 133 | straightforwardly into another language. (Hereinafter, translation is 134 | included without limitation in the term "modification".) 135 | 136 | "Source code" for a work means the preferred form of the work for 137 | making modifications to it. For a library, complete source code means 138 | all the source code for all modules it contains, plus any associated 139 | interface definition files, plus the scripts used to control compilation 140 | and installation of the library. 141 | 142 | Activities other than copying, distribution and modification are not 143 | covered by this License; they are outside its scope. The act of 144 | running a program using the Library is not restricted, and output from 145 | such a program is covered only if its contents constitute a work based 146 | on the Library (independent of the use of the Library in a tool for 147 | writing it). Whether that is true depends on what the Library does 148 | and what the program that uses the Library does. 149 | 150 | 1. You may copy and distribute verbatim copies of the Library's 151 | complete source code as you receive it, in any medium, provided that 152 | you conspicuously and appropriately publish on each copy an 153 | appropriate copyright notice and disclaimer of warranty; keep intact 154 | all the notices that refer to this License and to the absence of any 155 | warranty; and distribute a copy of this License along with the 156 | Library. 157 | 158 | You may charge a fee for the physical act of transferring a copy, 159 | and you may at your option offer warranty protection in exchange for a 160 | fee. 161 | 162 | 2. You may modify your copy or copies of the Library or any portion 163 | of it, thus forming a work based on the Library, and copy and 164 | distribute such modifications or work under the terms of Section 1 165 | above, provided that you also meet all of these conditions: 166 | 167 | a) The modified work must itself be a software library. 168 | 169 | b) You must cause the files modified to carry prominent notices 170 | stating that you changed the files and the date of any change. 171 | 172 | c) You must cause the whole of the work to be licensed at no 173 | charge to all third parties under the terms of this License. 174 | 175 | d) If a facility in the modified Library refers to a function or a 176 | table of data to be supplied by an application program that uses 177 | the facility, other than as an argument passed when the facility 178 | is invoked, then you must make a good faith effort to ensure that, 179 | in the event an application does not supply such function or 180 | table, the facility still operates, and performs whatever part of 181 | its purpose remains meaningful. 182 | 183 | (For example, a function in a library to compute square roots has 184 | a purpose that is entirely well-defined independent of the 185 | application. Therefore, Subsection 2d requires that any 186 | application-supplied function or table used by this function must 187 | be optional: if the application does not supply it, the square 188 | root function must still compute square roots.) 189 | 190 | These requirements apply to the modified work as a whole. If 191 | identifiable sections of that work are not derived from the Library, 192 | and can be reasonably considered independent and separate works in 193 | themselves, then this License, and its terms, do not apply to those 194 | sections when you distribute them as separate works. But when you 195 | distribute the same sections as part of a whole which is a work based 196 | on the Library, the distribution of the whole must be on the terms of 197 | this License, whose permissions for other licensees extend to the 198 | entire whole, and thus to each and every part regardless of who wrote 199 | it. 200 | 201 | Thus, it is not the intent of this section to claim rights or contest 202 | your rights to work written entirely by you; rather, the intent is to 203 | exercise the right to control the distribution of derivative or 204 | collective works based on the Library. 205 | 206 | In addition, mere aggregation of another work not based on the Library 207 | with the Library (or with a work based on the Library) on a volume of 208 | a storage or distribution medium does not bring the other work under 209 | the scope of this License. 210 | 211 | 3. You may opt to apply the terms of the ordinary GNU General Public 212 | License instead of this License to a given copy of the Library. To do 213 | this, you must alter all the notices that refer to this License, so 214 | that they refer to the ordinary GNU General Public License, version 2, 215 | instead of to this License. (If a newer version than version 2 of the 216 | ordinary GNU General Public License has appeared, then you can specify 217 | that version instead if you wish.) Do not make any other change in 218 | these notices. 219 | 220 | Once this change is made in a given copy, it is irreversible for 221 | that copy, so the ordinary GNU General Public License applies to all 222 | subsequent copies and derivative works made from that copy. 223 | 224 | This option is useful when you wish to copy part of the code of 225 | the Library into a program that is not a library. 226 | 227 | 4. You may copy and distribute the Library (or a portion or 228 | derivative of it, under Section 2) in object code or executable form 229 | under the terms of Sections 1 and 2 above provided that you accompany 230 | it with the complete corresponding machine-readable source code, which 231 | must be distributed under the terms of Sections 1 and 2 above on a 232 | medium customarily used for software interchange. 233 | 234 | If distribution of object code is made by offering access to copy 235 | from a designated place, then offering equivalent access to copy the 236 | source code from the same place satisfies the requirement to 237 | distribute the source code, even though third parties are not 238 | compelled to copy the source along with the object code. 239 | 240 | 5. A program that contains no derivative of any portion of the 241 | Library, but is designed to work with the Library by being compiled or 242 | linked with it, is called a "work that uses the Library". Such a 243 | work, in isolation, is not a derivative work of the Library, and 244 | therefore falls outside the scope of this License. 245 | 246 | However, linking a "work that uses the Library" with the Library 247 | creates an executable that is a derivative of the Library (because it 248 | contains portions of the Library), rather than a "work that uses the 249 | library". The executable is therefore covered by this License. 250 | Section 6 states terms for distribution of such executables. 251 | 252 | When a "work that uses the Library" uses material from a header file 253 | that is part of the Library, the object code for the work may be a 254 | derivative work of the Library even though the source code is not. 255 | Whether this is true is especially significant if the work can be 256 | linked without the Library, or if the work is itself a library. The 257 | threshold for this to be true is not precisely defined by law. 258 | 259 | If such an object file uses only numerical parameters, data 260 | structure layouts and accessors, and small macros and small inline 261 | functions (ten lines or less in length), then the use of the object 262 | file is unrestricted, regardless of whether it is legally a derivative 263 | work. (Executables containing this object code plus portions of the 264 | Library will still fall under Section 6.) 265 | 266 | Otherwise, if the work is a derivative of the Library, you may 267 | distribute the object code for the work under the terms of Section 6. 268 | Any executables containing that work also fall under Section 6, 269 | whether or not they are linked directly with the Library itself. 270 | 271 | 6. As an exception to the Sections above, you may also combine or 272 | link a "work that uses the Library" with the Library to produce a 273 | work containing portions of the Library, and distribute that work 274 | under terms of your choice, provided that the terms permit 275 | modification of the work for the customer's own use and reverse 276 | engineering for debugging such modifications. 277 | 278 | You must give prominent notice with each copy of the work that the 279 | Library is used in it and that the Library and its use are covered by 280 | this License. You must supply a copy of this License. If the work 281 | during execution displays copyright notices, you must include the 282 | copyright notice for the Library among them, as well as a reference 283 | directing the user to the copy of this License. Also, you must do one 284 | of these things: 285 | 286 | a) Accompany the work with the complete corresponding 287 | machine-readable source code for the Library including whatever 288 | changes were used in the work (which must be distributed under 289 | Sections 1 and 2 above); and, if the work is an executable linked 290 | with the Library, with the complete machine-readable "work that 291 | uses the Library", as object code and/or source code, so that the 292 | user can modify the Library and then relink to produce a modified 293 | executable containing the modified Library. (It is understood 294 | that the user who changes the contents of definitions files in the 295 | Library will not necessarily be able to recompile the application 296 | to use the modified definitions.) 297 | 298 | b) Use a suitable shared library mechanism for linking with the 299 | Library. A suitable mechanism is one that (1) uses at run time a 300 | copy of the library already present on the user's computer system, 301 | rather than copying library functions into the executable, and (2) 302 | will operate properly with a modified version of the library, if 303 | the user installs one, as long as the modified version is 304 | interface-compatible with the version that the work was made with. 305 | 306 | c) Accompany the work with a written offer, valid for at 307 | least three years, to give the same user the materials 308 | specified in Subsection 6a, above, for a charge no more 309 | than the cost of performing this distribution. 310 | 311 | d) If distribution of the work is made by offering access to copy 312 | from a designated place, offer equivalent access to copy the above 313 | specified materials from the same place. 314 | 315 | e) Verify that the user has already received a copy of these 316 | materials or that you have already sent this user a copy. 317 | 318 | For an executable, the required form of the "work that uses the 319 | Library" must include any data and utility programs needed for 320 | reproducing the executable from it. However, as a special exception, 321 | the materials to be distributed need not include anything that is 322 | normally distributed (in either source or binary form) with the major 323 | components (compiler, kernel, and so on) of the operating system on 324 | which the executable runs, unless that component itself accompanies 325 | the executable. 326 | 327 | It may happen that this requirement contradicts the license 328 | restrictions of other proprietary libraries that do not normally 329 | accompany the operating system. Such a contradiction means you cannot 330 | use both them and the Library together in an executable that you 331 | distribute. 332 | 333 | 7. You may place library facilities that are a work based on the 334 | Library side-by-side in a single library together with other library 335 | facilities not covered by this License, and distribute such a combined 336 | library, provided that the separate distribution of the work based on 337 | the Library and of the other library facilities is otherwise 338 | permitted, and provided that you do these two things: 339 | 340 | a) Accompany the combined library with a copy of the same work 341 | based on the Library, uncombined with any other library 342 | facilities. This must be distributed under the terms of the 343 | Sections above. 344 | 345 | b) Give prominent notice with the combined library of the fact 346 | that part of it is a work based on the Library, and explaining 347 | where to find the accompanying uncombined form of the same work. 348 | 349 | 8. You may not copy, modify, sublicense, link with, or distribute 350 | the Library except as expressly provided under this License. Any 351 | attempt otherwise to copy, modify, sublicense, link with, or 352 | distribute the Library is void, and will automatically terminate your 353 | rights under this License. However, parties who have received copies, 354 | or rights, from you under this License will not have their licenses 355 | terminated so long as such parties remain in full compliance. 356 | 357 | 9. You are not required to accept this License, since you have not 358 | signed it. However, nothing else grants you permission to modify or 359 | distribute the Library or its derivative works. These actions are 360 | prohibited by law if you do not accept this License. Therefore, by 361 | modifying or distributing the Library (or any work based on the 362 | Library), you indicate your acceptance of this License to do so, and 363 | all its terms and conditions for copying, distributing or modifying 364 | the Library or works based on it. 365 | 366 | 10. Each time you redistribute the Library (or any work based on the 367 | Library), the recipient automatically receives a license from the 368 | original licensor to copy, distribute, link with or modify the Library 369 | subject to these terms and conditions. You may not impose any further 370 | restrictions on the recipients' exercise of the rights granted herein. 371 | You are not responsible for enforcing compliance by third parties with 372 | this License. 373 | 374 | 11. If, as a consequence of a court judgment or allegation of patent 375 | infringement or for any other reason (not limited to patent issues), 376 | conditions are imposed on you (whether by court order, agreement or 377 | otherwise) that contradict the conditions of this License, they do not 378 | excuse you from the conditions of this License. If you cannot 379 | distribute so as to satisfy simultaneously your obligations under this 380 | License and any other pertinent obligations, then as a consequence you 381 | may not distribute the Library at all. For example, if a patent 382 | license would not permit royalty-free redistribution of the Library by 383 | all those who receive copies directly or indirectly through you, then 384 | the only way you could satisfy both it and this License would be to 385 | refrain entirely from distribution of the Library. 386 | 387 | If any portion of this section is held invalid or unenforceable under any 388 | particular circumstance, the balance of the section is intended to apply, 389 | and the section as a whole is intended to apply in other circumstances. 390 | 391 | It is not the purpose of this section to induce you to infringe any 392 | patents or other property right claims or to contest validity of any 393 | such claims; this section has the sole purpose of protecting the 394 | integrity of the free software distribution system which is 395 | implemented by public license practices. Many people have made 396 | generous contributions to the wide range of software distributed 397 | through that system in reliance on consistent application of that 398 | system; it is up to the author/donor to decide if he or she is willing 399 | to distribute software through any other system and a licensee cannot 400 | impose that choice. 401 | 402 | This section is intended to make thoroughly clear what is believed to 403 | be a consequence of the rest of this License. 404 | 405 | 12. If the distribution and/or use of the Library is restricted in 406 | certain countries either by patents or by copyrighted interfaces, the 407 | original copyright holder who places the Library under this License may add 408 | an explicit geographical distribution limitation excluding those countries, 409 | so that distribution is permitted only in or among countries not thus 410 | excluded. In such case, this License incorporates the limitation as if 411 | written in the body of this License. 412 | 413 | 13. The Free Software Foundation may publish revised and/or new 414 | versions of the Lesser General Public License from time to time. 415 | Such new versions will be similar in spirit to the present version, 416 | but may differ in detail to address new problems or concerns. 417 | 418 | Each version is given a distinguishing version number. If the Library 419 | specifies a version number of this License which applies to it and 420 | "any later version", you have the option of following the terms and 421 | conditions either of that version or of any later version published by 422 | the Free Software Foundation. If the Library does not specify a 423 | license version number, you may choose any version ever published by 424 | the Free Software Foundation. 425 | 426 | 14. If you wish to incorporate parts of the Library into other free 427 | programs whose distribution conditions are incompatible with these, 428 | write to the author to ask for permission. For software which is 429 | copyrighted by the Free Software Foundation, write to the Free 430 | Software Foundation; we sometimes make exceptions for this. Our 431 | decision will be guided by the two goals of preserving the free status 432 | of all derivatives of our free software and of promoting the sharing 433 | and reuse of software generally. 434 | 435 | NO WARRANTY 436 | 437 | 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO 438 | WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. 439 | EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR 440 | OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY 441 | KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE 442 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 443 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE 444 | LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME 445 | THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 446 | 447 | 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN 448 | WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY 449 | AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU 450 | FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR 451 | CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE 452 | LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING 453 | RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A 454 | FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF 455 | SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH 456 | DAMAGES. 457 | 458 | END OF TERMS AND CONDITIONS 459 | 460 | How to Apply These Terms to Your New Libraries 461 | 462 | If you develop a new library, and you want it to be of the greatest 463 | possible use to the public, we recommend making it free software that 464 | everyone can redistribute and change. You can do so by permitting 465 | redistribution under these terms (or, alternatively, under the terms of the 466 | ordinary General Public License). 467 | 468 | To apply these terms, attach the following notices to the library. It is 469 | safest to attach them to the start of each source file to most effectively 470 | convey the exclusion of warranty; and each file should have at least the 471 | "copyright" line and a pointer to where the full notice is found. 472 | 473 | 474 | Copyright (C) 475 | 476 | This library is free software; you can redistribute it and/or 477 | modify it under the terms of the GNU Lesser General Public 478 | License as published by the Free Software Foundation; either 479 | version 2.1 of the License, or (at your option) any later version. 480 | 481 | This library is distributed in the hope that it will be useful, 482 | but WITHOUT ANY WARRANTY; without even the implied warranty of 483 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 484 | Lesser General Public License for more details. 485 | 486 | You should have received a copy of the GNU Lesser General Public 487 | License along with this library; if not, write to the Free Software 488 | Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 489 | 490 | Also add information on how to contact you by electronic and paper mail. 491 | 492 | You should also get your employer (if you work as a programmer) or your 493 | school, if any, to sign a "copyright disclaimer" for the library, if 494 | necessary. Here is a sample; alter the names: 495 | 496 | Yoyodyne, Inc., hereby disclaims all copyright interest in the 497 | library `Frob' (a library for tweaking knobs) written by James Random Hacker. 498 | 499 | , 1 April 1990 500 | Ty Coon, President of Vice 501 | 502 | That's all there is to it! -------------------------------------------------------------------------------- /LICENSE3: -------------------------------------------------------------------------------- 1 | GNU LESSER GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | 9 | This version of the GNU Lesser General Public License incorporates 10 | the terms and conditions of version 3 of the GNU General Public 11 | License, supplemented by the additional permissions listed below. 12 | 13 | 0. Additional Definitions. 14 | 15 | As used herein, "this License" refers to version 3 of the GNU Lesser 16 | General Public License, and the "GNU GPL" refers to version 3 of the GNU 17 | General Public License. 18 | 19 | "The Library" refers to a covered work governed by this License, 20 | other than an Application or a Combined Work as defined below. 21 | 22 | An "Application" is any work that makes use of an interface provided 23 | by the Library, but which is not otherwise based on the Library. 24 | Defining a subclass of a class defined by the Library is deemed a mode 25 | of using an interface provided by the Library. 26 | 27 | A "Combined Work" is a work produced by combining or linking an 28 | Application with the Library. The particular version of the Library 29 | with which the Combined Work was made is also called the "Linked 30 | Version". 31 | 32 | The "Minimal Corresponding Source" for a Combined Work means the 33 | Corresponding Source for the Combined Work, excluding any source code 34 | for portions of the Combined Work that, considered in isolation, are 35 | based on the Application, and not on the Linked Version. 36 | 37 | The "Corresponding Application Code" for a Combined Work means the 38 | object code and/or source code for the Application, including any data 39 | and utility programs needed for reproducing the Combined Work from the 40 | Application, but excluding the System Libraries of the Combined Work. 41 | 42 | 1. Exception to Section 3 of the GNU GPL. 43 | 44 | You may convey a covered work under sections 3 and 4 of this License 45 | without being bound by section 3 of the GNU GPL. 46 | 47 | 2. Conveying Modified Versions. 48 | 49 | If you modify a copy of the Library, and, in your modifications, a 50 | facility refers to a function or data to be supplied by an Application 51 | that uses the facility (other than as an argument passed when the 52 | facility is invoked), then you may convey a copy of the modified 53 | version: 54 | 55 | a) under this License, provided that you make a good faith effort to 56 | ensure that, in the event an Application does not supply the 57 | function or data, the facility still operates, and performs 58 | whatever part of its purpose remains meaningful, or 59 | 60 | b) under the GNU GPL, with none of the additional permissions of 61 | this License applicable to that copy. 62 | 63 | 3. Object Code Incorporating Material from Library Header Files. 64 | 65 | The object code form of an Application may incorporate material from 66 | a header file that is part of the Library. You may convey such object 67 | code under terms of your choice, provided that, if the incorporated 68 | material is not limited to numerical parameters, data structure 69 | layouts and accessors, or small macros, inline functions and templates 70 | (ten or fewer lines in length), you do both of the following: 71 | 72 | a) Give prominent notice with each copy of the object code that the 73 | Library is used in it and that the Library and its use are 74 | covered by this License. 75 | 76 | b) Accompany the object code with a copy of the GNU GPL and this license 77 | document. 78 | 79 | 4. Combined Works. 80 | 81 | You may convey a Combined Work under terms of your choice that, 82 | taken together, effectively do not restrict modification of the 83 | portions of the Library contained in the Combined Work and reverse 84 | engineering for debugging such modifications, if you also do each of 85 | the following: 86 | 87 | a) Give prominent notice with each copy of the Combined Work that 88 | the Library is used in it and that the Library and its use are 89 | covered by this License. 90 | 91 | b) Accompany the Combined Work with a copy of the GNU GPL and this license 92 | document. 93 | 94 | c) For a Combined Work that displays copyright notices during 95 | execution, include the copyright notice for the Library among 96 | these notices, as well as a reference directing the user to the 97 | copies of the GNU GPL and this license document. 98 | 99 | d) Do one of the following: 100 | 101 | 0) Convey the Minimal Corresponding Source under the terms of this 102 | License, and the Corresponding Application Code in a form 103 | suitable for, and under terms that permit, the user to 104 | recombine or relink the Application with a modified version of 105 | the Linked Version to produce a modified Combined Work, in the 106 | manner specified by section 6 of the GNU GPL for conveying 107 | Corresponding Source. 108 | 109 | 1) Use a suitable shared library mechanism for linking with the 110 | Library. A suitable mechanism is one that (a) uses at run time 111 | a copy of the Library already present on the user's computer 112 | system, and (b) will operate properly with a modified version 113 | of the Library that is interface-compatible with the Linked 114 | Version. 115 | 116 | e) Provide Installation Information, but only if you would otherwise 117 | be required to provide such information under section 6 of the 118 | GNU GPL, and only to the extent that such information is 119 | necessary to install and execute a modified version of the 120 | Combined Work produced by recombining or relinking the 121 | Application with a modified version of the Linked Version. (If 122 | you use option 4d0, the Installation Information must accompany 123 | the Minimal Corresponding Source and Corresponding Application 124 | Code. If you use option 4d1, you must provide the Installation 125 | Information in the manner specified by section 6 of the GNU GPL 126 | for conveying Corresponding Source.) 127 | 128 | 5. Combined Libraries. 129 | 130 | You may place library facilities that are a work based on the 131 | Library side by side in a single library together with other library 132 | facilities that are not Applications and are not covered by this 133 | License, and convey such a combined library under terms of your 134 | choice, if you do both of the following: 135 | 136 | a) Accompany the combined library with a copy of the same work based 137 | on the Library, uncombined with any other library facilities, 138 | conveyed under the terms of this License. 139 | 140 | b) Give prominent notice with the combined library that part of it 141 | is a work based on the Library, and explaining where to find the 142 | accompanying uncombined form of the same work. 143 | 144 | 6. Revised Versions of the GNU Lesser General Public License. 145 | 146 | The Free Software Foundation may publish revised and/or new versions 147 | of the GNU Lesser General Public License from time to time. Such new 148 | versions will be similar in spirit to the present version, but may 149 | differ in detail to address new problems or concerns. 150 | 151 | Each version is given a distinguishing version number. If the 152 | Library as you received it specifies that a certain numbered version 153 | of the GNU Lesser General Public License "or any later version" 154 | applies to it, you have the option of following the terms and 155 | conditions either of that published version or of any later version 156 | published by the Free Software Foundation. If the Library as you 157 | received it does not specify a version number of the GNU Lesser 158 | General Public License, you may choose any version of the GNU Lesser 159 | General Public License ever published by the Free Software Foundation. 160 | 161 | If the Library as you received it specifies that a proxy can decide 162 | whether future versions of the GNU Lesser General Public License shall 163 | apply, that proxy's public statement of acceptance of any version is 164 | permanent authorization for you to choose that version for the 165 | Library. 166 | -------------------------------------------------------------------------------- /MANIFEST.in: -------------------------------------------------------------------------------- 1 | include LICENSE 2 | include LICENSE3 3 | include README.rst 4 | 5 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | 2 | FILES=`ls docker-compose.*.yaml` 3 | # A little nasty here, but we can do it! 4 | # The grep finds the 'rom-test-' in the .yaml 5 | # The sed removes extra spaces and colons 6 | # Which we pass into our rebuild 7 | GET_TARGET=grep crontab-test $${target} | sed 's/[ :]//g' 8 | GET_TARGET2=grep crontab-test-$${target} docker-compose.yaml | sed 's/[ :]//g' 9 | 10 | SHELL=/bin/bash 11 | # You can set these variables from the command line. 12 | SPHINXOPTS = 13 | SPHINXBUILD = sphinx-build 14 | PAPER = 15 | BUILDDIR = _build 16 | # Internal variables. 17 | PAPEROPT_a4 = -D latex_paper_size=a4 18 | PAPEROPT_letter = -D latex_paper_size=letter 19 | ALLSPHINXOPTS = -d $(BUILDDIR)/doctrees $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) source 20 | # the i18n builder cannot share the environment and doctrees with the others 21 | I18NSPHINXOPTS = $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) source 22 | 23 | .PHONY: clean docs test 24 | 25 | default: perms 26 | find . -type f | sudo xargs chmod -x 27 | 28 | perms: 29 | -sudo chown ${USER}:${USER} -R . 30 | 31 | clean: default 32 | -rm -f *.pyc crontab/*.pyc README.html MANIFEST 33 | -rm -rf build crontab.egg-info 34 | 35 | compose-build-all: 36 | docker-compose build 37 | 38 | compose-build-%: 39 | for target in $(patsubst compose-build-%,%,$@) ; do \ 40 | docker-compose build `${GET_TARGET2}`; \ 41 | done 42 | 43 | testall: 44 | make -j1 test-3.13 test-3.12 test-3.11 test-3.10 test-3.9 test-3.8 test-3.7 test-3.6 test-3.5 test-3.4 test-2.7 45 | 46 | test-%: 47 | # the test container runs the tests on up, then does an exit 0 when done 48 | for target in $(patsubst test-%,%,$@) ; do \ 49 | docker-compose run --rm `${GET_TARGET2}` ; \ 50 | done 51 | 52 | upload: 53 | docker-compose run --rm -w /source crontab-test-uploader python3.13 -m build --sdist 54 | docker-compose run --rm -w /source crontab-test-uploader python3.13 -m twine upload --skip-existing dist/*.tar.gz 55 | make perms 56 | -------------------------------------------------------------------------------- /README.rst: -------------------------------------------------------------------------------- 1 | 2 | Copyright 2011-2021 Josiah Carlson 3 | 4 | Released under the LGPL license version 2.1 and version 3 (you can choose 5 | which you'd like to be bound under). 6 | 7 | Description 8 | =========== 9 | 10 | This package intends to offer a method of parsing crontab schedule entries and 11 | determining when an item should next be run. More specifically, it calculates 12 | a delay in seconds from when the .next() method is called to when the item 13 | should next be executed. 14 | 15 | Comparing the below chart to http://en.wikipedia.org/wiki/Cron#CRON_expression 16 | you will note that W and # symbols are not supported. 17 | 18 | ============= =========== ================= ============== =========================== 19 | Field Name Mandatory Allowed Values Default Value Allowed Special Characters 20 | ============= =========== ================= ============== =========================== 21 | Seconds No 0-59 0 \* / , - 22 | Minutes Yes 0-59 N/A \* / , - 23 | Hours Yes 0-23 N/A \* / , - 24 | Day of month Yes 1-31 N/A \* / , - ? L 25 | Month Yes 1-12 or JAN-DEC N/A \* / , - 26 | Day of week Yes 0-6 or SUN-SAT N/A \* / , - ? L 27 | Year No 1970-2099 * \* / , - 28 | ============= =========== ================= ============== =========================== 29 | 30 | If your cron entry has 5 values, minutes-day of week are used, default seconds 31 | is and default year is appended. If your cron entry has 6 values, minutes-year 32 | are used, and default seconds are prepended. 33 | 34 | As such, only 5-7 value crontab entries are accepted (and mangled to 7 values, 35 | as necessary). 36 | 37 | 38 | Sample individual crontab fields 39 | ================================ 40 | 41 | Examples of supported entries are as follows:: 42 | 43 | * 44 | */5 45 | 7/8 46 | 3-25/7 47 | 3,7,9 48 | 0-10,30-40/5 49 | 50 | For month or day of week entries, 3 letter abbreviations of the month or day 51 | can be used to the left of any optional / where a number could be used. 52 | 53 | For days of the week:: 54 | 55 | mon-fri 56 | sun-thu/2 57 | 58 | For month:: 59 | 60 | apr-jul 61 | mar-sep/3 62 | 63 | Installation 64 | ============ 65 | 66 | :: 67 | 68 | pip install crontab 69 | 70 | 71 | Example uses 72 | ============ 73 | 74 | :: 75 | 76 | >>> from crontab import CronTab 77 | >>> from datetime import datetime 78 | >>> # define the crontab for 25 minutes past the hour every hour 79 | ... entry = CronTab('25 * * * *') 80 | >>> # find the delay from when this was run (around 11:13AM) 81 | ... entry.next() 82 | 720.81637899999998 83 | >>> # find the delay from when it was last scheduled 84 | ... entry.next(datetime(2011, 7, 17, 11, 25)) 85 | 3600.0 86 | 87 | 88 | 89 | 90 | Notes 91 | ===== 92 | 93 | At most one of 'day of week' or 'day of month' can be a value other than '?' 94 | or '*'. We violate spec here and allow '*' to be an alias for '?', in the case 95 | where one of those values is specified (seeing as some platforms don't support 96 | '?'). 97 | 98 | This module also supports the convenient aliases:: 99 | 100 | @yearly 101 | @annually 102 | @monthly 103 | @weekly 104 | @daily 105 | @hourly 106 | 107 | Example full crontab entries and their meanings:: 108 | 109 | 30 */2 * * * -> 30 minutes past the hour every 2 hours 110 | 15,45 23 * * * -> 11:15PM and 11:45PM every day 111 | 0 1 ? * SUN -> 1AM every Sunday 112 | 0 1 * * SUN -> 1AM every Sunday (same as above) 113 | 0 0 1 jan/2 * 2011-2013 -> 114 | midnight on January 1, 2011 and the first of every odd month until 115 | the end of 2013 116 | 24 7 L * * -> 7:24 AM on the last day of every month 117 | 24 7 * * L5 -> 7:24 AM on the last friday of every month 118 | 24 7 * * Lwed-fri -> 119 | 7:24 AM on the last wednesday, thursday, and friday of every month 120 | -------------------------------------------------------------------------------- /changelog.txt: -------------------------------------------------------------------------------- 1 | # changes in verion 1.0.1 2 | [added] merge PR #41 3 | 4 | # changes in version 1.0.0 5 | [added] this file, good to dcoument stuff 6 | [added] docker-compose and Docker files for different python runtimes 7 | -------------------------------------------------------------------------------- /crontab/__init__.py: -------------------------------------------------------------------------------- 1 | 2 | from ._crontab import CronTab 3 | 4 | __all__ = ['CronTab'] 5 | -------------------------------------------------------------------------------- /crontab/_crontab.py: -------------------------------------------------------------------------------- 1 | 2 | ''' 3 | crontab.py 4 | 5 | Written July 15, 2011 by Josiah Carlson 6 | Copyright 2011-2021 Josiah Carlson 7 | Released under the GNU LGPL v2.1 and v3 8 | available: 9 | http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html 10 | http://www.gnu.org/licenses/lgpl.html 11 | 12 | Other licenses may be available upon request. 13 | 14 | ''' 15 | 16 | from collections import namedtuple 17 | from datetime import datetime, timedelta 18 | import random 19 | import sys 20 | import warnings 21 | 22 | _ranges = [ 23 | (0, 59), 24 | (0, 59), 25 | (0, 23), 26 | (1, 31), 27 | (1, 12), 28 | (0, 6), 29 | (1970, 2099), 30 | ] 31 | 32 | ENTRIES = len(_ranges) 33 | SECOND_OFFSET, MINUTE_OFFSET, HOUR_OFFSET, DAY_OFFSET, MONTH_OFFSET, WEEK_OFFSET, YEAR_OFFSET = range(ENTRIES) 34 | 35 | _attribute = [ 36 | 'second', 37 | 'minute', 38 | 'hour', 39 | 'day', 40 | 'month', 41 | 'isoweekday', 42 | 'year' 43 | ] 44 | _alternate = { 45 | MONTH_OFFSET: {'jan': 1, 'feb': 2, 'mar': 3, 'apr': 4, 'may': 5, 'jun': 6, 46 | 'jul': 7, 'aug': 8, 'sep': 9, 'oct': 10, 'nov':11, 'dec':12}, 47 | WEEK_OFFSET: {'sun': 0, 'mon': 1, 'tue': 2, 'wed': 3, 'thu': 4, 'fri': 5, 48 | 'sat': 6}, 49 | } 50 | _aliases = { 51 | '@yearly': '0 0 1 1 *', 52 | '@annually': '0 0 1 1 *', 53 | '@monthly': '0 0 1 * *', 54 | '@weekly': '0 0 * * 0', 55 | '@daily': '0 0 * * *', 56 | '@hourly': '0 * * * *', 57 | } 58 | 59 | WARNING_CHANGE_MESSAGE = '''\ 60 | Version 0.22.0+ of crontab will use datetime.utcnow() and 61 | datetime.utcfromtimestamp() instead of datetime.now() and 62 | datetime.fromtimestamp() as was previous. This had been a bug, which will be 63 | remedied. If you would like to keep the *old* behavior: 64 | `ct.next(..., default_utc=False)` . If you want to use the new behavior *now*: 65 | `ct.next(..., default_utc=True)`. If you pass a datetime object with a tzinfo 66 | attribute that is not None, timezones will *just work* to the best of their 67 | ability. There are tests...''' 68 | 69 | 70 | if sys.version_info >= (3, 0): 71 | _number_types = (int, float) 72 | xrange = range 73 | else: 74 | _number_types = (int, long, float) 75 | 76 | SECOND = timedelta(seconds=1) 77 | MINUTE = timedelta(minutes=1) 78 | HOUR = timedelta(hours=1) 79 | DAY = timedelta(days=1) 80 | WEEK = timedelta(days=7) 81 | MONTH = timedelta(days=28) 82 | YEAR = timedelta(days=365) 83 | 84 | WARN_CHANGE = object() 85 | 86 | # find the next scheduled time 87 | def _end_of_month(dt): 88 | ndt = dt + DAY 89 | while dt.month == ndt.month: 90 | ndt += DAY 91 | return ndt.replace(day=1) - DAY 92 | 93 | def _month_incr(dt, m): 94 | odt = dt 95 | dt += MONTH 96 | while dt.month == odt.month: 97 | dt += DAY 98 | # get to the first of next month, let the backtracking handle it 99 | dt = dt.replace(day=1) 100 | return dt - odt 101 | 102 | def _year_incr(dt, m): 103 | # simple leapyear stuff works for 1970-2099 :) 104 | mod = dt.year % 4 105 | if mod == 0 and (dt.month, dt.day) < (2, 29): 106 | return YEAR + DAY 107 | if mod == 3 and (dt.month, dt.day) > (2, 29): 108 | return YEAR + DAY 109 | return YEAR 110 | 111 | _increments = [ 112 | lambda *a: SECOND, 113 | lambda *a: MINUTE, 114 | lambda *a: HOUR, 115 | lambda *a: DAY, 116 | _month_incr, 117 | lambda *a: DAY, 118 | _year_incr, 119 | lambda dt,x: dt.replace(second=0), 120 | lambda dt,x: dt.replace(minute=0), 121 | lambda dt,x: dt.replace(hour=0), 122 | lambda dt,x: dt.replace(day=1) if x > DAY else dt, 123 | lambda dt,x: dt.replace(month=1) if x > DAY else dt, 124 | lambda dt,x: dt, 125 | ] 126 | 127 | # find the previously scheduled time 128 | def _day_decr(dt, m): 129 | if m.day.input != 'l': 130 | return -DAY 131 | odt = dt 132 | ndt = dt = dt - DAY 133 | while dt.month == ndt.month: 134 | dt -= DAY 135 | return dt - odt 136 | 137 | def _month_decr(dt, m): 138 | odt = dt 139 | # get to the last day of last month, let the backtracking handle it 140 | dt = dt.replace(day=1) - DAY 141 | return dt - odt 142 | 143 | def _year_decr(dt, m): 144 | # simple leapyear stuff works for 1970-2099 :) 145 | mod = dt.year % 4 146 | if mod == 0 and (dt.month, dt.day) > (2, 29): 147 | return -(YEAR + DAY) 148 | if mod == 1 and (dt.month, dt.day) < (2, 29): 149 | return -(YEAR + DAY) 150 | return -YEAR 151 | 152 | def _day_decr_reset(dt, x): 153 | if x >= -DAY: 154 | return dt 155 | cur = dt.month 156 | while dt.month == cur: 157 | dt += DAY 158 | return dt - DAY 159 | 160 | _decrements = [ 161 | lambda *a: -SECOND, 162 | lambda *a: -MINUTE, 163 | lambda *a: -HOUR, 164 | _day_decr, 165 | _month_decr, 166 | lambda *a: -DAY, 167 | _year_decr, 168 | lambda dt,x: dt.replace(second=59), 169 | lambda dt,x: dt.replace(minute=59), 170 | lambda dt,x: dt.replace(hour=23), 171 | _day_decr_reset, 172 | lambda dt,x: dt.replace(month=12) if x < -DAY else dt, 173 | lambda dt,x: dt, 174 | _year_decr, 175 | ] 176 | 177 | Matcher = namedtuple('Matcher', 'second, minute, hour, day, month, weekday, year') 178 | 179 | def _assert(condition, message, *args): 180 | if not condition: 181 | raise ValueError(message%args) 182 | 183 | class _Matcher(object): 184 | __slots__ = 'allowed', 'end', 'any', 'input', 'which', 'split', 'loop' 185 | def __init__(self, which, entry, loop=False): 186 | """ 187 | input: 188 | `which` - index into the increment / validation lookup tables 189 | `entry` - the value of the column 190 | `loop` - do we loop when we validate / construct counts 191 | (turning 55-5,1 -> 0,1,2,3,4,5,55,56,57,58,59 in a "minutes" column) 192 | """ 193 | _assert(0 <= which <= YEAR_OFFSET, 194 | "improper number of cron entries specified") 195 | self.input = entry.lower() 196 | self.split = self.input.split(',') 197 | self.which = which 198 | self.allowed = set() 199 | self.end = None 200 | self.any = '*' in self.split or '?' in self.split 201 | self.loop = loop 202 | 203 | for it in self.split: 204 | al, en = self._parse_crontab(which, it) 205 | if al is not None: 206 | self.allowed.update(al) 207 | self.end = en 208 | _assert(self.end is not None, 209 | "improper item specification: %r", entry.lower() 210 | ) 211 | self.allowed = frozenset(self.allowed) 212 | 213 | def __call__(self, v, dt): 214 | for i, x in enumerate(self.split): 215 | if x == 'l': 216 | if v == _end_of_month(dt).day: 217 | return True 218 | 219 | elif x.startswith('l'): 220 | # We have to do this in here, otherwise we can end up, for 221 | # example, accepting *any* Friday instead of the *last* Friday. 222 | if dt.month == (dt + WEEK).month: 223 | continue 224 | 225 | x = x[1:] 226 | if x.isdigit(): 227 | x = int(x) if x != '7' else 0 228 | if v == x: 229 | return True 230 | continue 231 | 232 | start, end = map(int, x.partition('-')[::2]) 233 | allowed = set(range(start, end+1)) 234 | if 7 in allowed: 235 | allowed.add(0) 236 | if v in allowed: 237 | return True 238 | 239 | return self.any or v in self.allowed 240 | 241 | def __lt__(self, other): 242 | if self.any: 243 | return self.end < other 244 | return all(item < other for item in self.allowed) 245 | 246 | def __gt__(self, other): 247 | if self.any: 248 | return _ranges[self.which][0] > other 249 | return all(item > other for item in self.allowed) 250 | 251 | def __eq__(self, other): 252 | if self.any: 253 | return other.any 254 | return self.allowed == other.allowed 255 | 256 | def __hash__(self): 257 | return hash((self.any, self.allowed)) 258 | 259 | def _parse_crontab(self, which, entry): 260 | ''' 261 | This parses a single crontab field and returns the data necessary for 262 | this matcher to accept the proper values. 263 | 264 | See the README for information about what is accepted. 265 | ''' 266 | 267 | # this handles day of week/month abbreviations 268 | def _fix(it): 269 | if which in _alternate and not it.isdigit(): 270 | if it in _alternate[which]: 271 | return _alternate[which][it] 272 | _assert(it.isdigit(), 273 | "invalid range specifier: %r (%r)", it, entry) 274 | it = int(it, 10) 275 | _assert(_start <= it <= _end_limit, 276 | "item value %r out of range [%r, %r]", 277 | it, _start, _end_limit) 278 | return it 279 | 280 | # this handles individual items/ranges 281 | def _parse_piece(it): 282 | if '-' in it: 283 | start, end = map(_fix, it.split('-')) 284 | # Allow "sat-sun" 285 | if which in (DAY_OFFSET, WEEK_OFFSET) and end == 0: 286 | end = 7 287 | elif it == '*': 288 | start = _start 289 | end = _end 290 | else: 291 | start = _fix(it) 292 | end = _end 293 | if increment is None: 294 | return set([start]) 295 | 296 | _assert(_start <= start <= _end_limit, 297 | "%s range start value %r out of range [%r, %r]", 298 | _attribute[which], start, _start, _end_limit) 299 | _assert(_start <= end <= _end_limit, 300 | "%s range end value %r out of range [%r, %r]", 301 | _attribute[which], end, _start, _end_limit) 302 | if not self.loop: 303 | _assert(start <= end, 304 | "%s range start value %r > end value %r", 305 | _attribute[which], start, end) 306 | 307 | if increment and not self.loop: 308 | next_value = start + increment 309 | _assert(next_value <= _end_limit, 310 | "first next value %r is out of range [%r, %r]", 311 | next_value, start, _end_limit) 312 | 313 | if start <= end: 314 | return set(range(start, end+1, increment or 1)) 315 | 316 | right = set(range(end, _end_limit + 1, increment or 1)) 317 | first = max(right, default=end + (increment or 1)) % _end_limit 318 | return set(range(first, start+1, increment or 1)) | right 319 | 320 | _start, _end = _ranges[which] 321 | _end_limit = _end 322 | # wildcards 323 | if entry in ('*', '?'): 324 | if entry == '?': 325 | _assert(which in (DAY_OFFSET, WEEK_OFFSET), 326 | "cannot use '?' in the %r field", _attribute[which]) 327 | return None, _end 328 | 329 | # last day of the month 330 | if entry == 'l': 331 | _assert(which == DAY_OFFSET, 332 | "you can only specify a bare 'L' in the 'day' field") 333 | return None, _end 334 | 335 | # for the last 'friday' of the month, for example 336 | elif entry.startswith('l'): 337 | _assert(which == WEEK_OFFSET, 338 | "you can only specify a leading 'L' in the 'weekday' field") 339 | es, _, ee = entry[1:].partition('-') 340 | _assert((entry[1:].isdigit() and 0 <= int(es) <= 7) or 341 | (_ and es.isdigit() and ee.isdigit() and 0 <= int(es) <= 7 and 0 <= int(ee) <= 7), 342 | "last specifier must include a day number or range in the 'weekday' field, you entered %r", entry) 343 | return None, _end 344 | 345 | # allow Sunday to be specified as weekday 7 346 | if which == WEEK_OFFSET: 347 | _end_limit = 7 348 | 349 | increment = None 350 | # increments 351 | if '/' in entry: 352 | entry, increment = entry.split('/') 353 | increment = int(increment, 10) 354 | _assert(increment > 0, 355 | "you can only use positive increment values, you provided %r", 356 | increment) 357 | _assert(increment <= _end_limit, 358 | "increment value must be less than %r, you provided %r", 359 | _end_limit, increment) 360 | 361 | # handle singles and ranges 362 | good = _parse_piece(entry) 363 | 364 | # change Sunday to weekday 0 365 | if which == WEEK_OFFSET and 7 in good: 366 | good.discard(7) 367 | good.add(0) 368 | 369 | return good, _end 370 | 371 | 372 | _gv = lambda: str(random.randrange(60)) 373 | 374 | 375 | class CronTab(object): 376 | __slots__ = 'matchers', 'rs' 377 | def __init__(self, crontab, loop=False, random_seconds=False): 378 | """ 379 | inputs: 380 | `crontab` - crontab specification of "[S=0] Mi H D Mo DOW [Y=*]" 381 | `loop` - do we loop when we validate / construct counts 382 | (turning 55-5,1 -> 0,1,2,3,4,5,55,56,57,58,59 in a "minutes" column) 383 | `random_seconds` - randomly select starting second for tasks 384 | """ 385 | self.rs = random_seconds 386 | self.matchers = self._make_matchers(crontab, loop, random_seconds) 387 | 388 | def __eq__(self, other): 389 | if not isinstance(other, CronTab): 390 | return False 391 | match_last = self.matchers[1:] == other.matchers[1:] 392 | return match_last and ((self.rs and other.rs) or (not self.rs and 393 | not other.rs and self.matchers[0] == other.matchers[0])) 394 | 395 | def _make_matchers(self, crontab, loop, random_seconds): 396 | ''' 397 | This constructs the full matcher struct. 398 | ''' 399 | crontab = _aliases.get(crontab, crontab) 400 | ct = crontab.split() 401 | 402 | if len(ct) == 5: 403 | ct.insert(0, _gv() if random_seconds else '0') 404 | ct.append('*') 405 | elif len(ct) == 6: 406 | ct.insert(0, _gv() if random_seconds else '0') 407 | _assert(len(ct) == 7, 408 | "improper number of cron entries specified; got %i need 5 to 7"%(len(ct,))) 409 | 410 | matchers = [_Matcher(which, entry, loop) for which, entry in enumerate(ct)] 411 | 412 | return Matcher(*matchers) 413 | 414 | def _test_match(self, index, dt): 415 | ''' 416 | This tests the given field for whether it matches with the current 417 | datetime object passed. 418 | ''' 419 | at = _attribute[index] 420 | attr = getattr(dt, at) 421 | if index == WEEK_OFFSET: 422 | attr = attr() % 7 423 | return self.matchers[index](attr, dt) 424 | 425 | def next(self, now=None, increments=_increments, delta=True, default_utc=WARN_CHANGE, return_datetime=False): 426 | ''' 427 | How long to wait in seconds before this crontab entry can next be 428 | executed. 429 | ''' 430 | if default_utc is WARN_CHANGE and (isinstance(now, _number_types) or (now and not now.tzinfo) or now is None): 431 | warnings.warn(WARNING_CHANGE_MESSAGE, FutureWarning, 2) 432 | default_utc = False 433 | 434 | now = now or (datetime.utcnow() if default_utc and default_utc is not WARN_CHANGE else datetime.now()) 435 | if isinstance(now, _number_types): 436 | now = datetime.utcfromtimestamp(now) if default_utc else datetime.fromtimestamp(now) 437 | 438 | # handle timezones if the datetime object has a timezone and get a 439 | # reasonable future/past start time 440 | onow, now = now, now.replace(tzinfo=None) 441 | tz = onow.tzinfo 442 | future = now.replace(microsecond=0) + increments[0]() 443 | if future < now: 444 | # we are going backwards... 445 | _test = lambda: future.year < self.matchers.year 446 | if now.microsecond: 447 | future = now.replace(microsecond=0) 448 | else: 449 | # we are going forwards 450 | _test = lambda: self.matchers.year < future.year 451 | 452 | # Start from the year and work our way down. Any time we increment a 453 | # higher-magnitude value, we reset all lower-magnitude values. This 454 | # gets us performance without sacrificing correctness. Still more 455 | # complicated than a brute-force approach, but also orders of 456 | # magnitude faster in basically all cases. 457 | to_test = ENTRIES - 1 458 | while to_test >= 0: 459 | if not self._test_match(to_test, future): 460 | inc = increments[to_test](future, self.matchers) 461 | future += inc 462 | for i in xrange(0, to_test): 463 | future = increments[ENTRIES+i](future, inc) 464 | try: 465 | if _test(): 466 | return None 467 | except: 468 | print(future, type(future), type(inc)) 469 | raise 470 | to_test = ENTRIES-1 471 | continue 472 | to_test -= 1 473 | 474 | # verify the match 475 | match = [self._test_match(i, future) for i in xrange(ENTRIES)] 476 | _assert(all(match), 477 | "\nYou have discovered a bug with crontab, please notify the\n" \ 478 | "author with the following information:\n" \ 479 | "crontab: %r\n" \ 480 | "now: %r", ' '.join(m.input for m in self.matchers), now) 481 | 482 | if return_datetime: 483 | return future.replace(tzinfo=tz) 484 | 485 | if not delta: 486 | onow = now = datetime(1970, 1, 1) 487 | 488 | delay = future - now 489 | if tz: 490 | delay += _fix_none(onow.utcoffset()) 491 | if hasattr(tz, 'localize'): 492 | delay -= _fix_none(tz.localize(future).utcoffset()) 493 | else: 494 | delay -= _fix_none(future.replace(tzinfo=tz).utcoffset()) 495 | 496 | return delay.days * 86400 + delay.seconds + delay.microseconds / 1000000. 497 | 498 | def previous(self, now=None, delta=True, default_utc=WARN_CHANGE, return_datetime=False): 499 | return self.next(now, _decrements, delta, default_utc, return_datetime) 500 | 501 | def test(self, entry): 502 | if isinstance(entry, _number_types): 503 | entry = datetime.utcfromtimestamp(entry) 504 | for index in xrange(ENTRIES): 505 | if not self._test_match(index, entry): 506 | return False 507 | return True 508 | 509 | def _fix_none(d, _=timedelta(0)): 510 | if d is None: 511 | return _ 512 | return d 513 | -------------------------------------------------------------------------------- /docker-compose.yaml: -------------------------------------------------------------------------------- 1 | version: '3.3' 2 | services: 3 | crontab-test-uploader: 4 | build: 5 | context: . 6 | dockerfile: Dockerfile.upload 7 | args: 8 | PYTHON_VERSION: "3.13" 9 | environment: 10 | PYTHONPATH: /app 11 | PY: python3.13 12 | volumes: 13 | - ./:/source/:rw 14 | - ~/.pypirc/:/root/.pypirc/:ro 15 | 16 | crontab-test-3-13: 17 | build: 18 | context: . 19 | dockerfile: Dockerfile.bullseye 20 | args: 21 | PYTHON_VERSION: "3.13" 22 | environment: 23 | PYTHONPATH: /app 24 | PY: python3.13 25 | crontab-test-3-12: 26 | build: 27 | context: . 28 | dockerfile: Dockerfile.bullseye 29 | args: 30 | PYTHON_VERSION: "3.12" 31 | environment: 32 | PYTHONPATH: /app 33 | PY: python3.12 34 | crontab-test-3-11: 35 | build: 36 | context: . 37 | dockerfile: Dockerfile.bullseye 38 | args: 39 | PYTHON_VERSION: "3.11" 40 | environment: 41 | PYTHONPATH: /app 42 | PY: python3.11 43 | crontab-test-3-10: 44 | build: 45 | context: . 46 | dockerfile: Dockerfile.bullseye 47 | args: 48 | PYTHON_VERSION: "3.10" 49 | environment: 50 | PYTHONPATH: /app 51 | PY: python3.10 52 | crontab-test-3-9: 53 | build: 54 | context: . 55 | dockerfile: Dockerfile.bullseye 56 | args: 57 | PYTHON_VERSION: "3.9" 58 | environment: 59 | PYTHONPATH: /app 60 | PY: python3.9 61 | crontab-test-3-8: 62 | build: 63 | context: . 64 | dockerfile: Dockerfile.bullseye 65 | args: 66 | PYTHON_VERSION: "3.8" 67 | environment: 68 | PYTHONPATH: /app 69 | PY: python3.8 70 | crontab-test-3-7: 71 | build: 72 | context: . 73 | dockerfile: Dockerfile.bullseye 74 | args: 75 | PYTHON_VERSION: "3.7" 76 | environment: 77 | PYTHONPATH: /app 78 | PY: python3.7 79 | crontab-test-3-6: 80 | build: 81 | context: . 82 | dockerfile: Dockerfile.generic 83 | args: 84 | PYTHON_VERSION: "3.6" 85 | environment: 86 | PYTHONPATH: /app 87 | PY: python3.6 88 | crontab-test-3-5: 89 | build: 90 | context: . 91 | dockerfile: Dockerfile.generic 92 | args: 93 | PYTHON_VERSION: "3.5" 94 | environment: 95 | PYTHONPATH: /app 96 | PY: python3.5 97 | crontab-test-3-4: 98 | build: 99 | context: . 100 | dockerfile: Dockerfile.generic 101 | args: 102 | PYTHON_VERSION: "3.4" 103 | environment: 104 | PYTHONPATH: /app 105 | PY: python3.4 106 | # crontab-test-3-3: 107 | # build: 108 | # context: . 109 | # dockerfile: Dockerfile.generic 110 | # args: 111 | # PYTHON_VERSION: "3.3" 112 | # environment: 113 | # PYTHONPATH: /app 114 | crontab-test-2-7: 115 | build: 116 | context: . 117 | dockerfile: Dockerfile.generic 118 | args: 119 | PYTHON_VERSION: "2.7" 120 | environment: 121 | PYTHONPATH: /app 122 | PY: python2.7 -------------------------------------------------------------------------------- /pyproject.toml: -------------------------------------------------------------------------------- 1 | [build-system] 2 | requires = ["setuptools"] 3 | build-backend = "setuptools.build_meta" -------------------------------------------------------------------------------- /requirements.txt: -------------------------------------------------------------------------------- 1 | build 2 | python-dateutil 3 | pytz 4 | setuptools 5 | twine -------------------------------------------------------------------------------- /requirements_old.txt: -------------------------------------------------------------------------------- 1 | python-dateutil 2 | pytz 3 | -------------------------------------------------------------------------------- /setup.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python 2 | 3 | from setuptools import setup 4 | 5 | try: 6 | with open('README.rst') as f: 7 | long_description = f.read() 8 | except: 9 | long_description = '' 10 | 11 | setup( 12 | name='crontab', 13 | version='1.0.4', 14 | description='Parse and use crontab schedules in Python', 15 | author='Josiah Carlson', 16 | author_email='josiah.carlson@gmail.com', 17 | url='https://github.com/josiahcarlson/parse-crontab', 18 | packages=['crontab'], 19 | classifiers=[ 20 | 'Development Status :: 5 - Production/Stable', 21 | 'License :: OSI Approved :: GNU Library or Lesser General Public License (LGPL)', 22 | 'License :: OSI Approved :: GNU Lesser General Public License v2 (LGPLv2)', 23 | 'License :: OSI Approved :: GNU Lesser General Public License v3 (LGPLv3)', 24 | 'Programming Language :: Python', 25 | 'Programming Language :: Python :: 2.7', 26 | 'Programming Language :: Python :: 3.2', 27 | 'Programming Language :: Python :: 3.4', 28 | 'Programming Language :: Python :: 3.5', 29 | 'Programming Language :: Python :: 3.6', 30 | 'Programming Language :: Python :: 3.7', 31 | 'Programming Language :: Python :: 3.8', 32 | 'Programming Language :: Python :: 3.9', 33 | 'Programming Language :: Python :: 3.10', 34 | 'Programming Language :: Python :: 3.11', 35 | 'Programming Language :: Python :: 3.12', 36 | 'Programming Language :: Python :: 3.13', 37 | ], 38 | license='GNU LGPL v2.1', 39 | long_description=long_description, 40 | #setup_requires=['wheel'], 41 | #install_requires=["pytz"], 42 | ) 43 | -------------------------------------------------------------------------------- /tests/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/josiahcarlson/parse-crontab/0bf42a774d723513b7466c6393750e4cd8d681a3/tests/__init__.py -------------------------------------------------------------------------------- /tests/test_crontab.py: -------------------------------------------------------------------------------- 1 | 2 | from collections import namedtuple 3 | import datetime 4 | import unittest 5 | 6 | import pytz 7 | import dateutil.tz 8 | 9 | from crontab import CronTab 10 | 11 | Results = namedtuple('Results', 'crontab delay max_delay now future') 12 | 13 | class TestCrontab(unittest.TestCase): 14 | def _run_test(self, crontab, max_delay, now=None, min_delay=None): 15 | ct = CronTab(crontab) 16 | now = now or datetime.datetime.utcnow() 17 | delay = ct.next(now, default_utc=True) 18 | assert delay is not None 19 | dd = Results(crontab, delay, max_delay, now, now+datetime.timedelta(seconds=delay)) 20 | assert delay <= max_delay, dd 21 | if min_delay is not None: 22 | assert delay >= min_delay, dd 23 | if not crontab.endswith(' 2099'): 24 | delay2 = ct.previous(now + datetime.timedelta(seconds=delay), default_utc=True) 25 | dd = Results(crontab, delay, max_delay, now, now+datetime.timedelta(seconds=delay)) 26 | assert abs(delay2) >= delay, (delay, delay2) 27 | pt = now + datetime.timedelta(seconds=delay) + datetime.timedelta(seconds=delay2) 28 | assert pt <= now, dd 29 | 30 | def _run_impossible(self, crontab, now): 31 | ct = CronTab(crontab) 32 | delay = ct.next(now, default_utc=True) 33 | assert delay is None, (crontab, delay, now, now+datetime.timedelta(seconds=delay)) 34 | 35 | def test_closest(self): 36 | ce = CronTab("*/15 10-15 * * 1-5") 37 | t945 = datetime.datetime(2013, 1, 1, 9, 45) # tuesday 38 | t1245 = datetime.datetime(2013, 1, 1, 12, 45) # tuesday 39 | s1245 = datetime.datetime(2013, 1, 5, 12, 45) # saturday 40 | 41 | assert not ce.test(t945) 42 | assert not ce.test(s1245) 43 | assert ce.test(t1245) 44 | 45 | n = datetime.datetime.utcfromtimestamp(ce.next(t945, delta=False, default_utc=True)) 46 | assert n == datetime.datetime(2013, 1, 1, 10, 0), n 47 | p = datetime.datetime.utcfromtimestamp(ce.previous(t945, delta=False, default_utc=True)) 48 | assert p == datetime.datetime(2012, 12, 31, 15, 45), p 49 | 50 | n = datetime.datetime.utcfromtimestamp(ce.next(s1245, delta=False, default_utc=True)) 51 | assert n == datetime.datetime(2013, 1, 7, 10, 0), n 52 | p = datetime.datetime.utcfromtimestamp(ce.previous(s1245, delta=False, default_utc=True)) 53 | assert p == datetime.datetime(2013, 1, 4, 15, 45), p 54 | 55 | def test_normal(self): 56 | self._run_test('*/5 * * * * * *', 5) 57 | self._run_test('* * * * *', 60) 58 | self._run_test('0 * * * *', 3600) 59 | self._run_test('0 0 * * *', 86400) 60 | self._run_test('0 0 1 * *', 31*86400) 61 | self._run_test('5/15 * * * *', 15*60) 62 | self._run_test('5-51/15 * * * *', 15*60) 63 | self._run_test('1,8,40 * * * *', 3600) 64 | self._run_test('0 0 1 1 *', 86400 * 366) 65 | self._run_test('0 0 1 1 * 2099', 99 * 86400 * 366) 66 | self._run_test('0 0 ? * 0-6', 86400) 67 | self._run_test('0 0 31 * *', 62*86400, datetime.datetime(2011, 1, 31)) 68 | self._run_test('0,1/2 * * * *', 60, datetime.datetime(2011, 1, 1, 1, 0)) 69 | self._run_test('0,1/2 * * * *', 120, datetime.datetime(2011, 1, 1, 1, 1)) 70 | self._run_test('0,1/2 * * * *', 60, datetime.datetime(2011, 1, 1, 1, 2)) 71 | self._run_test('0-6,50-59/2 * * * *', 60, datetime.datetime(2011, 1, 1, 1, 1)) 72 | self._run_test('0-6,50-59/2 * * * *', 120, datetime.datetime(2011, 1, 1, 1, 2)) 73 | self._run_test('0-6,50-59/2 * * * *', 900, datetime.datetime(2011, 1, 1, 1, 45)) 74 | self._run_test('0-6,50-59/2 * * * *', 60, datetime.datetime(2011, 1, 1, 1, 55)) 75 | self._run_test('0-6,50/2 * * * *', 60, datetime.datetime(2011, 1, 1, 1, 55)) 76 | 77 | self._run_test('10,20 15 * * *', 9*60, datetime.datetime(2011, 1, 1, 15, 1), min_delay=9*60) 78 | self._run_test('10,20 15 * * *', 5*60, datetime.datetime(2011, 1, 1, 15, 15), min_delay=5*60) 79 | self._run_test('10,20 15 * * *', 86400 - 600, datetime.datetime(2011, 1, 1, 15, 20), min_delay=86400 - 600) 80 | self._run_test('* 2-5 * * *', 12525, datetime.datetime(2013, 6, 19, 22, 31, 15), min_delay=12525) 81 | 82 | def test_alternate(self): 83 | self._run_test('0 0 1 jan-dec *', 32 * 86400) 84 | self._run_test('0 0 ? * sun-sat', 86400) 85 | 86 | def test_aliases(self): 87 | self._run_test('@hourly', 3600) 88 | self._run_test('@daily', 86400) 89 | self._run_test('@monthly', 31*86400) 90 | self._run_test('@yearly', 86400 * 366) 91 | 92 | def test_day_of_week(self): 93 | self._run_test('0 0 ? 7 mon', 4*86400, datetime.datetime(2011, 7, 15)) 94 | self._run_test('0 0 ? 7 mon', 366*86400, datetime.datetime(2011, 7, 25, 1)) 95 | self._run_test('0 0 ? 8 mon-fri', 5*86400 + 1, datetime.datetime(2011, 7, 27, 1)) 96 | self._run_test('0 12 * * sat-sun', 129600, datetime.datetime(2015, 11, 6), 129600) 97 | self._run_test('0 12 * * sat-sun', 86400, datetime.datetime(2015, 11, 7, 12), 86400) 98 | self._run_test('0 12 * * sat-sun', 518400, datetime.datetime(2015, 11, 8, 12), 518400) 99 | self._run_test('0 5 * * fri *', 7*86400, datetime.datetime(2016, 3, 25, 5), 7*86400) 100 | self._run_test('* * * * Fri *', 6*86400+1, datetime.datetime(2016, 3, 25, 23, 59, 59), 6*86400+1) 101 | self._run_test('* * * * Fri *', 60, datetime.datetime(2016, 3, 25, 23, 56), 60) 102 | self._run_test('* * 13 * Fri *', 181*86400+1, datetime.datetime(2015, 11, 13, 23, 59, 59), 181*86400+1) 103 | 104 | def test_last_day(self): 105 | self._run_test('0 0 L 2 ?', 28*86400, datetime.datetime(2011, 1, 31)) 106 | self._run_test('0 0 1,L 2 ?', 86400, datetime.datetime(2011, 1, 31)) 107 | self._run_test('0 0 2,L 2 ?', 2*86400, datetime.datetime(2011, 1, 31)) 108 | self._run_test('0 0 L 2 ?', 58*86400, datetime.datetime(2011, 1, 1)) 109 | self._run_test('0 0 ? 2 L1', 58*86400, datetime.datetime(2011, 1, 31)) 110 | self._run_test('0 0 ? 7 L1', 1*86400, datetime.datetime(2011, 7, 24)) 111 | self._run_test('0 0 ? 7 L2', 2*86400, datetime.datetime(2011, 7, 24)) 112 | self._run_test('0 0 ? 7 L3', 3*86400, datetime.datetime(2011, 7, 24)) 113 | self._run_test('0 0 ? 7 L4', 4*86400, datetime.datetime(2011, 7, 24)) 114 | self._run_test('0 0 ? 7 L5', 5*86400, datetime.datetime(2011, 7, 24)) 115 | self._run_test('0 0 ? 7 L6', 6*86400, datetime.datetime(2011, 7, 24)) 116 | self._run_test('0 0 ? 7 L0', 7*86400, datetime.datetime(2011, 7, 24)) 117 | self._run_test('0 0 ? 7 L3-5', 3*86400, datetime.datetime(2011, 7, 24)) 118 | self._run_test('0 0 ? 7 L3-5', 2*86400, datetime.datetime(2011, 7, 25)) 119 | self._run_test('0 0 ? 7 L3-5', 86400, datetime.datetime(2011, 7, 26)) 120 | self._run_test('0 0 ? 7 L3-5', 86400, datetime.datetime(2011, 7, 27)) 121 | self._run_test('0 0 ? 7 L3-5', 86400, datetime.datetime(2011, 7, 28)) 122 | self._run_test('0 0 ? 7 L3-5', 362*86400, datetime.datetime(2011, 7, 29)) 123 | self._run_test('0 0 ? 7 L0-1', 24*86400, datetime.datetime(2011, 7, 1)) 124 | self._run_test('0 0 ? 7 L0-1', 24*86400, datetime.datetime(2011, 7, 1)) 125 | self._run_test('0 0 ? 7 L0-1', 86400, datetime.datetime(2011, 7, 24)) 126 | self._run_test('0 0 ? 7 L0-1', 6*86400, datetime.datetime(2011, 7, 25)) 127 | self._run_test('59 23 L 12 *', 282*86400, datetime.datetime(2012, 3, 25), 280*84400) 128 | self._run_test('0 0 ? 2 L1', 28*86400, datetime.datetime(2016, 2, 1), 28*86400) 129 | self._run_test('0 0 ? 2 L0', 27*86400, datetime.datetime(2016, 2, 1), 27*86400) 130 | self._run_test('0 0 ? 2 L7', 27*86400, datetime.datetime(2016, 2, 1), 27*86400) 131 | self._run_test('0 0 ? 2 L6', 26*86400, datetime.datetime(2016, 2, 1), 26*86400) 132 | self._run_test('0 0 ? 2 L5', 25*86400, datetime.datetime(2016, 2, 1), 25*86400) 133 | self._run_test('0 0 ? 2 L4', 24*86400, datetime.datetime(2016, 2, 1), 24*86400) 134 | self._run_test('0 0 ? 2 L3', 23*86400, datetime.datetime(2016, 2, 1), 23*86400) 135 | self._run_test('0 0 ? 2 L2', 22*86400, datetime.datetime(2016, 2, 1), 22*86400) 136 | 137 | def test_impossible(self): 138 | self._run_impossible('0 0 * 7 fri 2011', datetime.datetime(2011, 7, 31)) 139 | self._run_impossible('0 0 29 2 * 2011', datetime.datetime(2011, 2, 1)) 140 | self._run_impossible('0 0 L 1 * 2011', datetime.datetime(2011, 2, 1)) 141 | self._run_impossible('0 0 L 1 * 2011', datetime.datetime(2011, 1, 31)) 142 | self._run_impossible('0 0 ? 7 L3-5 2011', datetime.datetime(2011, 7, 29)) 143 | self._run_impossible('0 0 29 2 * 2012-2015', datetime.datetime(2012, 2, 29)) 144 | 145 | def test_bad_crontabs(self): 146 | self.assertRaises(ValueError, lambda: CronTab('*')) 147 | self.assertRaises(ValueError, lambda: CronTab('* *')) 148 | self.assertRaises(ValueError, lambda: CronTab('* * *')) 149 | self.assertRaises(ValueError, lambda: CronTab('* * * *')) 150 | self.assertRaises(ValueError, lambda: CronTab('* * * * * * * *')) 151 | self.assertRaises(ValueError, lambda: CronTab('-1 * * * *')) 152 | self.assertRaises(ValueError, lambda: CronTab('* mon-tue * * *')) 153 | self.assertRaises(ValueError, lambda: CronTab('* * * feb-jan *')) 154 | self.assertRaises(ValueError, lambda: CronTab('* * * * L')) 155 | self.assertRaises(ValueError, lambda: CronTab('* * * L *')) 156 | self.assertRaises(ValueError, lambda: CronTab('* L * * *')) 157 | self.assertRaises(ValueError, lambda: CronTab('L * * * *')) 158 | self.assertRaises(ValueError, lambda: CronTab('* 1, * * *')) 159 | self.assertRaises(ValueError, lambda: CronTab('60 * * * *')) 160 | self.assertRaises(ValueError, lambda: CronTab('* 25 * * *')) 161 | self.assertRaises(ValueError, lambda: CronTab('* * 32 * *')) 162 | self.assertRaises(ValueError, lambda: CronTab('* * * 13 *')) 163 | self.assertRaises(ValueError, lambda: CronTab('* * * * 9999')) 164 | self.assertRaises(ValueError, lambda: CronTab('20/50 * * * * *')) 165 | self.assertRaises(ValueError, lambda: CronTab('0/100 * * * * *')) 166 | self.assertRaises(ValueError, lambda: CronTab('*,50-59/12 * * * *')) 167 | self.assertRaises(ValueError, lambda: CronTab('* * * DEC/7 * *')) 168 | self.assertRaises(ValueError, lambda: CronTab('* * * * MON/7 *')) 169 | 170 | def test_previous(self): 171 | schedule = CronTab('0 * * * *') 172 | ts = datetime.datetime(2014, 6, 6, 9, 0, 0) 173 | for i in range(70): 174 | next = schedule.next(ts, default_utc=True) 175 | self.assertTrue(0 <= next <= 3600, next) 176 | previous = schedule.previous(ts, default_utc=True) 177 | self.assertTrue(-3600 <= previous <= 0, previous) 178 | ts += datetime.timedelta(seconds=1) 179 | 180 | def test_timezones_pytz(self): 181 | s = CronTab('0 9 13 3 * 2016') 182 | 183 | self.assertEqual(s.next(datetime.datetime(2016, 3, 13), default_utc=True), 32400) 184 | self.assertEqual(s.next(pytz.utc.localize(datetime.datetime(2016, 3, 13)), default_utc=True), 32400) 185 | 186 | self.assertEqual(s.next(pytz.timezone('US/Eastern').localize(datetime.datetime(2016, 3, 13))), 28800) 187 | 188 | t = CronTab('0 9 * * * 2018') 189 | self.assertEqual(t.next(datetime.datetime(2018, 11, 4), default_utc=True), 32400) 190 | 191 | timezone = pytz.timezone("America/Los_Angeles") 192 | self.assertEqual(t.next(timezone.localize(datetime.datetime(2018, 11, 4))), 36000) 193 | before = pytz.utc.localize(datetime.datetime(2018, 11, 4, 8, 29)).astimezone(timezone) 194 | self.assertEqual(CronTab('30 1 * * * 2018').next(before), 3660) 195 | self.assertEqual(CronTab('30 1 * * * 2018').next(timezone.localize(datetime.datetime(2018, 11, 4, 1, 15))), 900) 196 | self.assertEqual(CronTab('30 1 * * * 2018').next(timezone.localize(datetime.datetime(2018, 11, 4))), 9000) 197 | 198 | def test_timezones_dateutil(self): 199 | s = CronTab('0 9 13 3 * 2016') 200 | 201 | self.assertEqual(s.next(datetime.datetime(2016, 3, 13), default_utc=True), 32400) 202 | utc = dateutil.tz.tzutc() 203 | self.assertEqual(s.next(datetime.datetime(2016, 3, 13, tzinfo=utc), default_utc=True), 32400) 204 | 205 | x = datetime.datetime(2016, 3, 13, tzinfo=dateutil.tz.gettz('US/Eastern')) 206 | self.assertEqual(s.next(x), 28800) 207 | 208 | t = CronTab('0 9 * * * 2018') 209 | self.assertEqual(t.next(datetime.datetime(2018, 11, 4), default_utc=True), 32400) 210 | 211 | timezone = dateutil.tz.gettz("America/Los_Angeles") 212 | self.assertEqual(t.next(datetime.datetime(2018, 11, 4, tzinfo=timezone)), 36000) 213 | before = datetime.datetime(2018, 11, 4, 8, 29, tzinfo=utc).astimezone(timezone) 214 | self.assertEqual(CronTab('30 1 * * * 2018').next(before), 60) 215 | before = datetime.datetime(2018, 11, 4, 8, 31, tzinfo=utc).astimezone(timezone) 216 | self.assertEqual(CronTab('30 1 * * * 2018').next(before), 89940) 217 | self.assertEqual(CronTab('30 1 * * * 2018').next(datetime.datetime(2018, 11, 4, 1, 15, tzinfo=timezone)), 900) 218 | self.assertEqual(CronTab('30 1 * * * 2018').next(datetime.datetime(2018, 11, 4, tzinfo=timezone)), 5400) 219 | 220 | def test_equal(self): 221 | a = CronTab("3 * 5 6 *") 222 | b = CronTab("3 * 5 6 *") 223 | self.assertEqual(a, b) 224 | a = CronTab("3 * 5 6 *", random_seconds=True) 225 | b = CronTab("3 * 5 6 *") 226 | self.assertNotEqual(a, b) 227 | 228 | if __name__ == '__main__': 229 | unittest.main() 230 | --------------------------------------------------------------------------------