JavaSript backend (early stage)

vlib/strings/similarity.v

@@ -1,9 +1,11 @@
 module strings
 
+#-js
+
 // use levenshtein distance algorithm to calculate
 // the distance between between two strings (lower is closer)
 pub fn levenshtein_distance(a, b string) int {
-	mut f := [int(0); b.len+1]
+	mut f := [0].repeat2(b.len+1)
 	for ca in a {
 		mut j := 1
 		mut fj1 := f[0]