public void addAll(int[] elements) { if ( elements==null ) { return; } for (int i = 0; i < elements.length; i++) { int e = elements[i]; add(e); } }
public void addAll(int[] elements) { if ( elements==null ) { return; } for (int i = 0; i < elements.length; i++) { int e = elements[i]; add(e); } }
public static BitSet of(Collection elements) { BitSet s = new BitSet(); Iterator iter = elements.iterator(); while (iter.hasNext()) { Integer el = (Integer) iter.next(); s.add(el.intValue()); } return s; }
public static BitSet of(int el) { BitSet s = new BitSet(el + 1); s.add(el); return s; }
public static void error(int msgID, Throwable e) { getErrorState().errors++; getErrorState().errorMsgIDs.add(msgID); getErrorListener().error(new ToolMessage(msgID,e)); }
public static void error(int msgID, Object arg) { getErrorState().errors++; getErrorState().errorMsgIDs.add(msgID); getErrorListener().error(new ToolMessage(msgID, arg)); }
public static void insufficientPredicates(DecisionProbe probe, DFAState d, Map<Integer, Set<Token>> altToUncoveredLocations) { getErrorState().warnings++; Message msg = new GrammarInsufficientPredicatesMessage(probe,d,altToUncoveredLocations); getErrorState().warningMsgIDs.add(msg.msgID); getErrorListener().warning(msg); }
public static void error(int msgID) { getErrorState().errors++; getErrorState().errorMsgIDs.add(msgID); getErrorListener().error(new ToolMessage(msgID)); }
public static void error(int msgID, Throwable e) { getErrorState().errors++; getErrorState().errorMsgIDs.add(msgID); getErrorListener().error(new ToolMessage(msgID,e)); }
public static void warning(int msgID, Object arg) { getErrorState().warnings++; getErrorState().warningMsgIDs.add(msgID); getErrorListener().warning(new ToolMessage(msgID, arg)); }
public static void warning(int msgID, Object arg) { getErrorState().warnings++; getErrorState().warningMsgIDs.add(msgID); getErrorListener().warning(new ToolMessage(msgID, arg)); }
public static void syntaxError(int msgID, Grammar grammar, Token token, Object arg, antlr.RecognitionException re) { getErrorState().errors++; getErrorState().errorMsgIDs.add(msgID); getErrorListener().error( new GrammarSyntaxMessage(msgID,grammar,token,arg,re) ); }
public static void error(int msgID, Object arg) { getErrorState().errors++; getErrorState().errorMsgIDs.add(msgID); getErrorListener().error(new ToolMessage(msgID, arg)); }
public static void error(int msgID, Object arg, Throwable e) { getErrorState().errors++; getErrorState().errorMsgIDs.add(msgID); getErrorListener().error(new ToolMessage(msgID, arg, e)); }
public static void grammarWarning(int msgID, Grammar g, Token token, Object arg, Object arg2) { getErrorState().warnings++; Message msg = new GrammarSemanticsMessage(msgID,g,token,arg,arg2); getErrorState().warningMsgIDs.add(msgID); getErrorListener().warning(msg); }
public static void error(int msgID, Object arg, Throwable e) { getErrorState().errors++; getErrorState().errorMsgIDs.add(msgID); getErrorListener().error(new ToolMessage(msgID, arg, e)); }
public static void nondeterminism(DecisionProbe probe, DFAState d) { getErrorState().warnings++; Message msg = new GrammarNonDeterminismMessage(probe,d); getErrorState().warningMsgIDs.add(msg.msgID); getErrorListener().warning(msg); }
public static void leftRecursionCycles(Collection<? extends Set<? extends Rule>> cycles) { getErrorState().errors++; Message msg = new LeftRecursionCyclesMessage(cycles); getErrorState().errorMsgIDs.add(msg.msgID); getErrorListener().error(msg); }
public static void unreachableAlts(DecisionProbe probe, List alts) { getErrorState().errors++; Message msg = new GrammarUnreachableAltsMessage(probe,alts); getErrorState().errorMsgIDs.add(msg.msgID); getErrorListener().error(msg); }
public static void nonLLStarDecision(DecisionProbe probe) { getErrorState().errors++; Message msg = new NonRegularDecisionMessage(probe, probe.getNonDeterministicAlts()); getErrorState().errorMsgIDs.add(msg.msgID); getErrorListener().error(msg); }