Homework 1 Submission – Phil Getzen – MSU Net ID: getzenph – CSE491

iter_bug/fib.py

@@ -12,5 +12,5 @@ def __iter__(self):
 
     def next(self):
         next_fib = self.last_1 + self.last_2
-        self.last_1, self.last2 = self.last_2, next_fib
-        return next_fib
+        self.last_1, self.last_2 = self.last_2, next_fib
+        return next_fib

iter_bug/test.py

@@ -11,7 +11,7 @@ def test2():
     i.next()
     assert i.next() == 3
 
-def test2():
+def test3():
     f = fib.fib()
     i = iter(f)
     i.next()
@@ -21,4 +21,3 @@ def test2():
 test1()
 test2()
 test3()
-

sieve_gen/example.py

@@ -0,0 +1,4 @@
+import sieve
+
+for n, i in zip(range(10), sieve.next()):
+    print i

sieve_gen/sieve.py

@@ -0,0 +1,20 @@
+#Implementation using a generator
+
+_primeslist = [2]
+
+
+def _is_prime(primes, n):
+    for i in primes:
+        if n % i == 0:
+            return False
+    return True
+
+
+def next():
+    start = _primeslist[-1] + 1
+    while 1:
+        if _is_prime(_primeslist, start):
+            _primeslist.append(start)
+            yield start
+
+        start += 1

sieve_gen/test1.py

@@ -0,0 +1,9 @@
+import sieve
+
+
+def test1():
+    s = sieve.next()
+    i = iter(s)
+    assert i.next() == 3
+
+test1()

sieve_gen/test2.py

@@ -0,0 +1,12 @@
+import sieve
+
+
+def test2():
+    s = sieve.next()
+    i = iter(s)
+
+    for x in range(4):
+    	i.next()
+    assert i.next() == 13
+
+test2()

sieve_gen/test3.py

@@ -0,0 +1,11 @@
+import sieve
+
+
+def test3():
+    s = sieve.next()
+    i = iter(s)
+    for x in range(8):
+        i.next()
+    assert i.next() == 29
+
+test3()

sieve_iter/example.py

@@ -0,0 +1,4 @@
+import sieve
+
+for n, i in zip(range(10), sieve.sieve()):
+    print i

sieve_iter/sieve.py

@@ -0,0 +1,23 @@
+#Implementation using Iter
+
+class sieve(object):
+    def __init__(self):
+        self._primeslist = [2]
+
+    def __iter__(self):
+        return self
+
+    def _is_prime(self, n):
+        for i in self._primeslist:
+            if n % i == 0:
+                return False
+        return True
+
+    def next(self):
+        start = self._primeslist[-1] + 1
+        while 1:
+            if self._is_prime(start):
+                self._primeslist.append(start)
+                return start
+
+            start += 1

sieve_iter/test1.py

@@ -0,0 +1,9 @@
+import sieve
+
+
+def test1():
+    s = sieve.sieve()
+    i = iter(s)
+    assert i.next() == 3
+
+test1()

sieve_iter/test2.py

@@ -0,0 +1,11 @@
+import sieve
+
+
+def test2():
+    s = sieve.sieve()
+    i = iter(s)
+    for x in range(4):
+        i.next()
+    assert i.next() == 13
+
+test2()

sieve_iter/test3.py

@@ -0,0 +1,11 @@
+import sieve
+
+
+def test3():
+    s = sieve.sieve()
+    i = iter(s)
+    for x in range(8):
+        i.next()
+    assert i.next() == 29
+
+test3()

sieve_mod/example.py

@@ -0,0 +1,4 @@
+import sieve
+
+for n in range(10):
+    print sieve.next()

sieve_mod/sieve.py

@@ -0,0 +1,19 @@
+#This is an implementation using a module
+
+_primeslist = [2]
+
+def _is_prime(primes, n):
+    for i in primes:
+        if n % i == 0:
+            return False
+    return True
+
+def next():
+    global _primeslist
+    start = _primeslist[-1] + 1
+    while 1:
+        if _is_prime(_primeslist, start):
+            _primeslist.append(start)
+            return start
+
+        start += 1