New implementation for Lua tables. Does not use Vector or Hashtable, instead

uses plain Java arrays directly to keep heap allocation to a minimum.
Includes some unit tests that seem to indicate the basic operations are
correct. However, the following things are not implemented:

* Shrinking the capacity when elements are removed
* Optimal storage of each element in array vs. hash when entries are
  added out of order. A junit test case is there for this.

src/main/java/lua/value/LDouble.java

@@ -18,6 +18,12 @@ public class LDouble extends LNumber {
 		return String.valueOf(m_value);
 	}
 	
+	public boolean isInteger() {
+		// Cast to int and then back to double and see if the value
+		// survives the round trip.
+		return ( (double) ( (int) m_value ) ) == m_value;
+	}
+	
 	// binary operations on integers, first dispatch
 	public LValue luaBinOpUnknown(int opcode, LValue lhs) {
 		return lhs.luaBinOpDouble( opcode, this.m_value );