mirror of
https://github.com/UpsilonNumworks/Upsilon.git
synced 2026-01-19 00:37:25 +01:00
41 lines
1.5 KiB
C++
41 lines
1.5 KiB
C++
#include <quiz.h>
|
|
#include <poincare.h>
|
|
#include <assert.h>
|
|
|
|
QUIZ_CASE(poincare_integer) {
|
|
assert(Integer(123) == Integer(123));
|
|
assert(Integer("123") == Integer(123));
|
|
assert(!(Integer("-123") == Integer(123)));
|
|
assert(Integer("-123") == Integer(-123));
|
|
//assert(Integer("0123") == Integer(123));
|
|
assert(Integer("0x2BABE") == Integer(178878));
|
|
assert(Integer("0b1011") == Integer(11));
|
|
}
|
|
|
|
QUIZ_CASE(poincare_integer_compare) {
|
|
assert(Integer(123) < Integer(456));
|
|
assert(!(Integer(123) < Integer(123)));
|
|
assert(Integer(123) < Integer("123456789123456789"));
|
|
assert(Integer("123456789123456788") < Integer("123456789123456789"));
|
|
assert(!(Integer("123456789123456789") < Integer("123456789123456788")));
|
|
}
|
|
|
|
QUIZ_CASE(poincare_integer_add) {
|
|
//assert(Integer((uint32_t)0) + Integer((uint32_t)0) == Integer((uint32_t)0));
|
|
assert(Integer(123) + Integer(456) == Integer(579));
|
|
assert(Integer("123456789123456789") + Integer(1) == Integer("123456789123456790"));
|
|
}
|
|
|
|
QUIZ_CASE(poincare_integer_multiply) {
|
|
assert(Integer(12) * Integer(34) == Integer(408));
|
|
assert(Integer(-12) * Integer(34) == Integer(-408));
|
|
assert(Integer(-12) * Integer(-34) == Integer(408));
|
|
assert(Integer(999999) * Integer(999999) == Integer("999998000001"));
|
|
assert(Integer("9999999999") * Integer("9999999999") == Integer("99999999980000000001"));
|
|
}
|
|
|
|
QUIZ_CASE(poincare_integer_approximate) {
|
|
assert(Integer(1).approximate() == 1.0f);
|
|
assert(Integer("12345678").approximate() == 12345678.0f);
|
|
}
|