Removed some references to random

Author: olekscode

src/Math-Chromosome/PMChromosomeManager.class.st

@@ -7,7 +7,7 @@ Class {
 		'rateOfMutation',
 		'rateOfCrossover'
 	],
-	#category : 'Math-Chromosome'
+	#category : #'Math-Chromosome'
 }
 
 { #category : #creation }
@@ -55,8 +55,9 @@ PMChromosomeManager >> populationSize: anInteger [
 { #category : #operation }
 PMChromosomeManager >> process: aChromosome1 and: aChromosome2 [ 
 
-	| roll |
-	roll := Number random.
+	| random roll |
+	random := Random new.
+	roll := random next.
 	roll < rateOfCrossover 
 		ifTrue: [population addAll: (self crossover: aChromosome1 and: aChromosome2)]
 		ifFalse: 

src/Math-Core-Distribution/PMNormalDistribution.class.st

@@ -13,15 +13,20 @@ Class {
 
 { #category : #information }
 PMNormalDistribution class >> boxMullerTransform [
-|v1 v2 w y|
-			[ v1 := Number random * 2 - 1.
-			v2 := Number random * 2 - 1.
-			w := v1 squared + v2 squared.
-			w > 1 ] whileTrue.
-			y := (w ln * 2 negated / w) sqrt.
-			v1 := y * v1.
-			NextRandom := y * v2.
-			^v1.
+	| random v1 v2 w y |
+	random := Random new.
+	
+	[
+		v1 :=random next * 2 - 1.
+		v2 := random next * 2 - 1.
+		w := v1 squared + v2 squared.
+		w > 1
+	] whileTrue.
+			
+	y := (w ln * 2 negated / w) sqrt.
+	v1 := y * v1.
+	NextRandom := y * v2.
+	^v1.
 ]
 
 { #category : #information }

src/Math-FunctionFit/PMAnotherChromosomeManager.class.st

@@ -13,7 +13,7 @@ Class {
 	#classVars : [
 		'Primes'
 	],
-	#category : 'Math-FunctionFit'
+	#category : #'Math-FunctionFit'
 }
 
 { #category : #utils }
@@ -57,14 +57,24 @@ PMAnotherChromosomeManager class >> origin: anArray range: anotherArray [
 PMAnotherChromosomeManager >> crossover: aChromosome1 and: aChromosome2 [
 "the Discrete Recombination  operator
 that does not prefer schemata of certain parameters based on their position"
-|new1 new2|
-	aChromosome1=aChromosome2 ifTrue:[^Array with:( self mutate: aChromosome2) with: (self mutate: aChromosome1) ].
+	| random new1 new2 |
+	
+	aChromosome1 = aChromosome2 ifTrue:[
+		^ Array
+			with: (self mutate: aChromosome2)
+			with: (self mutate: aChromosome1) ].
+	
 	new1 := self clone: aChromosome1.
 	new2 := self clone: aChromosome2.
-	2 to: new1 size do: [:i| (Float random <0.5)ifTrue:[
+	
+	random := Random new.
+	
+	2 to: new1 size do: [ :i |
+		(random next < 0.5) ifTrue: [
 			new1 at: i put: (aChromosome2 at: i).
-			new2 at: i put: (aChromosome1 at: i)]].
-	^Array with: new1 with: new2
+			new2 at: i put: (aChromosome1 at: i) ] ].
+	
+	^ Array with: new1 with: new2
 ]
 
 { #category : #operation }
@@ -116,20 +126,26 @@ PMAnotherChromosomeManager >> lineCrossOver: aChromosome1 and: aChromosome2 [
 
 { #category : #operation }
 PMAnotherChromosomeManager >> mutate: aVector [
-"BGA mutation"
-	| isMutated threshold new index|
-	isMutated :=false.
-	threshold :=1/ aVector size asFloat .
-	new :=aVector copy.
-	1 to: aVector size do:[:i| Float random < threshold ifTrue:[
-			isMutated :=true.
+	"BGA mutation"
+	| isMutated threshold new random index|
+	
+	isMutated := false.
+	threshold := 1 / aVector size asFloat.
+	new := aVector copy.
+	random := Random new.
+	
+	1 to: aVector size do: [ :i |
+		random next < threshold ifTrue: [
+			isMutated := true.
 			new at: i put: (new at: i) + 
-			((Float random <0.5 ifTrue: [0.5] ifFalse:[0.5 negated ] )*(self randomRangeAt: i))]].
+				((random next < 0.5 ifTrue: [ 0.5 ] ifFalse:[ -0.5 ]) * (self randomRangeAt: i)) ] ].
+	
 	isMutated ifFalse: [
 		index := aVector size random + 1.
 		new at: index put: (new at: index) + 
-			((Float random <0.5 ifTrue: [0.5] ifFalse:[0.5 negated ] )*(self randomRangeAt: index))].
-	^new
+			((random next < 0.5 ifTrue: [ 0.5 ] ifFalse:[ -0.5 ]) * (self randomRangeAt: index)) ].
+	
+	^ new
 ]
 
 { #category : #accessing }
@@ -155,8 +171,9 @@ PMAnotherChromosomeManager >> printOn: aStream [
 
 { #category : #operation }
 PMAnotherChromosomeManager >> process: aChromosome1 and: aChromosome2 [ 
-	| roll |
-	roll := Number random.
+	| random roll |
+	random := Random new.
+	roll := random next.
 	roll < rateOfCrossover 
 		ifTrue: [population addAll: (self crossover: aChromosome1 and: aChromosome2)]
 		ifFalse: 
@@ -224,8 +241,10 @@ PMAnotherChromosomeManager >> rateOfMutation: aNumber [
 
 { #category : #private }
 PMAnotherChromosomeManager >> smallDistribution [
-"an exponential distribution as used by H. Mühlenbein"
-^2 raisedTo: (16 *Float random negated)
+	"an exponential distribution as used by H. Mühlenbein"
+	| random |
+	random := Random new.
+	^ 2 raisedTo: (16 * random next negated)
 ]
 
 { #category : #private }

src/Math-Numerical/PMBisectionZeroFinder.class.st

@@ -32,9 +32,11 @@ PMBisectionZeroFinder >> evaluateIteration [
 
 { #category : #operation }
 PMBisectionZeroFinder >> findNegativeXFrom: aNumber1 range: aNumber2 [
-	| n |
+	| random n |
 	n := 0.
-	[ negativeX := Number random * aNumber2 + aNumber1.
+	random := Random new.
+	
+	[ negativeX := random next * aNumber2 + aNumber1.
 	  ( functionBlock value: negativeX) < 0
 		] whileFalse: [ n := n + 0.1.
 						n > maximumIterations
@@ -44,9 +46,11 @@ PMBisectionZeroFinder >> findNegativeXFrom: aNumber1 range: aNumber2 [
 
 { #category : #operation }
 PMBisectionZeroFinder >> findPositiveXFrom: aNumber1 range: aNumber2 [
-	| n |
+	| n random |
 	n := 0.
-	[ positiveX := Number random * aNumber2 + aNumber1.
+	random := Random new.
+	
+	[ positiveX := random next * aNumber2 + aNumber1.
 	  ( functionBlock value: positiveX) > 0
 		] whileFalse: [ n := n + 1.
 						n > maximumIterations

src/Math-Numerical/PMGeneticOptimizer.class.st

@@ -77,8 +77,9 @@ PMGeneticOptimizer >> processRandomParents: aNumberArray [
 { #category : #information }
 PMGeneticOptimizer >> randomIndex: aNumberArray [
 		"Private"
-	| x n |
-	x := Number random.
+	| random x n |
+	random := Random new.
+	x := random next.
 	n := 1.
 	aNumberArray do: 
 		[ :each |

src/Math-Numerical/PMNewtonZeroFinder.class.st

@@ -43,17 +43,22 @@ PMNewtonZeroFinder class >> function: aBlock1 derivative: aBlock2 [
 PMNewtonZeroFinder >> computeInitialValues [
 	"Private - If no derivative has been defined, take an ad-hoc definition.
 	 If no initial value has been defined, take 0 as the starting point (for lack of anything better)."
-	| n |
-	result isNil
-		ifTrue: [ result := 0].
-	derivativeBlock isNil
-		ifTrue: [ derivativeBlock := self defaultDerivativeBlock].
+	| n random |
+	
+	result ifNil: [ result := 0].
+	derivativeBlock ifNil: [ derivativeBlock := self defaultDerivativeBlock].
+	
 	n := 0.
-	[ (derivativeBlock value: result) equalsTo: 0]
-		whileTrue: [ n := n + 1.
-					 n > maximumIterations
-						ifTrue: [ self error: 'Function''s derivative seems to be zero everywhere'].
-					 result := Number random + result].
+	random := Random new.
+	
+	[ (derivativeBlock value: result) equalsTo: 0] whileTrue: [
+		n := n + 1.
+		
+		n > maximumIterations ifTrue: [
+			self error: 'Function''s derivative seems to be zero everywhere' ].
+		
+		result := random next + result ].
+	
 	newFunctionValue := functionBlock value: result.
 ]
 
@@ -105,16 +110,22 @@ PMNewtonZeroFinder >> initialize [
 PMNewtonZeroFinder >> setDerivative: aBlock [ 
 	"Defines the derivative of the function for which zeroes will be found.
 	Tests if provided block indeed implements the derivative of the function"
-	| x |
-	(aBlock respondsTo: #value:)
-		ifFalse: [self error: 'Derivative block must implement the method value:'].
-	x := result isNil
-				ifTrue: [Number random]
-				ifFalse: [result + Number random].
+	| x random |
+	
+	(aBlock respondsTo: #value:) ifFalse: [
+		self error: 'Derivative block must implement the method value:' ].
+	
+	random := Random new.
+	
+	x := result
+		ifNil: [ random next ]
+		ifNotNil: [ result + random next ].
+		
 	((aBlock value: x)
-		relativelyEqualsTo: (self defaultDerivativeBlock value: x)
-		upTo: 1.0e-4)
-		ifFalse: [self error: 'Supplied derivative is not correct'].
+		closeTo: (self defaultDerivativeBlock value: x)
+		precision: 1.0e-4)
+		ifFalse: [ self error: 'Supplied derivative is not correct' ].
+	
 	derivativeBlock := aBlock
 ]
 

src/Math-Numerical/PMOptimizingBracketFinder.class.st

@@ -12,7 +12,11 @@ PMOptimizingBracketFinder class >> initialPoints: aSortedCollection function: aF
 
 { #category : #operation }
 PMOptimizingBracketFinder >> computeInitialValues [
-	[bestPoints size < 2] whileTrue: [self addPointAt: Number random]
+	| random |
+	random := Random new.
+	
+	[ bestPoints size < 2 ] whileTrue: [
+		self addPointAt: random next ]
 ]
 
 { #category : #operation }

src/Math-Quaternion/PMQuaternion.class.st

@@ -57,12 +57,15 @@ PMQuaternion class >> qr: qr qi: qi qj: qj qk: qk [
 
 { #category : #'*Math-Quaternion' }
 PMQuaternion class >> random [
-		"Answers a random quaternion with abs at most one."
+	"Answers a random quaternion with abs at most one."
+	
+	| random |
+	random := Random new.
 
-	^ (0.5 - Float random) 
-		i: (0.5 - Float random)
-		j: (0.5 - Float random)
-		k: (0.5 - Float random).
+	^ (0.5 - random next) 
+		i: (0.5 - random next)
+		j: (0.5 - random next)
+		k: (0.5 - random next).
 ]
 
 { #category : #'constants access' }

src/Math-Quaternion/PMQuaternion.extension.st

@@ -16,22 +16,25 @@ PMQuaternion >> productWithVector: aVector [
 	^aVector collect: [ :each | each * self]
 ]
 
-{ #category : #'*Math-Quaternion' }
-PMQuaternion class >> random [
-		"Answers a random quaternion with abs at most one."
-
-	^ (0.5 - Float random) 
-		i: (0.5 - Float random)
-		j: (0.5 - Float random)
-		k: (0.5 - Float random).
-]
-
 { #category : #'*Math-Quaternion' }
 PMQuaternion >> random [
 	"analog to Number>>random. The resulting quaternion will have abs at most that of the receiver"
 	^ self class random * self.
 ]
 
+{ #category : #'*Math-Quaternion' }
+PMQuaternion class >> random [
+	"Answers a random quaternion with abs at most one."
+	
+	| random |
+	random := Random new.
+
+	^ (0.5 - random next) 
+		i: (0.5 - random next)
+		j: (0.5 - random next)
+		k: (0.5 - random next).
+]
+
 { #category : #'*Math-Quaternion' }
 PMQuaternion >> subtractToPolynomial: aPolynomial [
 	^aPolynomial addNumber: self negated

src/Math-Tests-Complex/PMComplexTest.class.st

@@ -579,8 +579,9 @@ PMComplexTest >> testRaisedToInteger [
 
 { #category : #tests }
 PMComplexTest >> testRandom [
-	| c r |
-	c := Float random + Float random i.
+	| random c r |
+	random := Random new.
+	c := random next + random next i.
 	r := c random.
 	self assert: r isComplexNumber.
 	self assert: r abs < c abs