Application: gvSIG desktop » gvSIG raster

/* gvSIG. Geographic Information System of the Valencian Government

*

* Copyright (C) 2007-2008 Infrastructures and Transports Department

* of the Valencian Government (CIT)

* 

* This program is free software; you can redistribute it and/or

* modify it under the terms of the GNU General Public License

* as published by the Free Software Foundation; either version 2

* of the License, or (at your option) any later version.

* 

* This program is distributed in the hope that it will be useful,

* but WITHOUT ANY WARRANTY; without even the implied warranty of

* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

* GNU General Public License for more details.

* 

* You should have received a copy of the GNU General Public License

* along with this program; if not, write to the Free Software

* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, 

* MA  02110-1301, USA.

* 

*/

package org.gvsig.raster.wmts.app.wmtsclient.gui.wizard;

import java.util.ArrayList;

import java.util.Collection;

import java.util.TreeSet;

import javax.swing.AbstractListModel;

/**

 * Data model for a list of SRSs

 */

public class WMTSParametersListModel extends AbstractListModel {

        private static final long serialVersionUID = 1L;

        ArrayList<Object> srs = new ArrayList<Object>();

        public WMTSParametersListModel(ArrayList<Object> obj) {

                srs = obj;

        }

        public WMTSParametersListModel() {

        }

        public int getSize() {

                return srs.size();

        }

        public Object getElementAt(int index) {

                if(srs.size() > 0 && index >= 0 && index < srs.size())

                        return srs.get(index);

                return null;

        }

        public void removeAllItems() {

                srs.clear();

        }

        public void setAll(Collection<Object> c) {

                srs.clear();

                srs.addAll(c);

        }

        public Collection<Object> intersect(Collection<Object> c) {

                TreeSet<Object> resul = new TreeSet<Object>();

            for (int i = 0; i < srs.size(); i++) {

                        if (c.contains(srs.get(i)))

                                resul.add(srs.get(i));

                }

            return resul;        

        }

}