Changeset 4923

Timestamp:

Jan 9, 2008, 4:25:07 PM (17 years ago)

Author:

duncan

Message:

removing obsolete code

File:

• anuga_core/source/anuga/pmesh/mesh.py (modified) (5 diffs)

anuga_core/source/anuga/pmesh/mesh.py

@@ -25 +25 @@
 
 
-#class NoTrianglesError(exceptions.Exception): pass
- 
-#import load_mesh
 from anuga.coordinate_transforms.geo_reference import Geo_reference, \
      DEFAULT_ZONE
@@ -53 +50 @@
     kinds = _kinds()
     
-#FIXME: this is not tested.
-from anuga.utilities.numerical_tools import gradient
-
-
 
 # 1st and third values must be the same
@@ -62 +55 @@
 initialconversions = ['', 'exterior', '']
 
-#from os import sep
-#sys.path.append('..'+sep+'pmesh')
-#print "sys.path",sys.path
 
 class MeshObject:
@@ -1603 +1593 @@
         return alpha_segs_no_user_segs, segs2delete, optimum_alpha
     
-    def _boundary2mesh_old(self, raw_boundary=True,
-                    remove_holes=False,
-                    smooth_indents=False,
-                    expand_pinch=False):
-        """
-        Precon there must be a shape object.
-        """
-        self.shape.set_boundary_type(raw_boundary=raw_boundary,
-                                 remove_holes=remove_holes,
-                                 smooth_indents=smooth_indents,
-                                 expand_pinch=expand_pinch)
-        boundary_segs = self.shape.get_boundary()
-        #print "boundary_segs",boundary_segs
-        segs2delete = self.alphaUserSegments
-
-        #FIXME(DSG-DSG) this algorithm needs comments
-        #FIXME(DSG-DSG) can it be sped up?  It's slow
-        new_segs = []
-        alpha_segs = []
-        user_segs = []
-        for seg in boundary_segs:
-            v1 = self.userVertices[int(seg[0])]
-            v2 = self.userVertices[int(seg[1])]
-            alpha_seg = self.representedAlphaUserSegment(v1, v2)
-            user_seg = self.representedUserSegment(v1, v2)
-            #DSG!!!
-            assert not(not (alpha_seg == None) and not (user_seg == None))
-            if not alpha_seg == None:
-                alpha_segs.append(alpha_seg)
-            elif not user_seg  == None:
-                user_segs.append(user_seg)
-            else:
-                unique_seg = Segment(v1, v2)
-                new_segs.append(unique_seg)
-                
-            for seg in alpha_segs:
-                try:
-                    segs2delete.remove(seg)
-                except:
-                    pass
-        
-        self.alphaUserSegments = []
-        self.alphaUserSegments.extend(new_segs)
-        self.alphaUserSegments.extend(alpha_segs)
-
-        optimum_alpha = self.shape.get_alpha()
-        # need to draw newsegs
-        return new_segs, segs2delete, optimum_alpha
     
     def representedAlphaUserSegment(self, v1,v2):
@@ -2439 +2381 @@
 
 
-
-
 def unique(s):
     """Return a list of the elements in s, but without duplicates.