DIRECTORY AbSets, Atom, BiRelBasics, BiRels, IntStuff, SetBasics;BiRelDefaults2: CEDAR PROGRAMIMPORTS AbSets, BiRelBasics, BiRels, IntStuff, SetBasicsEXPORTS BiRels=BEGIN OPEN IntStuff, SetBasics, Sets:AbSets, Sets, BiRelBasics, BiRels;DefaultImage: PUBLIC PROC [br: BiRel, set: Set, dir: Direction] RETURNS [Set] ~ {src: Side ~ Source[dir];dst: Side ~ Dest[dir];spaces: SpacePair ~ br.Spaces[];easy: BOOL ~ set.Can[$Size] AND set.Size[two].Compare[two]<equal;is: ImageSet ~ NEW [ImageSetPrivate _ [br, set, easy, dir, src, dst, spaces[src], spaces[dst]]];mut: Mutability ~ SELECT br.MutabilityOf[] FROMvariable => variable,readonly => readonly,constant => IF set.MutabilityOf[]=constant THEN constant ELSE readonly,ENDCASE => ERROR;RETURN [[imageClasses[mut], [a[is]]]]};ImageClasses: TYPE ~ ARRAY Mutability OF SetClass;imageClasses: REF ImageClasses ~ NEW [ImageClasses];ImageSet: TYPE ~ REF ImageSetPrivate;ImageSetPrivate: TYPE ~ RECORD [br: BiRel,set: Set,easy: BOOL,dir: Direction,src, dst: Side,srcSpace, dstSpace: Space];ImagePrimitive: PROC [set: Set, op: ATOM, arg1, arg2: REF ANY] RETURNS [PrimitiveAnswer] ~ {is: ImageSet ~ NARROW[set.data.VA];SELECT op FROM$Size => RETURN [IF is.easy THEN yes ELSE no];ENDCASE => RETURN [pass]};ImageHasMember: PROC [set: Set, elt: Value] RETURNS [BOOL] ~ {is: ImageSet ~ NARROW[set.data.VA];RETURN [is.br.ScanRestriction[ConsSets[is.src, is.set, Sets.CreateSingleton[elt, is.dstSpace]], AcceptAny].found]};ImageScan: PROC [set: Set, Test: Sets.Tester, ro: Sets.RelOrder] RETURNS [MaybeValue] ~ {is: ImageSet ~ NARROW[set.data.VA];bro: RelOrder ~ ConsRelOrder[is.dst, ro];seen: Set ~ IF NOT is.easy THEN CreateHashSet[is.dstSpace] ELSE nilSet;EasyPass: PROC [pair: Pair] RETURNS [BOOL] ~ {RETURN Test[pair[is.dst]]};HardPass: PROC [pair: Pair] RETURNS [BOOL] ~ {v: Value ~ pair[is.dst]; RETURN [seen.AddElt[v].new AND Test[v]]};RETURN is.br.ScanHalfRestriction[is.set, IF is.easy THEN EasyPass ELSE HardPass, is.src, bro].KeepHalf[is.dst]};ImageGet3: PROC [set: Set, elt: Value, want: TripleBool] RETURNS [TripleMaybeValue] ~ {is: ImageSet ~ NARROW[set.data.VA];mv: MaybeValue ~ is.set.AnElt[];IF NOT mv.found THEN RETURN [[noMaybe, noMaybe, noMaybe]];{up: Set ~ IntervalAsSet[is.dstSpace, [elt, noValue]];dn: Set ~ IntervalAsSet[is.dstSpace, [noValue, elt]];gsU, gsD: BOOL _ FALSE;SearchUp: PROC [pair: Pair] RETURNS [BOOL] ~ {IF is.dstSpace.SEqual[pair[is.dst], elt] THEN gsU _ TRUE ELSE RETURN [TRUE];RETURN [FALSE]};SearchDn: PROC [pair: Pair] RETURNS [BOOL] ~ {IF is.dstSpace.SEqual[pair[is.dst], elt] THEN gsD _ TRUE ELSE RETURN [TRUE];RETURN [FALSE]};{prev: MaybePair ~ is.br.ScanRestriction[ConsSets[is.src, is.set, up], SearchUp, ConsRelOrder[is.dst, fwd, fwd]];next: MaybePair ~ is.br.ScanRestriction[ConsSets[is.src, is.set, dn], SearchDn, ConsRelOrder[is.dst, bwd, bwd]];RETURN [[prev: prev.KeepHalf[is.dst],same: IF gsU OR gsD THEN [TRUE, elt] ELSE noMaybe,next: next.KeepHalf[is.dst]]]}}};ImagesSize: PROC [set: Set, limit: EINT] RETURNS [EINT] ~ {is: ImageSet ~ NARROW[set.data.VA];IF is.easy THEN RETURN is.br.RestrictionSize[ConsSets[is.src, is.set], limit];RETURN set.DefaultSize[limit]};ImageCopy: PROC [set: Set] RETURNS [VarSet] ~ {is: ImageSet ~ NARROW[set.data.VA];RETURN is.br.Copy.Image[is.set, is.dir].AsVar};ImageInsulate: PROC [set: Set] RETURNS [UWSet] ~ {is: ImageSet ~ NARROW[set.data.VA];IF set.MutabilityOf[]#variable THEN RETURN set.AsUW[];RETURN is.br.Insulate.Image[is.set, is.dir].AsUW};ImageValueOf: PROC [set: Set] RETURNS [ConstSet] ~ {is: ImageSet ~ NARROW[set.data.VA];IF set.MutabilityOf[]=constant THEN RETURN set.AsConst[];RETURN is.br.ValueOf.Image[is.set.ValueOf, is.dir].AsConst};ImageFreeze: PROC [set: Set] RETURNS [ConstSet] ~ {is: ImageSet ~ NARROW[set.data.VA];IF set.MutabilityOf[]#variable THEN set.Complain[notVariable];RETURN is.br.Freeze.Image[is.set.ValueOf, is.dir].AsConst};ImageThaw: PROC [set: Set] ~ {is: ImageSet ~ NARROW[set.data.VA];IF set.MutabilityOf[]#variable THEN set.Complain[notVariable];is.br.Thaw[];RETURN};ImageAddSet: PROC [set, other: Set] RETURNS [new: SomeAll _ []] ~ {is: ImageSet ~ NARROW[set.data.VA];IF is.br.Functional[][is.dir] AND is.set.Size[IE[2]]=one AND other.Size[IE[2]]=one THEN {news: HadPair ~ is.br.AddPair[Cons[is.src, is.set.AnElt.it, other.AnElt.it], addIfNew];SELECT news[leftToRight] FROMnone => new.some _ TRUE;same => new.all _ FALSE;different => set.Cant[];ENDCASE => ERROR;}ELSE {mv: MaybeValue ~ is.set.AnElt[];easy: BOOL ~ NOT is.br.Functional[][is.dir];Addit: PROC [val: Value] ~ {had: BOOL ~ set.HasMember[val];FindDom: PROC [dv: Value] RETURNS [BOOL] ~ {news: HadPair ~ is.br.AddPair[Cons[is.src, dv, val], addIfNew];RETURN [news[leftToRight]=none]};IF had THEN new.all _ FALSE ELSE new.some _ TRUE;IF easy THEN [] _ is.br.AddPair[Cons[is.src, mv.it, val]] ELSE IF NOT is.set.Scan[FindDom].found THEN set.Cant[];RETURN};other.Enumerate[Addit];};};ImageRemSet: PROC [set, other: Set] RETURNS [had: SomeAll _ []] ~ {is: ImageSet ~ NARROW[set.data.VA];sets: SetPair _ ConsSets[is.src, is.set, [Sets.GetSingletonClass[is.dstSpace], [no[]]]];Remit: PROC [dst: Value] ~ {IF set.HasMember[dst] THEN had.some _ TRUE ELSE had.all _ FALSE;TRUSTED {sets[is.dst].data _ dst};[] _ is.br.RemSet[CreateProduct[sets]];RETURN};other.Enumerate[Remit];RETURN};ImageSpaceOf: PROC [set: Set] RETURNS [Space] ~ {is: ImageSet ~ NARROW[set.data.VA];RETURN [is.br.Spaces[][is.dst]]};DefaultReplaceMe: PUBLIC PROC [br, with: IntRel, where: IntInterval] ~ {clip: IntInterval ~ with.GetIntDom[];[] _ br.DeleteSet[Sets.IIAsSet[where]];IF where.min > INT.FIRST THEN where.max _ MAX[where.max, where.min-1];IF where.max < INT.LAST THEN SubShift[br, [where.max+1, INT.LAST], clip.Length.Sub[where.Length]];[] _ br.AddSet[with.Shift[ISub[where.min, clip.min]]];RETURN};DefaultShiftAndClipMe: PUBLIC PROC [br: BiRel, shift: EINT, clip: IntInterval] ~ {IF clip.min > INT.FIRST THEN [] _ br.DeleteSet[Sets.IIAsSet[[INT.FIRST, clip.min-1]]];IF clip.max < INT.LAST THEN [] _ br.DeleteSet[Sets.IIAsSet[[clip.max+1, INT.LAST]]];SubShift[br, [INT.FIRST, INT.LAST], shift];RETURN};SubShift: PROC [br: BiRel, bounds: IntInterval, shift: EINT] ~ {brBounds: IntInterval ~ br.GetIntDom[];i: INT;Movit: PROC [v: Value] RETURNS [BOOL] ~ {[] _ br.AddPair[[left: [i[shift.AddI[i].EI]], right: v]];[] _ br.RemPair[[left: [i[i]], right: v]];RETURN [FALSE]};bounds _ brBounds.Intersect[bounds];IF bounds.Empty THEN RETURN;SELECT shift.Sgn FROM-1 => {FOR i IN [bounds.min .. bounds.max] DOIF br.ScanMapping[[i[i]], Movit].found THEN ERROR;ENDLOOP;};0 => NULL;1 => {FOR i DECREASING IN [bounds.min .. bounds.max] DOIF br.ScanMapping[[i[i]], Movit].found THEN ERROR;ENDLOOP;};ENDCASE => ERROR;RETURN};DefaultIsDense: PUBLIC PROC [br: BiRel, when: When, side: Side] RETURNS [BOOL] ~ {IF when=always AND br.MutabilityOf#constant THEN RETURN [FALSE];RETURN br.SetOn[side].IsDense[when]};DefaultSideFixed: PUBLIC PROC [br: BiRel, side: Side] RETURNS [BOOL] ~ {RETURN [br.MutabilityOf[]=constant]};Start: PROC ~ {FOR mut: Mutability IN Mutability DOimageClasses[mut] _ Sets.CreateClass[[HasMember: ImageHasMember,Scan: ImageScan,Get3: ImageGet3,Size: ImagesSize,Copy: ImageCopy,Insulate: ImageInsulate,ValueOf: ImageValueOf,Freeze: ImageFreeze,Thaw: ImageThaw,AddSet: ImageAddSet,RemSet: ImageRemSet,SpaceOf: ImageSpaceOf,mutability: mut]];ENDLOOP;RETURN};Start[];END.    ^  BiRelDefaults2.MesaLast tweaked by Mike Spreitzer on December 14, 1987 11:39:10 am PSTЭ╩	╓  Ц"cedar" styleШ codeЩKЪЬCЩCЧKШ KЪ╧k	Ь8ШAKШ Ъ╧nЬЭЬЭШKЪЭЬ1Ш8KЪЭЬШKШЧKШ KЪЭЬЭЬЮЬ#ШGKШ ЪЮЬЭЬЭЬ'ЭЬ
ШQKЪЬШKШKШ KЪЬЭЬЭЬ"ШAKЪЬЭЬNШ`ЪЬЭЬЭШ/KШKШKЪЬЭЬЭЬ
ЭЬ
ШGKЪЭЬЭЬШЧKЪЭЬ!Ш'ЧKШ KЪЬЭЬЭЬЭЬ
Ш2KЪЬЭЬЭЬШ4KШ KЪЬ
ЭЬЭЬШ%ЪЬЭЬЭЬШ KЪЬ
Ш
KЪЬ	Ш	KЪЬЭЬШKЪЬШKЪЬШKЪЬШЧKШ ЪЮЬЭЬЭЬЭЬЭЬЭЬШ\KЪЬЭЬ
ЭЬШ#ЪЭЬЭШKЪ	Ь	ЭЬЭЬ	ЭЬЭЬШ.KЪЭЬЭЬ	ШЧЧKШ ЪЮЬЭЬЭЬЭЬШ>KЪЬЭЬ
ЭЬШ#KЪЭЬmШsЧKШ ЪЮ	ЬЭЬЮЬ"ЭЬШYKЪЬЭЬ
ЭЬШ#KЪЬ)Ш)KЪ	ЬЭЬЭЬ	ЭЬЭЬШGKЪ
ЮЬЭЬЭЬЭЬЭЬШIKЪЮЬЭЬЭЬЭЬЭЬЭЬШpKЪЭЬ#ЭЬ	ЭЬ
ЭЬ*ШpЧKШ ЪЮ	ЬЭЬ*ЭЬШWKЪЬЭЬ
ЭЬШ#KЪЬ Ш KЪЭЬЭЬ
ЭЬЭЬШ:KЪЬШKЪЬ5Ш5KЪЬ5Ш5KЪЬ
ЭЬЭЬШЪЮЬЭЬЭЬЭЬШ.KЪЭЬ'ЭЬЭЬЭЬЭЬЭЬШLKЪЭЬЭЬШЧЪЮЬЭЬЭЬЭЬШ.KЪЭЬ'ЭЬЭЬЭЬЭЬЭЬШLKЪЭЬЭЬШЧKЪЬqШqKЪЬpШpЪЭЬШ	KШKЪЬЭЬЭЬЭЬЭЬЭЬ	Ш2KШKШЧЧKШ Ъ
Ю
ЬЭЬЭЬЭЬЭЬШ;KЪЬЭЬ
ЭЬШ#KЪЭЬ	ЭЬЭЬ8ШNKЪЭЬШЧKШ ЪЮ	ЬЭЬЭЬШ/KЪЬЭЬ
ЭЬШ#KЪЭЬ)Ш/ЧKШ ЪЮЬЭЬЭЬШ2KЪЬЭЬ
ЭЬШ#KЪЭЬЭЬЭЬШ6KЪЭЬ,Ш2ЧKШ ЪЮЬЭЬЭЬШ4KЪЬЭЬ
ЭЬШ#KЪЭЬЭЬЭЬШ9KЪЭЬ6Ш<ЧKШ ЪЮЬЭЬЭЬШ3KЪЬЭЬ
ЭЬШ#KЪЭЬЭЬШ>KЪЭЬ5Ш;ЧKШ ЪЮ	ЬЭЬШKЪЬЭЬ
ЭЬШ#KЪЭЬЭЬШ>KЪЬШKЪЭЬШЧKШ ЪЮЬЭЬЭЬШCKЪЬЭЬ
ЭЬШ#ЪЭЬЭЬЭЬ	ЭЬЭЬ	ЭЬШYKЪЬWШWЪЭЬЭШKЪЬЭЬШKЪЬЭЬШKЪЬШKЪЭЬЭЬШЧKШЧЪЭЬШKШ KЪЬЭЬЭЬШ,ЪЮЬЭЬШKЪЬЭЬШЪЮЬЭЬЭЬЭЬШ,KЪЬ?Ш?KЪЭЬШ!ЧKЪ
ЭЬЭЬЭЬЭЬЭЬШ1KЪЭЬЭЬ.ЭЬЭЬЭЬЭЬШqKЪЭЬШЧKШKШЧKШЧKШ ЪЮЬЭЬЭЬШCKЪЬЭЬ
ЭЬШ#KЪЬXШXЪЮЬЭЬШKЪ
ЭЬЭЬЭЬЭЬЭЬШ@KЪЭЬШ"KШ'KЪЭЬШЧKШKЪЭЬШЧKШ ЪЮЬЭЬЭЬШ1KЪЬЭЬ
ЭЬШ#KЪЭЬШ!ЧKШ ЪЮЬЭЬЭЬ+ШHKШ%KЪЬ'Ш'KЪ
ЭЬЭЬЭЬЭЬЭЬШFKЪЭЬЭЬЭЬЭЬЭЬЭЬ"ШbKЪЬ6Ш6KЪЭЬШЧKШ ЪЮЬЭЬЭЬЭЬШRKЪЭЬЭЬЭЬЭЬ!ЭЬЭЬШVKЪЭЬЭЬЭЬЭЬ-ЭЬЭЬШTKЪ	ЬЭЬЭЬЭЬЭЬ
Ш+KЪЭЬШЧKШ ЪЮЬЭЬ)ЭЬШ@KШ'KЪЬЭЬШЪЮЬЭЬЭЬЭЬШ)KЪЬ(ЭЬШ9KШ*KЪЭЬЭЬШЧKШ$KЪЭЬЭЬЭЬШЪЭЬЭШШЪЭЬЭЬЭШ&KЪЭЬ%ЭЬЭЬШ2KЪЭЬШЧKШЧKЪЬЭЬШ
ШЪЭЬЭ
ЬЭЬЭШ1KЪЭЬ%ЭЬЭЬШ2KЪЭЬШЧKШЧKЪЭЬЭЬШЧKЪЭЬШЧKШ Ъ
ЮЬЭЬЭЬ%ЭЬЭЬШRKЪ
ЭЬЭЬЭЬЭЬЭЬШ@KЪЭЬШ%ЧKШ Ъ
ЮЬЭЬЭЬЭЬЭЬШHKЪЭЬШ%ЧKШ ЪЮЬЭЬШЪЭЬЭЬЭШ$ЪЬ&Ш&KЪЮ	ЬШKЪЮЬШKЪЮЬШKЪЮЬШKЪЮЬШKЪЮЬШKЪЮЬШKЪЮЬШKЪЮЬШKЪЮЬШKЪЮЬШKЪЮЬШKШЧKЪЭЬШЧKЪЭЬШЧKШ KШKШ KЪЭЬШЧ ЕЧ    Ь  '╨  