changed examples to use 4-space tabs

Philip Guo · Philip Guo · commit dcff43ce2739 · 2011-09-24T14:12:04.000-07:00
diff --git a/example-code/aliasing.txt b/example-code/aliasing.txt
@@ -9,11 +9,11 @@ y.append(7)
 y = "hello"
 
 def foo(lst):
-  lst.append("hello")
-  bar(lst)
+    lst.append("hello")
+    bar(lst)
 
 def bar(myLst):
-  print myLst
+    print myLst
 
 foo(x)
 foo(z)
diff --git a/example-code/fib.txt b/example-code/fib.txt
@@ -5,7 +5,7 @@ arr = [1, 1]
 print arr[0]
 
 while True:
-  print arr[-1]
-  tmp = sum(arr)
-  arr.append(tmp)
-  del arr[0]
+    print arr[-1]
+    tmp = sum(arr)
+    arr.append(tmp)
+    del arr[0]
diff --git a/example-code/map.txt b/example-code/map.txt
@@ -3,13 +3,13 @@
 # http://mit.edu/6.01/mercurial/spring10/www/handouts/readings.pdf
 
 def map(func, lst):
-  if lst == []:
-    return []
-  else:
-    return [func(lst[0])] + map(func, lst[1:])
+    if lst == []:
+        return []
+    else:
+        return [func(lst[0])] + map(func, lst[1:])
     
 def halveElements(lst):
-  return map(lambda x: x / 2.0, lst)
+    return map(lambda x: x / 2.0, lst)
   
 input = [2, 4, 6, 8, 10]
 output = halveElements(input)
diff --git a/example-code/memo_fib.txt b/example-code/memo_fib.txt
@@ -4,14 +4,14 @@
 MemoTable = {}
 
 def MemoizedFib(n):
-  if n <= 2:
-    return 1
+    if n <= 2:
+        return 1
 
-  if n in MemoTable:
-    return MemoTable[n]
+    if n in MemoTable:
+        return MemoTable[n]
 
-  MemoTable[n] = MemoizedFib(n-1) + MemoizedFib(n-2)
-  return MemoTable[n]
+    MemoTable[n] = MemoizedFib(n-1) + MemoizedFib(n-2)
+    return MemoTable[n]
 
 
 res = MemoizedFib(10)
diff --git a/example-code/oop_small.txt b/example-code/oop_small.txt
@@ -1,13 +1,13 @@
 class A:
-  x = 1
-  y = 'hello'
+    x = 1
+    y = 'hello'
 
 class B:
-  z = 'bye'
+    z = 'bye'
 
 class C(A,B):
-  def salutation(self):
-    return '%d %s %s' % (self.x, self.y, self.z)
+    def salutation(self):
+        return '%d %s %s' % (self.x, self.y, self.z)
 
 inst = C()
 print inst.salutation()
diff --git a/example-code/sqrt.txt b/example-code/sqrt.txt
@@ -2,22 +2,22 @@
 #   http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-10.html#%_sec_1.1.7
 
 def sqrt(x):
-  def average(a, b):
-    return (a + b) / 2.0
+    def average(a, b):
+        return (a + b) / 2.0
 
-  def is_good_enough(guess):
-    return (abs((guess * guess) - x) < 0.001)
+    def is_good_enough(guess):
+        return (abs((guess * guess) - x) < 0.001)
 
-  def improve(guess):
-    return average(guess, x / guess)
+    def improve(guess):
+        return average(guess, x / guess)
 
-  def sqrt_iter(guess):
-    if is_good_enough(guess):
-      return guess
-    else:
-      return sqrt_iter(improve(guess))
+    def sqrt_iter(guess):
+        if is_good_enough(guess):
+            return guess
+        else:
+            return sqrt_iter(improve(guess))
 
-  return sqrt_iter(1.0)
+    return sqrt_iter(1.0)
 
 
 ans = sqrt(9)
diff --git a/example-code/sum.txt b/example-code/sum.txt
@@ -3,14 +3,14 @@
 # http://mit.edu/6.01/mercurial/spring10/www/handouts/readings.pdf
 
 def summation(low, high, f, next):
-  s = 0
-  x = low
-  while x <= high:
-    s = s + f(x)
-    x = next(x)
-  return s
+    s = 0
+    x = low
+    while x <= high:
+        s = s + f(x)
+        x = next(x)
+    return s
 
 def sumsquares(low, high):
-  return summation(low, high, lambda x: x**2, lambda x: x+1)
+    return summation(low, high, lambda x: x**2, lambda x: x+1)
 
 print sumsquares(1, 10)
diff --git a/example-code/towers_of_hanoi.txt b/example-code/towers_of_hanoi.txt
@@ -1,13 +1,13 @@
 # move a stack of n disks from stack a to stack b,
 # using tmp as a temporary stack
 def TowerOfHanoi(n, a, b, tmp):
-  if n == 1:
-    b.append(a.pop())
-  else:
-    TowerOfHanoi(n-1, a, tmp, b)
-    b.append(a.pop())
-    TowerOfHanoi(n-1, tmp, b, a)
-      
+    if n == 1:
+        b.append(a.pop())
+    else:
+        TowerOfHanoi(n-1, a, tmp, b)
+        b.append(a.pop())
+        TowerOfHanoi(n-1, tmp, b, a)
+        
 stack1 = [4,3,2,1]
 stack2 = []
 stack3 = []
diff --git a/example-code/wentworth_try_finally.txt b/example-code/wentworth_try_finally.txt
@@ -7,12 +7,12 @@
 # How many "survived!" messages will be printed???
 
 def f(n):
-  try:
-     x = 10 / n
-     print "x is", x
-     f(n-1)
-     print "survived!"
-  finally:
-    print "Bye from f where n =", n
+    try:
+        x = 10 / n
+        print "x is", x
+        f(n-1)
+        print "survived!"
+    finally:
+        print "Bye from f where n =", n
 
 f(4)
