| OCR Text |
Show procedure computeP~s.OfCount ObjectList; for each Object in ObjectList do if IDOdelObjectP ( Object ) and not ( Object->Kark ) then if iller ( Object->AncestorCount ) eq 1 then ( ) ; Object->M&rk :c t; computePremiseOfCount ( Object->Prereqa ) ; Object->.Mark :• nil PropagatePremlses is: procedure propagatePremises( ObjectList, GroupList ); begin scalar Constraints, PremiseOfSet; end; for each Object in ObjectList do if modelObjectP( Object ) then ( ) ; if deer( Object->AncestorCount ) eq 0 then ( PremiseOfSet := nil; for each Dependent in Object->Dependents do PremiseOfSet := append ( Dependent ->P remiseOfSet, PremiseOfSet ) ; if Constraints := Object->Constraints then ( ) ; Constraints := (first( Constraints ))->Groupid; push( Constraints, GroupList ); push( Constraints, PremiseOfSet Object->PremiseOfSet := list2setQ( PremiaeOfSet ); GroupList := propagatePremiaea( Object->Prereqa, GroupList ) return GroupList |