src/vmath.nim

@@ -123,13 +123,13 @@ when defined(vmathArrayBased):
   template `[]`*[T](a: GMat234[T], i, j: int): T = a[i][j]
 
   template `[]=`*[T](a: var GMat2[T], i, j: int, v: T) =
-    cast[ptr T](cast[ByteAddress](a.addr) + (i * 2 + j) * sizeof(T))[] = v
+    cast[ptr T](cast[uint64](a.addr) + (i * 2 + j) * sizeof(T))[] = v
 
   template `[]=`*[T](a: var GMat3[T], i, j: int, v: T) =
-    cast[ptr T](cast[ByteAddress](a.addr) + (i * 3 + j) * sizeof(T))[] = v
+    cast[ptr T](cast[uint64](a.addr) + (i * 3 + j) * sizeof(T))[] = v
 
   template `[]=`*[T](a: var GMat4[T], i, j: int, v: T) =
-    cast[ptr T](cast[ByteAddress](a.addr) + (i * 4 + j) * sizeof(T))[] = v
+    cast[ptr T](cast[uint64](a.addr) + (i * 4 + j) * sizeof(T))[] = v
 
 elif defined(vmathObjBased):
   type
@@ -156,13 +156,13 @@ elif defined(vmathObjBased):
   template `[]`*[T](a: GVec4[T], i: int): T = cast[array[4, T]](a)[i]
 
   template `[]=`*[T](a: var GVec2[T], i: int, v: T) =
-    cast[ptr T](cast[ByteAddress](a.addr) + i * sizeof(T))[] = v
+    cast[ptr T](cast[uint64](a.addr) + i * sizeof(T))[] = v
 
   template `[]=`*[T](a: var GVec3[T], i: int, v: T) =
-    cast[ptr T](cast[ByteAddress](a.addr) + i * sizeof(T))[] = v
+    cast[ptr T](cast[uint64](a.addr) + i * sizeof(T))[] = v
 
   template `[]=`*[T](a: var GVec4[T], i: int, v: T) =
-    cast[ptr T](cast[ByteAddress](a.addr) + i * sizeof(T))[] = v
+    cast[ptr T](cast[uint64](a.addr) + i * sizeof(T))[] = v
 
   type
     GMat2*[T] {.bycopy.} = object
@@ -215,13 +215,13 @@ elif defined(vmathObjBased):
     cast[array[16, T]](a)[i * 4 + j]
 
   template `[]=`*[T](a: var GMat2[T], i, j: int, v: T) =
-    cast[ptr T](cast[ByteAddress](a.addr) + (i * 2 + j) * sizeof(T))[] = v
+    cast[ptr T](cast[uint64](a.addr) + (i * 2 + j) * sizeof(T))[] = v
 
   template `[]=`*[T](a: var GMat3[T], i, j: int, v: T) =
-    cast[ptr T](cast[ByteAddress](a.addr) + (i * 3 + j) * sizeof(T))[] = v
+    cast[ptr T](cast[uint64](a.addr) + (i * 3 + j) * sizeof(T))[] = v
 
   template `[]=`*[T](a: var GMat4[T], i, j: int, v: T) =
-    cast[ptr T](cast[ByteAddress](a.addr) + (i * 4 + j) * sizeof(T))[] = v
+    cast[ptr T](cast[uint64](a.addr) + (i * 4 + j) * sizeof(T))[] = v
 
   template `[]`*[T](a: GMat2[T], i: int): GVec2[T] =
     gvec2[T](
@@ -501,9 +501,9 @@ template genVecConstructor*(lower, upper, typ: untyped) =
   proc `lower 4`*[T](x: GVec4[T]): `upper 4` =
     gvec4[typ](typ(x[0]), typ(x[1]), typ(x[2]), typ(x[3]))
 
-  proc `lower 3`*[T](x: GVec2[T], z: T = 0.T): `upper 3` =
+  proc `lower 3`*[T](x: GVec2[T], z: T = 0): `upper 3` =
     gvec3[typ](typ(x[0]), typ(x[1]), z)
-  proc `lower 4`*[T](x: GVec3[T], w: T = 0.T): `upper 4` =
+  proc `lower 4`*[T](x: GVec3[T], w: T = 0): `upper 4` =
     gvec4[typ](typ(x[0]), typ(x[1]), typ(x[2]), w)
 
   proc `lower 4`*[T](a, b: GVec2[T]): `upper 4` =
@@ -791,12 +791,6 @@ proc lengthSq*[T](a: GVec4[T]): T =
 proc normalize*[T](a: GVec234[T]): type(a) =
   a / a.length
 
-proc normalize_safe*[T](a: GVec234[T]): type(a) =
-  let l = a.length
-  if l != 0:
-    return a / l
-  # else, implicit result is vec(0)
-
 proc mix*[T: SomeFloat](a, b: GVec234[T], v: T): type(a) =
   a * (1.0 - v) + b * v
 
@@ -1579,15 +1573,15 @@ proc angle*[T](a: GVec2[T]): T =
   ## Angle of a Vec2.
   arctan2(a.y, a.x)
 
-proc angle*[T; S: GVec2[T]|GVec3[T]](a, b: S): T =
+proc angle*[T](a, b: GVec2[T]): T =
-  ## Angle between 2 Vec2 or Vec3.
+  ## Angle between 2 Vec2.
+  fixAngle(arctan2(a.y - b.y, a.x - b.x))
+
+proc angle*[T](a, b: GVec3[T]): T =
+  ## Angle between 2 Vec3.
   var dot = dot(a, b)
   dot = dot / (a.length * b.length)
-  # The cases of angle((1, 1), (-1, -1)) and its 3d counterpart
+  arccos(dot)
-  # angle((1, 1, 1), (-1, -1, -1)) result in NaN due to a domain defect going
-  # into the arcos proc: abs(x) > 1.0.
-  # Therefore, we must `clamp` here.
-  arccos(dot.clamp(-1.0, 1.0))
 
 type
   Quat* = GVec4[float32]

tests/test.nim

@@ -1155,34 +1155,4 @@ block:
     else:
       doAssert abs(angleBetween(a.y, b.y - b.z)) < 0.001
 
-block:
-  # Test for https://github.com/treeform/vmath/issues/73
-  template gen2DTestsFor(constructor: untyped): void =
-    doAssert angle(constructor(1, 0), constructor(1, 0)) ~= 0
-    doAssert angle(constructor(1, 1), constructor(-1, -1)) ~= Pi
-    doAssert angle(constructor(1, 0), constructor(0, 1)) ~= Pi/2
-    doAssert angle(constructor(1, 0), constructor(-1, 0)) ~= Pi
-    doAssert angle(constructor(1, 1), constructor(1, -1)) ~= Pi/2
-
-    # Edge cases:
-    doAssert angle(constructor(0, 0), constructor(1, 0)).isNaN()
-
-  gen2DTestsFor vec2
-  gen2DTestsFor dvec2
-
-  template gen3DTestsFor(constructor: untyped): void =
-    doAssert angle(constructor(1, 0, 0), constructor(1, 0, 0)) ~= 0
-    doAssert angle(constructor(1, 1, 1), constructor(-1, -1, -1)) ~= Pi
-    doAssert angle(constructor(1, 0, 0), constructor(0, 1, 0)) ~= Pi/2
-    doAssert angle(constructor(1, 0, 0), constructor(-1, 0, 0)) ~= Pi
-    doAssert angle(constructor(1, 1, 1), constructor(1, -1, 1)) ~= arccos(1/3)
-    doAssert angle(constructor(1, 0, 0), constructor(0, 0, 1)) ~= Pi/2
-    doAssert angle(constructor(1, 1, 1), constructor(-1, -1, 1)) ~= arccos(-1/3)
-
-    # Edge cases:
-    doAssert angle(vec3(0, 0, 0), vec3(1, 0, 0)).isNaN()
-
-  gen3DTestsFor vec3
-  gen3DTestsFor dvec3
-
 echo "test finished successfully"

vmath.nimble

@@ -1,4 +1,4 @@
-version       = "2.0.0"
+version       = "1.2.0"
 author        = "Andre von Houck"
 description   = "Your single stop for vector math routines for 2d and 3d graphics."
 license       = "MIT"