Merge branch 'master' into js/ordering

docs/src/free_associative_algebra.md

@@ -253,4 +253,4 @@ julia> g = Generic.groebner_basis([u*(x*y)^3 + u*(x*y)^2 + u + v, (y*x)^3*t + (y
 
 julia> normal_form(u*(x*y)^3*s*t + u*(x*y)^2*s*t +u*s*t + v*s*t, g)
 0
- ```
+```

src/generic/MPoly.jl

@@ -66,7 +66,7 @@ ring.
 """
 function gens(a::MPolyRing{T}) where {T <: RingElement}
    n = a.num_vars
-   return [gen(a, i, Val{a.ord}) for i in 1:n]
+   return elem_type(a)[gen(a, i, Val{a.ord})::elem_type(a) for i in 1:n]
 end
 
 @doc raw"""

src/misc/VarNames.jl

@@ -367,7 +367,7 @@ Setting `n=:no` disables creation of this method.
 
 These macros behave like their `f(args..., varnames; kv...)` counterparts but also introduce the indexed `varnames` into the current scope.
 The first version needs at least one `varnames` argument.
-The third version calls the univariate method base method if it exists (e.g. `polynomial_ring(R, varname)`).
+The third version calls the univariate base method if it exists (e.g. `polynomial_ring(R, varname)`).
 
 Setting `macros=:no` disables macro creation.