Add license, media

Git ignore VS Code

.gitignore

@@ -1,4 +1,5 @@
 .DS_Store
+.vscode/
 .sconsign.dblite
 wasmer/
 addons.zip

LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2023 Ashton Meuser
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

addons/godot-wasm/LICENSE

@@ -1,6 +1,6 @@
 MIT License
 
-Copyright (c) 2021 Ashton Meuser
+Copyright (c) 2023 Ashton Meuser
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

examples/wasm-create/assembly/index.ts

@@ -29,10 +29,10 @@ export function sieve(_limit: i64): i32 {
   const limit: i32 = <i32>_limit;
 
   // Low primes
-	if (limit <= 0) return 0
-	if (limit <= 1) return 1
-	if (limit <= 2) return 2
-	if (limit <= 4) return 3
+	if (limit <= 0) return 0;
+	if (limit <= 1) return 1;
+	if (limit <= 2) return 2;
+	if (limit <= 4) return 3;
 
   // Initialize the sieve array with false values
   let sieve = new Array<bool>(limit + 1).fill(false);
@@ -66,8 +66,8 @@ export function sieve(_limit: i64): i32 {
   }
 
   // Return highest prime
-  for (let a = limit; a >= 0; a -= 1)
-    if (sieve[a]) return a;
+  for (let i = limit; i >= 0; i -= 1)
+    if (sieve[i]) return i;
 
   return 0;
 }