Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add QUO and LQUO methods for IsJuliaObject, improve tests #135

Merged
merged 2 commits into from
Nov 6, 2018
Merged

Add QUO and LQUO methods for IsJuliaObject, improve tests #135

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
85032e2
Improve JuliaInterface/tst/arith.tst
fingolfin Nov 6, 2018
5156a6a
Add QUO and LQUO methods for IsJuliaObject
fingolfin Nov 6, 2018
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions JuliaInterface/gap/arith.gi
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -42,6 +42,8 @@ Perform([[ "IsJuliaObject", "IsJuliaObject" ],
InstallOtherMethod( \+, argTypes, Julia.Base.\+ );
InstallOtherMethod( \*, argTypes, Julia.Base.\* );
InstallOtherMethod( \-, argTypes, Julia.Base.\- );
InstallOtherMethod( \/, argTypes, Julia.Base.\/ );
InstallOtherMethod( LQUO, argTypes, Julia.Base.\\ );
InstallOtherMethod( \^, argTypes, Julia.Base.\^ );
InstallOtherMethod( \=, argTypes, Julia.Base.\=\= );
InstallOtherMethod( \<, argTypes, Julia.Base.\< );
Expand Down
99 changes: 54 additions & 45 deletions JuliaInterface/tst/arith.tst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,80 +2,89 @@
gap> START_TEST( "arith.tst" );

#
gap> large_int := JuliaEvalString("big(2)^100");
gap> N := JuliaEvalString("big(2)^100");
<Julia: 1267650600228229401496703205376>
gap> large_int_p1 := JuliaEvalString("big(2)^100 + 1");
gap> N_p1 := JuliaEvalString("big(2)^100 + 1");
<Julia: 1267650600228229401496703205377>
gap> large_int_m1 := JuliaEvalString("big(2)^100 - 1");
gap> N_m1 := JuliaEvalString("big(2)^100 - 1");
<Julia: 1267650600228229401496703205375>
gap> large_int_squared := JuliaEvalString("big(2)^200");
gap> N_squared := JuliaEvalString("big(2)^200");
<Julia: 1606938044258990275541962092341162602522202993782792835301376>
gap> large_int_t2 := JuliaEvalString("big(2)^101");
gap> N_t2 := JuliaEvalString("big(2)^101");
<Julia: 2535301200456458802993406410752>

#
gap> zero := Zero(large_int);
gap> zero := Zero(N);
<Julia: 0>
gap> one := One(large_int);
gap> one := One(N);
<Julia: 1>

#
gap> large_int + 1 = large_int_p1;
true
gap> 1 + large_int = large_int_p1;
true
gap> -N;
<Julia: -1267650600228229401496703205376>

#
gap> large_int + (-large_int) = zero;
true
gap> N + 1;
<Julia: 1267650600228229401496703205377>
gap> 1 + N;
<Julia: 1267650600228229401496703205377>
gap> N + N;
<Julia: 2535301200456458802993406410752>

#
gap> large_int - 1 = large_int_m1;
true
gap> N - 1;
<Julia: 1267650600228229401496703205375>
gap> 1 - N;
<Julia: -1267650600228229401496703205375>
gap> N - N;
<Julia: 0>

#
gap> large_int * 2 = large_int_t2;
true
gap> 2 * large_int = large_int_t2;
true
gap> large_int * large_int = large_int_squared;
gap> N * 2;
<Julia: 2535301200456458802993406410752>
gap> 2 * N;
<Julia: 2535301200456458802993406410752>
gap> N * N = N_squared;
true

#
gap> large_int^0 = one;
true
gap> large_int^1 = large_int;
true
gap> large_int^2 = large_int_squared;
gap> N^0;
<Julia: 1>
gap> N^1;
<Julia: 1267650600228229401496703205376>
gap> N^2 = N_squared;
true

#
#gap> large_int / large_int = 1;
#true
#gap> large_int / 2^50 = 2^50;
#true
gap> N / N;
<Julia: 1.0>
gap> N / 2^50;
<Julia: 1.125899906842624e+15>

#
#gap> large_int \ large_int = 1;
#true
#gap> 2^50 \ large_int = 2^50;
#true
gap> LQUO(N, N);
<Julia: 1.0>
gap> LQUO(2^50, N);
<Julia: 1.125899906842624e+15>

#
gap> large_int < large_int_p1;
true
gap> large_int <= large_int_p1;
true
gap> large_int > large_int_m1;
true
gap> large_int >= large_int_m1;
true
gap> large_int = large_int;
true
gap> data := [ -N_p1, -N, -N_m1, -1, 0, 1, N_m1, N, N_p1 ];;
gap> TestBinOp := op -> SetX( [1..Length(data)], [1..Length(data)],
> {i,j} -> op(data[i], data[j]) = op(i,j) );;
gap> TestBinOp({a,b} -> a < b);
[ true ]
gap> TestBinOp({a,b} -> a <= b);
[ true ]
gap> TestBinOp({a,b} -> a > b);
[ true ]
gap> TestBinOp({a,b} -> a >= b);
[ true ]
gap> TestBinOp({a,b} -> a = b);
[ true ]

#
#gap> mod(large_int,2) = 0;
#gap> mod(large_int_p1,2) = 1;
#gap> mod(N,2) = 0;
#gap> mod(N_p1,2) = 1;

#
gap> STOP_TEST( "arith.tst", 1 );