java.lang.JTranscNumber Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of jtransc-rt Show documentation

JVM AOT compiler currently generating JavaScript, C++, Haxe, with initial focus on Kotlin and games.

There is a newer version: 0.6.8

package java.lang;

import com.jtransc.annotation.JTranscInvisible;

@JTranscInvisible
public class JTranscNumber {
	@JTranscInvisible
	static public void checkNumber(String str, int radix, boolean allowFloat) {
		if (!JTranscNumber.validateNumber(str, radix, allowFloat)) {
			throw new NumberFormatException("For input string: \"" + str + "\"");
		}
	}

	@JTranscInvisible
	static public boolean validateNumber(String str, int radix, boolean allowFloat) {
		final int len = str.length();
		int n = 0;
		int numpart = 0;
		int denpart = 0;
		int epart = 0;
		// Sign
		if ((n < len) && (str.charAt(n) == '-' || str.charAt(n) == '+')) n++;
		// Non-fractional digits
		while ((n < len) && isDigit(str.charAt(n), radix)) {
			n++;
			numpart++;
		}
		if (numpart <= 0) return false;
		if (allowFloat) {
			// Optional '.' notation
			if ((n < len) && (str.charAt(n) == '.')) {
				n++;
				while (n < len && isDigit(str.charAt(n), radix)) {
					n++;
					denpart++;
				}
				if (denpart <= 0) return false;
			}
			// Optional 'e' notation
			if ((n < len) && ((str.charAt(n) == 'e') || (str.charAt(n) == 'E'))) {
				n++;
				if ((n < len) && (str.charAt(n) == '-' || str.charAt(n) == '+')) n++;
				while ((n < len) && isDigit(str.charAt(n), radix)) {
					n++;
					epart++;
				}
				if (epart <= 0) return false;
			}
		}
		return (n >= len);
	}

	@JTranscInvisible
	static public boolean isDigit(char c, int radix) {
		int d = digit(c);
		return d >= 0 && d < radix;
	}

	@JTranscInvisible
	static public int digit(char c) {
		if (c >= '0' && c <= '9') return (c - '0');
		if (c >= 'a' && c <= 'z') return (c - 'a') + 10;
		if (c >= 'A' && c <= 'Z') return (c - 'A') + 10;
		return -1;
	}
}