Java BitSet.toArray方法代码示例

import antlr.collections.impl.BitSet; //导入方法依赖的package包/类
/** Generate a series of case statements that implement a BitSet test.
 * @param p The Bitset for which cases are to be generated
 */
protected void genCases(BitSet p) {
	if ( DEBUG_CODE_GENERATOR ) System.out.println("genCases("+p+")");
	int[] elems;

	elems = p.toArray();
	// Wrap cases four-per-line for lexer, one-per-line for parser
	int wrap = 1; //(grammar instanceof LexerGrammar) ? 4 : 1;
	int j=1;
	boolean startOfLine = true;
	for (int i = 0; i < elems.length; i++) {
		if (j==1) {
			print("");
		} else {
			_print("  ");
		}
		_print("case " + getValueString(elems[i]) + ":");

		if (j==wrap) {
			_println("");
			startOfLine = true;
			j=1;
		}
		else {
			j++;
			startOfLine = false;
		}
	}
	if (!startOfLine) {
		_println("");
	}
}
 

import antlr.collections.impl.BitSet; //导入方法依赖的package包/类
/**Generate a depth==1 lookahead test expression given the BitSet.
 * This may be one of:
 * 1) a series of 'x==X||' tests
 * 2) a range test using >= && <= where possible,
 * 3) a bitset membership test for complex comparisons
 * @param k The lookahead level
 * @param p The lookahead set for level k
 */
protected String getLookaheadTestTerm(int k, BitSet p) {
	// Determine the name of the item to be compared
	String ts = lookaheadString(k);

	// Generate a range expression if possible
	int[] elems = p.toArray();
	if (elementsAreRange(elems)) {
		return getRangeExpression(k, elems);
	}

	// Generate a bitset membership test if possible
	StringBuffer e;
	int degree = p.degree();
	if ( degree == 0 ) {
		return "true";
	}

	if (degree >= bitsetTestThreshold) {
		int bitsetIdx = markBitsetForGen(p);
		return getBitsetName(bitsetIdx) + ".member(" + ts + ")";
	}

	// Otherwise, generate the long-winded series of "x==X||" tests
	e = new StringBuffer();
	for (int i = 0; i < elems.length; i++) {
		// Get the compared-to item (token or character value)
		String cs = getValueString(elems[i]);

		// Generate the element comparison
		if( i > 0 ) e.append(" || ");
		e.append(ts);
		e.append(" == ");
		e.append(cs);
	}
	return e.toString();
}
 

import antlr.collections.impl.BitSet; //导入方法依赖的package包/类
/** Generate a series of case statements that implement a BitSet test.
 * @param p The Bitset for which cases are to be generated
 */
protected void genCases(BitSet p) {
    if (DEBUG_CODE_GENERATOR) System.out.println("genCases(" + p + ")");
    int[] elems;

    elems = p.toArray();
    // Wrap cases four-per-line for lexer, one-per-line for parser
    int wrap = (grammar instanceof LexerGrammar) ? 4 : 1;
    int j = 1;
    boolean startOfLine = true;
    for (int i = 0; i < elems.length; i++) {
        if (j == 1) {
            print("");
        }
        else {
            _print("  ");
        }
        _print("case " + getValueString(elems[i]) + ":");

        if (j == wrap) {
            _println("");
            startOfLine = true;
            j = 1;
        }
        else {
            j++;
            startOfLine = false;
        }
    }
    if (!startOfLine) {
        _println("");
    }
}
 

import antlr.collections.impl.BitSet; //导入方法依赖的package包/类
/**Generate a depth==1 lookahead test expression given the BitSet.
 * This may be one of:
 * 1) a series of 'x==X||' tests
 * 2) a range test using >= && <= where possible,
 * 3) a bitset membership test for complex comparisons
 * @param k The lookahead level
 * @param p The lookahead set for level k
 */
protected String getLookaheadTestTerm(int k, BitSet p) {
    // Determine the name of the item to be compared
    String ts = lookaheadString(k);

    // Generate a range expression if possible
    int[] elems = p.toArray();
    if (elementsAreRange(elems)) {
        return getRangeExpression(k, elems);
    }

    // Generate a bitset membership test if possible
    StringBuffer e;
    int degree = p.degree();
    if (degree == 0) {
        return "true";
    }

    if (degree >= bitsetTestThreshold) {
        int bitsetIdx = markBitsetForGen(p);
        return getBitsetName(bitsetIdx) + ".member(" + ts + ")";
    }

    // Otherwise, generate the long-winded series of "x==X||" tests
    e = new StringBuffer();
    for (int i = 0; i < elems.length; i++) {
        // Get the compared-to item (token or character value)
        String cs = getValueString(elems[i]);

        // Generate the element comparison
        if (i > 0) e.append("||");
        e.append(ts);
        e.append("==");
        e.append(cs);
    }
    return e.toString();
}
 

import antlr.collections.impl.BitSet; //导入方法依赖的package包/类
/** Generate a series of case statements that implement a BitSet test.
 * @param p The Bitset for which cases are to be generated
 */
protected void genCases(BitSet p) {
	if ( DEBUG_CODE_GENERATOR ) System.out.println("genCases("+p+")");
	int[] elems;

	elems = p.toArray();
	// Wrap cases four-per-line for lexer, one-per-line for parser
	int wrap = (grammar instanceof LexerGrammar) ? 4 : 1;
	int j=1;
	boolean startOfLine = true;
	for (int i = 0; i < elems.length; i++) {
		if (j==1) {
			print("");
		} else {
			_print("  ");
		}
		_print("case " + getValueString(elems[i]) + ":");
		if (j==wrap) {
			_println("");
			startOfLine = true;
			j=1;
		}
		else {
			j++;
			startOfLine = false;
		}
	}
	if (!startOfLine) {
		_println("");
	}
}
 

import antlr.collections.impl.BitSet; //导入方法依赖的package包/类
/**Generate a depth==1 lookahead test expression given the BitSet.
 * This may be one of:
 * 1) a series of 'x==X||' tests
 * 2) a range test using >= && <= where possible,
 * 3) a bitset membership test for complex comparisons
 * @param k The lookahead level
 * @param p The lookahead set for level k
 */
protected String getLookaheadTestTerm(int k, BitSet p) {
	// Determine the name of the item to be compared
	String ts = lookaheadString(k);

	// Generate a range expression if possible
	int[] elems = p.toArray();
	if (elementsAreRange(elems)) {
		return getRangeExpression(k, elems);
	}

	// Generate a bitset membership test if possible
	StringBuffer e;
	int degree = p.degree();
	if ( degree == 0 ) {
		return "true";
	}

	if (degree >= bitsetTestThreshold) {
		int bitsetIdx = markBitsetForGen(p);
		return getBitsetName(bitsetIdx) + ".member(" + ts + ")";
	}

	// Otherwise, generate the long-winded series of "x==X||" tests
	e = new StringBuffer();
	for (int i = 0; i < elems.length; i++) {
		// Get the compared-to item (token or character value)
		String cs = getValueString(elems[i]);

		// Generate the element comparison
		if ( i>0 ) e.append("||");
		e.append(ts);
		e.append("==");
		e.append(cs);
	}
	return e.toString();
}