test: clarified naming using domain language (repeated roots).

Author: hemalvarambhia

src/Math-Tests-Polynomials/PMPolynomialTest.class.st

@@ -264,17 +264,6 @@ PMPolynomialTest >> testPolynomialRootsForLinear [
 	self assert: (roots at: 1) closeTo: -0.5 .
 ]
 
-{ #category : #'iterative algorithms' }
-PMPolynomialTest >> testPolynomialRootsForQuadratic [
-	| polynomial roots |
-	"Here, compute the roots of the quadratic (2x + 1)^2 = 4 x^2 + 4 x + 1"
-	polynomial := PMPolynomial coefficients: #(1 4 4).
-	roots := polynomial roots .
-	self assert: roots size equals: 2.
-	self assert: (roots at: 1) closeTo: -0.5 .
-	self assert: (roots at: 2) closeTo: -0.5 .
-]
-
 { #category : #'function evaluation' }
 PMPolynomialTest >> testPolynomialSubtraction [
 	| polynomial |
@@ -286,3 +275,14 @@ PMPolynomialTest >> testPolynomialSubtraction [
 	self assert: (polynomial at: 3) equals: -1.
 	self assert: (polynomial at: 4) equals: 0
 ]
+
+{ #category : #'iterative algorithms' }
+PMPolynomialTest >> testPolynomialWithRepeatedRoots [
+	| polynomial roots |
+	"Here, compute the roots of the quadratic (2x + 1)^2 = 4 x^2 + 4 x + 1"
+	polynomial := PMPolynomial coefficients: #(1 4 4).
+	roots := polynomial roots .
+	self assert: roots size equals: 2.
+	self assert: (roots at: 1) closeTo: -0.5 .
+	self assert: (roots at: 2) closeTo: -0.5 .
+]