DIRECTORY AbSets, BiRelBasics, BiRels, IntStuff, SetBasics;SetsByBiRels: CEDAR PROGRAMIMPORTS AbSets, BiRelBasics, BiRels, SetBasicsEXPORTS BiRels=BEGIN OPEN IntStuff, SetBasics, BiRelBasics, BiRels, Sets:AbSets, Sets;SeqSet: TYPE ~ REF SeqSetPrivate;SeqSetPrivate: TYPE ~ RECORD [seq: Sequence,addat: SeqAddPlace,closeGaps: BOOL,space: Space,empty: BiRel,afterLast: INT _ 0];ImplementSetBySequence: PUBLIC PROC [seq: Sequence, addat: SeqAddPlace, closeGaps: BOOL] RETURNS [Set] ~ {ss: SeqSet ~ NEW [SeqSetPrivate _ [seq: seq,addat: addat,closeGaps: closeGaps,space: seq.Spaces[][right],empty: CreateEmptyBiRel[seq.Spaces]]];RETURN [[ssClasses[seq.MutabilityOf], [a[ss]] ]]};SSClasses: TYPE ~ ARRAY Mutability OF SetClass;ssClasses: REF SSClasses ~ NEW [SSClasses];SSHasMember: PROC [set: Set, elt: Value] RETURNS [BOOL] ~ {ss: SeqSet ~ NARROW[set.data.VA];RETURN [ss.seq.Apply[elt, rightToLeft].found]};SSScan: PROC [set: Set, Test: Tester, ro: RelOrder] RETURNS [MaybeValue] ~ {ss: SeqSet ~ NARROW[set.data.VA];RETURN ss.seq.SetOn[right].Scan[Test, ro]};SSGet3: PROC [set: Set, elt: Value, want: TripleBool] RETURNS [TripleMaybeValue] ~ {ss: SeqSet ~ NARROW[set.data.VA];tmp: TripleMaybePair ~ ss.seq.Get3[[[i[0]], elt], [[no, fwd], right], [want.prev, FALSE, want.next]];RETURN [[prev: tmp.prev.KeepHalf[right],same: IF ss.seq.Apply[elt, rightToLeft].found THEN [TRUE, elt] ELSE noMaybe,next: tmp.next.KeepHalf[right]]]};SSSize: PROC [set: Set, limit: EINT] RETURNS [EINT] ~ {ss: SeqSet ~ NARROW[set.data.VA];RETURN ss.seq.Size[limit]};SSCopy: PROC [set: Set] RETURNS [VarSet] ~ {ss: SeqSet ~ NARROW[set.data.VA];RETURN ss.seq.Copy.ImplementSetBySequence[ss.addat, ss.closeGaps].AsVar};SSInsulate: PROC [set: Set] RETURNS [UWSet] ~ {ss: SeqSet ~ NARROW[set.data.VA];RETURN ss.seq.Insulate.ImplementSetBySequence[ss.addat, ss.closeGaps].AsUW};SSValueOf: PROC [set: Set] RETURNS [ConstSet] ~ {ss: SeqSet ~ NARROW[set.data.VA];RETURN ss.seq.ValueOf.ImplementSetBySequence[ss.addat, ss.closeGaps].AsConst};SSFreeze: PROC [set: Set] RETURNS [ConstSet] ~ {ss: SeqSet ~ NARROW[set.data.VA];RETURN ss.seq.Freeze.ImplementSetBySequence[ss.addat, ss.closeGaps].AsConst};SSThaw: PROC [set: Set] ~ {ss: SeqSet ~ NARROW[set.data.VA];ss.seq.Thaw[];RETURN};SSAddSet: PROC [set, other: Set] RETURNS [new: SomeAll _ []] ~ {ss: SeqSet ~ NARROW[set.data.VA];PerElt: PROC [elt: Value] RETURNS [BOOL] ~ {had: BOOL ~ set.HasMember[elt];IF had THEN new.all _ FALSE ELSE {i0: INT ~ IF ss.addat=front THEN 0 ELSE ss.afterLast;ss.seq.Insert[elt, i0];IF ss.addat=back THEN ss.afterLast _ ss.afterLast.SUCC;new.some _ TRUE};RETURN [FALSE]};IF other.Scan[PerElt].found THEN ERROR;RETURN};SSRemSet: PROC [set, other: Set] RETURNS [had: SomeAll _ []] ~ {ss: SeqSet ~ NARROW[set.data.VA];IF other.data = set.data THEN {hadSome: HadSet ~ ss.seq.RemSet[ss.seq][rightToLeft];had _ [some: hadSome[same], all: TRUE];ss.afterLast _ 0;RETURN}ELSE IF ss.closeGaps THEN {PerElt: PROC [elt: Value] RETURNS [BOOL] ~ {index: MaybeValue ~ ss.seq.Apply[elt, rightToLeft];IF index.found THEN {i0: INT ~ index.it.VI;ss.seq.ReplaceMe[ss.empty, [i0, i0]];IF ss.addat=back THEN ss.afterLast _ ss.afterLast.PRED;had.some _ TRUE}ELSE had.all _ FALSE;RETURN [FALSE]};IF other.Scan[PerElt].found THEN ERROR;RETURN}ELSE {had _ ss.seq.DeleteSet[other, right];IF ss.addat=back THEN {bi: MaybePairInterval ~ ss.seq.GetBounds[[FALSE, TRUE]];ss.afterLast _ IF bi.found THEN bi.it[max][left].VI+1 ELSE 0};RETURN};};SSSpaceOf: PROC [set: Set] RETURNS [Space] ~ {ss: SeqSet ~ NARROW[set.data.VA];RETURN [ss.space]};ImplementSetByIDSubset: PUBLIC PROC [ids: OneToOne] RETURNS [Set] ~ {RETURN [[isClasses[ids.MutabilityOf], [a[ids.Refify]] ]]};ISClasses: TYPE ~ ARRAY Mutability OF SetClass;isClasses: REF ISClasses ~ NEW [ISClasses];ISHasMember: PROC [set: Set, elt: Value] RETURNS [BOOL] ~ {ri: REF BiRel ~ NARROW[set.data.VA];RETURN ri^.HasPair[ALL[elt]]};ISScan: PROC [set: Set, Test: Tester, ro: RelOrder] RETURNS [MaybeValue] ~ {ri: REF BiRel ~ NARROW[set.data.VA];Pass: PROC [pair: Pair] RETURNS [BOOL] ~ {RETURN Test[pair[left]]};RETURN ri^.Scan[Pass, [[ro, no]]].KeepHalf[left]};ISGetOne: PROC [set: Set, remove: BOOL, ro: RelOrder] RETURNS [MaybeValue] ~ {ri: REF BiRel ~ NARROW[set.data.VA];RETURN ri^.GetOne[remove, [[ro, no]]].KeepHalf[left]};ISGet3: PROC [set: Set, elt: Value, want: TripleBool] RETURNS [TripleMaybeValue] ~ {ri: REF BiRel ~ NARROW[set.data.VA];tmp: TripleMaybePair ~ ri^.Get3[ALL[elt], [[fwd, no]], want];RETURN [[prev: tmp.prev.KeepHalf[left],same: tmp.same.KeepHalf[left],next: tmp.next.KeepHalf[left] ]]};ISSize: PROC [set: Set, limit: EINT] RETURNS [EINT] ~ {ri: REF BiRel ~ NARROW[set.data.VA];RETURN ri^.Size[limit]};ISGetBounds: PROC [set: Set, want: EndBools] RETURNS [MaybeInterval] ~ {ri: REF BiRel ~ NARROW[set.data.VA];RETURN ri^.GetBounds[want].MPISide[left]};ISCopy: PROC [set: Set] RETURNS [VarSet] ~ {ri: REF BiRel ~ NARROW[set.data.VA];RETURN ri^.Copy.ImplementSetByIDSubset.AsVar};ISInsulate: PROC [set: Set] RETURNS [UWSet] ~ {ri: REF BiRel ~ NARROW[set.data.VA];RETURN ri^.Insulate.ImplementSetByIDSubset.AsUW};ISValueOf: PROC [set: Set] RETURNS [ConstSet] ~ {ri: REF BiRel ~ NARROW[set.data.VA];RETURN ri^.ValueOf.ImplementSetByIDSubset.AsConst};ISFreeze: PROC [set: Set] RETURNS [ConstSet] ~ {ri: REF BiRel ~ NARROW[set.data.VA];RETURN ri^.Freeze.ImplementSetByIDSubset.AsConst};ISThaw: PROC [set: Set] ~ {ri: REF BiRel ~ NARROW[set.data.VA];ri^.Thaw;RETURN};ISAddSet: PROC [set, other: Set] RETURNS [new: SomeAll] ~ {ri: REF BiRel ~ NARROW[set.data.VA];some: HadSetPair ~ ri^.AddSet[CreateIDSubset[other]];IF some[leftToRight] # some[rightToLeft] THEN ERROR;IF some[leftToRight][different] THEN ERROR;RETURN [[some: some[leftToRight][none], all: NOT some[leftToRight][same]]]};ISRemSet: PROC [set, other: Set] RETURNS [had: SomeAll] ~ {ri: REF BiRel ~ NARROW[set.data.VA];some: HadSet ~ ri^.RemSet[CreateIDSubset[other]][leftToRight];IF some[different] THEN ERROR;RETURN [[some: some[same], all: NOT some[none] ]]};ISSpaceOf: PROC [set: Set] RETURNS [Space] ~ {ri: REF BiRel ~ NARROW[set.data.VA];RETURN [ri^.Spaces[][left]]};Start: PROC ~ {FOR mut: Mutability IN Mutability DOssClasses[mut] _ CreateClass[cp: [HasMember: SSHasMember,Scan: SSScan,Get3: SSGet3,Size: SSSize,Copy: SSCopy,Insulate: IF mut=variable THEN SSInsulate ELSE NIL,ValueOf: IF mut#constant THEN SSValueOf ELSE NIL,Freeze: IF mut=variable THEN SSFreeze ELSE NIL,Thaw: IF mut=variable THEN SSThaw ELSE NIL,AddSet: IF mut=variable THEN SSAddSet ELSE NIL,RemSet: IF mut=variable THEN SSRemSet ELSE NIL,SpaceOf: SSSpaceOf,mutability: mut],relable: ALL[TRUE]];isClasses[mut] _ CreateClass[cp: [HasMember: ISHasMember,Scan: ISScan,GetOne: ISGetOne,Get3: ISGet3,Size: ISSize,GetBounds: ISGetBounds,Copy: ISCopy,Insulate: IF mut=variable THEN ISInsulate ELSE NIL,ValueOf: IF mut#constant THEN ISValueOf ELSE NIL,Freeze: IF mut=variable THEN ISFreeze ELSE NIL,Thaw: IF mut=variable THEN ISThaw ELSE NIL,AddSet: IF mut=variable THEN ISAddSet ELSE NIL,RemSet: IF mut=variable THEN ISRemSet ELSE NIL,SpaceOf: ISSpaceOf,mutability: mut],relable: ALL[TRUE]];ENDLOOP;};Start[];END.   \  SetsByBiRels.MesaLast tweaked by Mike Spreitzer on December 14, 1987 12:04:15 pm PSTЭ╩
Ё  Ц"cedar" styleШ codeЩKЪЬCЩCЧKШ KЪ╧k	Ь2Ш;KШ Ъ╧nЬЭЬЭШKЪЭЬ'Ш.KЪЭЬШKШЧKШ KЪЭЬЭЬ+ЮЬШGKШ KЪЬЭЬЭЬШ!ЪЬЭЬЭЬШKШKЪЬШKЪЬЭЬШKШKШKЪЬЭЬШKШЧKШ Ъ
ЮЬЭЬЭЬ0ЭЬЭЬ
ШjЪЬЭЬШ#KШ	KШKЪЬШKШKЪЬ#Ш#KШЧKЪЭЬ,Ш2ЧKШ KЪЬЭЬЭЬЭЬ
Ш/KЪЬЭЬЭЬШ+KШ ЪЮЬЭЬЭЬЭЬШ;KЪЬЭЬ
ЭЬШ!KЪЭЬ)Ш/ЧKШ ЪЮЬЭЬЮЬЭЬШLKЪЬЭЬ
ЭЬШ!KЪЭЬ%Ш+ЧKШ ЪЮЬЭЬ*ЭЬШTKЪЬЭЬ
ЭЬШ!KЪЬRЭЬШeЪЭЬШ	KШKЪ	ЬЭЬ&ЭЬЭЬЭЬ	ШLKШKШЧЧKШ Ъ
ЮЬЭЬЭЬЭЬЭЬШ7KЪЬЭЬ
ЭЬШ!KЪЭЬШЧKШ ЪЮЬЭЬЭЬШ,KЪЬЭЬ
ЭЬШ!KЪЭЬCШIЧKШ ЪЮ
ЬЭЬЭЬШ/KЪЬЭЬ
ЭЬШ!KЪЭЬFШLЧKШ ЪЮ	ЬЭЬЭЬШ1KЪЬЭЬ
ЭЬШ!KЪЭЬHШNЧKШ ЪЮЬЭЬЭЬШ0KЪЬЭЬ
ЭЬШ!KЪЭЬGШMЧKШ ЪЮЬЭЬШKЪЬЭЬ
ЭЬШ!KШKЪЭЬШЧKШ ЪЮЬЭЬЭЬШ@KЪЬЭЬ
ЭЬШ!ЪЮЬЭЬЭЬЭЬШ,KЪЬЭЬШЪЭЬЭЬЭЬЭЬШ"KЪ	ЬЭЬЭЬЭЬЭЬШ5KШKЪЭЬЭЬЭЬШ7KЪЬЭЬШЧKЪЭЬЭЬШЧKЪЭЬЭЬЭЬШ'KЪЭЬШЧKШ ЪЮЬЭЬЭЬШ@KЪЬЭЬ
ЭЬШ!ЪЭЬЭЬШKЪЬ5Ш5KЪЬ!ЭЬШ'KШKЪЭЬШЧЪЭЬЭЬЭЬШЪЮЬЭЬЭЬЭЬШ,KШ3ЪЭЬЭЬШKЪЬЭЬЭЬШKЪЬ%Ш%KЪЭЬЭЬЭЬШ7KЪЬЭЬШЧKЪЭЬЭЬШKЪЭЬЭЬШЧKЪЭЬЭЬЭЬШ'KЪЭЬШЧЪЭЬШKЪЬ%Ш%ЪЭЬЭЬШKЪЬ*ЭЬЭЬШ8KЪ	ЬЭЬ
ЭЬЭЬЭЬШ>ЧKЪЭЬШЧKЪЬШЧKШ ЪЮ	ЬЭЬЭЬШ.KЪЬЭЬ
ЭЬШ!KЪЭЬШЧKШ ЪЮЬЭЬЭЬЭЬ
ШEKЪЭЬ4Ш:ЧKШ KЪЬЭЬЭЬЭЬ
Ш/KЪЬЭЬЭЬШ+KШ ЪЮЬЭЬЭЬЭЬШ;KЪЬЭЬ	ЭЬ
ЭЬШ$KЪЭЬЭЬШЧKШ ЪЮЬЭЬЮЬЭЬШLKЪЬЭЬ	ЭЬ
ЭЬШ$KЪ
ЮЬЭЬЭЬЭЬЭЬШCKЪЭЬ,Ш2ЧKШ ЪЮЬЭЬЭЬЭЬШNKЪЬЭЬ	ЭЬ
ЭЬШ$KЪЭЬ0Ш6ЧKШ ЪЮЬЭЬ*ЭЬШTKЪЬЭЬ	ЭЬ
ЭЬШ$KЪЬ ЭЬШ=ЪЭЬШ	KШKШKШ"ЧЧKШ Ъ
ЮЬЭЬЭЬЭЬЭЬШ7KЪЬЭЬ	ЭЬ
ЭЬШ$KЪЭЬШЧKШ ЪЮЬЭЬЭЬШHKЪЬЭЬ	ЭЬ
ЭЬШ$KЪЭЬ$Ш*ЧKШ ЪЮЬЭЬЭЬШ,KЪЬЭЬ	ЭЬ
ЭЬШ$KЪЭЬ(Ш.ЧKШ ЪЮ
ЬЭЬЭЬШ/KЪЬЭЬ	ЭЬ
ЭЬШ$KЪЭЬ+Ш1ЧKШ ЪЮ	ЬЭЬЭЬШ1KЪЬЭЬ	ЭЬ
ЭЬШ$KЪЭЬ-Ш3ЧKШ ЪЮЬЭЬЭЬШ0KЪЬЭЬ	ЭЬ
ЭЬШ$KЪЭЬ,Ш2ЧKШ ЪЮЬЭЬШKЪЬЭЬ	ЭЬ
ЭЬШ$KЪЬ	Ш	KЪЭЬШЧKШ ЪЮЬЭЬЭЬШ;KЪЬЭЬ	ЭЬ
ЭЬШ$KЪЬ5Ш5KЪЭЬ'ЭЬЭЬШ4KЪЭЬЭЬЭЬШ+KЪЭЬ'ЭЬШLЧKШ ЪЮЬЭЬЭЬШ;KЪЬЭЬ	ЭЬ
ЭЬШ$KЪЬ>Ш>KЪЭЬЭЬЭЬШKЪЭЬЭЬШ3ЧKШ ЪЮ	ЬЭЬЭЬШ.KЪЬЭЬ	ЭЬ
ЭЬШ$KЪЭЬШЧKШ ЪЮЬЭЬШЪЭЬЭЬЭШ$ШШKЪЮ	ЬШKЪЮЬ	ШKЪЮЬ	ШKЪЮЬ	ШKЪЮЬ	ШKЪ
ЮЬЭЬЭЬЭЬЭЬШ3KЪ
ЮЬЭЬЭЬЭЬЭЬШ1KЪ
ЮЬЭЬЭЬ
ЭЬЭЬШ/KЪ
ЮЬЭЬЭЬЭЬЭЬШ+KЪ
ЮЬЭЬЭЬ
ЭЬЭЬШ/KЪ
ЮЬЭЬЭЬ
ЭЬЭЬШ/KЪЮЬШKЪЬШKШЧKЪЬ	ЭЬЭЬШKШЧШШKЪЮ	ЬШKЪЮЬ	ШKЪЮЬШKЪЮЬ	ШKЪЮЬ	ШKЪЮ	ЬШKЪЮЬ	ШKЪ
ЮЬЭЬЭЬЭЬЭЬШ3KЪ
ЮЬЭЬЭЬЭЬЭЬШ1KЪ
ЮЬЭЬЭЬ
ЭЬЭЬШ/KЪ
ЮЬЭЬЭЬЭЬЭЬШ+KЪ
ЮЬЭЬЭЬ
ЭЬЭЬШ/KЪ
ЮЬЭЬЭЬ
ЭЬЭЬШ/KЪЮЬШKЪЬШKШЧKЪЬ	ЭЬЭЬШKШЧKЪЭЬШЧKШЧKШ KШKШ KЪЭЬШЧ ЕЧ    ╚  (  