Removed some extraneous semicolons

Author: patmorin

python/ods/arraydeque.py

@@ -53,8 +53,8 @@ def remove(self, i):
             for k in range(i, self.n-1): 
                 self.a[(self.j+k)%len(self.a)] = self.a[(self.j+k+1)%len(self.a)]
         self.n -= 1
-        if len(self.a) >= 3*self.n: self._resize();
-        return x;
+        if len(self.a) >= 3*self.n: self._resize()
+        return x
 
     def _resize(self):
         b = new_array(max(1, 2*self.n))

python/ods/arraystack.py

@@ -32,24 +32,21 @@ def set(self, i, x):
     def add(self, i, x): 
         if i < 0 or i > self.n: raise IndexError()
         if self.n == len(self.a): self._resize()
-        for j in range(self.n, i, -1):
-            self.a[j] = self.a[j-1]
+        self.a[i+1:self.n+1] = self.a[i:self.n]
         self.a[i] = x
         self.n += 1
 
     def remove(self, i): 
         if i < 0 or i >= self.n: raise IndexError()
         x = self.a[i]
-        for j in range(i, self.n-1): 
-            self.a[j] = self.a[j+1]
+        self.a[i:self.n-1] = self.a[i+1:self.n]
         self.n -= 1
         if len(self.a) >= 3*self.n: self._resize()
         return x
 
     def _resize(self):
         b = new_array(max(1, 2*self.n))
-        for i in range(self.n):
-            b[i] = self.a[i]
+        b[0:self.n] = self.a[0:self.n]
         self.a = b
 
 

python/ods/binarytree.py

@@ -96,13 +96,13 @@ def first_node(self):
     def next_node(self, w):
         """Find the node that follows w in an in-order traversal"""
         if w.right != self.nil:
-            w = w.right;
+            w = w.right
             while w.left != self.nil:
-                w = w.left;
+                w = w.left
         else:
             while w.parent != self.nil and w.parent.left != w:
-                w = w.parent;
-            w = w.parent;
-        return w;
+                w = w.parent
+            w = w.parent
+        return w
 
 

python/ods/dllist.py

@@ -57,7 +57,7 @@ def add_before(self, w, x):
         u.next.prev = u
         u.prev.next = u
         self.n += 1
-        return u;
+        return u
 
     def add(self, i, x):
         if i < 0 or i > self.n:    raise IndexError()

python/ods/linearhashtable.py

@@ -12,7 +12,7 @@ def __init__(self, iterable=[]):
         self.add_all(iterable)
 
     def _initialize(self):
-        self.dl = object();
+        self.dl = object()
 
     def initialize(self):
         self.d = 1
@@ -95,7 +95,7 @@ def add_slow(self, x):
         return True
     
     def ideal_hash(self, x):
-        return tab[x.hashCode() >> w-d];
+        return tab[x.hashCode() >> w-d]
     """
 
     """A bunch of random values for use in tabulation hashing"""