DIRECTORYBasics, Commander, CommandTool, FS, IO, PrioritySearchRef, Rope;PrioritySearchRefExample: CEDAR PROGRAMIMPORTS Commander, CommandTool, FS, IO, PrioritySearchRef, Rope =BEGINbitsPerXChar: NAT = 1+Basics.bitsPerByte; -- high-order virtual bit is 1 if char present, 0 if notExampleDepth: PROC [ item1, item2: PrioritySearchRef.Item ] RETURNS [ Basics.Comparison ] =BEGINr1: Rope.ROPE = NARROW[item1];r2: Rope.ROPE = NARROW[item2];RETURN [ SELECT r1.Length-r2.Length FROM<0 => less,>0 => greater,ENDCASE => equal ];END;ExampleTreeHalf: PROC [ item: PrioritySearchRef.Item, index: PrioritySearchRef.RadixIndex ] RETURNS [ half: PrioritySearchRef.Half ] =BEGINr: Rope.ROPE = NARROW[item];charPos: NAT = index/bitsPerXChar;half _ PrioritySearchRef.TreeHalfImpl[LONG[(IF charPos<r.Length THEN ToXByte[r.Fetch[charPos]] ELSE 0)], 2*Basics.bitsPerWord-bitsPerXChar+(index MOD bitsPerXChar)];END;ExamplePrefix: PROC [ item1, item2: PrioritySearchRef.Item ] RETURNS [ prefix: PrioritySearchRef.RadixIndex ] =BEGINr1: Rope.ROPE = NARROW[item1];r2: Rope.ROPE = NARROW[item2];minLen: NAT = MIN[r1.Length[], r2.Length[]];FOR charPos: NAT _ 0, charPos+1 WHILE charPos<minLen DOr1c: CHAR = r1.Fetch[charPos];r2c: CHAR = r2.Fetch[charPos];IF r1c # r2c THEN RETURN[bitsPerXChar*charPos+PrioritySearchRef.PrefixImpl[LONG[ToXByte[r1c]], LONG[ToXByte[r2c]]]-(2*Basics.bitsPerWord -- that's bitsPerLongNumber, folks -- -bitsPerXChar)];ENDLOOP;RETURN[IF r1.Length[] # r2.Length[] THEN bitsPerXChar*minLen ELSE PrioritySearchRef.equal];END;ToXByte: PROC [ c: CHAR ] RETURNS [ b: CARDINAL ] =TRUSTED INLINE BEGINb _ 256+LOOPHOLE[c, Basics.Byte];END;t: PrioritySearchRef.Tree _ NIL;PSRExample: PROC [cmd: Commander.Handle] RETURNS [result: REF _ NIL, msg: Rope.ROPE _ NIL] -- Commander.CommandProc -- =BEGINTouchProc: PROC [ item: PrioritySearchRef.Item ] ={cmd.out.PutF[" %g", IO.rope[NARROW[item]]]};argv: CommandTool.ArgumentVector = CommandTool.Parse[cmd];s: IO.STREAM = FS.StreamOpen[argv[1]];tree: PrioritySearchRef.Tree = PrioritySearchRef.Create[prefix: ExamplePrefix, treeHalf: ExampleTreeHalf, depth: ExampleDepth];t _ tree;DOr: Rope.ROPE _ s.GetCedarTokenRope[ ! IO.EndOfStream => EXIT ].token;[] _ PrioritySearchRef.Insert[tree, r];ENDLOOP;s.Close[];cmd.out.PutF["\nTree has %d entries ...\nQuery matches", IO.int[tree.Size]];PrioritySearchRef.Search[tree, argv[2], argv[3], argv[4], TouchProc];END;Commander.Register["PSRExample", PSRExample, "Example of client usage of PrioritySearchRef package.  Syntax is\n\n  PSRExample fileName a b c\n\nwhere fileName is searched for all tokens alphabetically between b and c whose length is not greater than that of a."];END. -- of PrioritySearchRefExample      PrioritySearchRefExample.mesaUses PrioritySearchRef to maintain sets of ROPE's that can be searched by alphabetic order and/or by length (a semi-independent ordering).last modified by E. McCreight, May 16, 1985 2:04:07 pm PDTwritten by E. McCreight, May 17, 1985 9:34:33 am PDT Э╩Z  Ш JЪЬЩJШ JЪЬКЩКJШ JЪЬ:Щ:JЪЬ4Щ4JШ Ъ╧k	Ш	JЪЬ ЭЬЭЬШ@JШ ЧЪЬЭЬЭШ'JЪЭЬЭЬШAJЪЭШJШ JЪЬЭЬ╧c8ШbJШ Ъ╧nЬЭЬ*ЭЬШ[JЪЭШJЪЬ	ЭЬЭЬШJЪЬ	ЭЬЭЬШЪЭЬЭЬЭШ(JЪЬШJЪЬШJЪЭЬШЧJЪЭЬШJШ ЧЪЯЬЭЬGЭЬ#ШЖJЪЭШJЪЬЭЬЭЬШJЪЬ	ЭЬШ"ЪЬ&Ш&JЪЭЬЭЬЭЬЭЬШCJЪЬ)ЭЬШ<ЧJЪЭЬШJШ ЧЪЯЬЭЬ*ЭЬ+ШoJЪЭШJЪЬ	ЭЬЭЬШJЪЬ	ЭЬЭЬШJЪЬЭЬЭЬШ,ЪЭЬ
ЭЬЭЬЭШ7JЪЬЭЬШJЪЬЭЬШЪЭЬЭЬЭЬШ.JЪЬЭЬЭЬ&Ю%ЬШСЧJЪЭЬШЧJЪЭЬЭЬЭЬЭЬШ[JЪЭЬШJШ ЧЪ
ЯЬЭЬЭЬЭЬЭЬШ3JЪЭЬЭЬЭШJЪЬЭЬШ!JЪЭЬШJШ ЧJЪЬЭЬШ JШ ЪЯ
ЬЭЬЭЬ
ЭЬЭЬЭЬЭЬЮЬШxJЪЭШJШ ЪЯ	ЬЭЬ#Ш2JЪЬЭЬЭЬ
Ш-JШ ЧJЪЬ:Ш:JЪЬЭЬЭЬЭЬШ&JЪЬШJЪЬ	Ш	ЪЭШJЪЬЭЬЭЬЭЬ	ШEJЪЬ'Ш'JЪЭЬШЧJЪЬ
Ш
JЪЬ9ЭЬШLJЪЬEШEJЪЭЬШJШ ЧJЪЬИШИJШ JЪЭЬЮШ#JШ JШ ЧJШ Ч ЕЧ    
╥  L  