{"id":256,"date":"2014-02-03T17:43:26","date_gmt":"2014-02-03T17:43:26","guid":{"rendered":"https:\/\/alt2.minisoft.com\/support\/?p=256"},"modified":"2017-03-08T17:33:14","modified_gmt":"2017-03-08T17:33:14","slug":"quantifiers","status":"publish","type":"post","link":"https:\/\/c002.minisoft.com\/support\/quantifiers\/","title":{"rendered":"Quantifiers"},"content":{"rendered":"<p>Quantifiers specify the number of instances a character or character class must be present in the input for a match to be found. Quantifiers can be greedy or lazy. Greedy quantifiers match as many occurrences of a particular pattern as possible. Appending the ? character to a quantifier makes it lazy, which will match as few occurrences as possible:<\/p>\n<p>&nbsp;<\/p>\n<hr \/>\n<p>&nbsp;<\/p>\n<table>\n<tbody>\n<tr>\n<td width=\"103\"><strong>*<\/strong><\/td>\n<td width=\"535\">0 or more. Example: X* is X zero or more times<\/td>\n<\/tr>\n<tr>\n<td width=\"103\"><strong>*?<\/strong><\/td>\n<td width=\"535\">0 or more (lazy)<\/td>\n<\/tr>\n<tr>\n<td width=\"103\"><strong>+<\/strong><\/td>\n<td width=\"535\">1 or more<\/td>\n<\/tr>\n<tr>\n<td width=\"103\"><strong>+?<\/strong><\/td>\n<td width=\"535\">1 or more (lazy)<\/td>\n<\/tr>\n<tr>\n<td width=\"103\"><strong>?<\/strong><\/td>\n<td width=\"535\">0 or 1<\/td>\n<\/tr>\n<tr>\n<td width=\"103\"><strong>??<\/strong><\/td>\n<td width=\"535\">0 or 1 (lazy)<\/td>\n<\/tr>\n<tr>\n<td width=\"103\"><strong>{}<\/strong><\/td>\n<td width=\"535\">Exact number. Example: {3} is exactly 3<\/td>\n<\/tr>\n<tr>\n<td width=\"103\"><strong>{3,}<\/strong><\/td>\n<td width=\"535\">3 or more<\/td>\n<\/tr>\n<tr>\n<td width=\"103\"><strong>{3,5}<\/strong><\/td>\n<td width=\"535\">3, 4 or 5<\/td>\n<\/tr>\n<tr>\n<td width=\"103\"><strong>{3,5}?<\/strong><\/td>\n<td width=\"535\">3, 4 or 5 (lazy)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Quantifiers specify the number of instances a character or character class must be present in the input for a match to be found. Quantifiers can be greedy or lazy. Greedy quantifiers match as many occurrences of a particular pattern as possible. Appending the ? character to a quantifier makes it lazy, which will match as [&hellip;]<\/p>\n","protected":false},"author":75,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[58],"tags":[100,5,6],"_links":{"self":[{"href":"https:\/\/c002.minisoft.com\/support\/wp-json\/wp\/v2\/posts\/256"}],"collection":[{"href":"https:\/\/c002.minisoft.com\/support\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/c002.minisoft.com\/support\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/c002.minisoft.com\/support\/wp-json\/wp\/v2\/users\/75"}],"replies":[{"embeddable":true,"href":"https:\/\/c002.minisoft.com\/support\/wp-json\/wp\/v2\/comments?post=256"}],"version-history":[{"count":8,"href":"https:\/\/c002.minisoft.com\/support\/wp-json\/wp\/v2\/posts\/256\/revisions"}],"predecessor-version":[{"id":4702,"href":"https:\/\/c002.minisoft.com\/support\/wp-json\/wp\/v2\/posts\/256\/revisions\/4702"}],"wp:attachment":[{"href":"https:\/\/c002.minisoft.com\/support\/wp-json\/wp\/v2\/media?parent=256"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/c002.minisoft.com\/support\/wp-json\/wp\/v2\/categories?post=256"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/c002.minisoft.com\/support\/wp-json\/wp\/v2\/tags?post=256"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}