Adapt to renaming of Nemo types

docs/src/matrix_interface.md

@@ -162,7 +162,7 @@ dense_matrix_type(::Type{T}) where T <: RingElem
 
 Return the type of dense matrices whose entries have the given type. E.g.
 in Nemo, which depends on AbstractAlgebra, we define
-`dense_matrix_type(::Type{fmpz}) = fmpz_mat`.
+`dense_matrix_type(::Type{ZZRingElem}) = ZZMatrix`.
 
 ```julia
 nrows(M::MyMatSpace{T}) where T <: RingElem

src/AbstractTypes.jl

@@ -153,12 +153,12 @@ abstract type SimpleNumFieldElem{T} <: NumFieldElem{T} end
 # additional abstract types for parents, added ad hoc to form
 # collections of types as needed by applications
 
-abstract type FinField <: Field end    # for fq, fq_nmod, etc
+abstract type FinField <: Field end    # for FqPolyRepFieldElem, fqPolyRepFieldElem, etc
 
 # additional abstract types for elements, added ad hoc to form
 # collections of types as needed by applications
 
-abstract type FinFieldElem <: FieldElem end # for fq, fq_nmod, etc
+abstract type FinFieldElem <: FieldElem end # for FqPolyRepFieldElem, fqPolyRepFieldElem, etc
 
 ################################################################################
 #

src/Factor.jl

@@ -70,7 +70,7 @@ end
 Test whether $a$ is a factor of $b$.
 """
 function Base.in(a, b::Fac{T}) where {T}
-   # convert is necessary when T == fmpz, because hash on fmpz
+   # convert is necessary when T == ZZRingElem, because hash on ZZRingElem
    # doesn't coincide with hash on Integer
    convert(T, a) in keys(b.fac)
 end

src/Poly.jl

@@ -1956,7 +1956,7 @@ end
 
 # can throw NotInvertibleError for T <: ResElem
 #
-# To get a good gcd for fmpz_mod_poly/nmod_poly that can throw NotInvertibleError:
+# To get a good gcd for ZZModPolyRingElem/zzModPolyRingElem that can throw NotInvertibleError:
 #  1. Ensure that flint is only used for polynomial addition and multiplication
 #     and is never used for mod or divrem or divexact. Or, if using flint for
 #     division, check the invertibility of the leading coefficient first.

src/algorithms/GenericFunctions.jl

@@ -171,7 +171,7 @@ function remove(a::T, b::T) where T <: Union{RingElem, Number}
       throw(ArgumentError("Second argument must be a non-zero non-unit"))
    end
    if iszero(a)
-      return (0, zero(parent(a))) # questionable case, consistent with fmpz
+      return (0, zero(parent(a))) # questionable case, consistent with ZZRingElem
    end
    v = 0
    while begin; (ok, q) = divides(a, b); ok; end

test/generic/Fraction-test.jl

@@ -318,14 +318,14 @@ end
    @test gcd(a, (x + 1)//(x - 1)) == 1//(2*x^2-x-1)
 end
 
-if @isdefined fmpq
+if @isdefined QQFieldElem
     @testset "Generic.Frac.remove_valuation" begin
-        a = fmpq(2, 3)
+        a = QQFieldElem(2, 3)
 
-        @test remove(a, BigInt(2)) == (1, fmpq(1, 3))
+        @test remove(a, BigInt(2)) == (1, QQFieldElem(1, 3))
         @test valuation(a, BigInt(2)) == 1
 
-        @test remove(a, BigInt(3)) == (-1, fmpq(2, 1))
+        @test remove(a, BigInt(3)) == (-1, QQFieldElem(2, 1))
         @test valuation(a, BigInt(3)) == -1
     end
 end

test/generic/Matrix-test.jl

@@ -35,7 +35,7 @@ Base.getindex(a::MyTestMatrix{T}, r::Int, c::Int) where T = a.d
 Base.size(a::MyTestMatrix{T}) where T = a.dim, a.dim
 
 # Simulate user Field, together with a specialized matrix type
-# (like fmpz / fmpz_mat)
+# (like ZZRingElem / ZZMatrix)
 struct F2 <: AbstractAlgebra.Field end
 
 Base.zero(::F2) = F2Elem(false)