Skip to content

Add Base.round #63

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

Merged
merged 1 commit into from
Jan 12, 2018
Merged

Add Base.round #63

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
6 changes: 6 additions & 0 deletions src/polynomial.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -367,3 +367,9 @@ function mapcoefficientsnz(f::Function, p::AbstractPolynomialLike)
polynomial(mapcoefficientsnz.(f, terms(p)), SortedUniqState())
end
mapcoefficientsnz(f::Function, t::AbstractTermLike) = f(coefficient(t)) * monomial(t)

Base.round(t::AbstractTermLike) = round(coefficient(t)) * monomial(t)
function Base.round(p::AbstractPolynomialLike)
# round(0.1) is zero so we cannot use SortedUniqState
polynomial(round.(terms(p)), SortedState())
end
3 changes: 3 additions & 0 deletions test/polynomial.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -115,6 +115,9 @@
@test polynomial([1 2; 3 4], monovec([y, x^2])) == x^4 + 5x^2*y + 4y^2
@test polynomial([1 2; 3 4], monovec([y, x^2]), Float64) isa AbstractPolynomial{Float64}

@test (@inferred round(2.6x + 1.001x^2)) == 3x + 1x^2
@test (@inferred round(3.1x*y)) == 3x*y

@testset "Graded Lex Order" begin
Mod.@polyvar x y z
p = 3*y^2 + 2*y*x
Expand Down