Sieve of Eratosthenes implementation in haxe

Main.hx

package;

import sys.FileSystem;

class Main 
{
	static function main() 
	{
		var numbers = [
			for (i in 2...100) {
				isPrime(i);
			}
		];
		var curPrime = 1;
		for (prime in numbers) {
			curPrime = curPrime + 1;
			trace(curPrime + "\t" + prime);
		}
	}

	static function isPrime(possiblePrime:Int):Bool {
		if (possiblePrime == 2) return true;
		var maximumTestable = Math.ceil(Math.sqrt(possiblePrime));
		for (primeTest in 2...maximumTestable+1) {
			if (possiblePrime % primeTest == 0) return false;
		}
		return true;
	}
}