
DIRECTORY
BasicTime USING [GMT],
Char,
IO,
NodeReader,
Rope,
TBase,
TextEdit,
TextNode,
Tioga;

TBaseImpl: CEDAR PROGRAM
IMPORTS Char, IO, NodeReader, Rope, TextEdit, TextNode
EXPORTS TBase
~ BEGIN OPEN TBase;
ROPE: TYPE ~ Rope.ROPE;
Map: PUBLIC PROC [direction: Direction, loc1, loc2: Location, action: MapAction] 
RETURNS [quit: BOOL м FALSE] ~ {
scratch: NodeReader.Ref ~ NodeReader.New[];
{ -- for EXITS
SELECT direction FROM
forward => {
FOR node: Node _ loc1.node, TextNode.StepForward[node] UNTIL node=NIL DO
rdr: NodeReader.Ref ~ NodeReader.New[node, scratch];
i0: INT ~ IF node=loc1.node THEN loc1.where ELSE 0;
i1: INT ~ IF node=loc2.node THEN loc2.where ELSE NodeReader.Size[rdr];
FOR i: INT IN[i0..i1) DO
IF action[node, i, NodeReader.FetchChar[rdr, i]] THEN GOTO Quit;
ENDLOOP;
IF node=loc2.node THEN EXIT;
ENDLOOP;
};
backward => {
FOR node: Node _ loc2.node, TextNode.StepBackward[node] UNTIL node=NIL DO
rdr: NodeReader.Ref ~ NodeReader.New[node, scratch];
i0: INT ~ IF node=loc1.node THEN loc1.where ELSE 0;
i1: INT ~ IF node=loc2.node THEN loc2.where ELSE NodeReader.Size[rdr];
FOR i: INT DECREASING IN[i0..i1) DO
IF action[node, i, NodeReader.FetchChar[rdr, i]] THEN GOTO Quit;
ENDLOOP;
IF node=loc1.node THEN EXIT;
ENDLOOP;
};
ENDCASE => ERROR;
EXITS Quit => quit м TRUE;
};
NodeReader.Free[scratch];
};

ExpandToBrackets: PUBLIC PROC [char1, char2: XCHAR, loc1, loc2, 
bound1, bound2: Location, includeInResult: BOOL] 
RETURNS [found: BOOL м FALSE, result1, result2: Location м [NIL, 0]] ~ {
nest: CARD м 0;
action1: MapAction ~ {
SELECT char FROM
char1 => IF nest>0 THEN nest м nest-1 ELSE {
result1 м [node, IF includeInResult THEN index ELSE index+1];
quit м TRUE;
};
char2 => nest м nest+1;
ENDCASE;
};
action2: MapAction ~ {
SELECT char FROM
char2 => IF nest>0 THEN nest м nest-1 ELSE {
result2 м [node, IF includeInResult THEN index+1 ELSE index];
quit м TRUE;
};
char1 => nest м nest+1;
ENDCASE;
};
found м Map[backward, bound1, loc1, action1] AND Map[forward, loc2, bound2, action2];
IF NOT found THEN RETURN[FALSE]; -- to ensure null result locations
};

FindBrackets: PUBLIC PROC [direction: Direction, char1, char2: XCHAR, loc: Location, 
bound1, bound2: Location, includeInResult: BOOL м TRUE] 
RETURNS [found: BOOL м FALSE, result1, result2: Location м [NIL, 0]] ~ {
seed: Location;
action1: MapAction ~ {
IF char=char1 THEN { seed _ [node, index+1]; quit м TRUE };
};
action2: MapAction ~ {
IF char=char2 THEN { seed _ [node, index]; quit м TRUE };
};
SELECT direction FROM
forward => found м Map[forward, loc, bound2, action1];
backward => found м Map[backward, bound1, loc, action2];
ENDCASE;
IF NOT found THEN RETURN[FALSE]
ELSE RETURN ExpandToBrackets[char1: char1, char2: char2, loc1: seed, loc2: seed, 
bound1: bound1, bound2: bound2, includeInResult: includeInResult];
};

InsertBrackets: PUBLIC PROC [loc1, loc2: Location, rope1, rope2: ROPE, 
looks: Looks, props: PropList, includeInResult: BOOL, 
event: Event] RETURNS [result1, result2: Location] ~ {
start1, len1, start2, len2: INT;
[resultStart: start2, resultLen: len2] м TextEdit.ReplaceByRope[
root: NIL, dest: loc2.node, start: loc2.where, len: 0, 
rope: rope2, charSet: 0, looks: looks, charProps: props, event: event];
[resultStart: start1, resultLen: len1] м TextEdit.ReplaceByRope[
root: NIL, dest: loc1.node, start: loc1.where, len: 0, 
rope: rope1, charSet: 0, looks: looks, charProps: props, event: event];
IF loc1.node=loc2.node THEN start2 м start2+len1;
IF includeInResult
THEN RETURN[[loc1.node, start1], [loc2.node, start2+len2]]
ELSE RETURN[[loc1.node, start1+len1], [loc2.node, start2]];
};
MakeControlChar: PUBLIC PROC [node: Node, caret: INT, event: Event] 
RETURNS [ok: BOOL м FALSE, resultStart, resultLen: INT м 0] ~ {
IF caret>0 THEN {
index: INT ~ caret-1;
action: TextEdit.ModifyCharsAction ~ {
IF set=0 THEN { char м VAL[ORD[char] MOD 40B]; ok м TRUE };
RETURN[char];
};
TextEdit.ModifyChars[root: NIL, dest: node, start: index, len: 1, action: action, event: event];
IF ok THEN { resultStart м index; resultLen м 1 };
};
};

UnMakeControlChar: PUBLIC PROC [node: Node, caret: INT, event: Event] 
RETURNS [ok: BOOL м FALSE, resultStart, resultLen: INT м 0] ~ {
IF caret>0 THEN {
index: INT ~ caret-1;
action: TextEdit.ModifyCharsAction ~ {
IF set=0 AND ORD[char]<40B THEN { char м VAL[100B+ORD[char]]; ok м TRUE };
RETURN[char];
};
TextEdit.ModifyChars[root: NIL, dest: node, start: index, len: 1, action: action, event: event];
IF ok THEN { resultStart м index; resultLen м 1 };
};
};

x0: XCHAR ~ Char.Widen['0];
x7: XCHAR ~ Char.Widen['7];
MakeOctalChar: PUBLIC PROC [node: Node, caret: INT, event: Event] 
RETURNS [ok: BOOL м FALSE, resultStart, resultLen: INT м 0] ~ {
end: INT ~ caret;
start: INT м end;
code: Char.CharCode м 0;
set: Char.CharSet м 0;
GetChar: PROC [want: CHAR] RETURNS [BOOL м FALSE] ~ {
IF start>0 THEN {
index: INT ~ start-1;
char: Char.XCHAR ~ TextEdit.FetchChar[node, index];
IF char=Char.Widen[want] THEN { start м index; RETURN[TRUE] };
};
};
GetOctal: PROC [count: NAT] RETURNS [CARDINAL м 0] = {
IF count>0 AND start>0 THEN {
index: INT ~ start-1;
char: Char.XCHAR ~ TextEdit.FetchChar[node, index];
IF char IN [x0..x7] THEN {
digit: [0..8) ~ ORD[char]-ORD[x0];
start м index;
RETURN[IF count>0 THEN GetOctal[count-1]*8+digit ELSE digit];
};
};
};
IF GetChar[')]
THEN {
code м GetOctal[3];
IF NOT GetChar['|] THEN GOTO Bad;
set м GetOctal[3];
IF NOT GetChar['(] THEN GOTO Bad;
}
ELSE {
code м GetOctal[3];
};
IF NOT (start<end AND set<256) THEN GOTO Bad;
[resultStart: resultStart, resultLen: resultLen] м TextEdit.ReplaceByRope[
root: NIL, dest: node, start: start, len: end-start,
rope: Rope.FromChar[VAL[code]], charSet: set, 
looks: TextEdit.FetchLooks[node, start], 
charProps: TextEdit.GetCharPropList[node, start], 
event: event];
ok м TRUE;
EXITS Bad => RETURN[FALSE];
};

UnMakeOctalChar: PUBLIC PROC [node: Node, caret: INT, event: Event] 
RETURNS [ok: BOOL м FALSE, resultStart, resultLen: INT м 0] ~ {
IF caret>0 THEN {
index: INT ~ caret-1;
char: XCHAR ~ TextEdit.FetchChar[node, index];
set: Char.CharSet ~ Char.Set[char];
code: Char.CharCode ~ Char.Code[char];
rope: ROPE ~ IF set=0
THEN IO.PutFR1["%03b", IO.card[code]]
ELSE IO.PutFR["(%03b|%03b)", IO.card[set], IO.card[code]];
[resultStart: resultStart, resultLen: resultLen] м TextEdit.ReplaceByRope[
root: NIL, dest: node, start: index, len: 1, 
rope: rope, charSet: 0, 
looks: TextEdit.FetchLooks[node, index], 
charProps: TextEdit.GetCharPropList[node, index], 
event: event];
ok м TRUE;
};
};

SetFormat: PUBLIC PROC [node1, node2: Node, format: ATOM, event: Event м NIL] ~ {
FOR node: Node м node1, TextNode.StepForward[node] UNTIL node=NIL DO
TextEdit.PutFormat[node, format, event];
IF node=node2 THEN EXIT;
ENDLOOP 
};

SetComment: PUBLIC PROC [node1, node2: Node, comment: BOOL, event: Event м NIL] ~ {
FOR node: Node м node1, TextNode.StepForward[node] UNTIL node=NIL DO
TextEdit.PutComment[node, comment, event];
IF node=node2 THEN EXIT;
ENDLOOP 
};

InsertTime: PUBLIC PROC [node: Node, index: INT, gmt: BasicTime.GMT, 
looks: Looks м noLooks, props: PropList м NIL, event: Event м NIL] 
RETURNS [resultStart, resultLen, dateLen: INT] ~ {
date: ROPE ~ IO.PutR1[[time[gmt]]];
dateLen м Rope.Index[date, 0, ", "];
IF dateLen<Rope.Size[date] THEN dateLen м Rope.Index[date, dateLen+2, " "];
[resultStart: resultStart, resultLen: resultLen] м TextEdit.ReplaceByRope[
root: NIL, dest: node, start: index, len: 0, 
rope: date, charSet: 0, looks: looks, charProps: props, 
event: event];
};

END.
   @  
TBaseImpl.mesa
Copyright ╙ 1991, 1992 by Xerox Corporation.  All rights reserved.
Doug Wyatt, March 6, 1992 4:17 pm PST


GetChars: PROC [loc1, loc2: Location] RETURNS [rope: ROPE м NIL] ~ {
newline: ROPE ~ TextEdit.GetNewlineDelimiter[TextNode.Root[loc1.node]];
FOR node: Node _ loc1.node, TextNode.StepForward[node] UNTIL node=NIL DO
i0: INT ~ IF node=loc1.node THEN loc1.where ELSE 0;
i1: INT ~ IF node=loc2.node THEN loc2.where ELSE TextEdit.Size[node];
nrope: ROPE ~ Rope.Substr[TextEditBogus.GetRope[node], i0, i1];
rope м Rope.Concat[rope, nrope];
IF node=loc2.node THEN EXIT;
rope м Rope.Concat[rope, newline];
ENDLOOP;
};

Sel: TYPE ~ PACKED RECORD [
pdel: BOOL,
grain: SelectionGrain,
caret: BeforeAfter,
loc: ARRAY BeforeAfter OF Location
];

extend [loc1..loc2) until includes matching left and right brackets


 Э╩
М  Ц(cedarcode) styleХNewlineDelimiter
Щ codeЪЬЩKЪЬ
╧eЬ7ЩBKЩ%ЧKШ Ъ╧k	Ш	KЪЬ
ЮЬЮЬШKЪЬШKЪЮЬШKЪЬШKЪЬШKЪЬШKШ	KШ	KШЧKШ KЪ╧n	ЬЮЬЮШKЪЮЬЮЬ&Ш6KЪЮЬШЪЬЮЬЮЬШKЩ ЧЪЮЬЮЬЮЬШKЩ ЧЪ
ЯЬЮЬЮЬЮЬЮЬЩDKЪЬ	ЮЬ:ЩGЪЮЬ4ЮЬЮЬЮЩHKЪ	ЬЮЬЮЬЮЬЮЬЩ3KЪ	ЬЮЬЮЬЮЬЮЬЩEKЪЬЮЬ4Щ?KЪЬ Щ KЪЮЬЮЬЮЬЩKЪЬ"Щ"KЪЮЬЩЧKЩKЩ ЧЪЬЮЬЮЬЮЬЩKЪЬЮЬЩKЩKЩKЪЬЮЬЮЬ	Щ"KЩKЩ ЧЪЯЬЮЬЮЬBЮЬЮЬЮЬШrKЪЬ+Ш+ЪЬ╧cШЪЮЬЮШШЪЮЬ4ЮЬЮЬЮШHKЪЬ4Ш4KЪ	ЬЮЬЮЬЮЬЮЬШ3KЪ	ЬЮЬЮЬЮЬЮЬШFЪЮЬЮЬЮЬ	ЮШJЪЮЬ/ЮЬЮЬШ@KЪЮЬШЧKЪЮЬЮЬЮЬШKЪЮЬШЧKШЧШЪЮЬ5ЮЬЮЬЮШIKЪЬ4Ш4KЪ	ЬЮЬЮЬЮЬЮЬШ3KЪ	ЬЮЬЮЬЮЬЮЬШFЪ	ЮЬЮЬЮ
ЬЮЬ	ЮШ#JЪЮЬ/ЮЬЮЬШ@KЪЮЬШЧKЪЮЬЮЬЮЬШKЪЮЬШЧKШЧKЪЮЬЮЬШЧKЪЮЬЮЬШKШЧKЪЬШKШKШ ЧЪЯЬЮЬЮЬЮЬ:ЮЬЮЬ	ЮЬЮЬ ЮЬ	Ш╗KЪЬCЩCKЪЬЮЬШЪЬШЪЮЬЮШЪЬ	ЮЬЮЬЮЬШ,KЪЬЮЬЮЬЮЬ
Ш=KЪЬЮЬШKЪЬШЧKЪЬШKЪЮЬШЧKШЧЪЬШЪЮЬЮШЪЬ	ЮЬЮЬЮЬШ,KЪЬЮЬЮЬ	ЮЬШ=KЪЬЮЬШKЪЬШЧKЪЬШKЪЮЬШЧKШЧKЪЬ-ЮЬ%ШUKЪЮЬЮЬЮЬЮЬЮЬа"ШCKШKШ ЧЪЯЬЮЬЮЬ&ЮЬ=ЮЬЮЬЮЬ	ЮЬЮЬ ЮЬ	Ш╫KШЪЬШKЪЮЬЮЬ"ЮЬШ;KШЧЪЬШKЪЮЬЮЬ ЮЬШ9KШЧЪЮЬЮШKЪЬ6Ш6KЪЬ8Ш8KЪЮЬШЧKЪ
ЮЬЮЬЮЬЮЬЮЬШKЪЮЬЮЬЙШФKШKШ ЧЪЯЬЮЬЮЬ&ЮЬ3ЮЬЮЬ!Ш╡KЪЬЮЬШ KЪЬGЮЬvШ└KЪЬGЮЬvШ└KЪЮЬЮЬШ1ЪЮЬШKЪЮЬЮЬ/Ш:KЪЮЬЮЬ0Ш;ЧKШKЩ ЧЪЯЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬ	ШДЪЮЬ	ЮЬШKЪЬЮЬШЪЬ&Ш&KЪЮЬЮЬ
ЮЬЮЬЮЬЮЬШ;KЪЮЬШKШЧKЪЬЮЬBШ`KЪЮЬЮЬ(Ш2KШЧKШKШ ЧЪЯЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬ	ШЖЪЮЬ	ЮЬШKЪЬЮЬШЪЬ&Ш&KЪЮЬЮЬЮЬЮЬ
ЮЬЮЬЮЬШJKЪЮЬШKШЧKЪЬЮЬBШ`KЪЮЬЮЬ(Ш2KШЧKШKШ ЧKЪЬЮЬШЪЬЮЬШKЩ ЧЪЯЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬ	ШВKЪЬЮЬ	ШKЪЬЮЬШKШKШЪЯЬЮЬЮЬЮЬЮЬЮЬШ5ЪЮЬ	ЮЬШKЪЬЮЬШKЪЬЮЬ#Ш3KЪЮЬЮЬЮЬЮЬШ>KШЧKШЧЪ
ЯЬЮЬ	ЮЬЮЬЮЬ	Ш6ЪЮЬ	ЮЬ	ЮЬШKЪЬЮЬШKЪЬЮЬ#Ш3ЪЮЬЮЬ
ЮЬШKЪЬЮЬЮЬШ"KШKЪЮЬЮЬ	ЮЬЮЬШ=KШЧKШЧKШЧЪЮЬШЪЮЬШKШKЪЮЬЮЬЮЬЮЬШ!KШKЪЮЬЮЬЮЬЮЬШ!KШЧЪЮЬШKШKШЧЧKЪ
ЮЬЮЬЮЬ
ЮЬЮЬШ-KЪЬQЮЬ@ЮЬГШЪKЪЬЮЬШ
KЪЮЬЮЬЮЬШKШKШ ЧЪЯЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬ	ШДЪЮЬ	ЮЬШKЪЬЮЬШKЪЬЮЬ#Ш.KШ#KЪЬ&Ш&ЪЬЮЬЮЬШKЪЮЬЮЬЮЬШ%KЪЮЬЮЬЮЬЮЬШ:ЧKЪЬQЮЬйШ¤KЪЬЮЬШ
KШЧKШKШ ЧЪ
Я	ЬЮЬЮЬЮЬЮЬШQЪЮЬ0ЮЬЮЬЮШDKЪЬ(Ш(KЪЮЬЮЬЮЬШKЪЮЬШЧKШKШ ЧЪ
Я
ЬЮЬЮЬЮЬЮЬШSЪЮЬ0ЮЬЮЬЮШDKШ*KЪЮЬЮЬЮЬШKЪЮЬШЧKШKШ ЧЪЯ
ЬЮЬЮЬЮЬЮЬ-ЮЬЮЬЮЬ#ЮЬШ╝KЪЬЮЬЮЬШ#KЪЬ$Ш$KЪЮЬЮЬ,ШKKЪЬQЮЬlШ└KШЧJШ KЪЮЬШЧ ЕЧ    j  +6  