[Pixel]<Tioga>TBase>TextFindImpl.mesa!1

-- TextFindImpl.Mesa

-- derived from EditorFind.Mesa of Laurel 6

-- last writen by Paxton, February 23, 1983 4:13 pm

Last Edited by: Maxwell, January 5, 1983 4:03 pm

DIRECTORY

TextFind,

TextFindPrivate,

TextLooks,

TextLooksSupport,

TextEdit,

TextNode,

RopeEdit,

Rope,

RopeReader,

RunReader,

LooksReader,

Inline;

TextFindImpl: CEDAR PROGRAM

IMPORTS TextEdit, TextLooks, TextLooksSupport,

LooksReader, RopeEdit, RopeReader, TextNode,

RunReader, Rope

EXPORTS TextFind =

BEGIN OPEN TextFind, TextFindPrivate, RopeEdit;

MalformedPattern: PUBLIC ERROR [ec:PatternErrorCode] = CODE;

Finder: TYPE = REF FinderRec;

FinderRec: PUBLIC TYPE = FinderRecord;

-- ***** Operations *****

NameLoc: PUBLIC PROC [finder: Finder, name: ROPE]

RETURNS [at, atEnd: Offset] = { OPEN finder;

at ← atEnd ← 0;

IF finder = NIL OR nameArray = NIL THEN RETURN;

FOR i:NAT IN [0..nameArray.length) DO

IF Rope.Equal[nameArray[i].name, name] THEN

RETURN [nameArray[i].at,nameArray[i].atEnd];

ENDLOOP;

};

NameLooks: PUBLIC PROC [finder: Finder, name: ROPE]

RETURNS [looks: TextLooks.Looks] = { OPEN finder;

looks ← TextLooks.noLooks;

IF finder = NIL OR nameArray = NIL THEN RETURN;

FOR i:NAT IN [0..nameArray.length) DO

IF Rope.Equal[nameArray[i].name, name] THEN RETURN [nameArray[i].looks];

ENDLOOP;

};

Create: PUBLIC PROC [pattern: RefTextNode,

literal, word, ignoreLooks, ignoreCase, addBounds: BOOLEAN ← FALSE,

patternStart: Offset ← 0, patternLen: Offset ← MaxLen]

RETURNS [finder: Finder] = {

patternRope: ROPE ← TextEdit.GetRope[pattern];

patternRuns: TextLooks.Runs ← TextEdit.GetRuns[pattern];

RETURN [CreateFromParts[patternRope,patternRuns,literal,word,

ignoreLooks,ignoreCase,addBounds,patternStart,patternLen]] };

CreateFromRope: PUBLIC PROC [

pattern: ROPE, literal, word, ignoreCase, addBounds: BOOLEAN ← FALSE,

patternStart: Offset ← 0, patternLen: Offset ← MaxLen]

RETURNS [finder: Finder] = {

RETURN [CreateFromParts[pattern,NIL,literal,word,TRUE,

ignoreCase,addBounds,patternStart,patternLen]] };

CreateFromParts: PROC [patternRope: ROPE, patternRuns: TextLooks.Runs,

literal, word, ignoreLooks, ignoreCase, addBounds: BOOLEAN ← FALSE,

patternStart: Offset ← 0, patternLen: Offset ← MaxLen]

RETURNS [finder: Finder] =

BEGIN

NewLooks: PROC [num: NAT] RETURNS [array: REF LooksArray] = {

array ← TextNode.pZone.NEW[LooksArray[num]];

FOR i:NAT IN [0..num) DO array[i] ← TextLooks.noLooks; ENDLOOP };

char, patternChar: CHAR ← 377C;

pLen: Offset;

patternLength, plen, psIndex, nameCount: NAT ← 0;

nameList: LIST OF Rope.ROPE; -- in reverse order of appearance

nameLooksList: LIST OF TextLooks.Looks;

nameLooks: TextLooks.Looks;

insideNamedPat: BOOLEAN ← FALSE;

IF addBounds THEN { -- add |'s to both ends of pattern

IF literal THEN { -- put quotes before special chars in the pattern

new: Rope.ROPE;

AddQuotes: SAFE PROC [c: CHAR] RETURNS [stop: BOOL] = TRUSTED {

IF ~BlankChar[c] AND ~AlphaNumericChar[c] THEN

new ← Rope.Cat[new, "'"]; -- quote chars that are not blank or alpha or digit

new ← Rope.Cat[new, Rope.FromChar[c]];

RETURN [FALSE] };

[] ← Rope.Map[base: patternRope, action: AddQuotes];

patternRope ← new; literal ← FALSE };

patternRope ← Rope.Cat["|", Rope.Cat[patternRope, "|"]] };

pLen ← Rope.Size[patternRope];

patternStart ← MIN[patternStart,pLen];

IF (patternLen ← MIN[patternLen,pLen-patternStart]) > MaxPatternLength THEN

ERROR MalformedPattern[toobig];

patternLength ← plen ← patternLen;

finder ← TextNode.pZone.NEW[FinderRec];

BEGIN OPEN finder;

PatternProc: TYPE = PROC [char: CHAR, looks: TextLooks.Looks, ignoreCase: BOOLEAN];

patProc: PatternProc = IF literal THEN LitChar ELSE PatChar;

GetLooks: PROC RETURNS [lks: TextLooks.Looks] = {

RETURN [IF lksReader = NIL THEN TextLooks.noLooks ELSE

LooksReader.Get[lksReader ! RunReader.NoMoreRuns => {

lks ← TextLooks.noLooks; CONTINUE }]] };

LitChar: PatternProc = TRUSTED {

IF looks # TextLooks.noLooks THEN {

IF patternLooks = NIL THEN patternLooks ← NewLooks[patternLength];

patternLooks[psIndex] ← looks };

IF ignoreCase AND (char IN ['A..'Z] OR char IN ['a..'z]) THEN {

patternArray[psIndex] ← [pattern[char+200B]];

-- 200B tells matcher to check both upper and lower

IF psIndex = 0 THEN {

firstPatternCharIsNormal ← TRUE;

firstPatChar1 ← UpperCase[char];

firstPatChar2 ← LowerCase[char] };

IF psIndex = patternLength-1 THEN {

lastPatternCharIsNormal ← TRUE;

lastPatChar1 ← UpperCase[char];

lastPatChar2 ← LowerCase[char] }}

ELSE {

patternArray[psIndex] ← [pattern[char]];

IF psIndex = patternLength-1 THEN {

lastPatternCharIsNormal ← TRUE;

lastPatChar1 ← char;

lastPatChar2 ← 0C };

IF psIndex = 0 THEN {

firstPatternCharIsNormal ← TRUE;

firstPatChar1 ← char;

firstPatChar2 ← 0C }}};

NotChar: PatternProc = TRUSTED {

IF looks # TextLooks.noLooks THEN {

IF patternLooks = NIL THEN patternLooks ← NewLooks[patternLength];

patternLooks[psIndex] ← looks };

IF ignoreCase THEN patternArray[psIndex] ← [not[char+200B]]

ELSE patternArray[psIndex] ← [not[char]];

};

PatChar: PatternProc = TRUSTED {

IF looks # TextLooks.noLooks AND patternLooks = NIL THEN

patternLooks ← NewLooks[patternLength];

IF patternLooks # NIL THEN patternLooks[psIndex] ← looks;

SELECT char FROM

'' => {

IF RopeReader.GetIndex[ropeReader] >= plen THEN ERROR MalformedPattern[endquote];

patternLength ← patternLength-1;

LitChar[RopeReader.Get[ropeReader],GetLooks[],FALSE] };

IN ['A .. 'Z], IN ['a .. 'z] => LitChar[char,looks,ignoreCase];

'~ => {

IF RopeReader.GetIndex[ropeReader] >= plen THEN ERROR MalformedPattern[endtilda];

patternLength ← patternLength-1;

char ← RopeReader.Get[ropeReader];

looks ← GetLooks[];

SELECT char FROM

'' => {

IF RopeReader.GetIndex[ropeReader] >= plen THEN

ERROR MalformedPattern[endquote];

patternLength ← patternLength-1;

NotChar[RopeReader.Get[ropeReader],GetLooks[],FALSE] };

IN ['A .. 'Z], IN ['a .. 'z] => NotChar[char,looks,ignoreCase];

'% => patternArray[psIndex] ← [pattern[oneNonBlankPattern]];

'$ =>

IF psIndex > 0 AND patternArray[psIndex-1]=[pattern[anyNonBlankPattern]] AND

(patternLooks=NIL OR patternLooks[psIndex-1]=looks) THEN { -- change to max

patternLength ← patternLength-1;

psIndex ← psIndex-1;

patternArray[psIndex] ← [pattern[maxNonBlankPattern]] }

ELSE { -- new entry

patternArray[psIndex] ← [pattern[anyNonBlankPattern]];

stackSize ← stackSize+1 };

'@ => patternArray[psIndex] ← [pattern[oneNonAlphaPattern]];

'& =>

IF psIndex > 0 AND patternArray[psIndex-1]=[pattern[anyNonAlphaPattern]] AND

(patternLooks=NIL OR patternLooks[psIndex-1]=looks) THEN { -- change to max

patternLength ← patternLength-1;

psIndex ← psIndex-1;

patternArray[psIndex] ← [pattern[maxNonAlphaPattern]] }

ELSE { -- new entry

patternArray[psIndex] ← [pattern[anyNonAlphaPattern]];

stackSize ← stackSize+1 };

ENDCASE => patternArray[psIndex] ← [not[char]];

};

'# => patternArray[psIndex] ← [pattern[oneCharPattern]];

'* =>

IF psIndex > 0 AND patternArray[psIndex-1]=[pattern[anyStringPattern]] AND

(patternLooks=NIL OR patternLooks[psIndex-1]=looks) THEN { -- change to max

psIndex ← psIndex-1;

patternLength ← patternLength-1;

stackSize ← MAX[1, stackSize];

patternArray[psIndex] ← [pattern[maxStringPattern]] }

ELSE { -- new entry

patternArray[psIndex] ← [pattern[anyStringPattern]];

IF looks # TextLooks.noLooks THEN stackSize ← stackSize+1 };

'% => patternArray[psIndex] ← [pattern[oneBlankPattern]];

'$ =>

IF psIndex > 0 AND patternArray[psIndex-1]=[pattern[anyBlankPattern]] AND

(patternLooks=NIL OR patternLooks[psIndex-1]=looks) THEN { -- change to max

patternLength ← patternLength-1;

psIndex ← psIndex-1;

patternArray[psIndex] ← [pattern[maxBlankPattern]] }

ELSE { -- new entry

patternArray[psIndex] ← [pattern[anyBlankPattern]];

stackSize ← stackSize+1 };

'@ => patternArray[psIndex] ← [pattern[oneAlphaPattern]];

'& =>

IF psIndex > 0 AND patternArray[psIndex-1]=[pattern[anyAlphaPattern]] AND

(patternLooks=NIL OR patternLooks[psIndex-1]=looks) THEN { -- change to max

patternLength ← patternLength-1;

psIndex ← psIndex-1;

patternArray[psIndex] ← [pattern[maxAlphaPattern]] }

ELSE { -- new entry

patternArray[psIndex] ← [pattern[anyAlphaPattern]];

stackSize ← stackSize+1 };

'| => {

patternArray[psIndex] ←

[pattern[IF psIndex = 0 THEN leftBoundaryPattern ELSE rightBoundaryPattern]];

IF psIndex # 0 AND psIndex # patternLength-1 THEN

ERROR MalformedPattern[boundary];

IF psIndex = patternLength-1 THEN { -- right boundary

lastPatternCharIsNormal ← TRUE; lastPatChar1 ← rightBoundaryPattern };

IF psIndex = 0 THEN { --left boundary

firstPatternCharIsNormal ← TRUE; firstPatChar1 ← leftBoundaryPattern }};

'< => {

nameStart: Offset ← RopeReader.GetIndex[ropeReader]; -- index of char after the <

nameLen: Offset ← 0;

IF insideNamedPat THEN ERROR MalformedPattern[missingNameEnd];

insideNamedPat ← TRUE;

nameLooks ← looks; -- remember the looks of the <

patternArray[psIndex] ← [startname[nameCount]];

DO SELECT RopeReader.Peek[ropeReader !

RopeReader.ReadOffEnd => GOTO BadName] FROM -- scan to end of name

': => { -- pattern follows

[] ← RopeReader.Get[ropeReader];

[] ← GetLooks[];

patternLength ← patternLength-(nameLen+1);

EXIT };

'> => { -- no pattern given, so insert a phony *

psIndex ← psIndex + 1;

PatChar['*,looks,ignoreCase]; -- use looks from the '<

patternLength ← patternLength-nameLen+1;

EXIT };

ENDCASE => { -- part of the name

nameLen ← nameLen+1;

[] ← RopeReader.Get[ropeReader];

[] ← GetLooks[] };

ENDLOOP;

nameList ← TextNode.pZone.CONS[Rope.Substr[patternRope,nameStart,nameLen],nameList];

nameLooksList ← TextNode.pZone.CONS[nameLooks,nameLooksList];

EXITS BadName => ERROR MalformedPattern[missingNameEnd] };

'> => {

IF ~insideNamedPat THEN ERROR MalformedPattern[unmatchedNameEnd];

insideNamedPat ← FALSE;

patternArray[psIndex] ← [endname[nameCount]];

nameCount ← nameCount+1 };

'{ => {

leftBracketSeen ← TRUE;

patternArray[psIndex] ← [pattern[leftBracketPattern]] };

'} => {

IF rightBracketSeen THEN

patternArray[psIndex] ← [pattern[nopPattern]] -- use first } in pattern

ELSE {

rightBracketSeen ← TRUE;

patternArray[psIndex] ← [pattern[rightBracketPattern]] }};

ENDCASE => {

patternArray[psIndex] ← [pattern[char]];

IF psIndex = patternLength-1 THEN {

lastPatternCharIsNormal ← TRUE;

lastPatChar1 ← char;

lastPatChar2 ← 0C };

IF psIndex = 0 THEN {

firstPatternCharIsNormal ← TRUE;

firstPatChar1 ← char;

firstPatChar2 ← 0C }}}; -- end of PatChar

IF word THEN wordSearch ← TRUE

-- so Try will know to make sure don't have adjacent alphanumerics

ELSE IF patternLength=2 AND ~literal AND ~ignoreLooks AND

Rope.Fetch[patternRope,patternStart]='# AND

Rope.Fetch[patternRope,patternStart+1]='* THEN { -- for looks-only searches

looks ← TextLooks.FetchLooks[patternRuns,patternStart];

looksOnly ← TRUE;

runReader ← RunReader.Create[];

RETURN };

patternArray ← TextNode.pZone.NEW[PatternArray[patternLength]];

ropeReader ← RopeReader.Create[];

RopeReader.SetPosition[ropeReader,patternRope,patternStart];

IF patternRuns # NIL AND ~ignoreLooks THEN {

lksReader ← LooksReader.Create[];

LooksReader.SetPosition[lksReader,patternRuns,patternStart] };

psIndex ← 0;

DO -- unpack the pattern

char: CHAR ← RopeReader.Get[ropeReader ! RopeReader.ReadOffEnd => EXIT];

patProc[char,GetLooks[],ignoreCase];

psIndex ← psIndex + 1;

ENDLOOP;

length ← patternLength;

IF stackSize > 0 THEN {

stackSize ← stackSize+1;

textPosStack ← TextNode.pZone.NEW[TextStackArray[stackSize]];

textLenStack ← TextNode.pZone.NEW[TextStackArray[stackSize]];

patternPosStack ← TextNode.pZone.NEW[PatternStackArray[stackSize]] };

IF nameList # NIL THEN {

nameArray ← TextNode.pZone.NEW[NameArray[nameCount]];

FOR i:NAT DECREASING IN [0..nameCount) DO

nameArray[i].name ← nameList.first;

nameArray[i].looks ← nameLooksList.first;

nameList ← nameList.rest;

nameLooksList ← nameLooksList.rest;

ENDLOOP };

END; -- of OPEN finder

END; -- of Create

Start: PUBLIC PROC = {};

END.