From 99c1d9af689e5325f3cf535c4007b3aeb8325229 Mon Sep 17 00:00:00 2001
From: Minteck <contact@minteck.org>
Date: Tue, 10 Jan 2023 14:54:04 +0100
Subject: Update - This is an automated commit

---
 school/node_modules/cuint/test/UINT32_xor-test.js | 64 +++++++++++++++++++++++
 1 file changed, 64 insertions(+)
 create mode 100644 school/node_modules/cuint/test/UINT32_xor-test.js

(limited to 'school/node_modules/cuint/test/UINT32_xor-test.js')

diff --git a/school/node_modules/cuint/test/UINT32_xor-test.js b/school/node_modules/cuint/test/UINT32_xor-test.js
new file mode 100644
index 0000000..39dcca4
--- /dev/null
+++ b/school/node_modules/cuint/test/UINT32_xor-test.js
@@ -0,0 +1,64 @@
+var assert = require('assert')
+var UINT32 = require('..').UINT32
+
+describe('xor method', function () {
+
+  describe('0^1', function () {
+
+    it('should return 1', function (done) {
+      var u = UINT32(0).xor( UINT32(1) )
+
+      assert.equal( u.toNumber(), 1 )
+      done()
+    })
+
+  })
+
+  describe('1^2', function () {
+
+    it('should return 3', function (done) {
+      var u = UINT32(1).xor( UINT32(2) )
+
+      assert.equal( u.toNumber(), 3 )
+      done()
+    })
+
+  })
+
+  describe('1^2^16', function () {
+
+    it('should return n+1', function (done) {
+      var n = Math.pow(2, 16)
+      var u = UINT32(1).xor( UINT32(n) )
+
+      assert.equal( u.toNumber(), n+1 )
+      done()
+    })
+
+  })
+
+  describe('2^16^1', function () {
+
+    it('should return n+1', function (done) {
+      var n = Math.pow(2, 16)
+      var u = UINT32(n).xor( UINT32(1) )
+
+      assert.equal( u.toNumber(), n+1 )
+      done()
+    })
+
+  })
+
+  describe('2^16^2^16', function () {
+
+    it('should return 0', function (done) {
+      var n = Math.pow(2, 16)
+      var u = UINT32(n).xor( UINT32(n) )
+
+      assert.equal( u.toNumber(), 0 )
+      done()
+    })
+
+  })
+
+})
-- 
cgit