PageRenderTime 39ms CodeModel.GetById 8ms RepoModel.GetById 1ms app.codeStats 0ms

/mercatitulo/static/plugins/RobinHerbots-jquery.inputmask-b584195/js/inputmask.regex.extensions.js

https://gitlab.com/cavadu/mercatitulo
JavaScript | 215 lines | 197 code | 6 blank | 12 comment | 45 complexity | 4733c1c138e57bee26eea3fbe8ef3b8b MD5 | raw file
  1. /*
  2. Input Mask plugin extensions
  3. http://github.com/RobinHerbots/jquery.inputmask
  4. Copyright (c) 2010 - Robin Herbots
  5. Licensed under the MIT license (http://www.opensource.org/licenses/mit-license.php)
  6. Version: 0.0.0-dev
  7. Regex extensions on the jquery.inputmask base
  8. Allows for using regular expressions as a mask
  9. */
  10. (function (factory) {
  11. if (typeof define === "function" && define.amd) {
  12. define(["inputmask.dependencyLib", "inputmask"], factory);
  13. } else if (typeof exports === "object") {
  14. module.exports = factory(require("./inputmask.dependencyLib.jquery"), require("./inputmask"));
  15. } else {
  16. factory(window.dependencyLib || jQuery, window.Inputmask);
  17. }
  18. }
  19. (function ($, Inputmask) {
  20. Inputmask.extendAliases({ // $(selector).inputmask("Regex", { regex: "[0-9]*"}
  21. "Regex": {
  22. mask: "r",
  23. greedy: false,
  24. repeat: "*",
  25. regex: null,
  26. regexTokens: null,
  27. //Thx to https://github.com/slevithan/regex-colorizer for the tokenizer regex
  28. tokenizer: /\[\^?]?(?:[^\\\]]+|\\[\S\s]?)*]?|\\(?:0(?:[0-3][0-7]{0,2}|[4-7][0-7]?)?|[1-9][0-9]*|x[0-9A-Fa-f]{2}|u[0-9A-Fa-f]{4}|c[A-Za-z]|[\S\s]?)|\((?:\?[:=!]?)?|(?:[?*+]|\{[0-9]+(?:,[0-9]*)?\})\??|[^.?*+^${[()|\\]+|./g,
  29. quantifierFilter: /[0-9]+[^,]/,
  30. isComplete: function (buffer, opts) {
  31. return new RegExp(opts.regex).test(buffer.join(""));
  32. },
  33. definitions: {
  34. "r": {
  35. validator: function (chrs, maskset, pos, strict, opts) {
  36. var cbuffer = maskset.buffer.slice(),
  37. bufferStr,
  38. regexPart = "",
  39. isValid = false,
  40. openGroupCount = 0,
  41. groupToken;
  42. function RegexToken(isGroup, isQuantifier) {
  43. this.matches = [];
  44. this.isGroup = isGroup || false;
  45. this.isQuantifier = isQuantifier || false;
  46. this.quantifier = {
  47. min: 1,
  48. max: 1
  49. };
  50. this.repeaterPart = undefined;
  51. }
  52. function analyseRegex() {
  53. var currentToken = new RegexToken(),
  54. match, m, opengroups = [];
  55. opts.regexTokens = [];
  56. // The tokenizer regex does most of the tokenization grunt work
  57. while (match = opts.tokenizer.exec(opts.regex)) {
  58. m = match[0];
  59. switch (m.charAt(0)) {
  60. case "(": // Group opening
  61. opengroups.push(new RegexToken(true));
  62. break;
  63. case ")": // Group closing
  64. groupToken = opengroups.pop();
  65. if (opengroups.length > 0) {
  66. opengroups[opengroups.length - 1].matches.push(groupToken);
  67. } else {
  68. currentToken.matches.push(groupToken);
  69. }
  70. break;
  71. case "{":
  72. case "+":
  73. case "*": //Quantifier
  74. var quantifierToken = new RegexToken(false, true);
  75. m = m.replace(/[{}]/g, "");
  76. var mq = m.split(","),
  77. mq0 = isNaN(mq[0]) ? mq[0] : parseInt(mq[0]),
  78. mq1 = mq.length === 1 ? mq0 : (isNaN(mq[1]) ? mq[1] : parseInt(mq[1]));
  79. quantifierToken.quantifier = {
  80. min: mq0,
  81. max: mq1
  82. };
  83. if (opengroups.length > 0) {
  84. var matches = opengroups[opengroups.length - 1].matches;
  85. match = matches.pop();
  86. if (!match.isGroup) {
  87. groupToken = new RegexToken(true);
  88. groupToken.matches.push(match);
  89. match = groupToken;
  90. }
  91. matches.push(match);
  92. matches.push(quantifierToken);
  93. } else {
  94. match = currentToken.matches.pop();
  95. if (!match.isGroup) {
  96. groupToken = new RegexToken(true);
  97. groupToken.matches.push(match);
  98. match = groupToken;
  99. }
  100. currentToken.matches.push(match);
  101. currentToken.matches.push(quantifierToken);
  102. }
  103. break;
  104. default:
  105. if (opengroups.length > 0) {
  106. opengroups[opengroups.length - 1].matches.push(m);
  107. } else {
  108. currentToken.matches.push(m);
  109. }
  110. break;
  111. }
  112. }
  113. if (currentToken.matches.length > 0) {
  114. opts.regexTokens.push(currentToken);
  115. }
  116. }
  117. function validateRegexToken(token, fromGroup) {
  118. var isvalid = false;
  119. if (fromGroup) {
  120. regexPart += "(";
  121. openGroupCount++;
  122. }
  123. for (var mndx = 0; mndx < token.matches.length; mndx++) {
  124. var matchToken = token.matches[mndx];
  125. if (matchToken.isGroup === true) {
  126. isvalid = validateRegexToken(matchToken, true);
  127. } else if (matchToken.isQuantifier === true) {
  128. var crrntndx = $.inArray(matchToken, token.matches),
  129. matchGroup = token.matches[crrntndx - 1];
  130. var regexPartBak = regexPart;
  131. if (isNaN(matchToken.quantifier.max)) {
  132. while (matchToken.repeaterPart && matchToken.repeaterPart !== regexPart && matchToken.repeaterPart.length > regexPart.length) {
  133. isvalid = validateRegexToken(matchGroup, true);
  134. if (isvalid) break;
  135. }
  136. isvalid = isvalid || validateRegexToken(matchGroup, true);
  137. if (isvalid) matchToken.repeaterPart = regexPart;
  138. regexPart = regexPartBak + matchToken.quantifier.max;
  139. } else {
  140. for (var i = 0, qm = matchToken.quantifier.max - 1; i < qm; i++) {
  141. isvalid = validateRegexToken(matchGroup, true);
  142. if (isvalid) break;
  143. }
  144. regexPart = regexPartBak + "{" + matchToken.quantifier.min + "," + matchToken.quantifier.max + "}";
  145. }
  146. } else if (matchToken.matches !== undefined) {
  147. for (var k = 0; k < matchToken.length; k++) {
  148. isvalid = validateRegexToken(matchToken[k], fromGroup);
  149. if (isvalid) break;
  150. }
  151. } else {
  152. var testExp;
  153. if (matchToken.charAt(0) == "[") {
  154. testExp = regexPart;
  155. testExp += matchToken;
  156. for (var j = 0; j < openGroupCount; j++) {
  157. testExp += ")";
  158. }
  159. var exp = new RegExp("^(" + testExp + ")$");
  160. isvalid = exp.test(bufferStr);
  161. } else {
  162. for (var l = 0, tl = matchToken.length; l < tl; l++) {
  163. if (matchToken.charAt(l) === "\\") continue;
  164. testExp = regexPart;
  165. testExp += matchToken.substr(0, l + 1);
  166. testExp = testExp.replace(/\|$/, "");
  167. for (var j = 0; j < openGroupCount; j++) {
  168. testExp += ")";
  169. }
  170. var exp = new RegExp("^(" + testExp + ")$");
  171. isvalid = exp.test(bufferStr);
  172. if (isvalid) break;
  173. }
  174. }
  175. regexPart += matchToken;
  176. }
  177. if (isvalid) break;
  178. }
  179. if (fromGroup) {
  180. regexPart += ")";
  181. openGroupCount--;
  182. }
  183. return isvalid;
  184. }
  185. if (opts.regexTokens === null) {
  186. analyseRegex();
  187. }
  188. cbuffer.splice(pos, 0, chrs);
  189. bufferStr = cbuffer.join("");
  190. for (var i = 0; i < opts.regexTokens.length; i++) {
  191. var regexToken = opts.regexTokens[i];
  192. isValid = validateRegexToken(regexToken, regexToken.isGroup);
  193. if (isValid) break;
  194. }
  195. return isValid;
  196. },
  197. cardinality: 1
  198. }
  199. }
  200. }
  201. });
  202. return Inputmask;
  203. }));