PairList: CEDAR DEFINITIONS =BEGINRelationHead: TYPE = RECORD[first, last: REF Pair];Relation: TYPE = REF RelationHead;Pair: TYPE = RECORD[link: REF Pair, left, right: REF ANY _ NIL];NotFound: SIGNAL;EqualProc: TYPE = PROC[left,right: REF ANY] RETURNS[return: BOOLEAN];CreateRelation: PROCEDURE RETURNS [Relation];AddPair: PROCEDURE [relation: Relation, left, right: REF ANY _ NIL];Left: PROCEDURE[relation: Relation, equals: EqualProc, right: REF ANY _ NIL]RETURNS [REF ANY _ NIL];Right: PROCEDURE[relation: Relation, equals: EqualProc, left: REF ANY _ NIL]RETURNS [REF ANY _ NIL];ForAllPairs: PROCEDURE[relation: Relation,do: PROCEDURE[leftPart, rightPart: REF ANY _ NIL]];DestroyRelation: PROCEDURE[relation: Relation];END.   Ї  PairList.MesaCopyright c 1985 by Xerox Corporation.  All rights reserved.Last changed by: 26-Jun-81 18:28:36Cedar version:18-Jun-81 14:24:37Ordered pairs; building and searchingNearly the same as RelationDefs, written by Rick TiberiЭ╩Ы  Ш ЩJЪЬ
╧mЬ1Щ<JЪЬ#Щ#JЪЬ Щ JЪЬ%Щ%JЪЬ7Щ7ЧJШ JЪЬ
╧kЬШJЪЮШJЪЬЮЬЮЬЮЬШ3JЪЬ
ЮЬЮЬШ"JЪЬЮЬЮЬЮЬЮЬЮЬЮЬШ@JЪЬ
ЮЬШJЪ╧n	ЬЮЬЮЬЮЬЮЬЮЬ	ЮЬШEJШ JЪЯЬЮ	ЬЮЬШ-JЪ
ЯЬЮ	Ь#ЮЬЮЬЮЬШDЪ
ЯЬЮ	Ь/ЮЬЮЬЮЬШLJЪЮЬЮЬЮЬЮЬШЧЪ
ЯЬЮ	Ь.ЮЬЮЬЮЬШLJЪЮЬЮЬЮЬЮЬШЧЪЯЬЮ	ЬШ*JЪ	ЬЮ	ЬЮЬЮЬЮЬШ3ЧJЪЯЬЮ	ЬШ/JЪЮЬШJШ JШ JШ JШ Ч ЕЧ    ю  }  