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.

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

lazy evaluation of rational powers #641

Open
wants to merge 6 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from 4 commits
Commits
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
26 changes: 23 additions & 3 deletions src/types.jl
Original file line number Diff line number Diff line change
Expand Up @@ -608,7 +608,15 @@ function basicsymbolic(f, args, stype, metadata)
end
res
elseif f == (^) && length(args) == 2
res = args[1] ^ args[2]
if args[2] isa Rational && !isa(args[1], Symbolic)
if isinteger(args[2])
res = args[1] ^ numerator(args[2])
else
@goto FALLBACK
end
else
res = args[1] ^ args[2]
end
if ispow(res)
@set! res.metadata = metadata
end
Expand Down Expand Up @@ -1210,9 +1218,21 @@ function ^(a::SN, b)
elseif b isa Number && b < 0
Div(1, a ^ (-b))
elseif ismul(a) && b isa Number
coeff = unstable_pow(a.coeff, b)
new_dict = mapvalues((k, v) -> b*v, a.dict)
if b isa Rational
if isinteger(b)
integer_type = only(typeof(b).parameters)
coeff = a.coeff ^ convert(integer_type, b)
mxhbl marked this conversation as resolved.
Show resolved Hide resolved
else
coeff = 1
merge!(new_dict, Dict(term(^, a.coeff, b) => 1))
mxhbl marked this conversation as resolved.
Show resolved Hide resolved
end
else
coeff = unstable_pow(a.coeff, b)
end

Mul(promote_symtype(^, symtype(a), symtype(b)),
coeff, mapvalues((k, v) -> b*v, a.dict))
coeff, new_dict)
else
Pow(a, b)
end
Expand Down
20 changes: 19 additions & 1 deletion test/basics.jl
Original file line number Diff line number Diff line change
Expand Up @@ -363,5 +363,23 @@ end
ax = adjoint(x)
@test isequal(ax, x)
@test ax === x
@test isequal(adjoint(y), conj(y))
@test isequal(adjoint(y), conj(y))
end

@testset "pow" begin
@syms x y
@eqtest (2x)^(1//2) == term(^, 2, 1//2) * x^(1//2)
@eqtest (2x)^(1//1) == 2x
# @eqtest (2x)^1 == 2x ## This currently fails and returns (2//1)*x
@eqtest (2x)^(2//1) == 4x^(2//1)
@eqtest ((1//3)*x)^(1//4) == term(^, 1//3, 1//4) * x^(1//4)

@eqtest (x+y)^(1//2) == (x+y)^(1//2)
@eqtest (x+y)^(1//1) == x+y

@eqtest (x^(3//1))^(1//3) == x
@eqtest (x^(3//1))^(2//3) == x^(2//1)
@eqtest (x^(2//1))^2 == x^(4//1)

@test ((2x)^0.5).coeff ≈ sqrt(2)
end
8 changes: 8 additions & 0 deletions test/rulesets.jl
Original file line number Diff line number Diff line change
Expand Up @@ -52,6 +52,14 @@ end
@test simplify(Term(zero, [a])) == 0
@test simplify(Term(zero, [b + 1])) == 0
@test simplify(Term(zero, [x + 2])) == 0

@eqtest simplify(Term(sqrt, [2])) == Term(sqrt, [2])
@eqtest simplify(Term(^, [2, 1//2])) == Term(^, [2, 1//2])
@eqtest simplify(Term(^, [2x, 1//2])) == Term(^, [2, 1//2]) * x^(1//2)
@test simplify(Term(^, [2, 3])) ≈ 8
@test simplify(Term(^, [1//3, 3])) == 1//27
@test simplify(Term(^, [2, 0.5])) ≈ 2^0.5
@test simplify(Term(^, [2.5, 0.25])) ≈ 2.5^(0.25)
end

@testset "LiteralReal" begin
Expand Down
Loading