convert to Vector first since that's likely to be faster than abs (#111)

* convert to Vector first since that's likely to be faster than abs

* Update standardchop.jl

* Update Project.toml

* Update Project.toml

* v0.6.8

Author: dlfivefifty

Project.toml

@@ -1,7 +1,7 @@
 name = "ClassicalOrthogonalPolynomials"
 uuid = "b30e2e7b-c4ee-47da-9d5f-2c5c27239acd"
 authors = ["Sheehan Olver <[email protected]>"]
-version = "0.6.7"
+version = "0.6.8"
 
 [deps]
 ArrayLayouts = "4c555306-a7a7-4459-81d9-ec55ddd5c99a"

src/standardchop.jl

@@ -49,7 +49,7 @@ function standardchoplength(coeffs, tol)
     # Step 1: Convert COEFFS to a new monotonically nonincreasing
     #         vector ENVELOPE normalized to begin with the value 1.
 
-    b = convert(Vector, abs.(coeffs))
+    b = Vector(coeffs); b .= abs.(b)
     for j = n-1:-1:1
         b[j] = max(b[j], b[j+1])
     end