| java.lang.Object
 gnu.lists.AbstractSequence
gnu.jemacs.buffer.Buffer
All known Subclasses: gnu.jemacs.swt.SwtBuffer, gnu.jemacs.swing.SwingBuffer,
| Method Summary | |
| public void | backwardChar(int i)
| | public char | charAt(int index)
| | public int | charWidth(char ch, int column)
| | public int | checkMark()
| | public static Buffer | coerceBuffer(Object buf)
| | public void | consume(int start, int count, gnu.lists.Consumer out)
| | public int | countColumns(char[] chars, int start, int count, int initial)
| | public int | currentColumn()
| | public int | currentColumn(int offset)
Return the column number at a specified offset. | | public EWindow | display(boolean notThisWindow, EFrame frame)
| | public void | fill(char value)
| | public void | fill(int fromIndex, int toIndex, char value)
| | public static Buffer | findFile(String fname)
| | public void | forwardChar(int i)
| | final public long | forwardLine(int lines, int start)
Find the position a give number of lines forward or backward. | | public int | forwardLine(int lines)
| | public static String | generateNewBufferName(String start)
| | public static Buffer | getBuffer(String name)
| | public void | getChars(int srcBegin, int srcEnd, char[] dst, int dstBegin)
| | public static Buffer | getCurrent()
| | public int | getDot()
| | public String | getFileName()
| | abstract public int | getLength()
| | public EKeymap | getLocalKeymap()
| | public Marker | getMarkMarker(boolean force)
| | public String | getName()
| | public Path | getPath()
| | public int | getPoint()
| | public Marker | getPointMarker(boolean share)
| | abstract public CharSeq | getStringContent()
| | abstract public void | insert(String string, Object style, int ipos)
Insert string with given style at position pair. | | public void | insert(char[] chars, int offset, int count, Object style, int ipos)
Insert character with given style at position pair. | | public void | insert(String string, Object style)
| | public void | insert(Object value, Object style)
| | public void | insert(char ch, int count)
Insert count copies of ch at point. | | public void | insert(char ch, int count, Object style)
Insert count copies of ch at point. | | public void | insertAll(Object[] values, Object style)
| | abstract public void | insertFile(Reader in)
| | public void | insertFile(String filename)
| | abstract public void | invoke(Runnable doRun)
This is intended for Runnable's that may affect the state of the buffer. | | final public int | length()
| | abstract public int | lineStartOffset(int offset)
| | public int | lineStartOffset()
| | public static void | makeBufferLocal(Object symbol, boolean all)
| | abstract public int | maxDot()
| | public int | minDot()
| | public int | moveToColumn(int column, boolean force)
| | abstract public InPort | openReader(int start, int count)
| | public int | positionToOffset(Object position)
Convert an Emacs position (Marker, or 1-origin integer)
to a (0-origin) buffer offset. | | abstract public void | redrawModeline()
| | abstract public void | removeAll()
| | public void | removeChar(int count)
| | abstract public void | restorePointMark(long pointMark)
| | abstract public void | save(Writer out)
| | public void | save()
| | abstract public long | savePointMark()
| | abstract public long | scan(char target, int start, int end, int count, boolean allowQuit)
Search in BUF for COUNT instances of the character TARGET between START and END.
If COUNT is positive, search forwards; END must be >= START.
If COUNT is negative, search backwards for the -COUNTth instance;
END must be <= START.
If COUNT is zero, do anything you please; run rogue, for all I care.
If END is zero, use beginning or end of (FIXME: accessible part of)
the buffer, as appropriate for the direction indicated by COUNT.
If we find COUNT instances, SHORTAGE is zero, and return the
position after the COUNTth match. | | public void | setCharAt(int index, char ch)
| | public static void | setCurrent(Buffer buffer)
| | public void | setDot(int i)
| | public void | setFileName(String fname)
| | public void | setLocalKeymap(EKeymap map)
| | public void | setPath(Path path)
| | final public void | setPoint(int i)
| | public CharSequence | subSequence(int start, int end)
| | public String | toString()
| | public void | writeTo(int start, int count, java.io.Writer dest)
| | public void | writeTo(java.io.Writer str)
|
| activeLength | | int activeLength(Code) | | |
| eliminated | | int eliminated(Code) | | |
| localBindings | | Object[] localBindings(Code) | | Buffer-local variable bindings.
Represented as pairs of (Symbol, value)-pairs:
For an even integer i, if localBindings[i]
is a Symbol, there is a buffer-local binding
whose value is localBindings{i+1].
|
| modes | | Mode modes(Code) | | List of modes active for this buffer, major mode first.
|
| backwardChar | | public void backwardChar(int i)(Code) | | |
| charWidth | | public int charWidth(char ch, int column)(Code) | | |
| checkMark | | public int checkMark()(Code) | | |
| countColumns | | public int countColumns(char[] chars, int start, int count, int initial)(Code) | | |
| currentColumn | | public int currentColumn()(Code) | | |
| currentColumn | | public int currentColumn(int offset)(Code) | | Return the column number at a specified offset.
|
| forwardChar | | public void forwardChar(int i)(Code) | | |
| forwardLine | | final public long forwardLine(int lines, int start)(Code) | | Find the position a give number of lines forward or backward.
A side-effect-free version of Emacs's forward-line function.
Parameters:
lines - number of lines forward (or backward if negative)
Parameters:
start - initial position (buffer offset) (SHORTAGE<<32|POS) |
| forwardLine | | public int forwardLine(int lines)(Code) | | |
| getDot | | public int getDot()(Code) | | |
| getLength | | abstract public int getLength()(Code) | | |
| getMarkMarker | | public Marker getMarkMarker(boolean force)(Code) | | |
| getPoint | | public int getPoint()(Code) | | |
| getPointMarker | | public Marker getPointMarker(boolean share)(Code) | | |
| insert | | abstract public void insert(String string, Object style, int ipos)(Code) | | Insert string with given style at position pair.
|
| insert | | public void insert(char[] chars, int offset, int count, Object style, int ipos)(Code) | | Insert character with given style at position pair.
|
| insert | | public void insert(char ch, int count)(Code) | | Insert count copies of ch at point.
|
| insert | | public void insert(char ch, int count, Object style)(Code) | | Insert count copies of ch at point.
|
| invoke | | abstract public void invoke(Runnable doRun)(Code) | | This is intended for Runnable's that may affect the state of the buffer.
The implementation should make shure that the GUI is properly updated before
control returns
Parameters:
doRun - |
| length | | final public int length()(Code) | | |
| lineStartOffset | | abstract public int lineStartOffset(int offset)(Code) | | |
| lineStartOffset | | public int lineStartOffset()(Code) | | |
| makeBufferLocal | | public static void makeBufferLocal(Object symbol, boolean all)(Code) | |
Parameters:
all - true if make-variable-buffer-local,false if make-local-variable FIXME |
| maxDot | | abstract public int maxDot()(Code) | | |
| minDot | | public int minDot()(Code) | | |
| moveToColumn | | public int moveToColumn(int column, boolean force)(Code) | | |
| openReader | | abstract public InPort openReader(int start, int count)(Code) | | |
| positionToOffset | | public int positionToOffset(Object position)(Code) | | Convert an Emacs position (Marker, or 1-origin integer)
to a (0-origin) buffer offset.
|
| redrawModeline | | abstract public void redrawModeline()(Code) | | |
| removeAll | | abstract public void removeAll()(Code) | | |
| removeChar | | public void removeChar(int count)(Code) | | |
| restorePointMark | | abstract public void restorePointMark(long pointMark)(Code) | | |
| savePointMark | | abstract public long savePointMark()(Code) | | |
| scan | | abstract public long scan(char target, int start, int end, int count, boolean allowQuit)(Code) | | Search in BUF for COUNT instances of the character TARGET between START and END.
If COUNT is positive, search forwards; END must be >= START.
If COUNT is negative, search backwards for the -COUNTth instance;
END must be <= START.
If COUNT is zero, do anything you please; run rogue, for all I care.
If END is zero, use beginning or end of (FIXME: accessible part of)
the buffer, as appropriate for the direction indicated by COUNT.
If we find COUNT instances, SHORTAGE is zero, and return the
position after the COUNTth match. Note that for reverse motion
this is not the same as the usual convention for Emacs motion commands.
If we don't find COUNT instances before reaching END, set SHORTAGE
to the number of TARGETs left unfound, and return (shortage<<32|END).
(SHORTAGE<<32|POS) |
| setCurrent | | public static void setCurrent(Buffer buffer)(Code) | | |
| setDot | | public void setDot(int i)(Code) | | |
| setPoint | | final public void setPoint(int i)(Code) | | |
| Methods inherited from gnu.lists.AbstractSequence | public boolean add(Object o)(Code)(Java Doc)
public void add(int index, Object o)(Code)(Java Doc)
public boolean addAll(Collection c)(Code)(Java Doc)
public boolean addAll(int index, Collection c)(Code)(Java Doc)
protected int addPos(int ipos, Object value)(Code)(Java Doc)
public void clear()(Code)(Java Doc)
public int compare(int ipos1, int ipos2)(Code)(Java Doc)
final public int compare(SeqPosition i1, SeqPosition i2)(Code)(Java Doc)
public static int compare(AbstractSequence seq1, int pos1, AbstractSequence seq2, int pos2)(Code)(Java Doc)
public void consume(Consumer out)(Code)(Java Doc)
public boolean consumeNext(int ipos, Consumer out)(Code)(Java Doc)
public void consumePosRange(int iposStart, int iposEnd, Consumer out)(Code)(Java Doc)
public boolean contains(Object o)(Code)(Java Doc)
public boolean containsAll(Collection c)(Code)(Java Doc)
public int copyPos(int ipos)(Code)(Java Doc)
abstract public int createPos(int index, boolean isAfter)(Code)(Java Doc)
public int createRelativePos(int pos, int delta, boolean isAfter)(Code)(Java Doc)
final public Enumeration elements()(Code)(Java Doc)
public int endPos()(Code)(Java Doc)
public boolean equals(int ipos1, int ipos2)(Code)(Java Doc)
public boolean equals(Object o)(Code)(Java Doc)
public void fill(Object value)(Code)(Java Doc)
public void fill(int fromIndex, int toIndex, Object value)(Code)(Java Doc)
public void fillPosRange(int fromPos, int toPos, Object value)(Code)(Java Doc)
public int firstAttributePos(int ipos)(Code)(Java Doc)
public int firstChildPos(int ipos)(Code)(Java Doc)
public int firstChildPos(int ipos, ItemPredicate predicate)(Code)(Java Doc)
protected int fromEndIndex(int ipos)(Code)(Java Doc)
abstract public Object get(int index)(Code)(Java Doc)
public Object get(int[] indexes)(Code)(Java Doc)
public Object getAttribute(int index)(Code)(Java Doc)
public int getAttributeLength()(Code)(Java Doc)
protected int getContainingSequenceSize(int ipos)(Code)(Java Doc)
public int getEffectiveIndex(int[] indexes)(Code)(Java Doc)
protected int getIndexDifference(int ipos1, int ipos0)(Code)(Java Doc)
final public SeqPosition getIterator()(Code)(Java Doc)
public SeqPosition getIterator(int index)(Code)(Java Doc)
public SeqPosition getIteratorAtPos(int ipos)(Code)(Java Doc)
public int getLowBound(int dim)(Code)(Java Doc)
public int getNextKind(int ipos)(Code)(Java Doc)
public String getNextTypeName(int ipos)(Code)(Java Doc)
public Object getNextTypeObject(int ipos)(Code)(Java Doc)
public Object getPosNext(int ipos)(Code)(Java Doc)
public Object getPosPrevious(int ipos)(Code)(Java Doc)
public int getSize(int dim)(Code)(Java Doc)
protected boolean gotoAttributesStart(TreePosition pos)(Code)(Java Doc)
final public boolean gotoChildrenStart(TreePosition pos)(Code)(Java Doc)
protected boolean gotoParent(TreePosition pos)(Code)(Java Doc)
public boolean hasNext(int ipos)(Code)(Java Doc)
protected boolean hasPrevious(int ipos)(Code)(Java Doc)
public int hashCode()(Code)(Java Doc)
public int indexOf(Object o)(Code)(Java Doc)
protected boolean isAfterPos(int ipos)(Code)(Java Doc)
public boolean isEmpty()(Code)(Java Doc)
final public Iterator iterator()(Code)(Java Doc)
public int lastIndexOf(Object o)(Code)(Java Doc)
final public ListIterator listIterator()(Code)(Java Doc)
final public ListIterator listIterator(int index)(Code)(Java Doc)
protected int nextIndex(int ipos)(Code)(Java Doc)
final public int nextIndex(SeqPosition pos)(Code)(Java Doc)
public int nextMatching(int startPos, ItemPredicate type, int endPos, boolean descend)(Code)(Java Doc)
public int nextPos(int ipos)(Code)(Java Doc)
public int parentPos(int ipos)(Code)(Java Doc)
public int previousPos(int ipos)(Code)(Java Doc)
public int rank()(Code)(Java Doc)
protected void releasePos(int ipos)(Code)(Java Doc)
public Object remove(int index)(Code)(Java Doc)
public boolean remove(Object o)(Code)(Java Doc)
public boolean removeAll(Collection c)(Code)(Java Doc)
public void removePos(int ipos, int count)(Code)(Java Doc)
protected void removePosRange(int ipos0, int ipos1)(Code)(Java Doc)
public boolean retainAll(Collection c)(Code)(Java Doc)
public Object set(int[] indexes, Object value)(Code)(Java Doc)
public Object set(int index, Object element)(Code)(Java Doc)
protected void setPosNext(int ipos, Object value)(Code)(Java Doc)
protected void setPosPrevious(int ipos, Object value)(Code)(Java Doc)
abstract public int size()(Code)(Java Doc)
public int stableCompare(AbstractSequence other)(Code)(Java Doc)
public int startPos()(Code)(Java Doc)
public List subList(int fromIx, int toIx)(Code)(Java Doc)
public Sequence subSequence(SeqPosition start, SeqPosition end)(Code)(Java Doc)
protected Sequence subSequencePos(int ipos0, int ipos1)(Code)(Java Doc)
public Object[] toArray()(Code)(Java Doc)
public Object[] toArray(Object[] arr)(Code)(Java Doc)
public void toString(String sep, StringBuffer sbuf)(Code)(Java Doc)
public String toString()(Code)(Java Doc)
protected RuntimeException unsupported(String text)(Code)(Java Doc)
public static RuntimeException unsupportedException(String text)(Code)(Java Doc)
|
|
|