Application: gvSIG desktop

<?xml version="1.0" encoding="UTF-8" ?>

<!--

    gvSIG. Desktop Geographic Information System.

    Copyright (C) 2007-2013 gvSIG Association.

    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 3

    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.

    For any additional information, do not hesitate to contact us

    at info AT gvsig.com, or visit our website www.gvsig.com.

-->

<xs:schema targetNamespace="http://www.gvsig.gva.es"

        xmlns:xs="http://www.w3.org/2001/XMLSchema">

  <xs:element name="xmlCastor">

    <xs:complexType>

    <xs:sequence>

        <xs:element ref="xml-tag" minOccurs="0" maxOccurs="unbounded" />

      </xs:sequence>

    </xs:complexType>

  </xs:element>

  <xs:element name="property">

    <xs:complexType>

      <xs:attribute name="key" type="xs:string" use="required" />

      <xs:attribute name="value" type="xs:string" use="optional" />

    </xs:complexType>

  </xs:element>

  <xs:element name="xml-tag">

    <xs:complexType>

      <xs:sequence>

        <xs:element ref="property" minOccurs="0" maxOccurs="unbounded" />

        <xs:element ref="xml-tag" minOccurs="0" maxOccurs="unbounded" />

      </xs:sequence>

      <xs:attribute name="name" type="xs:string" use="optional" />

    </xs:complexType>

  </xs:element>

</xs:schema>

org.gvsig.tools.IverUtilesLibrary

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * 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 3

 * 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.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.tools.backup;

/* 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.

 * 

 */

/**

 * <p>Factory that gets a {@link DefaultBackupGenerator DefaultBackupGenerator} as a particular version of

 *  backup generator.</p>

 *

 * @author Jose Ignacio Yarza (jiyarza@opensistemas.com)

 * @author Pablo Piqueras Bartolom? (pablo.piqueras@iver.es)

 */

public class DefaultBackupGeneratorFactory extends BackupGeneratorFactory {

	/*

	 * (non-Javadoc)

	 * @see com.iver.utiles.backup.BackupGeneratorFactory#getBackupGenerator()

	 */

	public BackupGenerator getBackupGenerator() {		

		return new DefaultBackupGenerator();

	}

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * 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 3

 * 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.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.tools.backup;

/* 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.

 * 

 */

import java.io.File;

import org.gvsig.tools.backup.exceptions.BackupException;

/**

 * <p>A tagging interface that all file backups must implement.</p>

 *

 * @author Jose Ignacio Yarza (jiyarza@opensistemas.com)

 * @author Pablo Piqueras Bartolom? (pablo.piqueras@iver.es)

 */

public interface BackupGenerator {

	/**

	 * <p>Performs a backup of <code>source</code>.</p>

	 * 

	 * @param source the source file

	 */

	public void backup(File source) throws BackupException;

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * 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 3

 * 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.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.tools.backup;

/* 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.

 * 

 */ 

import java.io.File;

import java.io.FileInputStream;

import java.io.FileOutputStream;

import java.nio.channels.FileChannel;

import org.gvsig.tools.backup.exceptions.BackupException;

/**

 * <p>Performs a backup of a file, into another file at the same path (directory), with the file extension 

 *  changed to <i>.bak</i>.</p>

 *

 * @author Jose Ignacio Yarza (jiyarza@opensistemas.com)

 * @author Pablo Piqueras Bartolom? (pablo.piqueras@iver.es)

 */

public class DefaultBackupGenerator implements BackupGenerator {

	/*

	 * (non-Javadoc)

	 * @see com.iver.utiles.backup.BackupGenerator#backup(java.io.File)

	 */

	public void backup(File source) throws BackupException {

		try {

			int index = source.getAbsolutePath().lastIndexOf(".");

			if (index == -1)

				return;

			File dest = new File(source.getAbsolutePath().substring(0, index) + ".bak");

	        // Create channel on the source

	        FileChannel srcChannel = new FileInputStream(source).getChannel();

	        // Create channel on the destination

	        FileChannel dstChannel = new FileOutputStream(dest).getChannel();

	        // Copy file contents from source to destination

	        dstChannel.transferFrom(srcChannel, 0, srcChannel.size());

	        // Close the channels

	        srcChannel.close();

	        dstChannel.close();

	    } catch (Exception ex) {

	    	throw new BackupException(ex.getMessage(), ex, source);

	    }

	}

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * 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 3

 * 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.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.tools.backup.exceptions;

/* 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.

 * 

 */

import java.io.File;

/**

 * <p>Exception to report that a backup process has failed.</p>

 *

 * @author Pablo Piqueras Bartolom? (pablo.piqueras@iver.es)

 */

public class BackupException extends Exception {

	private static final long serialVersionUID = -2846421984617208883L;

	/**

	 * <p>The source file to be backup.</p>

	 */

	protected File source;

	/**

	 * <p>Constructs a new backup exception with the specified detail message and cause.</p>

	 * 

	 * @param message the detail message (which is saved for later retrieval by the <code>getMessage()</code> method).

	 * @param cause the cause (which is saved for later retrieval by the <code>getCause()</code> method). (A <code>null</code>

	 *  value is permitted, and indicates that the cause is nonexistent or unknown.)

	 * @param source the file from that was going to be done a backup

	 * 

	 * @see Exception#Exception(String, Throwable)

	 */

	public BackupException(String message, Throwable cause, File source) {

		super(message, cause);

		this.source = source;

	}

	/**

	 * <p>Gets the source file to be backup.</p> 

	 * 

	 * @return the source file

	 */

	public File getSource() {

		return source;

	}

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * 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 3

 * 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.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.tools.backup;

/* 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.

 * 

 */

/**

 * <p>Generic factory that creates a {@link BackupGenerator BackupGenerator} that performs a particular

 *  kind of backup.</p>

 *

 * @author Jose Ignacio Yarza (jiyarza@opensistemas.com)

 * @author Pablo Piqueras Bartolom? (pablo.piqueras@iver.es)

 */

public abstract class BackupGeneratorFactory {

	/**

	 * <p>Gets an instance of a backup generator that performs a particular kind of backup.</p>

	 * 

	 * @return an instance of a backup generator that performs a particular kind of backup

	 */

	public abstract BackupGenerator getBackupGenerator();

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * 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 3

 * 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.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.tools;

import org.gvsig.tools.library.AbstractLibrary;

import org.gvsig.tools.library.LibraryException;

import org.gvsig.utils.swing.jcomboServer.ServerData;

public class IverUtilesLibrary extends AbstractLibrary {

    @Override

    public void doRegistration() {

        registerAsAPI(IverUtilesLibrary.class);

    }

	@Override

	protected void doInitialize() throws LibraryException {

		// Nothing to do

	}

	@Override

	protected void doPostInitialize() throws LibraryException {

		ServerData.registerPersistence();

	}

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * 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 3

 * 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.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.utils.search;

import java.util.ArrayList;

import java.util.Arrays;

import java.util.Comparator;

import java.util.List;

import java.util.Vector;

import org.gvsig.utils.MathExtension;

/* gvSIG. Sistema de Informaci?n Geogr?fica de la Generalitat Valenciana

 *

 * Copyright (C) 2004 IVER T.I. and Generalitat Valenciana.

 *

 * 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., 59 Temple Place - Suite 330, Boston, MA  02111-1307,USA.

 *

 * For more information, contact:

 *

 *  Generalitat Valenciana

 *   Conselleria d'Infraestructures i Transport

 *   Av. Blasco Ib??ez, 50

 *   46010 VALENCIA

 *   SPAIN

 *

 *      +34 963862235

 *   gvsig@gva.es

 *      www.gvsig.gva.es

 *

 *    or

 *

 *   IVER T.I. S.A

 *   Salamanca 50

 *   46005 Valencia

 *   Spain

 *

 *   +34 963163400

 *   dac@iver.es

 */

/**

 * This class has static methods that return items that their beginning text value matches with a text pattern. <br>

 * It's necessary that items of the parameter array (Vector) were sort ordered according to their text value. <br>

 * Supports Vectors with and without repeated items.

 * 

 * There are four methods, that are a modification of a binary search algorithm of search, getting a rank of items:

 * <ul>

 * <li>Considering case sensitive in the search.</li>

 * <li>Ignoring case sensitive in the search.</li>

 * <li>Considering case sensitive in the search and an object which implements the Comparable interface</li>

 * <li>Ignoring case sensitive in the search, but yes an objecth which implements the Comparable interface</li>

 * </ul>

 *

 * @author Pablo Piqueras Bartolom? (pablo.piqueras@iver.es)

 */

public class BinarySearchUsingFirstCharacters {

	/**

	 * This method should be used when is wanted to distinguish small letters from capital letters during the search.

	 *

	 * It's necessary that all items of the array implement the {@link Comparable} interface.<br>

	 * And it's also necessary that the value returned by the <i>toString()</i> method of each item (supposing

	 *   they inherit from Object) would be the expected value user saw (that would be used to compare the items).

	 *

	 * @param text java.lang.String

	 * @param sortOrderedItems java.util.Vector

	 */

	public synchronized static List doSearchConsideringCaseSensitive(String text, Vector sortOrderedItems) {

		int currentIteration = 0;

		int size = sortOrderedItems.size();

		int maxNumberOfIterations = (int) MathExtension.log2(size);

		int lowIndex = 0;

		int highIndex = sortOrderedItems.size() - 1;

		int mIndx;

		while ((lowIndex <= highIndex) && (currentIteration <= maxNumberOfIterations)) {

			mIndx = ( lowIndex + highIndex ) / 2;

			if ( sortOrderedItems.get( mIndx ).toString().startsWith( text ) ) {

				lowIndex = highIndex = mIndx;

				highIndex ++;

				// Expand the rank to up

				while ( ( highIndex < size ) && ( sortOrderedItems.get( highIndex ).toString().startsWith( text ) ) ) {

					highIndex ++;

				}

				// Expand the rank to down

				while ( ( (lowIndex - 1) > -1 ) && ( sortOrderedItems.get( (lowIndex - 1) ).toString().startsWith( text ) ) ) {

					lowIndex --;

				}

				// It's possible that items with different case, should be between the same case, then this item will be added individually:

				List list = new Vector(sortOrderedItems.subList(lowIndex, highIndex));

				// Expand to down

				lowIndex --;

				while ( ( lowIndex > -1 ) && ( sortOrderedItems.get( (lowIndex ) ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) ) {

					if (sortOrderedItems.get( lowIndex ).toString().startsWith( text )) {

						list.add(0, sortOrderedItems.get( lowIndex ));

					}

					lowIndex --;

				}

				// Expand to up

				while ( ( highIndex < size ) && ( sortOrderedItems.get( highIndex ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) ) {

					if (sortOrderedItems.get( highIndex ).toString().startsWith( text )) {

						list.add(list.size(), sortOrderedItems.get( highIndex ));

					}

					highIndex ++;

				}

				// Returns all items in the rank

				return list; // Breaks the loop

			}

			else {

				if ( sortOrderedItems.get( mIndx ).toString().compareTo( text ) > 0 ) {

					highIndex = mIndx - 1;

				}

				else {

					lowIndex = mIndx + 1;

				}

			}

			currentIteration ++;

		}

		// If no item has been found -> return null

		return null;

	}

	/**

	 * This method should be used when is wanted not to distinguish small letters from capital letters during the search.

	 *

	 * It's necessary that all items of the array implement the {@link Comparable} interface.<br>

	 * And it's also necessary that the value returned by the <i>toString()</i> method of each item (supposing

	 *   they inherit from Object) would be the expected value user saw (that would be used to compare the items).

	 *

	 * In this particular situation, it's supposed that the vector is sort ordered according the default algorithm of Java; this has the problem that

	 *   it doesn't consideres the special characters and the orthographic rules of languages that aren't English, and then, for a particular

	 *   <i>text</i> search, an incorrect result could be obtained. The solution decided for this problem has been to modify the algorithm, for seach

	 *   into two ranks.

	 *

	 * @param text java.lang.String

	 * @param sortOrderedItems java.util.Vector

	 */

	public synchronized static List doSearchIgnoringCaseSensitive(String text, Vector sortOrderedItems) {

		int currentIteration = 0;

		int size = sortOrderedItems.size();

		int maxNumberOfIterations = (int) MathExtension.log2(size);

		int lowIndex = 0;

		int highIndex = sortOrderedItems.size() - 1;

		int mIndx;

		List list = null;

		List list2 = null;

		// FIRST RANK

		while ((lowIndex <= highIndex) && (currentIteration <= maxNumberOfIterations)) {

			mIndx = ( lowIndex + highIndex ) / 2;

			if ( sortOrderedItems.get( mIndx ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) {

				lowIndex = highIndex = mIndx;

				highIndex ++;

				// Expand the rank to up

				while ( ( highIndex < size ) && ( sortOrderedItems.get( highIndex ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) ) {

					highIndex ++;

				}

				// Expand the rank to down

				while ( ( (lowIndex - 1) > -1 ) && ( sortOrderedItems.get( (lowIndex - 1) ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) ) {

					lowIndex --;

				}

				// Returns all items in the rank

				list = Arrays.asList((sortOrderedItems.subList(lowIndex, highIndex)).toArray());

				break;

			}

			else {

				if ( sortOrderedItems.get( mIndx ).toString().compareTo( text ) > 0 ) {

					highIndex = mIndx - 1;

				}

				else {

					lowIndex = mIndx + 1;

				}

			}

			currentIteration ++;

		}

		// SECOND RANK

		currentIteration = 0;

		lowIndex = 0;

		highIndex = sortOrderedItems.size() - 1;

		while ((lowIndex <= highIndex) && (currentIteration <= maxNumberOfIterations)) {

			mIndx = ( lowIndex + highIndex ) / 2;

			if ( sortOrderedItems.get( mIndx ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) {

				lowIndex = highIndex = mIndx;

				highIndex ++;

				// Expand the rank to up

				while ( ( highIndex < size ) && ( sortOrderedItems.get( highIndex ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) ) {

					highIndex ++;

				}

				// Expand the rank to down

				while ( ( (lowIndex - 1) > -1 ) && ( sortOrderedItems.get( (lowIndex - 1) ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) ) {

					lowIndex --;

				}

				// Returns all items in the rank

				list2 = Arrays.asList((sortOrderedItems.subList(lowIndex, highIndex)).toArray()); // Breaks the loop

				if (list == null)

					return list2;

				else {

					if (list2 == null)

						return null;

					Object obj;

					int j;

					list = new ArrayList(list.subList(0, list.size()));

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

						obj = list2.get(i);

						// Don't add items which are already in the list

						if (!list.contains(obj)) {

							// Adds in sort order the new item:

							for (j = 0; j < list.size(); j ++) {

								if (list.get(j).toString().compareTo(obj.toString()) > 0)

									break;

							}

							list.add(j, obj);

						}

					}

					// It's possible that some elements at the end wouldn't be found -> another small search

					size = list.size();

					if (size == 0) {

						j = 0;

					}

					else {

						j = sortOrderedItems.indexOf(list.get(size - 1));

					}

					j++;

					if (j < sortOrderedItems.size()) {

						do {

							obj = sortOrderedItems.get( j );

							if (obj.toString().toLowerCase().startsWith( text.toLowerCase())) {

								list.add(size, obj);

							}

							j++;

						}

						while (j < sortOrderedItems.size());

					}

					return list;

				}

			}

			else {

				if ( sortOrderedItems.get( mIndx ).toString().toLowerCase().compareTo( text.toLowerCase() ) > 0 ) {

					highIndex = mIndx - 1;

				}

				else {

					lowIndex = mIndx + 1;

				}

			}

			currentIteration ++;

		}

		return null;

	}

//	/** THIS VERSION FAILURES IN SOME PARTICULAR SITUATIONS

//	 * This method should be used when is wanted distinguish small letters from capital letters during the search, and the comparation of items

//	 *   done according an algorithm we define.

//	 *

//	 * And it's also necessary that the value returned by the <i>toString()</i> method of each item (supposing

//	 *   they inherit from Object) would be the expected value user saw (that would be used to compare the items).

//	 *

//	 * @param text java.lang.String

//	 * @param sortOrderedItems java.util.Vector

//	 * @param comp An Comparator object which implements the <i><b>compareTo()</b><i>  method.

//	 */

//	public synchronized static List doSearchConsideringCaseSensitive(String text, Vector sortOrderedItems, Comparator comp) {

//		int currentIteration = 0;

//		int size = sortOrderedItems.size();

//		int maxNumberOfIterations = (int) MathExtension.log2(size);

//		int lowIndex = 0;

//		int highIndex = sortOrderedItems.size() - 1;

//		int mIndx;

//

//

//		while ((lowIndex <= highIndex) && (currentIteration <= maxNumberOfIterations)) {

//			mIndx = ( lowIndex + highIndex ) / 2;

//

//			if ( sortOrderedItems.get( mIndx ).toString().startsWith( text ) ) {

//				lowIndex = highIndex = mIndx;

//				highIndex ++;

//

//				// Expand the rank to up

//				while ( ( highIndex < size ) && ( sortOrderedItems.get( highIndex ).toString().startsWith( text ) ) ) {

//					highIndex ++;

//				}

//

//				// Expand the rank to down

//				while ( ( (lowIndex - 1) > -1 ) && ( sortOrderedItems.get( (lowIndex - 1) ).toString().startsWith( text ) ) ) {

//					lowIndex --;

//				}

//

//				// It's possible that items with different case, should be between the same case, then this item will be added individually:

//				List list = new Vector(sortOrderedItems.subList(lowIndex, highIndex));

//

//

//				// Expand to down

//				lowIndex --;

//				while ( ( lowIndex > -1 ) && ( sortOrderedItems.get( (lowIndex ) ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) ) {

//					if (sortOrderedItems.get( lowIndex ).toString().startsWith( text )) {

//						list.add(0, sortOrderedItems.get( lowIndex ));

//					}

//

//					lowIndex --;

//				}

//

//				// Expand to up

//				while ( ( highIndex < size ) && ( sortOrderedItems.get( highIndex ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) ) {

//					if (sortOrderedItems.get( highIndex ).toString().startsWith( text )) {

//						list.add(list.size(), sortOrderedItems.get( highIndex ));

//					}

//

//					highIndex ++;

//				}

//

//				// Returns all items in the rank

//				return list; // Breaks the loop

//			}

//			else {

//				if ( comp.compare(sortOrderedItems.get( mIndx ), text ) > 0 ) {

//					highIndex = mIndx - 1;

//				}

//				else {

//					lowIndex = mIndx + 1;

//				}

//			}

//

//			currentIteration ++;

//		}

//

//		// If no item has been found -> return null

//		return null;

//	}

	/**

	 * This method should be used when is wanted distinguish small letters from capital letters during the search, and the comparation of items

	 *   done according an algorithm we define.

	 *

	 * And it's also necessary that the value returned by the <i>toString()</i> method of each item (supposing

	 *   they inherit from Object) would be the expected value user saw (that would be used to compare the items).

	 *

	 * @param text java.lang.String

	 * @param sortOrderedItems java.util.Vector

	 * @param comp An Comparator object which implements the <i><b>compareTo()</b><i>  method.

	 */

	public synchronized static List doSearchConsideringCaseSensitive(String text, Vector sortOrderedItems, Comparator comp) {

		List results_list = doSearchIgnoringCaseSensitive(text, sortOrderedItems, comp);

		if (results_list == null)

			return null;

		List results = new ArrayList();

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

			if (results_list.get(i).toString().startsWith(text)) {

				results.add(results_list.get(i));

			}

		}

		return results;

	}

	/**

	 * This method should be used when is wanted not to distinguish small letters from capital letters during the search, and the comparation of items

	 *   done according an algorithm we define.

	 *

	 * And it's also necessary that the value returned by the <i>toString()</i> method of each item (supposing

	 *   they inherit from Object) would be the expected value user saw (that would be used to compare the items).

	 *

	 * @param text java.lang.String

	 * @param sortOrderedItems java.util.Vector

	 * @param comp An Comparator object which implements the <i><b>compareTo()</b><i>  method.

	 */

	public synchronized static List doSearchIgnoringCaseSensitive(String text, Vector sortOrderedItems, Comparator comp) {

		int currentIteration = 0;

		int size = sortOrderedItems.size();

		int maxNumberOfIterations = (int) MathExtension.log2(size);

		int lowIndex = 0;

		int highIndex = sortOrderedItems.size() - 1;

		int mIndx;

		while ((lowIndex <= highIndex) && (currentIteration <= maxNumberOfIterations)) {

			mIndx = ( lowIndex + highIndex ) / 2;

			if ( sortOrderedItems.get( mIndx ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) {

				lowIndex = highIndex = mIndx;

				highIndex ++;

				// Expand the rank to up

				while ( ( highIndex < size ) && ( sortOrderedItems.get( highIndex ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) ) {

					highIndex ++;

				}

				// Expand the rank to down

				while ( ( (lowIndex - 1) > -1 ) && ( sortOrderedItems.get( (lowIndex - 1) ).toString().toLowerCase().startsWith( text.toLowerCase() ) ) ) {

					lowIndex --;

				}

				// Returns all items in the rank

				return Arrays.asList((sortOrderedItems.subList(lowIndex, highIndex)).toArray()); // Breaks the loop

			}

			else {

				if ( comp.compare(sortOrderedItems.get( mIndx ).toString().toLowerCase(), text.toLowerCase() ) > 0 ) {

					highIndex = mIndx - 1;

				}

				else {

					lowIndex = mIndx + 1;

				}

			}

			currentIteration ++;

		}

		return null;

	}

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * 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 3

 * 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.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

/*

 * Created on 19-oct-2004

 *

 * TODO To change the template for this generated file go to

 * Window - Preferences - Java - Code Generation - Code and Comments

 */

/* gvSIG. Sistema de Informaci?n Geogr?fica de la Generalitat Valenciana

 *

 * Copyright (C) 2004 IVER T.I. and Generalitat Valenciana.

 *

 * 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., 59 Temple Place - Suite 330, Boston, MA  02111-1307,USA.

 *

 * For more information, contact:

 *

 *  Generalitat Valenciana

 *   Conselleria d'Infraestructures i Transport

 *   Av. Blasco Ib??ez, 50

 *   46010 VALENCIA

 *   SPAIN

 *

 *      +34 963862235

 *   gvsig@gva.es

 *      www.gvsig.gva.es

 *

 *    or

 *

 *   IVER T.I. S.A

 *   Salamanca 50

 *   46005 Valencia

 *   Spain

 *

 *   +34 963163400

 *   dac@iver.es

 */

package org.gvsig.utils;

/**

 * @author FJP

 * 

 * TODO To change the template for this generated type comment go to Window -

 * Preferences - Java - Code Generation - Code and Comments

 */

import java.io.File;

import javax.swing.filechooser.FileFilter;

/*

 * ImageFilter.java

 * 

 */

public class ImageFilter extends FileFilter

{

	//Accept all directories and all gif, jpg, tiff, or png files.

	public boolean accept(File f)

	{

		if (f.isDirectory()) { 

			return true; }

		String extension = Utils.getExtension(f);

		if (extension != null) 

		{

			if (extension.equals(Utils.tiff) || extension.equals(Utils.tif) || 

					extension.equals(Utils.gif) || extension.equals(Utils.jpeg) || 

					extension.equals(Utils.jpg) || extension.equals(Utils.png))

			{

				return true;

			} 

			else

			{

				return false;

			}

		}

		return false; } //The description of this filter

	public String getDescription() { return "Just Images"; }

	} 

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * 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 3

 * 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.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

/* gvSIG. Sistema de Informaci?n Geogr?fica de la Generalitat Valenciana

*

* Copyright (C) 2004 IVER T.I. and Generalitat Valenciana.

*

* 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., 59 Temple Place - Suite 330, Boston, MA  02111-1307,USA.

*

* For more information, contact:

*

*  Generalitat Valenciana

*   Conselleria d'Infraestructures i Transport

*   Av. Blasco Ib??ez, 50

*   46010 VALENCIA

*   SPAIN

*

*      +34 963862235

*   gvsig@gva.es

*      www.gvsig.gva.es

*

*    or

*

*   IVER T.I. S.A

*   Salamanca 50

*   46005 Valencia

*   Spain

*

*   +34 963163400

*   dac@iver.es

*/

package org.gvsig.utils;

import java.util.Calendar;

import java.util.Date;

import java.util.GregorianCalendar;

import java.util.Locale;

/**

 * This class contains static methods to manage Dates. It was principally 

 * created because of some problems doing the "String do DateTime" 

 * and the "DateTime to String" conversions.  

 * 

 * @author Jorge Piera Llodr? (piera_jor@gva.es)

 */

public class DateTime {

/**

 * returns the current date

 * 

 * 

 * @return java.util.Date

 */

    public static Date getCurrentDate() {        

        Calendar cal = new GregorianCalendar();

        return cal.getTime();

    } 

/**

 * It trnasforms one date in one String

 * 

 * 

 * @return A String

 * @param dtK Date

 * @param sFormat Date format. Example: "Y-m-d H:i:s.Z";

 */

    public static String dateToString(Date dtK, String sFormat) {        

        String sDate;

        int nYear;

        int nMonth;

        int nDay;

        int nHour;

        int nMinute;

        int nSecond;

        int nMS;

        Calendar clnK;

        String sf;

        int jc;

        clnK = Calendar.getInstance(Locale.US);

        clnK.setTime(dtK);

        nYear = clnK.get(Calendar.YEAR);

        nMonth = 1 + clnK.get(Calendar.MONTH);

        nDay = clnK.get(Calendar.DAY_OF_MONTH);

        nHour = clnK.get(Calendar.HOUR_OF_DAY);

        nMinute = clnK.get(Calendar.MINUTE);

        nSecond = clnK.get(Calendar.SECOND);

        nMS = clnK.get(Calendar.MILLISECOND);

        sDate = "";

        for (jc = 0; jc < sFormat.length(); jc++) {

            switch (sFormat.charAt(jc)) {

                case 'Y':

                    sDate += nYear;

                    break;

                case 'm':

                    sf = "" + nMonth;

                    if (nMonth < 10) {

                        sf = "0" + sf;

                    }

                    sDate += sf;

                    break;

                case 'd':

                    sf = "" + nDay;

                    if (nDay < 10) {

                        sf = "0" + sf;

                    }

                    sDate += sf;

                    break;

                case 'H':

                    sf = "" + nHour;

                    if (nHour < 10) {

                        sf = "0" + sf;

                    }

                    sDate += sf;

                    break;

                case 'i':

                    sf = "" + nMinute;

                    if (nMinute < 10) {

                        sf = "0" + sf;

                    }

                    sDate += sf;

                    break;

                case 's':

                    sf = "" + nSecond;

                    if (nSecond < 10) {

                        sf = "0" + sf;

                    }

                    sDate += sf;

                    break;

                case 'Z':

                    sf = "" + nMS;

                    if (nMS < 10) {

                        sf = "0" + sf;

                    }

                    sDate += sf;

                    break;

                default:

                    sDate += sFormat.substring(jc, jc + 1);

            }

        }

        return sDate;

    } 

/**

 * It transfoms one String in one Date

 * 

 * 

 * @return Date

 * @param sDate String

 */

    public static Date stringToDate(String sDate) {        

        Date dtRes;

        Calendar clnK;

        int nYear;

        int nMonth;

        int nDay;

        int nHour;

        int nMinute;

        int nSecond;

        int nMS;

        String sf;

        for (; sDate.length() < 23;)

            sDate += "0";

        sf = sDate.substring(0, 4);

        nYear = Integer.parseInt(sf);

        sf = sDate.substring(5, 7);

        nMonth = Integer.parseInt(sf) - 1;

        sf = sDate.substring(8, 10);

        nDay = Integer.parseInt(sf);

        sf = sDate.substring(11, 13);

        nHour = Integer.parseInt(sf);

        sf = sDate.substring(14, 16);

        nMinute = Integer.parseInt(sf);

        sf = sDate.substring(17, 19);

        nSecond = Integer.parseInt(sf);

        sf = sDate.substring(20, 23);

        nMS = Integer.parseInt(sf);

        clnK = Calendar.getInstance(Locale.US);

        clnK.set(nYear, nMonth, nDay, nHour, nMinute, nSecond);

        clnK.set(Calendar.MILLISECOND, nMS);

        dtRes = new Date();

        dtRes = clnK.getTime();

        //	    sf=dateToString(dtRes,"Y-m-d H:i:s.Z");

        return dtRes;

    } 

 }

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * 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 3

 * 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.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

package org.gvsig.utils;

/**

 * <p>Any object that needs store its data to restore it after, should implement <code>IPersistence</code>.</p>

 *

 * <p>The process of persisting (for instance in a file) the information of an object using XML is named <i>Marshall</i>,

 *  whereas the inverse process in named <i>Unmarshall</i>.</p>

 *

 * <p>It's necessary specify the name of the class that will be persisted or restored.</p>

 *

 * @author fjp

 */

public interface IPersistence {

	/**

	 * <p>Gets the class name of the object.</p>

	 *

	 * @return the class name of the object

	 */

    String getClassName();

    /**

     * <p>Returns an XML entity with all necessary information of the object to <i>marshall</i>.</p>

     *

     * @return the XML entity with all necessary information of the object

     */

    XMLEntity getXMLEntity() throws XMLException;

    /**

     * <p>Sets an XML entity with all necessary information of the object.</p>

     *

     * @param xml the XML entity with all necessary information of the object

     */

    void setXMLEntity(XMLEntity xml) throws XMLException;

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * 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 3

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