java混合运算精度,Java实现四则混合运算

getNegativeNumSensitiveToken() {

if (NEGATIVE_NUM_SENSITIVE.size() == 0) {

NEGATIVE_NUM_SENSITIVE.addAll(TOKENs.keySet());

NEGATIVE_NUM_SENSITIVE.remove(')');

}

return NEGATIVE_NUM_SENSITIVE;

}

public static boolean isTerminateToken(final char token) {

Setkeys = TOKENs.keySet();

return keys.contains(token);

}

public static int getTokenId(final char token) {

return TOKENs.get(token) == null ? -1 : TOKENs.get(token);

}

public static int getTokenSize() {

return TOKENs.size();

}

}

enum CALCULATE_MODE {

INSTANCE;

private static char[][] RULES = {

// + - * / ( ) #

{ '>', '>', '', '>' }, // +

{ '>', '>', '', '>' }, // -

{ '>', '>', '>', '>', '', '>' }, // *

{ '>', '>', '>', '>', '', '>' }, // /

{ '', '>', '>', '>', 'o', '>', '>' }, // )

{ ' exec(final String expression) {

clean();

String exp = clearExpression(expression);

List result = new LinkedList();

for (int i = 0; i < exp.length(); i++) {

char c = exp.charAt(i);

if (TERMINATE_TOKENS.isTerminateToken(c)) {

if (processNegativeNumbers(exp, i))

continue;

if (BUFFER.length() > 0) {

result.add(Double.valueOf(BUFFER.toString()));

BUFFER.delete(0, BUFFER.length());

}

result.add(c);

} else {

BUFFER.append(c);

}

PREVIOUS_CHAR = c;

}

return Collections.unmodifiableList(result);

}

}