| Метод |
Описание |
|
|
AddElseCases ( Alts alts, PredictionTree tree ) : void |
Extends each level of the prediction tree so that it has total coverage. For example, a typicaly prediction tree might have branches for 'a'..'z' and '0..'9'; this method will add coverage for all other possible inputs. It does this either by adding an error branch, or by extending the set handled by the default branch of each level. |
|
|
AutoAddBranchForAndPred ( InternalList &children, AndPred andPred, List alts, Set matched, MSet falsified ) : void |
|
|
|
ComputeAssertionTree ( List alts ) : PredictionTreeOrAlt |
|
|
|
ComputeAssertionTree2 ( List alts, Set matched ) : PredictionTreeOrAlt |
|
|
|
ComputeNestedPredictionTree ( List prevSets ) : PredictionTreeOrAlt |
|
|
|
ComputeSetForNextBranch ( KthSet kthSets, List thisBranch, IPGTerminalSet covered ) : IPGTerminalSet |
|
|
|
CountAlt ( int alt, int>.Dictionary timesUsed ) : void |
|
|
|
NarrowDownToOneCase ( IPGTerminalSet normalSet, List cases ) : IPGTerminalSet |
|
|
|
NarrowDownToSet ( KthSet kthSet, IPGTerminalSet set ) : KthSet |
|
|
|
NarrowDownToSet ( List thisBranch, IPGTerminalSet set ) : void |
|
|
|
RemoveFalsifiedCases ( List alts, MSet falsified ) : void |
|
|
|
SimplifyPredictionTree ( PredictionTree tree ) : PredictionTreeOrAlt |
Recursively merges adjacent duplicate cases in prediction trees. The tree is modified in-place, but in case a tree collapses to a single alternative, the return value indicates which single alternative. |
|