Replaced the calls to Number>>equalsTo: with closeTo:

Author: olekscode

src/Math-AutomaticDifferenciation/PMDualNumber.class.st

@@ -157,7 +157,9 @@ PMDualNumber >> eps: aNumber [
 
 { #category : #comparing }
 PMDualNumber >> equalsTo: aDualNumber [
-	^ (value equalsTo: aDualNumber value) and: [ eps equalsTo: aDualNumber eps ]
+
+	^ (value closeTo: aDualNumber value) and: [ 
+		  eps closeTo: aDualNumber eps ]
 ]
 
 { #category : #testing }

src/Math-AutomaticDifferenciation/PMHyperDualNumber.class.st

@@ -126,9 +126,10 @@ PMHyperDualNumber >> eps2: anEps2 [
 
 { #category : #comparing }
 PMHyperDualNumber >> equalsTo: aHyperDualNumber [
-	^ (super equalsTo: aHyperDualNumber)
-		and: [ (eps2 equalsTo: aHyperDualNumber eps2)
-				and: [ eps1eps2 equalsTo: aHyperDualNumber eps1eps2 ] ] 
+
+	^ (super equalsTo: aHyperDualNumber) and: [ 
+		  (eps2 closeTo: aHyperDualNumber eps2) and: [ 
+			  eps1eps2 closeTo: aHyperDualNumber eps1eps2 ] ]
 ]
 
 { #category : #'mathematical functions' }

src/Math-Core/SequenceableCollection.extension.st

@@ -3,7 +3,10 @@ Extension { #name : #SequenceableCollection }
 { #category : #'*Math-Core' }
 SequenceableCollection >> equalsTo: aSequenceableCollection [
 
-"^ self = aSequenceableCollection "
-self with: aSequenceableCollection do: [:a :b| (a equalsTo: b) ifFalse: [^false]   ].
-^true
+	"^ self = aSequenceableCollection "
+
+	self
+		with: aSequenceableCollection
+		do: [ :a :b | (a closeTo: b) ifFalse: [ ^ false ] ].
+	^ true
 ]

src/Math-FunctionFit/PMFunctionFit.class.st

@@ -9,7 +9,7 @@ fit result parameters .   --->  #(1.9999999999999998 0.39999999999999863)
 Class {
 	#name : #PMFunctionFit,
 	#superclass : #PMLeastSquareFit,
-	#category : 'Math-FunctionFit'
+	#category : #'Math-FunctionFit'
 }
 
 { #category : #creation }
@@ -78,9 +78,12 @@ PMFunctionFit >> parameters [
 
 { #category : #initialization }
 PMFunctionFit >> parameters: indexableCollection [
-indexableCollection do:[ :e|(e equalsTo: 0.0)ifTrue: [ self error:'parameters shouldnt be set to practically zero' ] ].
-result parameters: indexableCollection.
-self finalizeIterations .
+
+	indexableCollection do: [ :e | 
+		(e closeTo: 0.0) ifTrue: [ 
+			self error: 'parameters shouldnt be set to practically zero' ] ].
+	result parameters: indexableCollection.
+	self finalizeIterations
 ]
 
 { #category : #printing }

src/Math-Matrix/PMMatrix.class.st

@@ -746,35 +746,50 @@ PMMatrix >> productWithVector: aVector [
 
 { #category : #'as yet unclassified' }
 PMMatrix >> qrFactorization [
-	|identMat q r hh colSize i|
-	self numberOfRows < self numberOfColumns ifTrue:[ self error: 'numberOfRows<numberOfColumns' ]. 
-	r :=PMMatrix rows: (rows deepCopy).
+
+	| identMat q r hh colSize i |
+	self numberOfRows < self numberOfColumns ifTrue: [ 
+		self error: 'numberOfRows<numberOfColumns' ].
+	r := PMMatrix rows: rows deepCopy.
 	colSize := self numberOfRows.
-	q := PMSymmetricMatrix identity: colSize.  
+	q := PMSymmetricMatrix identity: colSize.
 	identMat := q deepCopy.
-	1 to: self numberOfColumns do: [:col| 
+	1 to: self numberOfColumns do: [ :col | 
 		hh := ((r columnAt: col) copyFrom: col to: colSize) householder.
-		i := (PMVector new: col-1withAll: 0) , (hh at:2 ).
-		q := q* (identMat - ((hh at: 1)*i tensorProduct: i ))."not really necessary, should be simplified"
-		i := PMMatrix rows:  ( (r rows allButFirst: (col -1)) collect: [:aRow| aRow allButFirst: (col -1)]  ).
-		i := i - ((hh at: 2) tensorProduct: ( (hh at: 1)*(hh at: 2)*i  ) ) .
-		i rows withIndexDo: [ :aRow :index |
-			aRow  withIndexDo: [ :n :c| r rowAt: (col + index -1) columnAt: (col +c -1) put: ((n equalsTo: 0) ifTrue: [0] ifFalse:  [n]  )  ]  ] .
-	"col <colSize ifTrue: [i :=(hh at: 2) copyFrom: 2 to: colSize -col +1.  i withIndexDo: [:n :index| r rowAt: col columnAt: index put: n  ]  ]""and this part is not correct, dont uncomment before the bug is corrected! useful if q is not explicitely necessary" ].
-"r rows allButFirst withIndexDo: [:aRow :ri|1 to: (ri min: self numberOfColumns ) do: [:ci|aRow at: ci put:0  ]   ]  ""not necessary with equalsTo:0"  
-	i :=0.
-	[(r rowAt: colSize) allSatisfy: [:n| n=0]  ]whileTrue: [i :=i+1.colSize :=colSize -1].
-	i>0 ifTrue: [ r :=PMMatrix rows: (r rows copyFrom: 1 to:  colSize). 
-					i := q numberOfColumns - i. 
-					q := PMMatrix rows:  ( q rows collect: [:row| row copyFrom: 1 to: i]) ].  
-	^Array with: q with: r
+		i := (PMVector new: col - 1 withAll: 0) , (hh at: 2).
+		q := q * (identMat - ((hh at: 1) * i tensorProduct: i)). "not really necessary, should be simplified"
+		i := PMMatrix rows:
+			     ((r rows allButFirst: col - 1) collect: [ :aRow | 
+				      aRow allButFirst: col - 1 ]).
+		i := i - ((hh at: 2) tensorProduct: (hh at: 1) * (hh at: 2) * i).
+		i rows withIndexDo: [ :aRow :index | 
+			aRow withIndexDo: [ :n :c | 
+				r
+					rowAt: col + index - 1
+					columnAt: col + c - 1
+					put: ((n closeTo: 0)
+							 ifTrue: [ 0 ]
+							 ifFalse: [ n ]) ] ]
+		"col <colSize ifTrue: [i :=(hh at: 2) copyFrom: 2 to: colSize -col +1.  i withIndexDo: [:n :index| r rowAt: col columnAt: index put: n  ]  ]""and this part is not correct, dont uncomment before the bug is corrected! useful if q is not explicitely necessary" ].
+	"r rows allButFirst withIndexDo: [:aRow :ri|1 to: (ri min: self numberOfColumns ) do: [:ci|aRow at: ci put:0  ]   ]  ""not necessary with equalsTo:0"
+	i := 0.
+	[ (r rowAt: colSize) allSatisfy: [ :n | n = 0 ] ] whileTrue: [ 
+		i := i + 1.
+		colSize := colSize - 1 ].
+	i > 0 ifTrue: [ 
+		r := PMMatrix rows: (r rows copyFrom: 1 to: colSize).
+		i := q numberOfColumns - i.
+		q := PMMatrix rows:
+			     (q rows collect: [ :row | row copyFrom: 1 to: i ]) ].
+	^ Array with: q with: r
 ]
 
 { #category : #'as yet unclassified' }
 PMMatrix >> qrFactorizationWithPivoting [
+
 	| identMat q r hh colSize i lengthArray rank mx pivot |
-	self numberOfRows < self numberOfColumns
-		ifTrue: [ self error: 'numberOfRows<numberOfColumns' ].
+	self numberOfRows < self numberOfColumns ifTrue: [ 
+		self error: 'numberOfRows<numberOfColumns' ].
 	lengthArray := self columnsCollect: [ :col | col * col ].
 	mx := lengthArray indexOf: lengthArray max.
 	pivot := Array new: lengthArray size.
@@ -791,41 +806,41 @@ PMMatrix >> qrFactorizationWithPivoting [
 	hh := ((r columnAt: rank) copyFrom: rank to: colSize) householder.
 	i := (PMVector new: rank - 1 withAll: 0) , (hh at: 2).
 	q := q * (identMat - ((hh at: 1) * i tensorProduct: i)).
-	i := PMMatrix rows: ((r rows allButFirst: rank - 1) collect: [ :aRow | aRow allButFirst: rank - 1 ]).
+	i := PMMatrix rows:
+		     ((r rows allButFirst: rank - 1) collect: [ :aRow | 
+			      aRow allButFirst: rank - 1 ]).
 	i := i - ((hh at: 2) tensorProduct: (hh at: 1) * (hh at: 2) * i).
-	i rows
-		withIndexDo: [ :aRow :index | 
-			aRow
-				withIndexDo: [ :n :c | 
-					r
-						rowAt: rank + index - 1
-						columnAt: rank + c - 1
-						put:
-							((n equalsTo: 0)
-								ifTrue: [ 0 ]
-								ifFalse: [ n ]) ] ].
-	rank + 1 to: lengthArray size do: [ :ind | lengthArray at: ind put: (lengthArray at: ind) - (r rowAt: rank columnAt: ind) squared ].
+	i rows withIndexDo: [ :aRow :index | 
+		aRow withIndexDo: [ :n :c | 
+			r
+				rowAt: rank + index - 1
+				columnAt: rank + c - 1
+				put: ((n closeTo: 0)
+						 ifTrue: [ 0 ]
+						 ifFalse: [ n ]) ] ].
+	rank + 1 to: lengthArray size do: [ :ind | 
+		lengthArray
+			at: ind
+			put: (lengthArray at: ind) - (r rowAt: rank columnAt: ind) squared ].
 	rank < lengthArray size
 		ifTrue: [ 
 			mx := (lengthArray copyFrom: rank + 1 to: lengthArray size) max.
-			(mx equalsTo: 0)
-				ifTrue: [ mx := 0 ].
+			(mx closeTo: 0) ifTrue: [ mx := 0 ].
 			mx := mx > 0
-				ifTrue: [ lengthArray indexOf: mx startingAt: rank + 1 ]
-				ifFalse: [ 0 ] ]
+				      ifTrue: [ lengthArray indexOf: mx startingAt: rank + 1 ]
+				      ifFalse: [ 0 ] ]
 		ifFalse: [ mx := 0 ].
 	mx > 0 ] whileTrue.
 	i := 0.
-	[ (r rowAt: colSize) allSatisfy: [ :n | n = 0 ] ]
-		whileTrue: [ 
-			i := i + 1.
-			colSize := colSize - 1 ].
-	i > 0
-		ifTrue: [ 
-			r := PMMatrix rows: (r rows copyFrom: 1 to: colSize).
-			i := q numberOfColumns - i.
-			pivot := pivot copyFrom: 1 to: i.
-			q := PMMatrix rows: (q rows collect: [ :row | row copyFrom: 1 to: i ]) ].
+	[ (r rowAt: colSize) allSatisfy: [ :n | n = 0 ] ] whileTrue: [ 
+		i := i + 1.
+		colSize := colSize - 1 ].
+	i > 0 ifTrue: [ 
+		r := PMMatrix rows: (r rows copyFrom: 1 to: colSize).
+		i := q numberOfColumns - i.
+		pivot := pivot copyFrom: 1 to: i.
+		q := PMMatrix rows:
+			     (q rows collect: [ :row | row copyFrom: 1 to: i ]) ].
 	^ Array with: q with: r with: pivot
 ]
 

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

@@ -52,20 +52,22 @@ PMDualNumberTest >> testAdd [
 
 { #category : #'tests-mathematical functions' }
 PMDualNumberTest >> testArcCos [
+
 	| a |
-	self
-		assert: (zero arcCos equalsTo: (PMDualNumber value: Float halfPi eps: -1)).
+	self assert:
+		(zero arcCos equalsTo: (PMDualNumber value: Float halfPi eps: -1)).
 	a := (PMDualNumber value: -1.0 successor eps: 1) arcCos.
-	self assert: (a value equalsTo: Float pi).
+	self assert: (a value closeTo: Float pi).
 	self assert: a eps < -1e6
 ]
 
 { #category : #'tests-mathematical functions' }
 PMDualNumberTest >> testArcSin [
+
 	| a |
 	self assert: zero arcSin equals: zero.
 	a := (PMDualNumber value: 1.0 predecessor eps: 1) arcSin.
-	self assert: (a value equalsTo: Float halfPi).
+	self assert: (a value closeTo: Float halfPi).
 	self assert: a eps > 1e6.
 	a := (PMDualNumber value: -0.5 eps: 1) arcSin.
 	self assert: a value equals: -0.5 arcSin.
@@ -74,11 +76,12 @@ PMDualNumberTest >> testArcSin [
 
 { #category : #'tests-mathematical functions' }
 PMDualNumberTest >> testArcTan [
+
 	self assertEquality: zero arcTan and: zero.
 	self
 		assertEquality: one negated arcTan
 		and: (PMDualNumber value: -1 arcTan eps: -1 / 2).
-	self assert: (three arcTan eps equalsTo: 0.1)
+	self assert: (three arcTan eps closeTo: 0.1)
 ]
 
 { #category : #test }
@@ -166,19 +169,20 @@ PMDualNumberTest >> testEqualsTo [
 	self
 		assert: (one equalsTo: (PMDualNumber value: 1.0000000001 eps: 1.0000000001)).
 	self
-		deny: (one equalsTo: (PMDualNumber value: 1.0000000001 eps: 1.0000001)).
+		deny: (one equalsTo: (PMDualNumber value: 1.0000000001 eps: 1.001)).
 	self
-		deny: (one equalsTo: (PMDualNumber value: 1.0000001 eps: 1.0000000001)).
+		deny: (one equalsTo: (PMDualNumber value: 1.001 eps: 1.0000000001)).
 	self
-		deny: (one equalsTo: (PMDualNumber value: 1.0000001 eps: 1.0000001))
+		deny: (one equalsTo: (PMDualNumber value: 1.001 eps: 1.001))
 ]
 
 { #category : #'tests-mathematical functions' }
 PMDualNumberTest >> testExp [
+
 	| a b |
 	b := 3 exp.
 	a := three exp.
-	self assert: (a eps equalsTo: b).
+	self assert: (a eps closeTo: b).
 	self assert: a value equals: b.
 	self assert: one equals: zero exp
 ]
@@ -199,9 +203,10 @@ PMDualNumberTest >> testHash [
 
 { #category : #'tests-mathematical functions' }
 PMDualNumberTest >> testLn [
+
 	| a |
 	a := three ln.
-	self assert: (a eps equalsTo: 1 / 3).
+	self assert: (a eps closeTo: 1 / 3).
 	self assert: a value equals: 3 ln.
 	self assert: one ln equals: zero
 ]
@@ -247,25 +252,24 @@ PMDualNumberTest >> testPrintOn [
 
 { #category : #'tests-mathematical functions' }
 PMDualNumberTest >> testRaisedTo [
+
 	| a |
 	self assertEquality: (three raisedTo: 2) and: three squared.
 	self assertEquality: (three raisedTo: 0) and: onec.
 	self
 		assertEquality: (three + one raisedTo: 1 / 2)
 		and: (PMDualNumber value: 2 eps: 1 / 2).
-	self
-		assert:
-			((three + one raisedTo: 3 / 2)
-				equalsTo: (PMDualNumber value: 8 eps: 6)).
+	self assert: ((three + one raisedTo: 3 / 2) equalsTo:
+			 (PMDualNumber value: 8 eps: 6)).
 	self assertEquality: (zero raisedTo: 1.4) and: zeroc.
 	a := 2 raisedTo: three.
-	self assert: (a value equalsTo: 8).
-	self assert: (a eps equalsTo: 2 ln * (2 raisedTo: 3)).
+	self assert: (a value closeTo: 8).
+	self assert: (a eps closeTo: 2 ln * (2 raisedTo: 3)).
 	self assertEquality: (1 raisedTo: three) and: onec.
 	self assertEquality: (one raisedTo: one) and: one.
 	a := three raisedTo: three.
-	self assert: (a value equalsTo: 27).
-	self assert: (a eps equalsTo: (3 raisedTo: 3) * (3 ln + 1))
+	self assert: (a value closeTo: 27).
+	self assert: (a eps closeTo: (3 raisedTo: 3) * (3 ln + 1))
 ]
 
 { #category : #'tests-mathematical functions' }
@@ -349,14 +353,15 @@ PMDualNumberTest >> testSubtract [
 
 { #category : #'tests-mathematical functions' }
 PMDualNumberTest >> testTan [
+
 	| a b |
 	a := three tan.
 	self assert: a value equals: 3 tan.
-	self assert: (a eps equalsTo: 3 tan squared + 1).
+	self assert: (a eps closeTo: 3 tan squared + 1).
 	b := Float halfPi - 0.000000000001.
 	a := (PMDualNumber value: b eps: 1) tan.
 	self assert: a value equals: b tan.
-	self assert: (a eps equalsTo: b tan squared + 1)
+	self assert: (a eps closeTo: b tan squared + 1)
 ]
 
 { #category : #'tests-testing' }