JavaSript backend (early stage)

vlib/strings/builder.v

@@ -2,10 +2,10 @@
 // Use of this source code is governed by an MIT license
 // that can be found in the LICENSE file.
 
-module strings 
+module strings
 
 struct Builder {
-mut: 
+mut:
 	buf []byte
 pub:
 	len int
@@ -13,19 +13,19 @@ pub:
 
 pub fn new_builder(initial_size int) Builder {
 	return Builder {
-		buf: _make(0, initial_size, sizeof(byte))
+		//buf: _make(0, initial_size, sizeof(byte))
 	}
 }
 
 pub fn (b mut Builder) write(s string) {
 	b.buf._push_many(s.str, s.len)
-	//b.buf << []byte(s)  // TODO 
+	//b.buf << []byte(s)  // TODO
 	b.len += s.len
 }
 
 pub fn (b mut Builder) writeln(s string) {
 	b.buf._push_many(s.str, s.len)
-	//b.buf << []byte(s)  // TODO 
+	//b.buf << []byte(s)  // TODO
 	b.buf << `\n`
 	b.len += s.len + 1
 }

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]

vlib/strings/strings.v

@@ -1,11 +1,11 @@
-module strings 
+module strings
 
 pub fn repeat(c byte, n int) string {
 	if n <= 0 {
 		return ''
 	}
-	mut arr := malloc(n + 1)
-	//mut arr := [byte(0); n + 1] 
+	//mut arr := malloc(n + 1)
+	mut arr := [byte(0)].repeat2(n + 1)
 	for i := 0; i < n; i++ {
 		arr[i] = c
 	}