this.regionStart = start; this.regionEnd = end; resetForInput();
/** * Sets a new pattern for the {@code Matcher}. Results of a previous find * get lost. The next attempt to find an occurrence of the {@link Pattern} * in the string will start at the beginning of the input. * * @param pattern * the new {@code Pattern}. * * @return the {@code Matcher} itself. */ public Matcher usePattern(Pattern pattern) { if (pattern == null) { throw new IllegalArgumentException("pattern == null"); } this.pattern = pattern; synchronized (this) { if (address != 0) { closeImpl(address); address = 0; // In case openImpl throws. } address = openImpl(pattern.address); } if (input != null) { resetForInput(); } matchOffsets = new int[(groupCount() + 1) * 2]; matchFound = false; return this; }
this.regionStart = start; this.regionEnd = end; resetForInput();
this.regionStart = start; this.regionEnd = end; resetForInput();
this.regionStart = start; this.regionEnd = end; resetForInput();
this.regionStart = start; this.regionEnd = end; resetForInput();
this.regionStart = start; this.regionEnd = end; resetForInput();
this.regionStart = start; this.regionEnd = end; resetForInput();
/** * Sets a new pattern for the {@code Matcher}. Results of a previous find * get lost. The next attempt to find an occurrence of the {@link Pattern} * in the string will start at the beginning of the input. * * @param pattern * the new {@code Pattern}. * * @return the {@code Matcher} itself. */ public Matcher usePattern(Pattern pattern) { if (pattern == null) { throw new IllegalArgumentException("pattern == null"); } this.pattern = pattern; synchronized (this) { if (address != 0) { closeImpl(address); address = 0; // In case openImpl throws. } address = openImpl(pattern.address); } if (input != null) { resetForInput(); } matchOffsets = new int[(groupCount() + 1) * 2]; matchFound = false; return this; }
/** * Sets a new pattern for the {@code Matcher}. Results of a previous find * get lost. The next attempt to find an occurrence of the {@link Pattern} * in the string will start at the beginning of the input. * * @param pattern * the new {@code Pattern}. * * @return the {@code Matcher} itself. */ public Matcher usePattern(Pattern pattern) { if (pattern == null) { throw new IllegalArgumentException("pattern == null"); } this.pattern = pattern; synchronized (this) { if (address != 0) { closeImpl(address); address = 0; // In case openImpl throws. } address = openImpl(pattern.address); } if (input != null) { resetForInput(); } matchOffsets = new int[(groupCount() + 1) * 2]; matchFound = false; return this; }
/** * Sets a new pattern for the {@code Matcher}. Results of a previous find * get lost. The next attempt to find an occurrence of the {@link Pattern} * in the string will start at the beginning of the input. * * @param pattern * the new {@code Pattern}. * * @return the {@code Matcher} itself. */ public Matcher usePattern(Pattern pattern) { if (pattern == null) { throw new IllegalArgumentException("pattern == null"); } this.pattern = pattern; synchronized (this) { if (address != 0) { closeImpl(address); address = 0; // In case openImpl throws. } address = openImpl(pattern.address); } if (input != null) { resetForInput(); } matchOffsets = new int[(groupCount() + 1) * 2]; matchFound = false; return this; }
/** * Sets a new pattern for the {@code Matcher}. Results of a previous find * get lost. The next attempt to find an occurrence of the {@link Pattern} * in the string will start at the beginning of the input. * * @param pattern * the new {@code Pattern}. * * @return the {@code Matcher} itself. */ public Matcher usePattern(Pattern pattern) { if (pattern == null) { throw new IllegalArgumentException("pattern == null"); } this.pattern = pattern; synchronized (this) { if (address != 0) { closeImpl(address); address = 0; // In case openImpl throws. } address = openImpl(pattern.address); } if (input != null) { resetForInput(); } matchOffsets = new int[(groupCount() + 1) * 2]; matchFound = false; return this; }
/** * Sets a new pattern for the {@code Matcher}. Results of a previous find * get lost. The next attempt to find an occurrence of the {@link Pattern} * in the string will start at the beginning of the input. * * @param pattern * the new {@code Pattern}. * * @return the {@code Matcher} itself. */ public Matcher usePattern(Pattern pattern) { if (pattern == null) { throw new IllegalArgumentException("pattern == null"); } this.pattern = pattern; synchronized (this) { if (address != 0) { closeImpl(address); address = 0; // In case openImpl throws. } address = openImpl(pattern.address); } if (input != null) { resetForInput(); } matchOffsets = new int[(groupCount() + 1) * 2]; matchFound = false; return this; }
/** * Sets a new pattern for the {@code Matcher}. Results of a previous find * get lost. The next attempt to find an occurrence of the {@link Pattern} * in the string will start at the beginning of the input. * * @param pattern * the new {@code Pattern}. * * @return the {@code Matcher} itself. */ public Matcher usePattern(Pattern pattern) { if (pattern == null) { throw new IllegalArgumentException("pattern == null"); } this.pattern = pattern; synchronized (this) { if (address != 0) { closeImpl(address); address = 0; // In case openImpl throws. } address = openImpl(pattern.address); } if (input != null) { resetForInput(); } matchOffsets = new int[(groupCount() + 1) * 2]; matchFound = false; return this; }