Merge pull request #278 from olekscode/277-Run-tests-and-apply-Deprewriter-transformations

Fixed #277. Updated all references to deprecated method with Deprewriter

Author: SergeStinckwich

src/Math-AutomaticDifferenciation/PMDualNumber.class.st

@@ -142,9 +142,10 @@ PMDualNumber >> closeTo: aDualNumber [
 
 { #category : #'mathematical functions' }
 PMDualNumber >> conjugated [
+
 	^ self class
-		value: self value conjugated
-		eps: self eps asComplex complexConjugate
+		  value: self value complexConjugate
+		  eps: self eps asComplex complexConjugate
 ]
 
 { #category : #'mathematical functions' }

src/Math-PrincipalComponentAnalysis/PMPrincipalComponentAnalyserSVD.class.st

@@ -37,9 +37,10 @@ d1 scatterplotMatrix.
 
 { #category : #accessing }
 PMPrincipalComponentAnalyserSVD >> fit: aPMMatrix [
+
 	svd := aPMMatrix decomposeSV.
-	u := svd leftSingularForm.
-	v := svd rightSingularForm.
+	u := svd leftSingularMatrix.
+	v := svd rightSingularMatrix.
 	self flipEigenvectorsSign
 ]
 

src/Math-Tests-AutomaticDifferenciation/PMDualNumberTest.class.st

@@ -86,13 +86,15 @@ PMDualNumberTest >> testArcTan [
 
 { #category : #test }
 PMDualNumberTest >> testConjugated [
+
 	| a z |
 	z := PMDualNumber value: 1.0 + 1.0 i eps: 1.0.
 	a := z absSquared.
 	self assert: a value equals: z value absSquared.
 	self
 		assert: a eps
-		equals: z eps asComplex complexConjugate * z value + (z value asComplex conjugated * z eps)
+		equals: z eps asComplex complexConjugate * z value
+			+ (z value asComplex complexConjugate * z eps)
 ]
 
 { #category : #tests }

src/Math-Tests-Matrix/PMSingularValueDecompositionTest.class.st

@@ -189,61 +189,67 @@ PMSingularValueDecompositionTest >> testIsExampleOrthonormalV [
 
 { #category : #tests }
 PMSingularValueDecompositionTest >> testIsOrthonormalU [
+
 	"Verifying that matrix U is orthonormal. That is, all columns of U are unit vectors and orthogonal to each other."
 
 	| u m identity |
-	u := matrix decomposeSV leftSingularForm.
+	u := matrix decomposeSV leftSingularMatrix.
 	m := u numberOfRows.
 	identity := PMSymmetricMatrix identity: m.
 	self assert: u transpose * u closeTo: identity
 ]
 
 { #category : #tests }
 PMSingularValueDecompositionTest >> testIsOrthonormalV [
+
 	"Verifying that matrix U is orthonormal. That is, all columns of U are unit vectors and orthogonal to each other."
 
 	| v n identity |
-	v := matrix decomposeSV rightSingularForm.
+	v := matrix decomposeSV rightSingularMatrix.
 	n := v numberOfRows.
 	identity := PMSymmetricMatrix identity: n.
 	self assert: v transpose * v closeTo: identity
 ]
 
 { #category : #tests }
 PMSingularValueDecompositionTest >> testIsSquareU [
+
 	"U should be a square matrix"
 
 	| u |
-	u := matrix decomposeSV leftSingularForm.
+	u := matrix decomposeSV leftSingularMatrix.
 	self assert: u numberOfRows equals: u numberOfColumns
 ]
 
 { #category : #tests }
 PMSingularValueDecompositionTest >> testIsSquareV [
+
 	"V should be a square matrix"
 
 	| v |
-	v := matrix decomposeSV rightSingularForm.
+	v := matrix decomposeSV rightSingularMatrix.
 	self assert: v numberOfRows equals: v numberOfColumns
 ]
 
 { #category : #tests }
 PMSingularValueDecompositionTest >> testReconstruction [
+
 	| svd u v s reconstructed |
 	svd := matrix decomposeSV.
-	u := svd leftSingularForm.
-	v := svd rightSingularForm.
-	s := svd sForm.
+	u := svd leftSingularMatrix.
+	v := svd rightSingularMatrix.
+	s := svd diagonalSingularValueMatrix.
 	reconstructed := u * s * v transpose.
 	self assert: reconstructed closeTo: matrix
 ]
 
 { #category : #tests }
 PMSingularValueDecompositionTest >> testShapeS [
+
 	"If A is an (m x n) matrix, then S should be an (m x n) matrix"
 
 	| s m n |
-	s := matrix decomposeSV sForm.
+	s := matrix decomposeSV diagonalSingularValueMatrix.
 	m := matrix numberOfRows.
 	n := matrix numberOfColumns.
 	self assert: s numberOfRows equals: m.
@@ -252,49 +258,54 @@ PMSingularValueDecompositionTest >> testShapeS [
 
 { #category : #tests }
 PMSingularValueDecompositionTest >> testShapeU [
+
 	"If A is an (m x n) matrix, then U should be an (m x m) matrix"
 
 	| u m |
-	u := matrix decomposeSV leftSingularForm.
+	u := matrix decomposeSV leftSingularMatrix.
 	m := matrix numberOfRows.
 	self assert: u numberOfRows equals: m.
 	self assert: u numberOfColumns equals: m
 ]
 
 { #category : #tests }
 PMSingularValueDecompositionTest >> testShapeV [
+
 	"If A is an (m x n) matrix, then V should be an (n x n) matrix"
 
 	| v n |
-	v := matrix decomposeSV rightSingularForm.
+	v := matrix decomposeSV rightSingularMatrix.
 	n := matrix numberOfColumns.
 	self assert: v numberOfRows equals: n.
 	self assert: v numberOfColumns equals: n
 ]
 
 { #category : #tests }
 PMSingularValueDecompositionTest >> testValueS [
+
 	"Comparing S to its known value"
 
 	| s |
-	s := matrix decomposeSV sForm.
+	s := matrix decomposeSV diagonalSingularValueMatrix.
 	self assert: s closeTo: actualS
 ]
 
 { #category : #tests }
 PMSingularValueDecompositionTest >> testValueU [
+
 	"Comparing U to its known value"
 
 	| u |
-	u := matrix decomposeSV leftSingularForm.
+	u := matrix decomposeSV leftSingularMatrix.
 	self assert: u closeTo: actualU
 ]
 
 { #category : #tests }
 PMSingularValueDecompositionTest >> testValueV [
+
 	"Comparing V to its known value"
 
 	| v |
-	v := matrix decomposeSV rightSingularForm.
+	v := matrix decomposeSV rightSingularMatrix.
 	self assert: v closeTo: actualV
 ]