

DIRECTORY
SpellingWordMap,
Rope USING [ROPE, Size],
RopeReader USING [Create, SetPosition, Get, Ref, Backwards];

SpellingWordMapImpl: CEDAR MONITOR
IMPORTS 
Rope, 
RopeReader
EXPORTS 
SpellingWordMap =	
BEGIN

ROPE: TYPE = Rope.ROPE;
reader: RopeReader.Ref м RopeReader.Create[]; -- To make word parsing efficient.

MapWordsInRope: 
PUBLIC ENTRY PROC [words: ROPE, alphabetic: SpellingWordMap.CharSet, buffer: REF TEXT, f: PROC [REF TEXT, REF ANY, INT] RETURNS [BOOL], data: REF ANY, offset: INT]
RETURNS [premature: BOOLEAN м FALSE, wordStart, wordEnd: INT м 0, newBuffer: REF TEXT] =  {
HandleExpansion: PROC [] = INLINE {
IF wp >= buffer.maxLength THEN {
newBuffer м NEW[TEXT[2*buffer.maxLength + 1]];
newBuffer.length м newBuffer.maxLength;
FOR j: NAT IN [0..wp) DO
newBuffer[j] м buffer[j];
ENDLOOP;
buffer м newBuffer;
};
};
ParseState: TYPE = {InWord, InJunk, Embeddable};
state: ParseState м InJunk;
wp: NAT м 0;
size: INT м words.Size[];
c, e: CHAR м 0C;
newBuffer м buffer;
buffer.length м buffer.maxLength;
RopeReader.SetPosition[reader, words, 0];
FOR pos: INT IN [0..size) DO
c м reader.Get[];
IF alphabetic[c] THEN {
IF state = InJunk THEN {
wordStart м pos;
wp м 0;
}
ELSE IF state = Embeddable THEN {
HandleExpansion[];
buffer[wp] м e;
wp м wp + 1;
};
state м InWord;
HandleExpansion[];
buffer[wp] м c;
wp м wp + 1;
}
ELSE {
IF state = InWord THEN {
 IF c = '' THEN {
state м Embeddable;
e м c;
}
ELSE {
buffer.length м wp;
wordEnd м pos;
premature м f[buffer, data, wordStart+offset];
IF premature THEN RETURN;
state м InJunk;
};
}
ELSE IF state = Embeddable THEN {
buffer.length м wp;
wordEnd м pos-1;
premature м f[buffer, data, wordStart+offset];
IF premature THEN RETURN;
state м InJunk;
};
};
ENDLOOP;
IF state = InWord THEN {
buffer.length м wp;
wordEnd м size;
premature м f[buffer, data, wordStart+offset];
}
ELSE IF state = Embeddable THEN {
buffer.length м wp;
wordEnd м size-1;
premature м f[buffer, data, wordStart+offset];
};
};

MapWordsInRopeBackward: 
PUBLIC ENTRY PROC [words: ROPE, alphabetic: SpellingWordMap.CharSet, buffer: REF TEXT, f: PROC [REF TEXT, REF ANY, INT] RETURNS [BOOL], data: REF ANY, offset:  INT]
RETURNS [premature: BOOLEAN м FALSE, wordStart, wordEnd: INT м 0, newBuffer: REF TEXT] =  {
HandleExpansion: PROC [] = INLINE {
IF wp >= buffer.maxLength THEN {
newBuffer м NEW[TEXT[2*buffer.maxLength + 1]];
newBuffer.length м newBuffer.maxLength;
FOR j: NAT IN [0..wp) DO
newBuffer[j] м buffer[j];
ENDLOOP;
buffer м newBuffer;
};
};
ReverseWord: PROC [] = INLINE {
j: NAT м buffer.length;
c: CHAR;
FOR i: NAT IN [0..j/2) DO
j м j - 1;
c м buffer[i];
buffer[i] м buffer[j];
buffer[j] м c;
ENDLOOP;
};
ParseState: TYPE = {InWord, InJunk, Embeddable};
state: ParseState м InJunk;
wp: NAT м 0;
size: INT м words.Size[];
c, e: CHAR м 0C;
newBuffer м buffer;
buffer.length м buffer.maxLength;
RopeReader.SetPosition[reader, words, words.Size[]];
FOR pos: INT DECREASING IN [0..size) DO
c м reader.Backwards[];
IF alphabetic[c] THEN {
IF state = InJunk THEN {
wordEnd м pos+1;
wp м 0;
}
ELSE IF state = Embeddable THEN {
HandleExpansion[];
buffer[wp] м e;
wp м wp + 1;
};
state м InWord;
HandleExpansion[];
buffer[wp] м c;
wp м wp + 1;
}
ELSE {
IF state = InWord THEN {
 IF c = '' THEN {
state м Embeddable;
e м c;
}
ELSE {
buffer.length м wp;
wordStart м pos+1;
ReverseWord[];
premature м f[buffer, data, wordStart+offset];
IF premature THEN RETURN;
state м InJunk;
};
}
ELSE IF state = Embeddable THEN {
buffer.length м wp;
wordStart м pos+2;
ReverseWord[];
premature м f[buffer, data, wordStart+offset];
IF premature THEN RETURN;
state м InJunk;
};
};
ENDLOOP;
IF state = InWord THEN {
buffer.length м wp;
wordStart м 0;
ReverseWord[];
premature м f[buffer, data, wordStart+offset];
}
ELSE IF state = Embeddable THEN {
buffer.length м wp;
wordStart м 1;
ReverseWord[];
premature м f[buffer, data, wordStart+offset];
};
};

END.
CHANGE LOG
Created by Nix on May 1, 1987 10:41:54 am PDT, END

     SpellingWordMapImpl.mesa
Copyright ╙ 1987, 1990, 1992 by Xerox Corporation.  All rights reserved.
Last Edited by: Nix, October 24, 1983 10:47 am
Last tweaked by Mike Spreitzer on February 17, 1989 4:25:31 pm PST
Tim Diebert: January 26, 1987 4:53:12 pm PST
JKF, May 29, 1990 7:53:57 am PDT
Maps the function f over each of the words in the ROPE words, stopping either when f returns TRUE or when all of the words are exhausted.   A word is defined to be the longest non-empty sequence of ['A..'Z]+['a..'z]+ + , with embedded apostrophes allowed: "abcd" is a word, "ab'cd" is a word, but "abcd'" is not a word.  The accumulation and testing of words is carried out in the buffer, which is grown to accomodate long words, and which is returned (possibly longer) when the mapping is complete.   On return, premature is TRUE iff the function f returned TRUE on some word.  If premature is true, then wordStart and wordEnd are set to the starting index and stopping index of the word for which f returned true.  If premature is false, then these values denote nothing of interest.
Maps the function f over each of the words in the ROPE words, stopping either when f returns TRUE or when all of the words are exhausted.   A word is defined to be the longest non-empty sequence of ['A..'Z]+['a..'z]+ + , with embedded apostrophes allowed: "abcd" is a word, "ab'cd" is a word, but "abcd'" is not a word.  The accumulation and testing of words is carried out in the buffer, which is grown to accomodate long words, and which is returned (possibly longer) when the mapping is complete.   On return, premature is TRUE iff the function f returned TRUE on some word.  If premature is true, then wordStart and wordEnd are set to the starting index and stopping index of the word for which f returned true.  If premature is false, then these values denote nothing of interest.
Last tweaked by Mike Spreitzer on May 1, 1987 10:41:27 am PDT
Made accents (chars 005 and 013) alphabetic.
changes to: embeds, MapWordsInRope, ParseState, MapWordsInRopeBackward, ParseState, Start, Start

 Э╩Б  Ц(cedarcode) styleХNewlineDelimiter
Ш codeЦ"Cedar" styleЪЬЩKЦ"Cedar" styleЪЬ
╧eЬ=ЩHKЩ.KЩBKЩ,KЩ ЧKШ Ъ╧k	Ш	KШKЪЬЮЬЮЬШKЪЬЮЬ,Ш<ЧKШ KЪ╨bnЬЮЬЮШ"ЪЮЬШKЪЬШKЪЬ
Ш
ЧЪЮЬШKЪЬШЧKЪЮШKШ KЪЮЬЮЬЮЬШKЪЬ.╧c"ШPKШ Ъ╧bЬШKЪ"ЮЬЮЬЮЬ	ЮЬ/ЮЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬ	ЮЬЮЬ
ЮЬШгKЪЮЬЮЬЮЬЮЬЮЬЮЬШ[KЪ	Ь2ЮЬ'ЮЬпЮЬЮЬ▐ЩУЪ╧nЬЮЬЮЬШ#ЪЮЬЮЬШ KЪЬЮЬЮЬШ.KШ'ЪЮЬЮЬЮЬ	ЮШKШKЪЮЬШЧKШKШЧKШЧKЪЬЮЬ Ш0KШKЪЬЮЬШKЪЬЮЬШKЪЬЮЬЮЬШKШKШ!KЪЬ)Ш)ЪЮЬЮЬЮЬЮШKШЪЮЬЮЬШЪЮЬЮЬШKШKШKШЧЪЮЬЮЬЮЬШ!KШKШKШKШЧKШKШKШKШKШЧЪЮЬШЪЮЬЮЬШЪЬЮЬЮЬШKШKШKШЧЪЮЬШKШKШKШ.KЪЮЬЮЬЮЬШKШKШЧKШЧЪЮЬЮЬЮЬШ!KШKШKШ.KЪЮЬЮЬЮЬШKШKШЧKШЧKЪЮЬШЧЪЮЬЮЬШKШKШKШ.KШЧЪЮЬЮЬЮЬШ!KШKШKШ.KШЧKШKШ ЧЪбЬШKЪ"ЮЬЮЬЮЬ	ЮЬ/ЮЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬ	ЮЬЮЬЮЬШдKЪЮЬЮЬЮЬЮЬЮЬЮЬШ[KЪ	Ь2ЮЬ'ЮЬпЮЬЮЬ▐ЩУЪвЬЮЬЮЬШ#ЪЮЬЮЬШ KЪЬЮЬЮЬШ.KШ'ЪЮЬЮЬЮЬ	ЮШKШKЪЮЬШЧKШKШЧKШЧЪвЬЮЬЮЬШKЪЬЮЬШKЪЬЮЬШЪЮЬЮЬЮЬ
ЮШKШ
KШKШKШKЪЮЬШЧKШЧKЪЬЮЬ Ш0KШKЪЬЮЬШKЪЬЮЬШKЪЬЮЬЮЬШKШKШ!KЪЬ4Ш4Ъ	ЮЬЮЬЮ
ЬЮЬЮШ'KШЪЮЬЮЬШЪЮЬЮЬШKШKШKШЧЪЮЬЮЬЮЬШ!KШKШKШKШЧKШKШKШKШKШЧЪЮЬШЪЮЬЮЬШЪЬЮЬЮЬШKШKШKШЧЪЮЬШKШKШKШKШ.KЪЮЬЮЬЮЬШKШKШЧKШЧЪЮЬЮЬЮЬШ!KШKШKШKШ.KЪЮЬЮЬЮЬШKШKШЧKШЧKЪЮЬШЧЪЮЬЮЬШKШKШKШKШ.KШЧЪЮЬЮЬЮЬШ!KШKШKШKШ.KШЧKШKШ ЧЪЮЬШKЪЮЬЮШ
KЪЬ-╧rШ2ЧKШ Щ=KЩ,KЪЬгTЩ`ЧKЩ Ч ЕЧ    f    