DIRECTORY
Basics USING [BoundsCheckInt, NonNegative],
Char USING [CharCode, CharSet, Make, XCHAR],
NodeReader USING [Ref, Rep, CharInfo],
Rope USING [ROPE, AppendChars, Size],
Rosary USING [ROSARY, ContainingRun, FetchContainingRun],
TextEdit USING [CharSetFromItem, LooksFromItem, PropListFromItem],
TextFind USING [CharMap, CharMapFromCase],
Tioga USING [Node, Looks, PropList];

NodeReaderImpl: CEDAR MONITOR
IMPORTS Basics, Char, Rope, Rosary, TextEdit, TextFind
EXPORTS NodeReader
= BEGIN

ROPE: TYPE ~ Rope.ROPE;
ROSARY: TYPE ~ Rosary.ROSARY;
Ref: TYPE ~ NodeReader.Ref;
Rep: TYPE ~ NodeReader.Rep;
CharInfo: TYPE ~ NodeReader.CharInfo;

CacheIndex: TYPE ~ [0..3);
cache: ARRAY CacheIndex OF Ref м ALL[NIL];

CacheAlloc: ENTRY PROC RETURNS [reader: Ref м NIL] = {
FOR i: CacheIndex IN CacheIndex DO
IF (reader м cache[i])#NIL THEN { cache[i] м NIL; EXIT };
ENDLOOP;
};

CacheFree: ENTRY PROC [reader: Ref] = {
FOR i: CacheIndex IN CacheIndex DO
IF cache[i]=reader THEN RETURN; -- don't cache it twice!
ENDLOOP;
FOR i: CacheIndex IN CacheIndex DO
IF cache[i]=NIL THEN { cache[i] м reader; EXIT };
ENDLOOP;
};

New: PUBLIC PROC [node: Tioga.Node, oldReader: Ref м NIL] RETURNS [reader: Ref] ~ {
reader м oldReader;
IF reader=NIL THEN reader м CacheAlloc[];
IF reader=NIL THEN reader м NEW[Rep];
Set[reader, node];
};

Free: PUBLIC PROC [reader: Ref] ~ {
Set[reader, NIL];
CacheFree[reader];
};

textSize: NAT ~ 128;

Set: PUBLIC PROC [reader: Ref, node: Tioga.Node] ~ {
IF node#NIL
THEN SetParts[reader, node.rope, node.runs, node.charSets, node.charProps]
ELSE SetParts[reader, NIL, NIL, NIL, NIL];
};

SetParts: PUBLIC PROC [reader: Ref, rope: ROPE, runs, charSets, charProps: ROSARY] ~ {
text: REF TEXT м reader.text;
IF text=NIL OR text.maxLength<textSize THEN text м NEW[TEXT[textSize]];
readerн м [];
reader.text м text;
reader.size м Rope.Size[rope];
reader.rope м rope;
reader.runs м runs;
reader.charSets м charSets;
reader.charProps м charProps;
IF reader.size>0 THEN {
IF runs=NIL THEN reader.looksEnd м reader.size; -- noLooks for all chars
IF charSets=NIL THEN reader.charSetEnd м reader.size; -- 0 for all chars
IF charProps=NIL THEN reader.propsEnd м reader.size; -- NIL for all chars
};
};

UpdateText: PROC [reader: Ref, index: INT] ~ {
start: INT ~ (Basics.BoundsCheckInt[index, reader.size]/textSize)*textSize;
text: REF TEXT ~ reader.text;
IF text.maxLength<textSize THEN ERROR;
text.length м 0;
[] м Rope.AppendChars[buffer: text, rope: reader.rope, start: start, len: textSize];
reader.textStart м start;
reader.textEnd м start+text.length;
};

UpdateLooks: PROC [reader: Ref, index: INT] ~ {
run: Rosary.ContainingRun ~ Rosary.FetchContainingRun[reader.runs, index];
reader.looks м TextEdit.LooksFromItem[run.item];
reader.looksStart м run.start;
reader.looksEnd м run.end;
};

UpdateCharSet: PROC [reader: Ref, index: INT] ~ {
run: Rosary.ContainingRun ~ Rosary.FetchContainingRun[reader.charSets, index];
reader.charSet м TextEdit.CharSetFromItem[run.item];
reader.charSetStart м run.start;
reader.charSetEnd м run.end;
};

UpdateProps: PROC [reader: Ref, index: INT] ~ {
run: Rosary.ContainingRun ~ Rosary.FetchContainingRun[reader.charProps, index];
reader.props м TextEdit.PropListFromItem[run.item];
reader.propsStart м run.start;
reader.propsEnd м run.end;
};

Fetch: PUBLIC PROC [reader: Ref, index: INT] RETURNS [CharInfo] ~ {
IF index NOT IN [reader.textStart..reader.textEnd) THEN UpdateText[reader, index];
IF index NOT IN [reader.looksStart..reader.looksEnd) THEN UpdateLooks[reader, index];
IF index NOT IN [reader.charSetStart..reader.charSetEnd) THEN UpdateCharSet[reader, index];
IF index NOT IN [reader.propsStart..reader.propsEnd) THEN UpdateProps[reader, index];
RETURN[[char: Char.Make[reader.charSet, ORD[reader.text[index-reader.textStart]]], 
looks: reader.looks, props: reader.props]];
};

FetchChar: PUBLIC PROC [reader: Ref, index: INT] RETURNS [Char.XCHAR] ~ {
IF index NOT IN [reader.textStart..reader.textEnd) THEN UpdateText[reader, index];
IF index NOT IN [reader.charSetStart..reader.charSetEnd) THEN UpdateCharSet[reader, index];
RETURN[Char.Make[reader.charSet, ORD[reader.text[index-reader.textStart]]]];
};

FetchCharSet: PUBLIC PROC [reader: Ref, index: INT] RETURNS [Char.CharSet] ~ {
IF index NOT IN [reader.charSetStart..reader.charSetEnd) THEN UpdateCharSet[reader, index];
RETURN[reader.charSet];
};

FetchCharCode: PUBLIC PROC [reader: Ref, index: INT] RETURNS [Char.CharCode] ~ {
IF index NOT IN [reader.textStart..reader.textEnd) THEN UpdateText[reader, index];
RETURN[ORD[reader.text[index-reader.textStart]]];
};

FetchLooks: PUBLIC PROC [reader: Ref, index: INT] RETURNS [Tioga.Looks] ~ {
IF index NOT IN [reader.looksStart..reader.looksEnd) THEN UpdateLooks[reader, index];
RETURN[reader.looks];
};

FetchProps: PUBLIC PROC [reader: Ref, index: INT] RETURNS [Tioga.PropList] ~ {
IF index NOT IN [reader.propsStart..reader.propsEnd) THEN UpdateProps[reader, index];
RETURN[reader.props];
};

Run: PUBLIC PROC [r1: Ref, pos1: INT, r2: Ref, pos2: INT, case: BOOL, len: INT] 
RETURNS [count: INT м 0] ~ {
rem1: INT ~ Basics.NonNegative[r1.size-Basics.NonNegative[pos1]];
rem2: INT ~ Basics.NonNegative[r2.size-Basics.NonNegative[pos2]];
maxCount: INT ~ MIN[len, rem1, rem2];
WHILE count<maxCount DO
i1: INT ~ pos1+count;
i2: INT ~ pos2+count;
IF i1 NOT IN [r1.charSetStart..r1.charSetEnd) THEN UpdateCharSet[r1, i1];
IF i2 NOT IN [r2.charSetStart..r2.charSetEnd) THEN UpdateCharSet[r2, i2];
IF r1.charSet#r2.charSet THEN EXIT;
IF i1 NOT IN [r1.textStart..r1.textEnd) THEN UpdateText[r1, i1];
IF i2 NOT IN [r2.textStart..r2.textEnd) THEN UpdateText[r2, i2];
{
map: TextFind.CharMap ~ TextFind.CharMapFromCase[case OR r1.charSet#0];
runLen: NAT ~ MIN[maxCount-count, 
r1.textEnd-i1, r2.textEnd-i2, r1.charSetEnd-i1, r2.charSetEnd-i2];
base1: NAT ~ i1-r1.textStart;
base2: NAT ~ i2-r2.textStart;
FOR k: NAT IN[0..runLen) DO
IF map[r1.text[base1+k]]#map[r2.text[base2+k]] THEN RETURN[count+k];
ENDLOOP;
count м count+runLen;
};
ENDLOOP;
};


END.
   Ж  
NodeReaderImpl.mesa
Copyright ╙ 1991, 1992 by Xerox Corporation.  All rights reserved.
Doug Wyatt, March 27, 1992 4:52 pm PST

Э╩ц  ХNewlineDelimiter
Ц(cedarcode) styleЩ codeЪЬЩKЪЬ
╧eЬ7ЩBKЩ&KЩ ЧЪ╧k	Ш	KЪЬЮЬШ+KЪЬЮЬЮЬШ,KЪЬЮЬШ&KЪЬЮЬЮЬШ%KЪЬЮЬЮЬ%Ш9KЪЬ	ЮЬ4ШBKЪЬ	ЮЬШ*KЪЬЮЬШ$ЧKШ KЪ╧nЬЮЬЮШKЪЮЬ/Ш6KЪЮЬШЪЬЮШKШ ЧKЪЮЬЮЬЮЬШKЪЮЬЮЬ
ЮЬШKЪЬЮЬШKЪЬЮЬШKЪЬ
ЮЬШ%KШ KЪЬЮЬ
ШЪ	ЬЮЬЮЬЮЬЮЬШ*KШ ЧЪ
Я
ЬЮЬЮЬЮЬЮЬШ6ЪЮЬЮЬЮШ"KЪ
ЮЬЮЬЮЬЮЬЮЬШ9KЪЮЬШЧKШKШ ЧЪЯ	ЬЮЬЮЬШ'ЪЮЬЮЬЮШ"KЪЮЬЮЬЮЬ╧cШ8KЪЮЬШЧЪЮЬЮЬЮШ"KЪЮЬ
ЮЬЮЬЮЬШ1KЪЮЬШЧKШKШ ЧЪ
ЯЬЮЬЮЬ%ЮЬЮЬШSKЪЬШKЪЮЬЮЬЮЬШ)KЪЮЬЮЬЮЬ
ЮЬШ%KШKШKШ ЧЪЯЬЮЬЮЬШ#KЪЬЮЬШKЪЬШKШKШ ЧЪЬ
ЮЬШKШ ЧЪЯЬЮЬЮЬ$Ш4ЪЮЬЮШKЪЮЬFШJKЪ
ЮЬЮЬЮЬЮЬЮЬШ*ЧKШKШ ЧЪ
ЯЬЮЬЮЬЮЬЮЬШVKЪЬЮЬЮЬШKЪЮЬЮЬЮЬЮЬЮЬЮЬШGKШKЪЬШKЪЬШKЪЬШKЪЬШKЪЬШKЪЬШЪЮЬЮЬШKЪЮЬЮЬЮЬ аШHKЪЮЬ
ЮЬЮЬ"аШHKЪЮЬЮЬЮЬ аШIKШЧKШKШ ЧЪЯ
ЬЮЬЮЬШ.KЪЬЮЬAШKKЪЬЮЬЮЬШKЪЮЬЮЬЮЬШ&KЪЬШKЪЬTШTKЪЬШKЪЬ#Ш#KШKШ ЧЪЯЬЮЬЮЬШ/KШJKЪЬ0Ш0KЪЬШKЪЬШKШKШ ЧЪЯЬЮЬЮЬШ1KШNKЪЬ4Ш4KЪЬ Ш KЪЬШKШKШ ЧЪЯЬЮЬЮЬШ/KШOKЪЬ3Ш3KЪЬШKЪЬШKШKШ ЧЪ
ЯЬЮЬЮЬЮЬЮЬШCKЪЮЬЮЬЮЬ$ЮЬШRKЪЮЬЮЬЮЬ&ЮЬШUKЪЮЬЮЬЮЬ*ЮЬШ[KЪЮЬЮЬЮЬ&ЮЬШUKЪЮЬ"ЮЬTШKШKШ ЧЪЯ	ЬЮЬЮЬЮЬЮЬЮЬШIKЪЮЬЮЬЮЬ$ЮЬШRKЪЮЬЮЬЮЬ*ЮЬШ[KЪЮЬЮЬ(ШLKШKШ ЧЪ
ЯЬЮЬЮЬЮЬЮЬШNKЪЮЬЮЬЮЬ*ЮЬШ[KЪЮЬШKШKШ ЧЪ
ЯЬЮЬЮЬЮЬЮЬШPKЪЮЬЮЬЮЬ$ЮЬШRKЪЮЬЮЬ'Ш1KШKШ ЧЪ
Я
ЬЮЬЮЬЮЬЮЬШKKЪЮЬЮЬЮЬ&ЮЬШUKЪЮЬШKШKШ ЧЪ
Я
ЬЮЬЮЬЮЬЮЬШNKЪЮЬЮЬЮЬ&ЮЬШUKЪЮЬШKШKШ ЧЪЯЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬ	ЮЬ	ШmKЪЬЮЬ8ШAKЪЬЮЬ8ШAKЪЬ
ЮЬЮЬШ%ЪЮЬЮШKЪЬЮЬШKЪЬЮЬШKЪЮЬЮЬЮЬ"ЮЬШIKЪЮЬЮЬЮЬ"ЮЬШIKЪЮЬЮЬЮЬШ#KЪЮЬЮЬЮЬЮЬШ@KЪЮЬЮЬЮЬЮЬШ@ШKЪЬ6ЮЬШGKЪЬЮЬЮЬTШeKЪЬЮЬШKЪЬЮЬШЪЮЬЮЬЮЬЮШKЪЮЬ-ЮЬЮЬ
ШDKЪЮЬШЧKЪЬШKШЧKЪЮЬШЧKШKШ ЧKШ KЪЮЬШЧ ЕЧ    А  ь  