IT. Expert System.

REGEX

Possesive Quantifiers


Possesive Quantifiers

Possessive quantifiers prevent a regular expression engine from trying all versions of a regex pattern, which can be useful for performance reasons. You can also use possessive quantifiers to eliminate certain matches.

A possessive quantifier is like a greedy quantifier because it will repeat the token as many times as possible, however, it will not give up matches as the engine backtracks. Adding a + makes a quantifier possessive.

The following table lists the possessive quantifiers:

Value Definition
*+ Matches the previous element zero or more times, possessive
++ Matches the previous element one or more times, possessive
?+ Matches the previous element zero or one time, possessive
{n,m}+ Matches the previous element at least n times, but no more than m times, possessive

Supported by:
Java, PCRE



Content

Android Reference

Java basics

Java Enterprise Edition (EE)

Java Standard Edition (SE)

SQL

HTML

PHP

CSS

Java Script

MYSQL

JQUERY

VBS

REGEX

C

C++

C#

Design patterns

RFC (standard status)

RFC (proposed standard status)

RFC (draft standard status)

RFC (informational status)

RFC (experimental status)

RFC (best current practice status)

RFC (historic status)

RFC (unknown status)

IT dictionary

License.
All information of this service is derived from the free sources and is provided solely in the form of quotations. This service provides information and interfaces solely for the familiarization (not ownership) and under the "as is" condition.
Copyright 2016 © ELTASK.COM. All rights reserved.
Site is optimized for mobile devices.
Downloads: 431 / 159172322. Delta: 0.03154 с