Added dynamic restart

Maze.py

@@ -0,0 +1,156 @@
+import random
+import sys
+from os import path
+
+#X = 5
+#Y = 5
+
+class Grouper(object):
+   def __init__(self, init=[]):
+      mapping = self._mapping = {}
+      for x in init:
+         mapping[x] = [x]
+
+   def join(self, a, *args):
+      """Join given arguments into the same set.
+Accepts one or more arguments."""
+      mapping = self._mapping
+      set_a = mapping.setdefault(a, [a])
+
+      for arg in args:
+         set_b = mapping.get(arg)
+         if set_b is None:
+            set_a.append(arg)
+            mapping[arg] = set_a
+         elif set_b is not set_a:
+            if len(set_b) > len(set_a):
+               set_a, set_b = set_b, set_a
+            set_a.extend(set_b)
+            for elem in set_b:
+               mapping[elem] = set_a
+
+   def joined(self, a, b):
+      """Returns True if a and b are members of the same set."""
+      mapping = self._mapping
+      try:
+          return mapping[a] is mapping[b]
+      except KeyError:
+          return False
+
+   def __iter__(self):
+      """Returns an iterator returning each of the disjoint sets as a list."""
+      seen = set()
+      for elem, group in self._mapping.iteritems():
+          if elem not in seen:
+              yield group
+              seen.update(group)
+
+class Cell():
+    """Represents a cell in the maze, with an x and y coordinate and its
+    right hand wall and downwards wall.
+
+    """
+    def __init__(self, x, y):
+        self.x, self.y = x, y
+        self.right_wall = self.down_wall = None
+
+class Wall():
+    """Represents a wall in the maze with its two neighbouring cells.
+    """
+    def __init__(self):
+        self.neighbours = None
+        self.active = True
+
+def popchoice(seq):
+    """Takes an iterable and pops a random item from it.
+    """
+    return seq.pop(random.randrange(len(seq)))
+
+def create_maze(X, Y):
+    # A mapping of coord tuple to Cell object    
+    cells = {}
+    # A list of all the non-edge walls
+    walls = []
+
+    # Generate cells
+    for y in range(Y):
+        for x in range(X):
+            cells[(x, y)] = Cell(x, y)
+
+    # Generate walls and add to the neighbouring cells
+    for y in range(Y):
+        for x in range(X):
+            current_cell = cells[(x,y)]
+            down_wall = Wall()
+            current_cell.down_wall = down_wall
+            right_wall = Wall()
+            current_cell.right_wall = right_wall
+            if y != Y-1:
+                down_wall.neighbours = (current_cell, cells[(x,y+1)])
+                walls.append(down_wall)
+
+            if x != X-1:
+                right_wall.neighbours = (current_cell, cells[(x+1,y)])
+                walls.append(right_wall)
+
+    grouper = Grouper()
+    # Get a list of all the cell objects to give to the Grouper            
+    cell_list = [cells[key] for key in cells]
+
+    maze = Grouper(cell_list)
+
+    for _ in range(len(walls)):
+        # Pop a random wall from the list and get its neighbours
+        wall = popchoice(walls)
+        cell_1, cell_2 = wall.neighbours
+        # If the cells on either side of the wall aren't already connected,
+        # destroy the wall
+        if not maze.joined(cell_1, cell_2):
+            wall.active = False
+            maze.join(cell_1, cell_2)
+
+    # Draw the maze
+
+    maze_map = []
+
+    x_max = (X*2)+1
+    y_max = (Y*2)+1
+
+    # Make an empty maze map with True for wall and False for space
+    # Make top wall
+    maze_map.append([True for _ in range(x_max)])
+    for y in range(1, y_max):
+        # Make rows with left side wall
+        maze_map.append([True]+[False for _ in range(1, x_max)])
+
+    # Add the down and right walls from each cell to the map
+    for coords, cell in cells.items():
+        x, y = coords
+        # Add the intersection wall for each cell (down 1 right 1)
+        maze_map[(y*2)+2][(x*2)+2] = True
+        if cell.right_wall.active:
+            maze_map[(y*2)+1][(x*2)+2] = True
+        if cell.down_wall.active:
+            maze_map[(y*2)+2][(x*2)+1] = True
+
+    # Print the map
+    maze = []
+    for i in range(len(maze_map)):
+        a = 0
+        b = 0
+        c = 0
+        while(a == b or a == b or c == b):
+          a = random.randint(0, X*2)
+          b = random.randint(0, X*2)
+          c = random.randint(0, X*2)
+
+        maze_row = []
+        for j in range(len(maze_map[0])):
+            #if(n >= rand_number or j == X or j == 0 or i == 0 or i == Y):
+            if maze_map[i][j] and ((j != a and j!= b and j!= c) or j == 2*X or j == 0 or i == 0 or i == 2*Y):
+              maze_row.append(1)
+            else:
+              maze_row.append(0)
+        maze.append(maze_row)
+        #print maze_row
+    return maze

PodSixNet/COPYING

@@ -0,0 +1,165 @@
+		   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions. 
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version. 
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.

PodSixNet/Channel.py

@@ -0,0 +1,58 @@
+import asynchat
+import sys, traceback
+
+from rencode import loads, dumps
+
+class Channel(asynchat.async_chat):
+	endchars = '\0---\0'
+	def __init__(self, conn=None, addr=(), server=None):
+		asynchat.async_chat.__init__(self, conn)
+		self.addr = addr
+		self._server = server
+		self._ibuffer = ""
+		self.set_terminator(self.endchars)
+		self.sendqueue = []
+
+	def collect_incoming_data(self, data):
+		self._ibuffer += data
+
+	def found_terminator(self):
+		data = loads(self._ibuffer)
+		self._ibuffer = ""
+
+		if type(dict()) == type(data) and data.has_key('action'):
+			[getattr(self, n)(data) for n in ('Network_' + data['action'], 'Network') if hasattr(self, n)]
+		else:
+			print "OOB data:", data
+
+	def Pump(self):
+		[asynchat.async_chat.push(self, d) for d in self.sendqueue]
+		self.sendqueue = []
+
+	def Send(self, data):
+		self.sendqueue.append(dumps(data) + self.endchars)
+
+	def handle_connect(self):
+		if hasattr(self, "Connected"):
+			self.Connected()
+		else:
+			print "Unhandled Connected()"
+
+	def handle_error(self):
+		try:
+			self.close()
+		except:
+			pass
+		if hasattr(self, "Error"):
+			self.Error(sys.exc_info()[1])
+		else:
+			asynchat.async_chat.handle_error(self)
+
+	def handle_expt(self):
+		pass
+
+	def handle_close(self):
+		if hasattr(self, "Close"):
+			self.Close()
+		asynchat.async_chat.handle_close(self)
+