[Bprocessor-commit] /gui/src/net/sourceforge/bprocessor/gui/treeview GenericTreeView.java, 1.67, 1.68

[rimestad <rim...@us...>]

Update of /cvsroot/bprocessor//gui/src/net/sourceforge/bprocessor/gui/treeview
In directory sc8-pr-cvs3.sourceforge.net:/tmp/cvs-serv20014/src/net/sourceforge/bprocessor/gui/treeview

Modified Files:
	GenericTreeView.java 
Log Message:
indent correct and made use inheritdoc and not see in javadoc

Index: GenericTreeView.java
===================================================================
RCS file: /cvsroot/bprocessor//gui/src/net/sourceforge/bprocessor/gui/treeview/GenericTreeView.java,v
retrieving revision 1.67
retrieving revision 1.68
diff -C2 -d -r1.67 -r1.68
*** GenericTreeView.java	30 Nov 2006 22:03:51 -0000	1.67
--- GenericTreeView.java	2 Jan 2007 17:47:50 -0000	1.68
***************
*** 784,791 ****
        final Comparator num = 
          new Comparator() {
!         public int compare(Object s1, Object s2) {
!           return ((Surface) s1).getId().compareTo(((Surface) s2).getId());
!         }
!       };      
        LinkedList sort =  new LinkedList(elem);
        Collections.sort(sort, num);
--- 784,791 ----
        final Comparator num = 
          new Comparator() {
!           public int compare(Object s1, Object s2) {
!             return ((Surface) s1).getId().compareTo(((Surface) s2).getId());
!           }
!         };      
        LinkedList sort =  new LinkedList(elem);
        Collections.sort(sort, num);
***************
*** 839,846 ****
        final Comparator num = 
          new Comparator() {
!         public int compare(Object s1, Object s2) {
!           return ((Space) s1).getId().compareTo(((Space) s2).getId());
!         }
!       };      
        LinkedList sort =  new LinkedList(elem);
        Collections.sort(sort, num);
--- 839,846 ----
        final Comparator num = 
          new Comparator() {
!           public int compare(Object s1, Object s2) {
!             return ((Space) s1).getId().compareTo(((Space) s2).getId());
!           }
!         };      
        LinkedList sort =  new LinkedList(elem);
        Collections.sort(sort, num);
***************
*** 938,945 ****
        final Comparator num = 
          new Comparator() {
!         public int compare(Object s1, Object s2) {
!           return ((Constructor) s1).getId().compareTo(((Constructor) s2).getId());
!         }
!       };      
        LinkedList sort =  new LinkedList(elem);
        Collections.sort(sort, num);
--- 938,945 ----
        final Comparator num = 
          new Comparator() {
!           public int compare(Object s1, Object s2) {
!             return ((Constructor) s1).getId().compareTo(((Constructor) s2).getId());
!           }
!         };      
        LinkedList sort =  new LinkedList(elem);
        Collections.sort(sort, num);
***************
*** 1042,1049 ****
        final Comparator num = 
          new Comparator() {
!         public int compare(Object s1, Object s2) {
!           return ((Space) s1).getId().compareTo(((Space) s2).getId());
!         }
!       };      
        LinkedList sort =  new LinkedList(elem);
        Collections.sort(sort, num);
--- 1042,1049 ----
        final Comparator num = 
          new Comparator() {
!           public int compare(Object s1, Object s2) {
!             return ((Space) s1).getId().compareTo(((Space) s2).getId());
!           }
!         };      
        LinkedList sort =  new LinkedList(elem);
        Collections.sort(sort, num);
***************
*** 1128,1135 ****
        final Comparator num = 
          new Comparator() {
!         public int compare(Object s1, Object s2) {
!           return ((Vertex) s1).getId().compareTo(((Vertex) s2).getId());
!         }
!       };      
        LinkedList sort =  new LinkedList(elem);
        Collections.sort(sort, num);
--- 1128,1135 ----
        final Comparator num = 
          new Comparator() {
!           public int compare(Object s1, Object s2) {
!             return ((Vertex) s1).getId().compareTo(((Vertex) s2).getId());
!           }
!         };      
        LinkedList sort =  new LinkedList(elem);
        Collections.sort(sort, num);