Name: Rope Maintainer: Russ Atkinson Date: October 27, 1982 Purpose: ROPE is Cedar's standard "string" type: an immutable garbage-collected sequence of characters. The Rope interface provides a large set of useful operations on ropes, including rope concatenation, subrope extraction, and rope scanning. A client can provide his own specialized implementation of ROPE. The standard implementation of ROPE avoids copying for most rope concatenation and subrope extraction operations. Filed as: [Indigo]Documentation>Rope.tioga 1. Introduction to Rope A rope (type Rope.ROPE) is a garbage-collected sequence of characters. A rope is immutable; the sequence of characters denoted by a rope never changes. Ropes may be shared freely among independently-written applications, since no application will hand out a rope and then attempt to free its storage or somehow alter the characters it contains. Because of this, rope is the standard "string" type for public Cedar interfaces. Rope is an interface that defines the type ROPE and a set of operations on ropes. Rope.mesa and Rope.bcd are brought over during Cedar installation, and the Rope interface's implementation is included in the Cedar boot file. Most Cedar programs either define ROPE: TYPE = Rope.ROPE immediately, or else OPEN Rope with a USING list. The object-style notation applies to many procedures in the Rope interface (r.Fetch[i] is the same as Rope.Fetch[r, i], if r is a ROPE), so it is seldom necessary to give the interface name explicitly even if the interface is not opened. The Cedar language provides rope literals. Such a literal is denoted by a quoted string, for instance, "This is a rope literal\n". The compiler determines that the quoted string is a rope (and not a STRING or REF TEXT) from the target type established by the context of the literal, as in r: ROPE _ "now is the time". In the current implementation the type Rope.ROPE is a REF to a variant record. One variant just contains a sequence of characters; in this case the rope is a text rope, or Rope.Text. Other variants contain references to one or more other ropes. These variants are allow the rope implementation to avoid copying when performing most Cat (rope concatenaction), Substr (subrope extraction), and Replace (an optimized combination of Cat and Substr that is often useful) operations. A large rope created using these operations will be a directed acyclic graph. This structure is a compromise; many operations slow down as the graph becomes deeper, but the Cat, Substr, and Replace operations are much faster than they would be if they had to copy long arguments. Unless a client is striving for the ultimate in efficiency, he has no need to understand more details of the rope representation. A client may use his own representation for a rope by implementing a small set of basic operations on the new representation. Examples of this are given later in this documentation. A brief summary of all the operations in the Rope interface appears below. The goal of this summary is to convey the general character of what exists, rather than all of the details. So in this summary, procedures are grouped into classes according to their function. The detailed description that comes in the next section is arranged alphabetically by procedure name. In all operations, NIL is equivalent to the null rope (""). However, not all ropes with length of zero are NIL; the correct way to test whether or not a rope r is null is by r.Length[] = 0. In fact, it is seldom useful to compare two ropes r1 and r2 using the built-in compare operation r1 = r2, since this just compares pointer values; Rope.Compare[r1, r2] should be used instead. MaxLen is the maximum number of characters in a rope; it is LAST[INT] = 2147483647. The maximum number of characters in a text rope is LAST[NAT] = 32767. The Rope interface always describes a range of characters in a rope (called a piece in the comments below) by specifying the first character position (start) and the number of characters to include (len). If start is negative or greater than the length of the rope, a bounds fault occurs (Runtime.BoundsFault, the same error used by array bounds checking). A negative value of len describes an empty piece, while an excessively large value of len describes a piece extending to the end of the rope. In the procedures below, start always defaults to 0 and len always defaults to MaxLen. Several operations take a case argument, which means "case significant". If case is TRUE, upper case characters are treated as distinct from lower case characters; if case is FALSE, an upper case character is treated as the corresponding lower case character. In the procedures below, case always defaults to TRUE (case is significant). Constructing a rope FromChar [c: CHAR] RETURNS [Text] -- returns a new rope containing the single character c FromProc [len: INT, p: PROC RETURNS [CHAR], maxPiece: INT] RETURNS [ROPE] -- returns a new rope r, Length[r] = len, contents from sequentially calling p FromRefText [s: REF TEXT] RETURNS [Text] -- returns a new rope, contents resulting from s MakeRope [base: REF ANY, size: INT, fetch: FetchType, map: MapType, pieceMap: PieceMapType] RETURNS [ROPE] -- returns a client-defined rope with given size and operations The two primitive operations on a rope Fetch [base: ROPE, index: INT] RETURNS [CHAR] -- returns the indexed character in the rope (or raises BoundsFault) -- the form base[index] does not work, but base.Fetch[index] does Length [base: ROPE] RETURNS [INT] -- returns the number of characters in base. -- the form base.length does not work, but base.Length[] (or base.Length) does Constructing a rope from other ropes Cat [r1, r2, r3, r4, r5, r6: ROPE _ NIL] RETURNS [ROPE] Concat [base, rest: ROPE] RETURNS [ROPE] -- returns the concatenation of the given ropes Replace [base: ROPE, start, len: INT, with: ROPE] RETURNS [ROPE] -- returns a new rope, contents resulting from base with the given piece replaced by replace Substr [base: ROPE, start, len: INT] RETURNS [ROPE] -- returns a new rope, contents from base (from start for len) Translate [base: ROPE, start, len: INT, translator: TranslatorType] RETURNS [ROPE] -- returns a new rope, contents from translating base (from start for len) Comparing ropes Compare [s1, s2: ROPE, case: BOOL] RETURNS [Environment.Comparison] -- returns lexicographic comparison of the contents Equal [s1, s2: ROPE, case: BOOL] RETURNS [BOOL] -- returns s1 = s2 (true iff s1 and s2 contain same sequence of characters, modulo case) IsEmpty [r: ROPE] RETURNS [BOOL] -- returns Length[r] = 0 Simple pattern matching on ropes Find [s1, s2: ROPE, pos1: INT, case: BOOL] RETURNS [INT] -- returns index of s2 in s1 (not before pos1), or -1 if s2 not found Map [base: ROPE, start, len: INT, action: ActionType] RETURNS [BOOL] -- applies action to each character in the given piece Match [pattern, object: ROPE, case: BOOL] RETURNS [BOOL] -- returns true iff object matches pattern (using * matching) Run [s1: ROPE, pos1: INT, s2: ROPE, pos2: INT, case: BOOL] RETURNS [INT] -- returns position of first difference between s1 (not before pos1) and s2 (not before pos2) SkipOver [s: ROPE, pos: INT, skip: ROPE] RETURNS [INT] -- returns first position not before pos of char in s not in skip SkipTo [s: ROPE, pos: INT, skip: ROPE] RETURNS [INT] -- returns first position not before pos of char in s in skip Constructing a mutable sequence of characters from a rope ToRefText [base: ROPE] RETURNS [REF TEXT] -- returns a new REF TEXT, contents from base Dealing with a rope's internal structure Balance [base: ROPE, start, len, flat: INT] RETURNS [ROPE] -- returns a balanced tree for the specified piece ContainingPiece [ref: ROPE, index: INT] RETURNS [base: ROPE, start, len: INT] -- returns the leaf piece containing the index for len chars Flatten [base: ROPE, start, len: INT] RETURNS [Text] -- returns a text variant rope, contents resulting from the given piece PieceMap [base: ROPE, start, len: INT, action: PieceActionType, mapUser: BOOL] RETURNS [BOOL] -- applies action to each flat piece in the given piece VerifyStructure [s: ROPE] RETURNS [leaves, nodes, maxDepth: INT] -- performs consistency checks and gathers counts for s 2. Rope Operations Signals raised through the interface The following procedures raise Runtime.BoundsFault: Fetch, if index >= base.Length[]. Any procedure returning a text rope, if the length of the rope would exceed LAST[NAT]. Any procedure returning a rope, if the length of the rope would exceed MaxLen. Any procedure with a start parameter, if start < 0 or start exceeds the length of the rope. Any procedure with a pos (or pos1 or pos2) parameter, if pos < 0. There are no values of a len parameter that raise errors: if len is too long it is shortened to indicate the rest of the rope, and if len < 0 the behavior will be as if len = 0. VerifyStructure raises VerifyFailed when it finds a problem in the rope it is examining. Any procedure may raise NoRope. This indicates that an internal consistency check has failed, and is not intended to be caught by normal clients. This error probably means that some unsafe operation in the client program has violated the type structure, though it may mean that the rope implementation is broken. Details of the operations Balance [base: ROPE, start: INT _ 0, len: INT _ MaxLen, flat: INT _ FlatMax] RETURNS [ROPE] Returns the specified piece of base as a balanced tree. The leaves of the returned rope will be a maximum of flat characters if they are copied. The leaves will be a minimum of flat/2 characters in any case (unless there is a single leaf). The flat argument will be converted to MIN[MAX[flat,FlatMax],MaxLen] before being used. A bounds fault will occur if start < 0 or start > base.Length[]. The len argument will be assigned MAX[MIN[len,base.Length[]-start],0] before being used. Larger values of flat will result in less depth, but probably more copying. Compare [s1, s2: ROPE, case: BOOL _ TRUE] RETURNS [Environment.Comparison] Compares the contents of s1 and s2 lexicographically, using ASCII character codes. Returns less if s1 < s2, equal if s1 = s2, and greater if s1 > s2. If case is TRUE, the characters are compared exactly. If case is FALSE, upper case characters are translated into corresponding lower case characters before comparison. Cat [r1, r2, r3, r4, r5, r6: ROPE _ NIL] RETURNS [ROPE] Returns a new rope, contents resulting from concatenating r1 .. r6. Copying occurs only when the result rope is small. Concat [base, rest: ROPE] RETURNS [ROPE] A synonym for Cat (but restricted to concatenating two ropes). Slightly more efficient than Cat. ContainingPiece [ref: ROPE, index: INT _ 0] RETURNS [base: ROPE, start: INT, len: INT] Given a rope and an index in the rope, ContainingPiece returns the largest piece in ref such that base is either a text or object variant, and the characters indexed by [start..start+len) in base are the same as that indexed by [index..index+len) in ref. If index < 0 or index > Length[ref]-1 then [NIL, 0, 0] is returned. Intended for use by applications demanding efficient access. Equal [s1, s2: ROPE, case: BOOL _ TRUE] RETURNS [BOOL] Returns TRUE iff contents of s1 and s2 are the same, defined as: s1.Length[] = s2.Length[] AND FOR i IN [0..s1.Length[]): s1.Fetch[i] = s2.Fetch[i] (modulo case significance). Find [s1, s2: ROPE, pos1: INT _ 0, case: BOOL _ TRUE] RETURNS [INT] Returns first position not before pos1 in s1 of an instance of s2. If case is FALSE, then upper case characters are treated as their lower case equivalents. If there is no such occurrence, returns -1. Fetch [base: ROPE, index: INT _ 0] RETURNS [CHAR] If 0 <= index < base.Length[], Fetch returns the indexed character in the rope, otherwise raises bounds fault. If the indexed character occurs in a client-defined rope, the client-supplied fetch routine may be called. Flatten [base: ROPE, start: INT _ 0, len: INT _ MaxLen] RETURNS [Text] If the piece given by base, start, and len is short enough to fit in a text variant of rope, then returns a text variant object including the contents of the specified piece. If start is negative or greater than base.Length[] or the specified piece is too large, then raises bounds fault. The object returned may be an object that existed prior to the Flatten invocation. FromChar [c: CHAR] RETURNS [Text] Returns a new text rope containing the single character c. FromProc [len: INT, p: PROC RETURNS [CHAR], maxPiece: INT _ MaxLen] RETURNS [ROPE] Returns a new rope r, where Length[r]=len, and the contents result from sequentially calling p. If len > maxPiece then the rope returned will be a balanced tree of flat ropes, each piece being no larger than maxPiece. The implementation may impose minimum and maximum limits on maxPiece (currently [24..LAST[NAT]]), and will adjust values outside of that range to be within the range. FromRefText [s: REF TEXT] RETURNS [Text] Returns a rope with length and contents from the given REF TEXT. Copying will occur. Length [base: ROPE] RETURNS [INT] Returns the number of characters in base. Note that Length[NIL] = 0. MakeRope [base: REF, size: INT, fetch: FetchType, map: MapType _ NIL, pieceMap: PieceMapType _ NIL] RETURNS [ROPE] Returns a new rope, implemented using the client-supplied size, base, and operations. Calling Rope operations using a client-defined rope results in calling the client-supplied procedures with the base reference. If the client does not supply map or pieceMap operations they will be implemented by default operations within the Rope implementation (using the client-supplied fetch procedure). The argument types are declared as: FetchType: TYPE = PROC [REF, INT] RETURNS [CHAR] MapType: TYPE = PROC [base: REF, start, len: INT, action: ActionType] RETURNS [BOOL] PieceMapType: TYPE = PROC [base: REF, start, len: INT, action: PieceActionType] RETURNS [BOOL] The fetch operation is used to fetch single characters. The map and pieceMap operations are used to map over characters and pieces from a client-defined rope, and are present for the sake of efficiency. The operations supplied should appear to be strictly functional, otherwise the correct behavior of rope operations cannot be guaranteed. Map [base: ROPE, start: INT _ 0, len: INT _ MaxLen, action: ActionType] RETURNS [BOOL] Applies the action procedure to each character in the given piece, or until the action returns TRUE. Map returns TRUE if it was stopped by action returning TRUE. The type of action is declared as: ActionType: TYPE = PROC [CHAR] RETURNS [BOOL] Match [pattern, object: ROPE, case: BOOL _ TRUE] RETURNS [BOOL] Returns TRUE iff object matches pattern. Matching takes place from left to right, and the * character in the pattern will match any number of characters in the object. If case is FALSE, alphabetic characters match either their upper or lower case equivalents, other such characters must match exactly. Examples that return TRUE: Match["a*b", "axb", TRUE] Match["Ab", "aB", FALSE] Examples that return FALSE: Match["a*b", "aaa", TRUE] Match["Ab", "aB", TRUE] PieceMap [base: ROPE, start: INT _ 0, len: INT _ MaxLen, action: PieceActionType, mapUser: BOOL _ TRUE] RETURNS [BOOL] Applies the action procedure to each leaf piece in the representation of the piece specified by base, start, and len. PieceMap terminates when all leaf pieces have been visited or the action returns TRUE. A leaf piece is either a text variant or a client-defined object. PieceMap returns TRUE if it was stopped by action returning TRUE. The leaf pieces that make up the given piece will either be of the text variant, or of the client-implemented variant, or (if mapUser is TRUE) of whatever rope variant is supplied by the client's PieceMap operation. The PieceMap routine supplied in client variants is only used if it is not NIL and the mapUser parameter is TRUE. The type of action is declared as: PieceActionType: TYPE = PROC [ROPE, INT, INT] RETURNS [BOOL] Replace [base: ROPE, start: INT _ 0, len: INT _ MaxLen, replace: ROPE _ NIL] RETURNS [ROPE] Returns a new rope, x, where x results from base with the piece indexed by start for len replaced by the contents of replace. A bounds fault occurs if start>base.Length[] or start<0 or the length of the resulting rope would exceed LAST[INT]. The resulting rope will be Equal to Cat[Cat[Substr[base, 0, start], replace], Substr[base, start+len]] Replace combines a delete with an insert at the same location, and is therefore suited for many text editing applications. Run [s1: ROPE, pos1: INT _ 0, s2: ROPE, pos2: INT _ 0, case: BOOL _ TRUE] RETURNS [INT] Returns the position of the first difference between s1 (not before pos1) and s2 (not before pos2). If case is FALSE, case is ignored in comparing characters. If no difference occurs, the length of the shorter of the ropes is returned. If pos1 > s1.length or pos2 > s2.length, then 0 will be returned. A bounds fault will occur if pos1 < 0 or pos2 < 0. SkipOver [s: ROPE, pos: INT _ 0, skip: ROPE] RETURNS [INT] Returns first position not before pos of character in s1 not in s2. If pos > Length[s], then pos will be returned. Otherwise, if no such position exists, Length[s] will be returned. SkipTo [s: ROPE, pos: INT _ 0, skip: ROPE] RETURNS [INT] Returns first position not before pos of character in s1 in s2. If pos > Length[s], then pos will be returned. Otherwise, if no such position exists, Length[s] will be returned. Substr [base: ROPE, start: INT _ 0, len: INT _ MaxLen] RETURNS [ROPE] Returns a new rope, x, with contents from the given piece of base. If start is negative or greater than base.Length[], a bounds fault will occur. Copying will not occur unless the resulting rope is small. The rope returned may have existed prior to the invocation of Substr. ToRefText [base: ROPE] RETURNS [REF TEXT] Returns a new REF TEXT containing contents from the given rope. Copying will occur. Translate [base: ROPE, start: INT _ 0, len: INT _ MaxLen, translator: TranslatorType _ NIL] RETURNS [ROPE] Returns a new ROPE constructed by applying the translator procedure to each character in the indicated piece. A NIL translator performs no translation, but the returned rope will be a copy of the given rope. TranslatorType is defined as: TranslatorType: TYPE = PROC [old: CHAR] RETURNS [new: CHAR]; VerifyStructure [s: ROPE] RETURNS [leaves, nodes, maxDepth: INT] Examines the rope s, verifying that certain representation invariants hold, and counting the leaves (text and object variants) and nodes (substr, concat, and replace variants) in the rope. The maximum depth of the rope is also returned. The error VerifyFailed is raised if a bad representation is discovered. This operation is intended for diagnostic use only. 3. Rope Pragmatics Implementation of rope literals Currently, each rope literal in a program module consumes two words of space in that module's global frame, hence in the MDS. Unlike STRING literals, rope literals do not consume large amounts of global or local frame space, and it is not valid to follow a rope literal with 'L. There is a very good chance that the global frame cost for rope literals will be reduced to a small constant someday before the MDS disappears. The binder detects multiple occurrences of the same rope literal, and only allocates a single rope no matter how often the same literal appears. This sharing is permitted since ropes are assumed to be immutable. Someday the loader may perform the same merging of rope literals. The merging algorithm could even be improved to detect a set long ropes that differ only slightly, and generate a more compact representation for the set than is possible for any of the individuals. Accumulating characters to make a rope The downside of rope immutability is that adding a single character to a rope always involves storage allocation. This is fine if somebody is actually interested in the resulting rope, but in many applications a program only wishes to accept characters one by one until some event happens, then produce a rope for the final result. The obvious solution is to accumulate the characters in a REF TEXT buffer (see the escape from rope section below), then produce a rope using Rope.FromText. A standard way to accomplish the same thing without directly manipulating a REF TEXT is to use IOStream.CreateOutputStreamToRope. This returns an IOStream.Handle h on which the client can perform h.PutChar[char] until all the characters are needed as a rope; then h.GetOutputStreamRope[] returns the rope. The IOStream interface provides several other more specialized ways of generating ropes: PutFR, GetToken, GetMesaToken, GetRope, GetLine. See the IOStream documentation for more information. If efficiency is crucial, a client can create a Rope.Text using RopeInline.NewText, and set its length and contents directly. In this case the client must be careful to avoid changing the object (length or contents) after passing it to any external client as a rope, and to ensure that the length field is consistent with the maximum length of the text rope (length <= max). Unsafe conversions to and from rope Some Cedar programs must deal with STRINGs passed through existing Mesa interfaces. The ConvertUnsafe interface is provided for these programs to use. It contains the following procedures, which are almost self-explanatory: AppendRefText: PROC [to: LONG STRING, from: REF READONLY TEXT]; AppendRope: PROC [to: LONG STRING, from: ROPE]; ToRefText: PROC [from: LONG STRING] RETURNS [REF TEXT]; ToRope: PROC [from: LONG STRING] RETURNS [Rope.Text]; Note that no allocation of uncounted storage is done behind the ConvertUnsafe interface (the client passes storage into the Append* procedures). Also note that the compiler will lengthen a STRING into a LONG STRING, so no separate procedures are needed to deal with short STRINGs. In some cases the following hack is justified: r: Rope.Text _ RopeInline.InlineFlatten[sourceRope]; s: LONG STRING _ LOOPHOLE[r]; -- now use s ... This should be used only if high efficiency is important and if there is high probability that sourceRope is already flat (is a text rope). This trick is banned if the fake string s is being passed to someone who might modify it, or someone who might retain and use a reference to it after the (reference-counted) reference r has disappeared. Think carefully before using this one! Speedups from using other rope interfaces For applications that are limited in performance by the performance of the Rope package, one possible way of improving the performance (at considerable cost in code space) is to use some of the inline routines defined in RopeInline. It is recommended that this step be delayed until proven to be necessary. The RopeInline level of interface is likely to be much more volatile that the Rope level, and implementation details cannot be guaranteed to remain fixed. For an application that exhibits good locality of reference to a rope (successive Fetch calls are often consecutive or have nearly-equal indices), a considerable speedup is available by in effect opening a stream on the rope (to keep state between fetches). Bill Paxton has developed an unreleased package of this kind for Tioga's use; see him for more information. Escape from rope Sometimes rope is just not what you need: you need a structure to hold together some characters, and you update these characters so frequently (and pass them around in such well-controlled ways) that the extra expense of rope allocation is not acceptable. Then you should use REF TEXT (documented in the language manual). The RefText interface provides operations identical to the rope comparison and pattern matching procedures, but for REF TEXT. It also provides some procedures with no analogy for rope. These include a destructive append operation and a pool of preallocated TEXTs that can be time-shared among separate applications. See the interface RefText.mesa for more information. How deep ropes impact performance Because ropes try to avoid copying for Cat, Substr, and Replace operations, the depth of the tree used to represent a rope object can become arbitrarily deep. For invocations of Map and PieceMap operations this additional depth may lead to errors due to exhaustion of frame space (which comes from MDS). The standard implementation attempts to keep the depth small by flattening small ropes into text variants and by rebalancing deep ropes. A client may wish to further reduce the depth of a rope object through various means, including rebalancing the tree (via Balance). There are practical limits on flattening. No flat piece composed solely of a text variant may be longer than LAST[NAT]. Also, virtual memory space may be quite limited, so large amounts of flattening of large ropes will first fragment, then exhaust virtual memory. The cost of the Fetch operation will be proportional to the depth of the tree in the worst case. The cost of the Map and PieceMap operations is mostly dependent on the number of pieces present in the given range of indexes, and the number of times the action routines are called. Two examples of user-defined rope The first example is a simple computed sequence of characters corresponding to the ASCII character set. That is, the sequence is 256 characters long, character 0 has code 0, and so on. We write the procedures as follows: MyFetch: PROC [base: REF, index: INT] RETURNS [CHAR] = { RETURN [LOOPHOLE[LowHalf[index], CHAR]]}; MakeAsciiSet: PROC [] RETURNS [ROPE] = { RETURN [MakeRope[base: NIL, size: 256, fetch: MyFetch]]}; The MakeAsciiSet procedure creates a rope that can be used as any other rope. It "behaves" as a sequence of 256 characters in rope operations. However, it does not occupy as much space as a sequence of 256 characters. The second example is that of a file that has been made into a rope. To keep things simple we shall assume the following file interface: OpenRead [name: ROPE] RETURNS [File] ReadBuffer [file: File, index: INT, buffer: REF TEXT] ByteLength [file: File] RETURNS [INT] The OpenRead operation excludes others from writing the file, so we don't have to worry about its contents changing. Given the above operations, we can write the following program to make a file into a rope: MyRef: TYPE = REF MyData; MyData: TYPE = MONITORED RECORD [ need: BOOL, -- TRUE if buffer is invalid length: INT, -- byte length of file pageIndex: INT, -- byte index of page in buffer file: File, -- file object for this rope buf: REF TEXT -- buffer for this rope ]; FileFetch: PROC [r: REF, index: INT] RETURNS [CHAR] = { FileFetchEntry: ENTRY PROC [rr: MyRef, index: INT] RETURNS [CHAR] = INLINE { pageIndex: INT _ rr.pageIndex; IF index >= rr.length THEN ERROR; -- should never happen IF rr.need OR index NOT IN [pageIndex..pageIndex+PageSize) THEN { -- need a different buffer of characters rr.pageIndex _ pageIndex _ index MOD PageSize; ReadPage[rr.file, pageIndex, rr.buf]; rr.need _ FALSE}; RETURN [rr.buf[NARROW[index-pageIndex, NAT]]] }; WITH r SELECT FROM rr: MyRef => RETURN[FileFetchEntry[rr, index]]; ENDCASE => ERROR; -- should never happen }; MakeFileRope: PROC [name: ROPE] RETURNS [ROPE] = { file: File _ OpenRead[name]; length: INT _ ByteLength[file]; buf: REF TEXT _ NEW[TEXT[PageSize]]; base: MyRef _ NEW[MyData _ [need: TRUE, length: length, pageIndex: 0, file: file, buf: buf]]; RETURN [MakeRope[base: base, size: length, fetch: FileFetch]]}; The above program fragment is not a very good implementation for a file rope. We have made no provision for closing the file or dealing with an error such as an aborted transaction. Random access to this file rope could lead to intolerable thrashing, with a page read for every fetch. The lack of copying for Cat, Substr, and Replace would serve to make the problem worse, since many fragments of the file could be accessible. A better implementation might use flat ropes for short files, Pilot spaces for moderate-length files, and multiple buffers for large files (approaching Pilot virtual space limits). It would also include explicit procedures for map and pieceMap operations to make such access efficient. A. Appendix: Rope operations that are provided for backward compatability We discourage the use of the following types and procedures; they are documented here so that the reader of old code can understand what they do. Index [s1: ROPE, pos1: INT, s2: ROPE, case: BOOL _ TRUE] RETURNS [INT] Returns first position not before pos1 in s1 of an instance of s2. If there is no such occurrence, Length[s1] is returned. This operation is an older version of Find. Size [base: ROPE] RETURNS [INT] A synonym for Length. B. Appendix: Modules in the Rope implementation The Rope package interfaces are described by [Indigo]Top>Rigging.df; the implementation is described by [Indigo]Top>RiggingMaker.df. The principal modules are: Rope -- definitions RopeInline -- inline definitions RopeImpl -- implementation for most operations RopeImplExt -- implementation for scanning operations -- (Find, Match, SkipOver, SkipTo, Run, VerifyStructure) ��J�"SimpleDoc" style��bl�@�s�`�o��"��7�1��il��'��$� ��5��c��D��B��G��H��+��f�i �� !��3��0��5��&��,��6��6�� F��D��+��L��F��?��O��/��O��j��b��7�� N��7��F��?��&�� D��A��,��N��$��/��\��>�� J�� 3�� X��n��k��c�� E��6��=��]��A��=��9�� -��(��2�� <��G��$�� 7��7��$�!��L��M�� :�� "��F��O�� ~�� >�� 3��d��{��R�� T�� O��J�� Q��x�� >�� K��9��>�� #��)�� a��'��'�� :��W��'��:�� -�B�~�� r�� @� �� (�� {�� q��&�P�� O��!��!��5��m��i� ��-�� #�%��/� �}�� A� �/��;��:��6�4�� _� �L��<�)�� R� ��+��i��n�!�)��t��h��r��]��!�� +�� 3��0��(�:��k�� )��;��"��#��!��@��:��K��0��%��)��8��J��u��