Complex numbers: complex64 complex128

1 files changed, 2 insertions, 313 deletions

diff --git a/code/demo.odin b/code/demo.odin
index 3b78f7de3..e9eba17c8 100644
--- a/code/demo.odin
+++ b/code/demo.odin
@@ -1,320 +1,9 @@
-#import "atomic.odin";
-#import "hash.odin";
-#import "mem.odin";
-#import "opengl.odin";
-#import "strconv.odin";
-#import "sync.odin";
-#import win32 "sys/windows.odin";
-
 #import "fmt.odin";
 #import "os.odin";
 #import "math.odin";
 
 
 main :: proc() {
-when true {
-/*
-	Added:
-		* Unexported entities and fields using an underscore prefix
-			- See `sync.odin` and explain
-
-	Removed:
-	 * Maybe/option types
-	 * Remove `type` keyword and other "reserved" keywords
-	 * ..< and ... removed and replace with .. (half-closed range)
-
-	Changed:
-	 * `compile_assert` and `assert`return the value of the condition for semantic reasons
-	 * thread_local -> #thread_local
-	 * #include -> #load
-	 * Files only get checked if they are actually used
-	 * match x in y {} // For type match statements
-	 * Version numbering now starts from 0.1.0 and uses the convention:
-	 	- major.minor.patch
-	 * Core library additions to Windows specific stuff
- */
-
-	{
-		Fruit :: enum {
-			APPLE,
-			BANANA,
-			COCONUT,
-		}
-		fmt.println(Fruit.names);
-	}
-
-	{
-		A :: struct           {x, y: f32};
-		B :: struct #align 16 {x, y: f32};
-		fmt.println("align_of(A) =", align_of(A));
-		fmt.println("align_of(B) =", align_of(B));
-	}
-
-	{
-		// Removal of ..< and ...
-		for i in 0..16 {
-		}
-		// Is similar to
-		for _i := 0; _i < 16; _i++ { immutable i := _i;
-		}
-	}
-
-	{
-	#label thing
-		for i in 0..10 {
-			for j in i+1..10 {
-				if j == 2 {
-					fmt.println(i, j);
-					continue thing;
-				}
-				if j == 3 {
-					break thing;
-				}
-			}
-		}
-
-		// Works with, `for`, `for in`, `match`, `match in`
-		// NOTE(bill): This solves most of the problems I need `goto` for
-	}
-
-	{
-		t := type_info(int);
-		using Type_Info;
-		match i in t {
-		case Integer, Float:
-			fmt.println("It's a number");
-		}
-
-
-		x: any = 123;
-	#label foo
-		match i in x {
-		case int, f32:
-			fmt.println("It's an int or f32");
-			break foo;
-		}
-	}
-
-	{
-		cond := true;
-		x: int;
-		if cond {
-			x = 3;
-		} else {
-			x = 4;
-		}
-
-
-		// Ternary operator
-		y := cond ? 3 : 4;
-
-		FOO :: true ? 123 : 432; // Constant ternary expression
-		fmt.println("Ternary values:", y, FOO);
-	}
-
-	{
-		// Slices now store a capacity
-		buf: [256]byte;
-		s: []byte;
-		s = buf[..0]; // == buf[0..0];
-		fmt.println("count =", s.count);
-		fmt.println("capacity =", s.capacity);
-		append(s, 1, 2, 3);
-		fmt.println(s);
-
-		s = buf[1..2..3];
-		fmt.println("count =", s.count);
-		fmt.println("capacity =", s.capacity);
-		fmt.println(s);
-
-		clear(s); // Sets count to zero
-		s.count = 0; // Equivalent
-	}
-
-	{
-		Foo :: struct {
-			x, y, z: f32,
-			ok:      bool,
-			flags:   u32,
-		}
-		foo_array: [256]Foo;
-		foo_as_bytes: []byte = slice_to_bytes(foo_array[..]);
-		// Useful for things like
-		// os.write(handle, foo_as_bytes);
-
-		foo_slice := slice_ptr(cast(^Foo)foo_as_bytes.data, foo_as_bytes.count/size_of(Foo), foo_as_bytes.capacity/size_of(Foo));
-		// Question: Should there be a bytes_to_slice procedure or is it clearer to do this even if it is error prone?
-		// And if so what would the syntax be?
-		// slice_transmute([]Foo, foo_as_bytes);
-	}
-
-	{
-		Vec3 :: [vector 3]f32;
-
-		x := Vec3{1, 2, 3};
-		y := Vec3{4, 5, 6};
-		fmt.println(x < y);
-		fmt.println(x + y);
-		fmt.println(x - y);
-		fmt.println(x * y);
-		fmt.println(x / y);
-
-		for i in x {
-			fmt.println(i);
-		}
-
-		compile_assert(size_of([vector 7]bool) == size_of([7]bool));
-		compile_assert(size_of([vector 7]i32) == size_of([7]i32));
-		// align_of([vector 7]i32) != align_of([7]i32) // this may be the case
-	}
-
-	{
-		// fmt.* changes
-		// bprint* returns `int` (bytes written)
-		// sprint* returns `string` (bytes written as a string)
-
-		data: [256]byte;
-		str := fmt.sprintf(data[..0], "Hellope %d %s %c", 123, "others", '!');
-		fmt.println(str);
-
-		buf := data[..0];
-		count := fmt.bprintf(^buf, "Hellope %d %s %c", 123, "others", '!');
-		fmt.println(cast(string)buf[..count]);
-
-		// NOTE(bill): We may change this but because this is a library feature, I am not that bothered yet
-	}
-
-	{
-		x: [dynamic]f64;
-		reserve(x, 16);
-		defer free(x); // `free` is overloaded for numerous types
-		// Number literals can have underscores in them for readability
-		append(x, 2_000_000.500_000, 3, 5, 7); // variadic append
-
-		for p, i in x {
-			if i > 0 { fmt.print(", "); }
-			fmt.print(p);
-		}
-		fmt.println();
-	}
-
-	{
-		// Dynamic array "literals"
-		x := [dynamic]f64{2_000_000.500_000, 3, 5, 7};
-		defer free(x);
-		fmt.println(x); // fmt.print* supports printing of dynamic types
-		clear(x);
-		fmt.println(x);
-	}
-
-	{
-		m: map[f32]int;
-		reserve(m, 16);
-		defer free(m);
-
-		m[1.0] = 1278;
-		m[2.0] = 7643;
-		m[3.0] = 564;
-		_, ok := m[3.0];
-		c := m[3.0];
-		assert(ok && c == 564);
-
-		fmt.print("map[");
-		i := 0;
-		for val, key in m {
-			if i > 0 {
-				fmt.print(", ");
-			}
-			fmt.printf("%v=%v", key, val);
-			i += 1;
-		}
-		fmt.println("]");
-	}
-	{
-		m := map[string]u32{
-			"a" = 56,
-			"b" = 13453,
-			"c" = 7654,
-		};
-		defer free(m);
-
-		c := m["c"];
-		_, ok := m["c"];
-		assert(ok && c == 7654);
-		fmt.println(m);
-
-		delete(m, "c"); // deletes entry with key "c"
-		_, found := m["c"];
-		assert(!found);
-
-		fmt.println(m);
-		clear(m);
-		fmt.println(m);
-
-		// NOTE: Fixed size maps are planned but we have not yet implemented
-		// them as we have had no need for them as of yet
-	}
-
-	{
-		Vector3 :: struct{x, y, z: f32};
-		Quaternion :: struct{x, y, z, w: f32};
-
-		Entity :: union {
-			// Common Fields
-			id:             u64,
-			name:           string,
-			using position: Vector3,
-			orientation:    Quaternion,
-			flags:          u32,
-
-			// Variants
-			Frog{
-				ribbit_volume: f32,
-				jump_height:   f32,
-			},
-			Door{
-				openness: f32,
-			},
-			Map{
-				width, height:   f32,
-				place_positions: []Vector3,
-				place_names:     []string,
-			},
-		}
-
-		entity: Entity;
-		// implicit conversion from variant to base type
-		entity = Entity.Frog{
-			id = 1337,
-			ribbit_volume = 0.5,
-			jump_height = 2.1,
-			/*other data */
-		};
-
-		entity.name = "Frank";
-		entity.position = Vector3{1, 4, 9};
-
-		using Entity;
-		match e in entity {
-		case Frog:
-			fmt.println("Ribbit");
-		case Door:
-			fmt.println("Creak");
-		case Map:
-			fmt.println("Rustle");
-		default:
-			fmt.println("Just a normal entity");
-		}
-
-		if frog, ok := union_cast(Frog)entity; ok {
-			fmt.printf("The frog jumps %f feet high at %v\n", frog.jump_height, frog.position);
-		}
-
-		// Panics if not the correct type
-		frog: Frog;
-		frog = union_cast(Frog)entity;
-		frog, _ = union_cast(Frog)entity; // ignore error and force cast
-	}
-}
+	x := 1+2i;
+	fmt.printf("%v\n", x);
 }
-