Web   ·   Wiki   ·   Activities   ·   Blog   ·   Lists   ·   Chat   ·   Meeting   ·   Bugs   ·   Git   ·   Translate   ·   Archive   ·   People   ·   Donate
summaryrefslogtreecommitdiffstats
path: root/Generation
diff options
context:
space:
mode:
authorOli <olivier.belanger@umontreal.ca>2007-07-16 18:10:34 (GMT)
committer Oli <olivier.belanger@umontreal.ca>2007-07-16 18:10:34 (GMT)
commitf2fdf4556c6c51495a273fdc2eef51f0a98910e1 (patch)
treee975249e4a0b46ad841e6a6a67bad52306216d09 /Generation
parent2119fa4741e1ac0b54de6d1cbab145d323c3cafa (diff)
remove trailing spaces
Diffstat (limited to 'Generation')
-rwxr-xr-xGeneration/Utils.py70
1 files changed, 35 insertions, 35 deletions
diff --git a/Generation/Utils.py b/Generation/Utils.py
index f025188..e5ea295 100755
--- a/Generation/Utils.py
+++ b/Generation/Utils.py
@@ -8,36 +8,36 @@ import math
#----------------------------------------------------------------------
def prob(x):
- sum1 = 0
- sum2 = 0
-
- for i in x:
- sum1 = sum1 + i
-
- val = sum1 * random.randint(0, 32767) / 32768
-
- for i in range(len(x)):
- sum2 = sum2 + x[i]
- if x[i]:
- if sum2 >= val:
- return i
- break
-
+ sum1 = 0
+ sum2 = 0
+
+ for i in x:
+ sum1 = sum1 + i
+
+ val = sum1 * random.randint(0, 32767) / 32768
+
+ for i in range(len(x)):
+ sum2 = sum2 + x[i]
+ if x[i]:
+ if sum2 >= val:
+ return i
+ break
+
def prob2(x):
- sum1 = 0
- sum2 = 0
-
- for i in x:
- sum1 = sum1 + i[1]
-
- val = sum1 * random.randint(0, 32767) / 32768
-
- for i in x:
- sum2 = sum2 + i[1]
- if i[1]:
- if sum2 >= val:
- return i[0]
- break
+ sum1 = 0
+ sum2 = 0
+
+ for i in x:
+ sum1 = sum1 + i[1]
+
+ val = sum1 * random.randint(0, 32767) / 32768
+
+ for i in x:
+ sum2 = sum2 + i[1]
+ if i[1]:
+ if sum2 >= val:
+ return i[0]
+ break
def scale(val, mini=0., maxi=1., length=100):
slope = []
@@ -47,14 +47,14 @@ def scale(val, mini=0., maxi=1., length=100):
low_val = (pow(1.-(up*2.),4.)*(-50.5)+0.5)
else:
low_val = up
-
+
if val <= 0.5:
high_val = (pow(1.-(val * 2.),4.)*(-50.5)+0.5)
else:
high_val = val
-
+
step = (maxi - mini) * (1. / length)
-
+
calc = (1. / length) * (high_val - low_val)
append = slope.append
for i in range(length + 1):
@@ -65,10 +65,10 @@ def scale(val, mini=0., maxi=1., length=100):
temp = 1
else:
temp = temp
-
+
append(((step * i) + mini, int(temp * 100)))
-
+
return slope
def midtotrans(x):
- return pow(1.059463, x - 36)
+ return pow(1.059463, x - 36)