Javascript判断Crontab表达式是否合法
这段时间在做Quartz任务调度，使用的Crontab表达式实现的。Crontab由前端页面输入，作为参数穿入后台。
虽然Quartz具有校验Crontab表达式的方法，如下：
boolean cronExpressionFlag = CronExpression.isValidExpression(crontab);但是我一直想在前端直接验证，即不需要通过异步的方式向后台获取验证结果，找了好久，发现没有现成的框架可以使用，于是自己根据网上搜索到的资料，写了这个js脚本。
这个脚本目前对日和星期的判断还有点小问题，不过不影响使用。
以后如果有时间，继续完善这个脚本，废话不多说了，上代码：
function cronValidate() {
var cron = $("#cron").val();
var result = CronExpressionValidator.validateCronExpression(cron);
if(result == true){
alert("格式正确");
}
else{
alert("格式错误");
}
return CronExpressionValidator.validateCronExpression(cron);
}
function CronExpressionValidator() {
}
CronExpressionValidator.validateCronExpression = function(value) {
var results = true;
if (value == null || value.length == 0) {
return false;
}
// split and test length
var expressionArray = value.split(" ");
var len = expressionArray.length;
if ((len != 6) && (len != 7)) {
return false;
}
// check only one question mark
var match = value.match(/\?/g);
if (match != null && match.length > 1) {
return false;
}
// check only one question mark
var dayOfTheMonthWildcard = "";
// if appropriate length test parts
// [0] Seconds 0-59 , - * /
if (CronExpressionValidator.isNotWildCard(expressionArray[0], /[\*]/gi)) {
if (!CronExpressionValidator.segmentValidator("([0-9\\\\,-\\/])", expressionArray[0], [0, 59], "seconds")) {
return false;
}
}
// [1] Minutes 0-59 , - * /
if (CronExpressionValidator.isNotWildCard(expressionArray[1], /[\*]/gi)) {
if (!CronExpressionValidator.segmentValidator("([0-9\\\\,-\\/])", expressionArray[1], [0, 59], "minutes")) {
return false;
}
}
// [2] Hours 0-23 , - * /
if (CronExpressionValidator.isNotWildCard(expressionArray[2], /[\*]/gi)) {
if (!CronExpressionValidator.segmentValidator("([0-9\\\\,-\\/])", expressionArray[2], [0, 23], "hours")) {
return false;
}
}
// [3] Day of month 1-31 , - * ? / L W C
if (CronExpressionValidator.isNotWildCard(expressionArray[3], /[\*\?]/gi)) {
if (!CronExpressionValidator.segmentValidator("([0-9LWC\\\\,-\\/])", expressionArray[3], [1, 31], "days of the month")) {
return false;
}
} else {
dayOfTheMonthWildcard = expressionArray[3];
}
// [4] Month 1-12 or JAN-DEC , - * /
if (CronExpressionValidator.isNotWildCard(expressionArray[4], /[\*]/gi)) {
expressionArray[4] = CronExpressionValidator.convertMonthsToInteger(expressionArray[4]);
if (!CronExpressionValidator.segmentValidator("([0-9\\\\,-\\/])", expressionArray[4], [1, 12], "months")) {
return false;
}
}
// [5] Day of week 1-7 or SUN-SAT , - * ? / L C #
if (CronExpressionValidator.isNotWildCard(expressionArray[5], /[\*\?]/gi)) {
expressionArray[5] = CronExpressionValidator.convertDaysToInteger(expressionArray[5]);
if (!CronExpressionValidator.segmentValidator("([0-9LC#\\\\,-\\/])", expressionArray[5], [1, 7], "days of the week")) {
return false;
}
} else {
if (dayOfTheMonthWildcard == String(expressionArray[5])) {
return false;
}
}
// [6] Year empty or 1970-2099 , - * /
if (len == 7) {
if (CronExpressionValidator.isNotWildCard(expressionArray[6], /[\*]/gi)) {
if (!CronExpressionValidator.segmentValidator("([0-9\\\\,-\\/])", expressionArray[6], [1970, 2099], "years")) {
return false;
}
}
}
return true;
}
// ----------------------------------
// isNotWildcard 静态方法;
// ----------------------------------
CronExpressionValidator.isNotWildCard = function(value, expression) {
var match = value.match(expression);
return (match == null || match.length == 0) ? true : false;
}
// ----------------------------------
// convertDaysToInteger 静态方法;
// ----------------------------------
CronExpressionValidator.convertDaysToInteger = function(value) {
var v = value;
v = v.replace(/SUN/gi, "1");
v = v.replace(/MON/gi, "2");
v = v.replace(/TUE/gi, "3");
v = v.replace(/WED/gi, "4");
v = v.replace(/THU/gi, "5");
v = v.replace(/FRI/gi, "6");
v = v.replace(/SAT/gi, "7");
return v;
}
// ----------------------------------
// convertMonthsToInteger 静态方法;
// ----------------------------------
CronExpressionValidator.convertMonthsToInteger = function(value) {
var v = value;
v = v.replace(/JAN/gi, "1");
v = v.replace(/FEB/gi, "2");
v = v.replace(/MAR/gi, "3");
v = v.replace(/APR/gi, "4");
v = v.replace(/MAY/gi, "5");
v = v.replace(/JUN/gi, "6");
v = v.replace(/JUL/gi, "7");
v = v.replace(/AUG/gi, "8");
v = v.replace(/SEP/gi, "9");
v = v.replace(/OCT/gi, "10");
v = v.replace(/NOV/gi, "11");
v = v.replace(/DEC/gi, "12");
return v;
}
// ----------------------------------
// segmentValidator 静态方法;
// ----------------------------------
CronExpressionValidator.segmentValidator = function(expression, value, range, segmentName) {
var v = value;
var numbers = new Array();
// first, check for any improper segments
var reg = new RegExp(expression, "gi");
if (!reg.test(v)) {
return false;
}
// check duplicate types
// check only one L
var dupMatch = value.match(/L/gi);
if (dupMatch != null && dupMatch.length > 1) {
return false;
}
// look through the segments
// break up segments on ','
// check for special cases L,W,C,/,#,-
var split = v.split(",");
var i = -1;
var l = split.length;
var match;
while (++i < l) {
// set vars
var checkSegment = split[i];
var n;
var pattern = /(\w*)/;
match = pattern.exec(checkSegment);
// if just number
pattern = /(\w*)\-?\d+(\w*)/;
match = pattern.exec(checkSegment);
if (match
&& match[0] == checkSegment
&& checkSegment.indexOf("L") == -1
&& checkSegment.indexOf("l") == -1
&& checkSegment.indexOf("C") == -1
&& checkSegment.indexOf("c") == -1
&& checkSegment.indexOf("W") == -1
&& checkSegment.indexOf("w") == -1
&& checkSegment.indexOf("/") == -1
&& (checkSegment.indexOf("-") == -1 || checkSegment
.indexOf("-") == 0) && checkSegment.indexOf("#") == -1) {
n = match[0];
if (n && !(isNaN(n)))
numbers.push(n);
else if (match[0] == "0")
numbers.push(n);
continue;
}
// includes L, C, or w
pattern = /(\w*)L|C|W(\w*)/i;
match = pattern.exec(checkSegment);
if (match
&& match[0] != ""
&& (checkSegment.indexOf("L") > -1
|| checkSegment.indexOf("l") > -1
|| checkSegment.indexOf("C") > -1
|| checkSegment.indexOf("c") > -1
|| checkSegment.indexOf("W") > -1 || checkSegment
.indexOf("w") > -1)) {
// check just l or L
if (checkSegment == "L" || checkSegment == "l")
continue;
pattern = /(\w*)\d+(l|c|w)?(\w*)/i;
match = pattern.exec(checkSegment);
// if something before or after
if (!match || match[0] != checkSegment) {
continue;
}
// get the number
var numCheck = match[0];
numCheck = numCheck.replace(/(l|c|w)/ig, "");
n = Number(numCheck);
if (n && !(isNaN(n)))
numbers.push(n);
else if (match[0] == "0")
numbers.push(n);
continue;
}
var numberSplit;
// includes /
if (checkSegment.indexOf("/") > -1) {
// take first #
numberSplit = checkSegment.split("/");
if (numberSplit.length != 2) {
continue;
} else {
n = numberSplit[0];
if (n && !(isNaN(n)))
numbers.push(n);
else if (numberSplit[0] == "0")
numbers.push(n);
continue;
}
}
// includes #
if (checkSegment.indexOf("#") > -1) {
// take first #
numberSplit = checkSegment.split("#");
if (numberSplit.length != 2) {
continue;
} else {
n = numberSplit[0];
if (n && !(isNaN(n)))
numbers.push(n);
else if (numberSplit[0] == "0")
numbers.push(n);
continue;
}
}
// includes -
if (checkSegment.indexOf("-") > 0) {
// take both #
numberSplit = checkSegment.split("-");
if (numberSplit.length != 2) {
continue;
} else if (Number(numberSplit[0]) > Number(numberSplit[1])) {
continue;
} else {
n = numberSplit[0];
if (n && !(isNaN(n)))
numbers.push(n);
else if (numberSplit[0] == "0")
numbers.push(n);
n = numberSplit[1];
if (n && !(isNaN(n)))
numbers.push(n);
else if (numberSplit[1] == "0")
numbers.push(n);
continue;
}
}
}
// lastly, check that all the found numbers are in range
i = -1;
l = numbers.length;
if (l == 0)
return false;
while (++i < l) {
// alert(numbers[i]);
if (numbers[i] < range[0] || numbers[i] > range[1]) {
return false;
}
}
return true;
}
function cronValidate() {var cron = $("#cron").val(); var result = CronExpressionValidator.validateCronExpression(cron); if(result == true){ alert("格式正确"); } else{ alert("格式错误"); } return CronExpressionValidator.validateCronExpression(cron); } function CronExpressionValidator() { } CronExpressionValidator.validateCronExpression = function(value) {var results = true; if (value == null || value.length == 0) { returnfalse; } // split and test length var expressionArray = value.split(" "); var len = expressionArray.length; if ((len != 6) && (len != 7)) { returnfalse; } // check only one question mark var match = value.match(/\?/g); if (match != null && match.length > 1) { returnfalse; } // check only one question mark var dayOfTheMonthWildcard = ""; // if appropriate length test parts // [0] Seconds 0-59 , - * / if (CronExpressionValidator.isNotWildCard(expressionArray[0], /[\*]/gi)) { if (!CronExpressionValidator.segmentValidator("([0-9\\\\,-\\/])", expressionArray[0], [0, 59], "seconds")) { returnfalse; } } // [1] Minutes 0-59 , - * / if (CronExpressionValidator.isNotWildCard(expressionArray[1], /[\*]/gi)) { if (!CronExpressionValidator.segmentValidator("([0-9\\\\,-\\/])", expressionArray[1], [0, 59], "minutes")) { returnfalse; } } // [2] Hours 0-23 , - * / if (CronExpressionValidator.isNotWildCard(expressionArray[2], /[\*]/gi)) { if (!CronExpressionValidator.segmentValidator("([0-9\\\\,-\\/])", expressionArray[2], [0, 23], "hours")) { returnfalse; } } // [3] Day of month 1-31 , - * ? / L W C if (CronExpressionValidator.isNotWildCard(expressionArray[3], /[\*\?]/gi)) { if (!CronExpressionValidator.segmentValidator("([0-9LWC\\\\,-\\/])", expressionArray[3], [1, 31], "days of the month")) { returnfalse; } } else { dayOfTheMonthWildcard = expressionArray[3]; } // [4] Month 1-12 or JAN-DEC , - * / if (CronExpressionValidator.isNotWildCard(expressionArray[4], /[\*]/gi)) { expressionArray[4] = CronExpressionValidator.convertMonthsToInteger(expressionArray[4]); if (!CronExpressionValidator.segmentValidator("([0-9\\\\,-\\/])", expressionArray[4], [1, 12], "months")) { returnfalse; } } // [5] Day of week 1-7 or SUN-SAT , - * ? / L C # if (CronExpressionValidator.isNotWildCard(expressionArray[5], /[\*\?]/gi)) { expressionArray[5] = CronExpressionValidator.convertDaysToInteger(expressionArray[5]); if (!CronExpressionValidator.segmentValidator("([0-9LC#\\\\,-\\/])", expressionArray[5], [1, 7], "days of the week")) { returnfalse; } } else { if (dayOfTheMonthWildcard == String(expressionArray[5])) { returnfalse; } } // [6] Year empty or 1970-2099 , - * / if (len == 7) { if (CronExpressionValidator.isNotWildCard(expressionArray[6], /[\*]/gi)) { if (!CronExpressionValidator.segmentValidator("([0-9\\\\,-\\/])", expressionArray[6], [1970, 2099], "years")) { returnfalse; } } } returntrue; } // ---------------------------------- // isNotWildcard 静态方法; // ---------------------------------- CronExpressionValidator.isNotWildCard = function(value, expression) {var match = value.match(expression); return (match == null || match.length == 0) ? true : false; } // ---------------------------------- // convertDaysToInteger 静态方法; // ---------------------------------- CronExpressionValidator.convertDaysToInteger = function(value) {var v = value; v = v.replace(/SUN/gi, "1"); v = v.replace(/MON/gi, "2"); v = v.replace(/TUE/gi, "3"); v = v.replace(/WED/gi, "4"); v = v.replace(/THU/gi, "5"); v = v.replace(/FRI/gi, "6"); v = v.replace(/SAT/gi, "7"); return v; } // ---------------------------------- // convertMonthsToInteger 静态方法; // ---------------------------------- CronExpressionValidator.convertMonthsToInteger = function(value) {var v = value; v = v.replace(/JAN/gi, "1"); v = v.replace(/FEB/gi, "2"); v = v.replace(/MAR/gi, "3"); v = v.replace(/APR/gi, "4"); v = v.replace(/MAY/gi, "5"); v = v.replace(/JUN/gi, "6"); v = v.replace(/JUL/gi, "7"); v = v.replace(/AUG/gi, "8"); v = v.replace(/SEP/gi, "9"); v = v.replace(/OCT/gi, "10"); v = v.replace(/NOV/gi, "11"); v = v.replace(/DEC/gi, "12"); return v; } // ---------------------------------- // segmentValidator 静态方法; // ---------------------------------- CronExpressionValidator.segmentValidator = function(expression, value, range, segmentName) {var v = value; var numbers = newArray(); // first, check for any improper segments var reg = newRegExp(expression, "gi"); if (!reg.test(v)) { returnfalse; } // check duplicate types // check only one L var dupMatch = value.match(/L/gi); if (dupMatch != null && dupMatch.length > 1) { returnfalse; } // look through the segments // break up segments on ',' // check for special cases L,W,C,/,#,- var split = v.split(","); var i = -1; var l = split.length; var match; while (++i < l) { // set vars var checkSegment = split[i]; var n; var pattern = /(\w*)/; match = pattern.exec(checkSegment); // if just number pattern = /(\w*)\-?\d+(\w*)/; match = pattern.exec(checkSegment); if (match && match[0] == checkSegment && checkSegment.indexOf("L") == -1 && checkSegment.indexOf("l") == -1 && checkSegment.indexOf("C") == -1 && checkSegment.indexOf("c") == -1 && checkSegment.indexOf("W") == -1 && checkSegment.indexOf("w") == -1 && checkSegment.indexOf("/") == -1 && (checkSegment.indexOf("-") == -1 || checkSegment .indexOf("-") == 0) && checkSegment.indexOf("#") == -1) { n = match[0]; if (n && !(isNaN(n))) numbers.push(n); elseif (match[0] == "0") numbers.push(n); continue; } // includes L, C, or w pattern = /(\w*)L|C|W(\w*)/i; match = pattern.exec(checkSegment); if (match && match[0] != "" && (checkSegment.indexOf("L") > -1 || checkSegment.indexOf("l") > -1 || checkSegment.indexOf("C") > -1 || checkSegment.indexOf("c") > -1 || checkSegment.indexOf("W") > -1 || checkSegment .indexOf("w") > -1)) { // check just l or L if (checkSegment == "L" || checkSegment == "l") continue; pattern = /(\w*)\d+(l|c|w)?(\w*)/i; match = pattern.exec(checkSegment); // if something before or after if (!match || match[0] != checkSegment) { continue; } // get the number var numCheck = match[0]; numCheck = numCheck.replace(/(l|c|w)/ig, ""); n = Number(numCheck); if (n && !(isNaN(n))) numbers.push(n); elseif (match[0] == "0") numbers.push(n); continue; } var numberSplit; // includes / if (checkSegment.indexOf("/") > -1) { // take first # numberSplit = checkSegment.split("/"); if (numberSplit.length != 2) { continue; } else { n = numberSplit[0]; if (n && !(isNaN(n))) numbers.push(n); elseif (numberSplit[0] == "0") numbers.push(n); continue; } } // includes # if (checkSegment.indexOf("#") > -1) { // take first # numberSplit = checkSegment.split("#"); if (numberSplit.length != 2) { continue; } else { n = numberSplit[0]; if (n && !(isNaN(n))) numbers.push(n); elseif (numberSplit[0] == "0") numbers.push(n); continue; } } // includes - if (checkSegment.indexOf("-") > 0) { // take both # numberSplit = checkSegment.split("-"); if (numberSplit.length != 2) { continue; } elseif (Number(numberSplit[0]) > Number(numberSplit[1])) { continue; } else { n = numberSplit[0]; if (n && !(isNaN(n))) numbers.push(n); elseif (numberSplit[0] == "0") numbers.push(n); n = numberSplit[1]; if (n && !(isNaN(n))) numbers.push(n); elseif (numberSplit[1] == "0") numbers.push(n); continue; } } } // lastly, check that all the found numbers are in range i = -1; l = numbers.length; if (l == 0) returnfalse; while (++i < l) { // alert(numbers[i]); if (numbers[i] < range[0] || numbers[i] > range[1]) { returnfalse; } } returntrue; }
Javascript判断Crontab表达式是否合法的更多相关文章
- 六天玩转javascript：javascript变量与表达式(2)
本系列内容为本人平时项目实践和参照MDN,MSDN,<javascript语言精粹>,<Effective Javascript>等资料,并且整理自己EverNote的日常积累 ...
- 六天玩转javascript：javascript变量与表达式(1)
说明 本系列属于进阶系列,语常用语法等不在本系列介绍范围之内. 在我刚开始做一个程序员并开发项目的时候,我总是喜欢使用开发语言的各种特性,每次m$发布新版C#的时候我总是会把开发者预览版下好,亲自体验 ...
- JavaScript判断浏览器类型及版本
JavaScript是前端开发的主要语言,我们可以通过编写JavaScript程序来判断浏览器的类型及版本.JavaScript判断浏览器类型一般有两种办法,一种是根据各种浏览器独有的属性来分辨,另一 ...
- JavaScript权威指南--表达式与运算符
本章要点 表达式是javascript中的一个短语,javascript解释器会将其计算出一个结果. 程序中的常量.变量名就是一种简单的表达式.复杂的表达式是由简单的表达式组成的,比如数组访问表达式. ...
- Javascript判断数据类型的五种方式及其特殊性
Javascript判断数据类型的五种方式及区别 @ 目录 typeof instanceof Object.prototype.toString isArray iisNaN ----------- ...
- 《如何使用Javascript判断浏览器终端设备》
WEB开发中如何通过Javascript来判断终端为PC.IOS(iphone).Android呢? 可以通过判断浏览器的userAgent,用正则来判断手机是否是ios和Android客户端. va ...
- 菜鸟笔记：javascript基础之表达式和运算符
4.1 原始表达式 原始表达式是最简单的表达式~它不再包含其他表达式.它包含:直接量(程序中直接显示出来的数据值.)常量(程序中不会被修改的量)变量. 4.2 对象和数组的初始化表达式 对象和数组初始 ...
- JavaScript判断移动端及pc端访问不同的网站
JavaScript判断移动端及pc端访问不同的网站 现在很多网站都是分为两个版本,一个pc端的一个移动端的(响应式除外),针对这两个版本,就需要对访问的设备进行判断,如果是pc,就直接访问pc网站, ...
- 如何使用Javascript判断浏览器终端设备
WEB开发中如何通过Javascript来判断终端为PC.IOS(iphone).Android呢? 可以通过判断浏览器的userAgent,用正则来判断手机是否是ios和Android客户端 var ...
随机推荐
- verilog语法实例学习(4)
Verilog模块 Verilog中代码描述的电路叫模块,模块具有以下的结构: module module_name[ (portname {, portname})]; //端口列表 [parame ...
- Android 应用程序之间内容分享详解（二）
转载请注明出处:http://blog.csdn.net/xiaanming/article/details/9428613 Android 应用程序之间内容分享详解(一) 之前给大家分享了你开发的应 ...
- Spring(AbstractRoutingDataSource)实现动态数据源切换
转自: http://blog.51cto.com/linhongyu/1615895 一.前言 近期一项目A需实现数据同步到另一项目B数据库中,在不改变B项目的情况下,只好选择项目A中切换数据源,直 ...
- go语言之进阶篇通过range遍历channel内容
1.通过range遍历channel内容 package main import ( "fmt" ) func main() { ch := make(chan int) //创建 ...
- iOS开发-简单工厂模式
设计模式(Design pattern)是一套被反复使用.多数人知晓的.经过分类编目的.代码设计经验的总结.设计模式是为了可重用代码.让代码更容易被他人理解.保证代码可靠性.概念很长,iOS开发中最常 ...
- Druid连接池简介和配置
Druid是什么?有什么作用? Druid首先是一个数据库连接池,但它不仅仅是一个数据库连接池,它还包含一个ProxyDriver,一系列内置的JDBC组件库,一个SQL Parser. Druid ...
- git版本还原
本地还原 在确认需要进行版本还原以后, 打开GIT BASH 输入: git reset --hard ad76ebf5ba8fb12bc38300ee99db478b332c1f7b 此操作成功以后 ...
- tensorflow基本操作介绍
1.tensorflow的基本运作 为了快速的熟悉TensorFlow编程,下面从一段简单的代码开始: import tensorflow as tf #定义‘符号’变量,也称为占位符 a = tf. ...
- 【转】TensorFlow四种Cross Entropy算法实现和应用
http://www.jianshu.com/p/75f7e60dae95 作者:陈迪豪 来源:CSDNhttp://dataunion.org/26447.html 交叉熵介绍 交叉熵(Cross ...
- c#：winform从一个toolstriptool上拖动一个图标到一个自定义usercontrol内。
效果: 在一个winform工程中,添加一个ToolStrip然后给它添加一个ToolStripButton(tsbStart,它就是红色框圈选的图标) this.toolStripTools = n ...