| OCR Text |
Show 49 rences. GroupConstraints will eliminate the redundant occurrences at a later time. The rootlist is a list of root objects requiring a new premise_of set. The premises of objects on rootlist also require new premise_of sets. Rootlist is returned so the premise_of sets may be recomputed. LabeiComponent is: procedure labelComponent Component; begin acalar NewLabel, RootObjecta; end; NewLabel : • ~indUniqueLabel ( Component ) ; for each Constraint in Component do if NewLabel neq Conatraint->Groupid then ( ) ; Conatraint->Groupid := NewLabel; RootObjecta :• append ( Conatraint->ConatrainedObjecta, RootObjecta ) return RootObjecta 6.2.5 ComputePremlseOfCount and PropagatePremlses. For each object in rootobjects and each objects prerequisite objects, ComputePremlseOfCount will compute the number of dependent objects which require a new premise_of set to be computed. This is analogous to computeAncestorCount except the edges of the dependency graph are viewed in reverse. PropagatePremlses subtracts one from this number each time a dependent object's premise_of set is recomputed. When the number becomes zero, all of the dependent's premise_of sets are valid and the object's premise of set may be computed as well. The effect of this is to compute the premise_of sets in topological order, with no redundant computation. This is analogous to topologlcaiEval except in reverse. ComputePremlseOfCount is: |
