/** Remove A -> A UnaryRules from bestRulesUnderMax. */ public final void purgeRules() { Map<UnaryRule,UnaryRule> bR = Generics.newHashMap(); for (UnaryRule ur : bestRulesUnderMax.keySet()) { if (ur.parent != ur.child) { bR.put(ur, ur); } else { closedRulesWithParent[ur.parent].remove(ur); closedRulesWithChild[ur.child].remove(ur); } } bestRulesUnderMax = bR; makeCRArrays(); }
public UnaryRule[] closedRulesByParent(int state) { if (closedRulesWithP == null) { makeCRArrays(); } if (state >= closedRulesWithP.length) { return EMPTY_UNARY_RULE_ARRAY; } return closedRulesWithP[state]; }
public UnaryRule[] closedRulesByChild(int state) { if (closedRulesWithC == null) { makeCRArrays(); } if (state >= closedRulesWithC.length) { return EMPTY_UNARY_RULE_ARRAY; } return closedRulesWithC[state]; }
/** Remove A -> A UnaryRules from bestRulesUnderMax. */ public final void purgeRules() { Map<UnaryRule,UnaryRule> bR = Generics.newHashMap(); for (UnaryRule ur : bestRulesUnderMax.keySet()) { if (ur.parent != ur.child) { bR.put(ur, ur); } else { closedRulesWithParent[ur.parent].remove(ur); closedRulesWithChild[ur.child].remove(ur); } } bestRulesUnderMax = bR; makeCRArrays(); }
/** Remove A -> A UnaryRules from bestRulesUnderMax. */ public final void purgeRules() { Map<UnaryRule,UnaryRule> bR = Generics.newHashMap(); for (UnaryRule ur : bestRulesUnderMax.keySet()) { if (ur.parent != ur.child) { bR.put(ur, ur); } else { closedRulesWithParent[ur.parent].remove(ur); closedRulesWithChild[ur.child].remove(ur); } } bestRulesUnderMax = bR; makeCRArrays(); }
/** Remove A -> A UnaryRules from bestRulesUnderMax. */ public final void purgeRules() { Map<UnaryRule,UnaryRule> bR = Generics.newHashMap(); for (UnaryRule ur : bestRulesUnderMax.keySet()) { if (ur.parent != ur.child) { bR.put(ur, ur); } else { closedRulesWithParent[ur.parent].remove(ur); closedRulesWithChild[ur.child].remove(ur); } } bestRulesUnderMax = bR; makeCRArrays(); }