forked from JetBrains/ideavim
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
rmaddy
committed
Apr 22, 2003
1 parent
2ff5feb
commit ae97706
Showing
32 changed files
with
5,773 additions
and
0 deletions.
There are no files selected for viewing
Large diffs are not rendered by default.
Oops, something went wrong.
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,66 @@ | ||
/* | ||
* gnu/regexp/CharIndexed.java | ||
* Copyright (C) 1998-2001 Wes Biggs | ||
* | ||
* This library is free software; you can redistribute it and/or modify | ||
* it under the terms of the GNU Lesser General Public License as published | ||
* by the Free Software Foundation; either version 2.1 of the License, or | ||
* (at your option) any later version. | ||
* | ||
* This library is distributed in the hope that it will be useful, | ||
* but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
* GNU Lesser General Public License for more details. | ||
* | ||
* You should have received a copy of the GNU Lesser General Public License | ||
* along with this program; if not, write to the Free Software | ||
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | ||
*/ | ||
package gnu.regexp; | ||
|
||
/** | ||
* Defines the interface used internally so that different types of source | ||
* text can be accessed in the same way. Built-in concrete classes provide | ||
* support for String, StringBuffer, InputStream and char[] types. | ||
* A class that is CharIndexed supports the notion of a cursor within a | ||
* block of text. The cursor must be able to be advanced via the move() | ||
* method. The charAt() method returns the character at the cursor position | ||
* plus a given offset. | ||
* | ||
* @author <A HREF="mailto:wes@cacas.org">Wes Biggs</A> | ||
*/ | ||
public interface CharIndexed | ||
{ | ||
/** | ||
* Defines a constant (0xFFFF was somewhat arbitrarily chosen) | ||
* that can be returned by the charAt() function indicating that | ||
* the specified index is out of range. | ||
*/ | ||
char OUT_OF_BOUNDS = '\uFFFF'; | ||
|
||
/** | ||
* Returns the character at the given offset past the current cursor | ||
* position in the input. The index of the current position is zero. | ||
* It is possible for this method to be called with a negative index. | ||
* This happens when using the '^' operator in multiline matching mode | ||
* or the '\b' or '\<' word boundary operators. In any case, the lower | ||
* bound is currently fixed at -2 (for '^' with a two-character newline). | ||
* | ||
* @param index the offset position in the character field to examine | ||
* @return the character at the specified index, or the OUT_OF_BOUNDS | ||
* character defined by this interface. | ||
*/ | ||
char charAt(int index); | ||
|
||
/** | ||
* Shifts the input buffer by a given number of positions. Returns | ||
* true if the new cursor position is valid. | ||
*/ | ||
boolean move(int index); | ||
|
||
/** | ||
* Returns true if the most recent move() operation placed the cursor | ||
* position at a valid position in the input. | ||
*/ | ||
boolean isValid(); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,49 @@ | ||
/* | ||
* gnu/regexp/CharIndexedCharArray.java | ||
* Copyright (C) 1998-2001 Wes Biggs | ||
* | ||
* This library is free software; you can redistribute it and/or modify | ||
* it under the terms of the GNU Lesser General Public License as published | ||
* by the Free Software Foundation; either version 2.1 of the License, or | ||
* (at your option) any later version. | ||
* | ||
* This library is distributed in the hope that it will be useful, | ||
* but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
* GNU Lesser General Public License for more details. | ||
* | ||
* You should have received a copy of the GNU Lesser General Public License | ||
* along with this program; if not, write to the Free Software | ||
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | ||
*/ | ||
package gnu.regexp; | ||
|
||
import java.io.Serializable; | ||
|
||
class CharIndexedCharArray implements CharIndexed, Serializable | ||
{ | ||
private char[] s; | ||
private int anchor; | ||
|
||
CharIndexedCharArray(char[] str, int index) | ||
{ | ||
s = str; | ||
anchor = index; | ||
} | ||
|
||
public char charAt(int index) | ||
{ | ||
int pos = anchor + index; | ||
return ((pos < s.length) && (pos >= 0)) ? s[pos] : OUT_OF_BOUNDS; | ||
} | ||
|
||
public boolean isValid() | ||
{ | ||
return (anchor < s.length); | ||
} | ||
|
||
public boolean move(int index) | ||
{ | ||
return ((anchor += index) < s.length); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,49 @@ | ||
/* | ||
* gnu/regexp/CharIndexedCharArray.java | ||
* Copyright (C) 2003 Rick Maddy | ||
* | ||
* This library is free software; you can redistribute it and/or modify | ||
* it under the terms of the GNU Lesser General Public License as published | ||
* by the Free Software Foundation; either version 2.1 of the License, or | ||
* (at your option) any later version. | ||
* | ||
* This library is distributed in the hope that it will be useful, | ||
* but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
* GNU Lesser General Public License for more details. | ||
* | ||
* You should have received a copy of the GNU Lesser General Public License | ||
* along with this program; if not, write to the Free Software | ||
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | ||
*/ | ||
package gnu.regexp; | ||
|
||
import java.io.Serializable; | ||
|
||
class CharIndexedCharSequence implements CharIndexed, Serializable | ||
{ | ||
private CharSequence seq; | ||
private int anchor; | ||
|
||
CharIndexedCharSequence(CharSequence seq, int index) | ||
{ | ||
this.seq = seq; | ||
anchor = index; | ||
} | ||
|
||
public char charAt(int index) | ||
{ | ||
int pos = anchor + index; | ||
return ((pos < seq.length()) && (pos >= 0)) ? seq.charAt(pos) : OUT_OF_BOUNDS; | ||
} | ||
|
||
public boolean isValid() | ||
{ | ||
return (anchor < seq.length()); | ||
} | ||
|
||
public boolean move(int index) | ||
{ | ||
return ((anchor += index) < seq.length()); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,171 @@ | ||
/* | ||
* gnu/regexp/CharIndexedReader.java | ||
* Copyright (C) 1998-2001 Wes Biggs | ||
* | ||
* This library is free software; you can redistribute it and/or modify | ||
* it under the terms of the GNU Lesser General Public License as published | ||
* by the Free Software Foundation; either version 2.1 of the License, or | ||
* (at your option) any later version. | ||
* | ||
* This library is distributed in the hope that it will be useful, | ||
* but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
* GNU Lesser General Public License for more details. | ||
* | ||
* You should have received a copy of the GNU Lesser General Public License | ||
* along with this program; if not, write to the Free Software | ||
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | ||
*/ | ||
|
||
package gnu.regexp; | ||
|
||
import java.io.InputStream; | ||
import java.io.BufferedInputStream; | ||
import java.io.IOException; | ||
|
||
// TODO: move(x) shouldn't rely on calling next() x times | ||
|
||
class CharIndexedInputStream implements CharIndexed | ||
{ | ||
private static final int BUFFER_INCREMENT = 1024; | ||
private static final int UNKNOWN = Integer.MAX_VALUE; // value for end | ||
|
||
private BufferedInputStream br; | ||
|
||
// so that we don't try to reset() right away | ||
private int index = -1; | ||
|
||
private int bufsize = BUFFER_INCREMENT; | ||
|
||
private int end = UNKNOWN; | ||
|
||
private char cached = OUT_OF_BOUNDS; | ||
|
||
// Big enough for a \r\n pair | ||
// lookBehind[0] = most recent | ||
// lookBehind[1] = second most recent | ||
private char[] lookBehind = new char[]{OUT_OF_BOUNDS, OUT_OF_BOUNDS}; | ||
|
||
CharIndexedInputStream(InputStream str, int index) | ||
{ | ||
if (str instanceof BufferedInputStream) | ||
br = (BufferedInputStream)str; | ||
else | ||
br = new BufferedInputStream(str, BUFFER_INCREMENT); | ||
next(); | ||
if (index > 0) move(index); | ||
} | ||
|
||
private boolean next() | ||
{ | ||
if (end == 1) return false; | ||
end--; // closer to end | ||
|
||
try | ||
{ | ||
if (index != -1) | ||
{ | ||
br.reset(); | ||
} | ||
int i = br.read(); | ||
br.mark(bufsize); | ||
if (i == -1) | ||
{ | ||
end = 1; | ||
cached = OUT_OF_BOUNDS; | ||
return false; | ||
} | ||
cached = (char)i; | ||
index = 1; | ||
} | ||
catch (IOException e) | ||
{ | ||
e.printStackTrace(); | ||
cached = OUT_OF_BOUNDS; | ||
return false; | ||
} | ||
return true; | ||
} | ||
|
||
public char charAt(int index) | ||
{ | ||
if (index == 0) | ||
{ | ||
return cached; | ||
} | ||
else if (index >= end) | ||
{ | ||
return OUT_OF_BOUNDS; | ||
} | ||
else if (index == -1) | ||
{ | ||
return lookBehind[0]; | ||
} | ||
else if (index == -2) | ||
{ | ||
return lookBehind[1]; | ||
} | ||
else if (index < -2) | ||
{ | ||
return OUT_OF_BOUNDS; | ||
} | ||
else if (index >= bufsize) | ||
{ | ||
// Allocate more space in the buffer. | ||
try | ||
{ | ||
while (bufsize <= index) bufsize += BUFFER_INCREMENT; | ||
br.reset(); | ||
br.mark(bufsize); | ||
br.skip(index - 1); | ||
} | ||
catch (IOException e) | ||
{ | ||
} | ||
} | ||
else if (this.index != index) | ||
{ | ||
try | ||
{ | ||
br.reset(); | ||
br.skip(index - 1); | ||
} | ||
catch (IOException e) | ||
{ | ||
} | ||
} | ||
char ch = OUT_OF_BOUNDS; | ||
|
||
try | ||
{ | ||
int i = br.read(); | ||
this.index = index + 1; // this.index is index of next pos relative to charAt(0) | ||
if (i == -1) | ||
{ | ||
// set flag that next should fail next time? | ||
end = index; | ||
return ch; | ||
} | ||
ch = (char)i; | ||
} | ||
catch (IOException ie) | ||
{ | ||
} | ||
|
||
return ch; | ||
} | ||
|
||
public boolean move(int index) | ||
{ | ||
// move read position [index] clicks from 'charAt(0)' | ||
boolean retval = true; | ||
while (retval && (index-- > 0)) retval = next(); | ||
return retval; | ||
} | ||
|
||
public boolean isValid() | ||
{ | ||
return (cached != OUT_OF_BOUNDS); | ||
} | ||
} | ||
|
Oops, something went wrong.