Statistics
| Revision:

root / branches / v10 / extensions / extPublish / src / com / iver / cit / gvsig / publish / gui / view / PublicationTreeModel.java @ 13570

History | View | Annotate | Download (2.89 KB)

1
/* gvSIG. Sistema de Informaci?n Geogr?fica de la Generalitat Valenciana
2
 *
3
 * Copyright (C) 2004-2006 IVER T.I. and Generalitat Valenciana.
4
 *
5
 * This program is free software; you can redistribute it and/or
6
 * modify it under the terms of the GNU General Public License
7
 * as published by the Free Software Foundation; either version 2
8
 * of the License, or (at your option) any later version.
9
 *
10
 * This program is distributed in the hope that it will be useful,
11
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
13
 * GNU General Public License for more details.
14
 *
15
 * You should have received a copy of the GNU General Public License
16
 * along with this program; if not, write to the Free Software
17
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307,USA.
18
 *
19
 * For more information, contact:
20
 *
21
 *   Generalitat Valenciana
22
 *   Conselleria d'Infraestructures i Transport
23
 *   Av. Blasco Iba?ez, 50
24
 *   46010 VALENCIA
25
 *   SPAIN
26
 *
27
 *   +34 963862235
28
 *   gvsig@gva.es
29
 *   www.gvsig.gva.es
30
 *
31
 *    or
32
 *
33
 *   IVER T.I. S.A
34
 *   Salamanca 50
35
 *   46005 Valencia
36
 *   Spain
37
 *
38
 *   +34 963163400
39
 *   dac@iver.es
40
 */
41
package com.iver.cit.gvsig.publish.gui.view;
42

    
43
import java.util.Collection;
44
import java.util.HashMap;
45
import java.util.LinkedHashMap;
46
import java.util.Set;
47

    
48
import javax.swing.event.TreeModelListener;
49
import javax.swing.tree.TreeModel;
50
import javax.swing.tree.TreePath;
51

    
52
import com.iver.cit.gvsig.publish.serversModel.Publication;
53
import com.iver.cit.gvsig.publish.serversModel.Server;
54
import com.iver.cit.gvsig.publish.serversModel.Service;
55

    
56
public class PublicationTreeModel implements TreeModel {
57
        Publication publication = null;
58
        
59
        public PublicationTreeModel(Publication p){
60
                publication = p;
61
        }
62
        
63
        public void addTreeModelListener(TreeModelListener l) {
64
                // TODO Auto-generated method stub
65

    
66
        }
67

    
68
        public int getChildCount(Object parent) {
69
                if (parent instanceof Server){
70
                        Server server = (Server) parent;
71
                        return server.getServicesCount();
72
                }
73
                return 0;
74
        }
75

    
76
        public int getIndexOfChild(Object parent, Object child) {
77
                // TODO Auto-generated method stub
78
                return 0;
79
        }
80

    
81
        public Object getRoot() {
82
                return publication.getServer();                
83
        }
84

    
85
        public boolean isLeaf(Object node) {
86
                if (node instanceof Server){                        
87
                        return false;
88
                }
89
                if (node instanceof Service){
90
                        return true;
91
                }
92
                return false;
93
        }
94

    
95
        public void removeTreeModelListener(TreeModelListener l) {
96
                // TODO Auto-generated method stub
97

    
98
        }
99

    
100
        public void valueForPathChanged(TreePath path, Object newValue) {
101
                // TODO Auto-generated method stub
102

    
103
        }
104
        /**
105
         * TODO: I think we can improve the performance, each time you
106
         * want a child you are getting all the Collection
107
         */
108
        public Object getChild(Object parent, int index) {
109
                if (parent instanceof Server){
110
                        Server server = (Server) parent;
111
                        return server.getService(index);
112
                }
113
                
114
                return null;
115
        }
116

    
117
}