DIRECTORY HashTable USING [Table, HashProc, EqualProc], Rope USING [ROPE]; Names: CEDAR DEFINITIONS ~ BEGIN ROPE: TYPE ~ Rope.ROPE; Index: TYPE ~ CARDINAL; Name: TYPE ~ LIST OF Index; Dictionnary: TYPE ~ REF NameTabRec; NameTabRec: TYPE ~ RECORD [next: Index, data: REF _ NIL, invtab: HashTable.Table, tab: REF TabRec]; TabRec: TYPE ~ RECORD [SEQUENCE size: Index OF ROPE]; CreateDictionnary: PROC [size: Index _ 64, data: REF _ NIL] RETURNS [dict: Dictionnary]; NameFromRope: PROC [r: ROPE, in: Dictionnary, sep: ROPE] RETURNS [name: Name _ NIL]; NameFromRopeWord: PROC [r: ROPE, in: Dictionnary] RETURNS [name: Name _ NIL]; RopeFromName: PROC [name: Name, in: Dictionnary, sep: ROPE] RETURNS [r: ROPE _ NIL]; AppendRopeToName: PROC [name: Name, r: ROPE, in: Dictionnary, sep: ROPE] RETURNS [newName: Name]; AppendRopeWordToName: PROC [name: Name, r: ROPE, in: Dictionnary] RETURNS [newName: Name]; Equal: PROC [n1, n2: Name] RETURNS [eq: BOOLEAN]; NameEqual: HashTable.EqualProc; HashName: HashTable.HashProc; END. ,Names.mesa Copyright c 1986 by Xerox Corporation. All rights reserved. Christian LeCocq September 11, 1986 11:09:03 am PDT Mangement of a set of simple ropes in a space efficient way. Heading Description of the type. Description of the type. Description of the procedure. Description of the procedure. Description of the procedure. Description of the procedure. Description of the procedure. Description of the procedure. Description of the procedure. Description of the procedure. Description of the procedure. Κ&˜codešœ ™ Kšœ Οmœ1™