DIRECTORY CD, RefTab, Rope, RTBasic;Connections: CEDAR DEFINITIONS = BEGINROPE: TYPE = Rope.ROPE;Side: TYPE ~ RTBasic.Side;Object: TYPE = CD.Object;Layer: TYPE = CD.Layer;Table: TYPE = RefTab.Ref;		-- A RefTab with operations Key: TYPE = REF;Net: TYPE = REF NetRec;NetRec: TYPE = RECORD [name: ROPE _ NIL,					-- required to be unique among the nets width: INT _ 0,						-- 0 default means minimum sizesegments: Segments _ NIL,		-- pins for this netnetDat: REF ANY _ NIL			-- for client use];Segments: TYPE = LIST OF Segment;Segment: TYPE = REF SegmentRec;SegmentRec: TYPE = RECORD [name: Rope.ROPE _ NIL,		-- optional name of connectionobject: Object _ NIL,		-- the owning objectrange: Range _ [0, 0],		-- in interest coordinate systemside: Side,						-- side toward which routing should connectlayer: Layer _ CD.undefLayer,segmentDat: REF ANY _ NIL	-- for client use];Range: TYPE = RECORD [min, max: INT		-- range of segment along side];CreateForRopes: PROC [mod: NAT _ 17] RETURNS [Table];Fetch: PROC [table: Table, key: Key] RETURNS [found: BOOL, net: Net];Store: PROC [table: Table, key: Key, net: Net] RETURNS [BOOL];InsertPins: PROC [table: Table, object: CD.Object, pinFilter: PinFilterProc _ NIL, makeHashKey: HashKeyProc _ NIL];PinFilterProc: TYPE = PROC [inst: CD.Instance, obj: CD.Object] RETURNS [keepIt: BOOL _ TRUE];HashKeyProc: TYPE = PROC [instance: CD.Instance] RETURNS [key: Rope.ROPE];EnumerateNets: PROC [table: Table, action: EachNetAction] RETURNS [quit: BOOL];EachNetAction: TYPE = PROC [key: Key, net: Net] RETURNS [quit: BOOL _ FALSE];EnumerateSegments: PROC [net: Net, action: EachSegmentAction] RETURNS [quit: BOOL];EachSegmentAction: TYPE = PROC [net: Net, segment: Segment] RETURNS [quit: BOOL _ FALSE];END.    Connections.mesaCopyright ╙ 1986, 1987 by Xerox Corporation.  All rights reserved.Created by Bryan Preas, September 9, 1987 1:14:22 pm PDTBertrand Serlet April 27, 1987 0:14:30 am PDTTheoryThis interface provides a simple way to describe interconnection requirements among a group of Objects to be laid out.Common TypesTypesBuilding The Connection Tablecreates new table, whose length is mod.  Does the right thing for Rope tables.looks up key in table, returns associated net (if any)if found is TRUE, net is value associated with given keyif found is FALSE, net is NILreturns TRUE after inserting new pairreturns FALSE after overwriting old net for existing key-net pairput the pins on the interest rec of th object in the table if pinFilter returns true.Using The Connection Tableenumerates pairs currently in symbol table in unspecified orderpairs inserted/deleted during enumeration may or may not be seenapplies action to each pair until action returns TRUE or no more pairsreturns TRUE if some action returns TRUEenumerates segments currently in net in unspecified ordersegments inserted/deleted during enumeration may or may not be seenapplies action to each segment until action returns TRUE or no more segmentsreturns TRUE if some action returns TRUE Э╩Х  Ш codeЪЬЩKЪЬBЩBKЪЬ8Щ8KЪЬ*╧kЩ-ЧKШ ЪЭ	ЬШ
KЪЭЬШЧKШ KЪ╧nЬЭЬЭЬЭШ&headЩKЪЬvЩvЧЩKЪЭЬЭЬЭЬШKЪЬЭЬШKЪЬЭЬЭЬШKЪЬЭЬЭЬШЧЩKЪЬЭЬ╧cШ7KЪЬЭЬЭЬШKЪЬЭЬЭЬШЪЬЭЬЭЬШKЪЬЭЬЭЬЯ(Ш>KЪЬЭЬЯШ4KЪЬЭЬЯШ/KЪЬЭЬЭЬЭЬЯШ)KШKШ ЧKЪЬ
ЭЬЭЬЭЬ	Ш!KЪЬ	ЭЬЭЬШЪЬЭЬЭЬШKЪЬЭЬЭЬЯШ6KЪЬЭЬЯШ+KЪЬЯ Ш8KЪЬЯ+Ш<KЪЬЭЬШKЪЬЭЬЭЬЭЬЯШ+KШЧЪЬЭЬЭЬШKЪЬ
ЭЬЯШ-KШЧЧЩЪЮЬЭЬЭЬЭЬ	Ш5KЪЬ#╧eЬ(ЩNKШ ЧЪЮЬЭЬЭЬ	ЭЬШEKЪЬ6Щ6KЪЬЭЬ(Щ8KЪЬЭЬ	ЭЩKШ ЧЪЮЬЭЬ$ЭЬЭЬШ>KЪЬЭЬЩ%KЪЬЭЬ4ЩAKШ ЧЪ
Ю
ЬЭЬЭЬ$ЭЬЭЬШsKЪЬUЩUЧKЪЬЭЬЭЬЭЬЭЬ	ЭЬ
ЭЬЭЬШ]KЪЬЭЬЭЬЭЬЭЬЭЬШJЧЩЪЮЬЭЬ'ЭЬЭЬШOKЪЬ?Щ?KЪЬ@Щ@KЪЬ1ЭЬЩFKЪЬЭЬЭЩ(ЧЪЬЭЬЭЬЭЬЭЬЭЬШMKШ ЧЪЮЬЭЬ'ЭЬЭЬШSKЪЬ9Щ9KЪЬCЩCKЪЬ4ЭЬЩLKЪЬЭЬЭЩ(ЧKЪЬЭЬЭЬЭЬЭЬЭЬШYKШ ЧKЪЭЬШЧ ЕЧ    ·  Ы  