Made code easier to read reverting from 79 charaters per line to 100 characters

Chipe1 · Chipe1 · commit e2ed73f6d926 · 2016-03-16T17:07:36.000+05:30
diff --git a/agents.py b/agents.py
@@ -51,8 +51,7 @@ class Thing(object):
     .__name__  slot (used for output only)."""
 
     def __repr__(self):
-        return '<{}>'.format(getattr(self, '__name__',
-                                     self.__class__.__name__))
+        return '<{}>'.format(getattr(self, '__name__', self.__class__.__name__))
 
     def is_alive(self):
         "Things that are 'alive' should return true."
@@ -309,10 +308,8 @@ def delete_thing(self, thing):
         except(ValueError, e):
             print(e)
             print("  in Environment delete_thing")
-            print("  Thing to be removed: {} at {}" .format(thing,
-                                                            thing.location))
-            print("  from list: {}" .format([(thing, thing.location)
-                                             for thing in self.things]))
+            print("  Thing to be removed: {} at {}" .format(thing, thing.location))
+            print("  from list: {}" .format([(thing, thing.location) for thing in self.things]))
         if thing in self.agents:
             self.agents.remove(thing)
 
diff --git a/csp.py b/csp.py
@@ -105,18 +105,15 @@ def goal_test(self, state):
         "The goal is to assign all vars, with all constraints satisfied."
         assignment = dict(state)
         return (len(assignment) == len(self.vars) and
-                every(lambda var: self.nconflicts(var, assignment[var],
-                                                  assignment) == 0,
-                      self.vars))
+                every(lambda x: self.nconflicts(x, assignment[x], assignment) == 0, self.x))
 
     # These are for constraint propagation
 
     def support_pruning(self):
         """Make sure we can prune values from domains. (We want to pay
         for this only if we use it.)"""
         if self.curr_domains is None:
-            self.curr_domains = dict((v, list(self.domains[v]))
-                                     for v in self.vars)
+            self.curr_domains = dict((v, list(self.domains[v])) for v in self.vars)
 
     def suppose(self, var, value):
         "Start accumulating inferences from assuming var=value."
@@ -590,12 +587,10 @@ def __init__(self, grid):
                        for var, ch in zip(flatten(self.rows), squares))
         for _ in squares:
             raise ValueError("Not a Sudoku grid", grid)  # Too many squares
-        CSP.__init__(self, None, domains, self.neighbors,
-                     different_values_constraint)
+        CSP.__init__(self, None, domains, self.neighbors, different_values_constraint)
 
     def display(self, assignment):
-        def show_box(box): return [
-            ' '.join(map(show_cell, row)) for row in box]
+        def show_box(box): return [' '.join(map(show_cell, row)) for row in box]
 
         def show_cell(cell): return str(assignment.get(cell, '.'))
 
diff --git a/tests/test_search.py b/tests/test_search.py
@@ -8,19 +8,15 @@
 
 
 def test_breadth_first_tree_search():
-    assert breadth_first_tree_search(romania).solution() == ['Sibiu',
-                                                             'Fagaras',
-                                                             'Bucharest']
+    assert breadth_first_tree_search(romania).solution() == ['Sibiu', 'Fagaras', 'Bucharest']
 
 
 def test_breadth_first_search():
-    assert breadth_first_search(romania).solution() == ['Sibiu', 'Fagaras',
-                                                        'Bucharest']
+    assert breadth_first_search(romania).solution() == ['Sibiu', 'Fagaras', 'Bucharest']
 
 
 def test_uniform_cost_search():
-    assert uniform_cost_search(romania).solution() == ['Sibiu', 'Rimnicu',
-                                                       'Pitesti', 'Bucharest']
+    assert uniform_cost_search(romania).solution() == ['Sibiu', 'Rimnicu', 'Pitesti', 'Bucharest']
 
 
 def test_depth_first_graph_search():
@@ -29,9 +25,7 @@ def test_depth_first_graph_search():
 
 
 def test_iterative_deepening_search():
-    assert iterative_deepening_search(romania).solution() == ['Sibiu',
-                                                              'Fagaras',
-                                                              'Bucharest']
+    assert iterative_deepening_search(romania).solution() == ['Sibiu', 'Fagaras', 'Bucharest']
 
 def test_and_or_graph_search():
     def run_plan(state, problem, plan):
diff --git a/tests/test_utils.py b/tests/test_utils.py
@@ -75,9 +75,9 @@ def test_histogram():
     assert histogram([1, 2, 4, 2, 4, 5, 7, 9, 2, 1]) == [(1, 2), (2, 3),
                                                          (4, 2), (5, 1),
                                                          (7, 1), (9, 1)]
-    assert histogram([1, 2, 4, 2, 4, 5, 7, 9, 2, 1], 0,
-                     lambda x: x*x) == [(1, 2), (4, 3), (16, 2), (25, 1),
-                                        (49, 1), (81, 1)]
+    assert histogram([1, 2, 4, 2, 4, 5, 7, 9, 2, 1], 0, lambda x: x*x) == [(1, 2), (4, 3),
+                                                                           (16, 2), (25, 1),
+                                                                           (49, 1), (81, 1)]
     assert histogram([1, 2, 4, 2, 4, 5, 7, 9, 2, 1], 1) == [(2, 3), (4, 2),
                                                             (1, 2), (9, 1),
                                                             (7, 1), (5, 1)]
