[Bprocessor-commit] model/src/net/sourceforge/bprocessor/model SurfaceSorter.java, 1.1, 1.2 Sorter.java, 1.3, 1.4

[Michael L. <he...@us...>]

Update of /cvsroot/bprocessor/model/src/net/sourceforge/bprocessor/model
In directory sc8-pr-cvs3.sourceforge.net:/tmp/cvs-serv16915/src/net/sourceforge/bprocessor/model

Modified Files:
	SurfaceSorter.java Sorter.java 
Log Message:
A little progress on surface sorting

Index: SurfaceSorter.java
===================================================================
RCS file: /cvsroot/bprocessor/model/src/net/sourceforge/bprocessor/model/SurfaceSorter.java,v
retrieving revision 1.1
retrieving revision 1.2
diff -C2 -d -r1.1 -r1.2
*** SurfaceSorter.java	3 May 2007 09:40:38 -0000	1.1
--- SurfaceSorter.java	7 May 2007 09:48:44 -0000	1.2
***************
*** 27,31 ****
      Vertex normal = surface.normal();
      Vertex direction = edge.getDirection();
!     return null;
    }
  }
--- 27,31 ----
      Vertex normal = surface.normal();
      Vertex direction = edge.getDirection();
!     return new Entry(surface, 0 , 1);
    }
  }

Index: Sorter.java
===================================================================
RCS file: /cvsroot/bprocessor/model/src/net/sourceforge/bprocessor/model/Sorter.java,v
retrieving revision 1.3
retrieving revision 1.4
diff -C2 -d -r1.3 -r1.4
*** Sorter.java	3 May 2007 09:40:38 -0000	1.3
--- Sorter.java	7 May 2007 09:48:44 -0000	1.4
***************
*** 65,79 ****
    /**
     * Sort a list of edges around some vertex
!    * @param edges List of edges
!    * @return Sorted list of edges
     */
!   public List<T> sort(List<T> edges) {
      List result = new LinkedList();
!     if (!edges.isEmpty()) {
        {
          List left = new LinkedList();
          List right = new LinkedList();
  
!         for (T current : edges) {
            Entry entry = entryFor(current);
            if (entry.dx == 0) {
--- 65,79 ----
    /**
     * Sort a list of edges around some vertex
!    * @param objects List of objects to sort
!    * @return Sorted list of objects
     */
!   public List<T> sort(List<T> objects) {
      List result = new LinkedList();
!     if (!objects.isEmpty()) {
        {
          List left = new LinkedList();
          List right = new LinkedList();
  
!         for (T current : objects) {
            Entry entry = entryFor(current);
            if (entry.dx == 0) {