Application: gvSIG desktop

/**

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

 */

/* CVS MESSAGES:

*

* $Id: TestXMLEntity.java 30754 2009-09-09 06:42:28Z cordinyana $

* $Log$

* Revision 1.7  2007-03-05 11:15:43  jaume

* *** empty log message ***

*

* Revision 1.6  2007/03/05 10:03:12  jaume

* *** empty log message ***

*

* Revision 1.5  2007/03/05 09:00:11  jaume

* *** empty log message ***

*

* Revision 1.4  2007/03/02 13:35:56  jaume

* *** empty log message ***

*

* Revision 1.3  2007/03/02 13:27:32  jaume

* *** empty log message ***

*

* Revision 1.2  2007/03/02 13:24:53  jaume

* *** empty log message ***

*

* Revision 1.1  2007/03/02 13:23:50  jaume

* *** empty log message ***

*

* Revision 1.1  2006/08/29 06:18:17  jaume

* *** empty log message ***

*

*

*/

package org.gvsig.utils;

import java.io.File;

import java.io.FileReader;

import org.gvsig.tools.junit.AbstractLibraryAutoInitTestCase;

import org.gvsig.utils.xmlEntity.generate.XmlTag;

public class TestXMLEntity extends AbstractLibraryAutoInitTestCase {

	private XMLEntity x1, x2, x3, x4;

	private XMLEntity gvp1;

	private XMLEntity gvp2;

	@Override

	protected void doSetUp() throws Exception {

		x1 = new XMLEntity();

		x2 = new XMLEntity();

		x3 = new XMLEntity();

		final Object obj1 = new XMLEntity();

		final Object obj2 = new XMLEntity();

		final Object obj3 = "StringClass";

		x1.putProperty("boolean1", false);

		x1.putProperty("boolean2", true);

		x1.putProperty("integer1", Integer.parseInt("123"));

		x1.putProperty("integer2", Integer.parseInt("321"));

		x1.putProperty("long1", Long.parseLong("123123"));

		x1.putProperty("long2", Long.parseLong("321321"));

		x1.putProperty("float1", Float.parseFloat("1234.1234"));

		x1.putProperty("float2", Float.parseFloat("4321.4321"));

		x1.putProperty("double1", Double.parseDouble("12341234.12341234"));

		x1.putProperty("double2", Double.parseDouble("43214321.43214321"));

		x1.putProperty("string1", "String1");

		x1.putProperty("string2", "String2");

		x1.putProperty("object1", obj1);

		x1.putProperty("object2", obj2);

		//----- x1 == x2

		x2.putProperty("boolean1", false);

		x2.putProperty("boolean2", true);

		x2.putProperty("integer1", Integer.parseInt("123"));

		x2.putProperty("integer2", Integer.parseInt("321"));

		x2.putProperty("long1", Long.parseLong("123123"));

		x2.putProperty("long2", Long.parseLong("321321"));

		x2.putProperty("float1", Float.parseFloat("1234.1234"));

		x2.putProperty("float2", Float.parseFloat("4321.4321"));

		x2.putProperty("double1", Double.parseDouble("12341234.12341234"));

		x2.putProperty("double2", Double.parseDouble("43214321.43214321"));

		x2.putProperty("string1", "String1");

		x2.putProperty("string2", "String2");

		x2.putProperty("object1", obj1);

		x2.putProperty("object2", obj2);

		//----- x1 != x3

		x3.putProperty("boolean1", false);

		x3.putProperty("boolean2", true);

		x3.putProperty("integer1", Integer.parseInt("123"));

		x3.putProperty("integer2", Integer.parseInt("321"));

		x3.putProperty("long1", Long.parseLong("123123"));

		x3.putProperty("long2", Long.parseLong("321321"));

		x3.putProperty("float1", Float.parseFloat("1234.1234"));

		x3.putProperty("float2", Float.parseFloat("4321.4321"));

		x3.putProperty("double1", Double.parseDouble("12341234.12341234"));

		x3.putProperty("double2", Double.parseDouble("43214321.43214324"));

		x3.putProperty("string1", "String1");

		x3.putProperty("string2", "String2");

		x3.putProperty("object1", obj1);

		x3.putProperty("object2", obj3);

		XmlTag tag;

		try {

			tag = (XmlTag) XmlTag.unmarshal(

					new FileReader(new File("testdata/sample.gvp")));

			gvp1 = new XMLEntity(tag);

			tag = (XmlTag) XmlTag.unmarshal(

					new FileReader(new File("testdata/sample2.gvp")));

			gvp2 = new XMLEntity(tag);

		} catch (Exception e) {

			// TODO Auto-generated catch block

			e.printStackTrace();

		}

	}

	public void testEquality() {

		assertEquals(x1, x2);

		assertFalse(x1.equals(x3));

		assertFalse(x2.equals(x3));

	}

	public void testHash() {

		final long x1Hash = x1.hash();

		final long x2Hash = x2.hash();

		final long x3Hash = x3.hash();

		assertTrue("x1 should be equals to x2", x1Hash == x2Hash);

		assertTrue("x1 should be distinct to x3", x1Hash != x3Hash);

	}

	public void testSkippedProperties() {

		x1.putProperty("skipped1", true, false);

		x1.putProperty("skipped2", 1, false);

		x1.putProperty("skipped3", 1D, false);

		x1.putProperty("skipped4", 1F, false);

		x1.putProperty("skipped5", 1L, false);

		x1.putProperty("skipped6", "bla bla", false);

		x2.putProperty("skipped1", false, false);

		x2.putProperty("skipped2", 2, false);

		x2.putProperty("skipped3", 2D, false);

		x2.putProperty("skipped4", 2F, false);

		x2.putProperty("skipped5", 2L, false);

		x2.putProperty("skipped6", "bla bla bleitor", false);

		x3.putProperty("skipped1", false, false);

		x3.putProperty("skipped2", 2, false);

		x3.putProperty("skipped3", 2D, false);

		x3.putProperty("skipped4", 2F, false);

		x3.putProperty("skipped5", 2L, false);

		x3.putProperty("skipped6", "bla bla bleitor", false);

		final long x1Hash = x1.hash();

		final long x2Hash = x2.hash();

		final long x3Hash = x3.hash();

		assertTrue("x1 should be equals to x2", x1Hash == x2Hash);

		assertTrue("x1 should be distinct to x3", x1Hash != x3Hash);

		assertTrue("x2 should be distinct to x3", x2Hash != x3Hash);

		x1.remove("skipped1");

		x1.remove("skipped2");

		x1.remove("skipped3");

		x1.remove("skipped4");

		x1.remove("skipped5");

		x1.remove("skipped6");

		x2.remove("skipped1");

		x2.remove("skipped2");

		x2.remove("skipped3");

		x2.remove("skipped4");

		x2.remove("skipped5");

		x2.remove("skipped6");

		x3.remove("skipped1");

		x3.remove("skipped2");

		x3.remove("skipped3");

		x3.remove("skipped4");

		x3.remove("skipped5");

		x3.remove("skipped6");

	}

	public void testNonSkippedProperties() {

		x1.putProperty("non_skipped1", true, true);

		x1.putProperty("non_skipped2", 1, true);

		x1.putProperty("non_skipped3", 1D, true);

		x1.putProperty("non_skipped4", 1F, true);

		x1.putProperty("non_skipped5", 1L, true);

		x1.putProperty("non_skipped6", "bla bla", true);

		x3.putProperty("non_skipped1", false, true);

		x3.putProperty("non_skipped2", 2, true);

		x3.putProperty("non_skipped3", 2D, true);

		x3.putProperty("non_skipped4", 2F, true);

		x3.putProperty("non_skipped5", 2L, true);

		x3.putProperty("non_skipped6", "bla bla bleitor", true);

		x2.putProperty("non_skipped1", false, true);

		x2.putProperty("non_skipped2", 2, true);

		x2.putProperty("non_skipped3", 2D, true);

		x2.putProperty("non_skipped4", 2F, true);

		x2.putProperty("non_skipped5", 2L, true);

		x2.putProperty("non_skipped6", "bla bla bleitor", true);

		final long x1Hash = x1.hash();

		final long x2Hash = x2.hash();

		final long x3Hash = x3.hash();

		assertFalse("x1 should be distinct to x2", x1Hash == x2Hash);

		assertFalse("x1 should be distinct to x3", x1Hash == x3Hash);

		assertFalse("x2 should be distinct to x3", x2Hash == x3Hash);

		// restore the XMEntities to the initial state and ensure that

		// passes the tests again

		x1.remove("non_skipped1");

		x1.remove("non_skipped2");

		x1.remove("non_skipped3");

		x1.remove("non_skipped4");

		x1.remove("non_skipped5");

		x1.remove("non_skipped6");

		x2.remove("non_skipped1");

		x2.remove("non_skipped2");

		x2.remove("non_skipped3");

		x2.remove("non_skipped4");

		x2.remove("non_skipped5");

		x2.remove("non_skipped6");

		x3.remove("non_skipped1");

		x3.remove("non_skipped2");

		x3.remove("non_skipped3");

		x3.remove("non_skipped4");

		x3.remove("non_skipped5");

		x3.remove("non_skipped6");

		testHash();

		testEquality();

	}

	public void testEquivalentProjects() {

		final long x1Hash = gvp1.hash();

		final long x2Hash = gvp2.hash();

		assertTrue("x1 should be equals to x2", x1Hash == x2Hash);

	}

	public void testBenchMark() {

		long t_ini, t_unmarshal, t_buildXMLEntity, t_computeHash ;

		t_ini = System.currentTimeMillis();

		XmlTag tag;

		try {

			File f= new File("testdata/big.gvp");

			tag = (XmlTag) XmlTag.unmarshal(

					new FileReader(f));

			t_unmarshal = System.currentTimeMillis() - t_ini;

			gvp1 = new XMLEntity(tag);

			t_buildXMLEntity = System.currentTimeMillis() - t_unmarshal- t_ini;

			long hash = gvp1.hash();

			t_computeHash = System.currentTimeMillis() - t_buildXMLEntity- t_ini;

			assertTrue("BenchMark ("+f.getAbsolutePath()+" "+f.length()/1024+"Kb):" +

					"\t-unmarshal time: "+t_unmarshal+" milliseconds\n" +

					"\t-build XMLEntity time: "+t_buildXMLEntity+" milliseconds\n" +

					"\t-compute hash time: "+t_computeHash+" milliseconds",t_computeHash < 500);

		} catch (Exception e) {

			// TODO Auto-generated catch block

			e.printStackTrace();

		}

	}

}

/**

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

import java.text.Collator;

import java.util.Collections;

import java.util.Locale;

import java.util.Vector;

import java.util.List;

import org.gvsig.utils.StringComparator;

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

 */

/**

 * Tests the methods of the class <i>StringComparator</i>

 * 

 * @author Pablo Piqueras Bartolom? (p_queras@hotmail.com)

 */

public class TestStringComparator {

	/**

	 * Test method for the TestMathExtension class

	 * 

	 * @param args

	 */

	public static void main(String[] args)

	{

		StringComparator stringComparator = new StringComparator();

		// Initialize the vector of Strings (for test methods with the parameter Comparator)

		Vector v = new Vector();

		v.add("extWMS");

		v.add("libUI");

		v.add("extWMS");

		v.add("libRemoteServices");

		v.add("extWFS2");

		v.add("libNomenclatorIGN");

		v.add("libNomenclatorIGN_GUI");

		v.add("libIverUtiles");

		v.add("extWFS2");

		v.add("EXTWFS2");

		v.add("extWFS2");

		v.add("libGDBMS");

		v.add("libInternationalization");

		v.add("libFMap");

		v.add("6");

		v.add("4");

		v.add("3");

		v.add("5");

		v.add("2");

		v.add("1");

		v.add("extWFS2");

		v.add("libExceptions");

		v.add("libDriverManager");

		v.add("libCq CMS for java");

		v.add("libCorePlugin");

		v.add("extWFS2");

		v.add("extAddIDEELayers");

		v.add("extAlertCClient");

		v.add("extCAD");

		v.add("extWFS2");

		v.add("?and?");

		v.add("?and?");

		v.add("extJDBC");

		v.add("extMyPlugin");

		v.add("extRasterTools");

		v.add("extScripting");

		v.add("extWCS");

		v.add("extWFS2");

		v.add("extwfs2");		// If both are null -> true

		v.add("extWMS");

		v.add("extWMS");

		v.add("extWCS");

		v.add("7");

		v.add("9");

		v.add("8");

		v.add("0");

		v.add("EXTWCS");

		v.add("?and?");

		v.add("extensi?n");

		v.add("?AND?");

		v.add("_fwAndami");

		v.add("abcdefghijklmn?opqrstuvwxyz");

		v.add("?");

		v.add("appgvSIG");

		v.add("la casa");

		v.add("la monta?a");

		v.add("la colina");

		v.add("las abejas");

		v.add("las nutrias");

		v.add("las ballenas");

		v.add("lasa?a");

		v.add("Vector");

		v.add("avi?n");

		v.add("cami?n");

		v.add("autob?s");

		// Show the original vector

		System.out.println("Vector original: " + v.toString() + "\n");

		// First kind of sort

		stringComparator.setCaseSensitive(true);

		List list = v.subList(0, v.size());

		Collections.sort(list, stringComparator);

		System.out.println("Ordenaci?n normal con case-sensitive:" + list.toString() + "\n");

		// Second kind of sort

		stringComparator.setCaseSensitive(false);

		list = v.subList(0, v.size());

		Collections.sort(list, stringComparator);

		System.out.println("Ordenaci?n normal sin case-sensitive:" + list.toString() + "\n");

		Collator collator = Collator.getInstance(new Locale("es_ES"));

		stringComparator.setLocaleRules(stringComparator.new LocaleRules(true, collator));

		// Third kind of sort

		stringComparator.setCaseSensitive(true);

		list = v.subList(0, v.size());

		Collections.sort(list, stringComparator);

		System.out.println("Ordenaci?n con reglas locales y con case-sensitive:" + list.toString() + "\n");

		// Fourth kind of sort

		stringComparator.setCaseSensitive(false);

		list = v.subList(0, v.size());

		Collections.sort(list, stringComparator);

		System.out.println("Ordenaci?n con reglas locales y sin case-sensitive:" + list.toString() + "\n");

		stringComparator.getLocaleRules().setUseLocaleRules(false);

		// Fifth kind of sort

		stringComparator.setCaseSensitive(true);

		list = v.subList(0, v.size());

		Collections.sort(list, stringComparator);

		System.out.println("Ordenaci?n normal con case-sensitive:" + list.toString() + "\n");

		// Sixth kind of sort

		stringComparator.setCaseSensitive(false);

		list = v.subList(0, v.size());

		Collections.sort(list, stringComparator);

		System.out.println("Ordenaci?n normal sin case-sensitive:" + list.toString() + "\n");

	}	

}

/**

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

import java.text.Collator;

import java.util.Locale;

import java.util.Vector;

import org.gvsig.utils.StringComparator;

import org.gvsig.utils.vectorUtilities.VectorUtilities;

import junit.framework.TestCase;

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

 */

/**

 * Tests the methods of {@link VectorUtilities}

 * 

 * @author Pablo Piqueras Bartolom? (p_queras@hotmail.com)

 */

public class TestVectorUtilities extends TestCase {

	private static String obj;

	private static Vector v1 = new Vector();

	private static Vector v2 = new Vector();

	private static StringComparator stringComparator;

	/*

	 *  (non-Javadoc)

	 * @see junit.framework.TestCase#setUp()

	 */

	protected void setUp() throws Exception {

		super.setUp();

		// Initialize the StringComparator

		stringComparator = new StringComparator();

	    // Set spanish rules and with case sensitive

		Collator collator = Collator.getInstance(new Locale("es_ES"));		

		stringComparator.setLocaleRules(stringComparator.new LocaleRules(true, collator));

		stringComparator.setCaseSensitive(false);

	}

	/*

	 *  (non-Javadoc)

	 * @see junit.framework.TestCase#tearDown()

	 */

	protected void tearDown() throws Exception {

		super.tearDown();

	}

	///// TEST OPERATION: addAlphabeticallyOrdered(Vector, Object) /////

	/**

	 * A test

	 */

	public void test1() {

		try {

			// Insert at the beginning

			obj = new String("First");

			VectorUtilities.addAlphabeticallyOrdered(v1, obj);

			System.out.println("Test 1:\nObj: " + obj + "\nResults: " + v1);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test2() {

		try {

			// Insert at the end

			obj = new String("ZZ????");

			VectorUtilities.addAlphabeticallyOrdered(v1, obj);

			System.out.println("Test 2:\nObj: " + obj + "\nResults: " + v1);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test3() {

		try {

			// An insertion

			obj = new String("?and?");

			VectorUtilities.addAlphabeticallyOrdered(v1, obj);

			System.out.println("Test 3:\nObj: " + obj + "\nResults: " + v1);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test4() {

		try {

			// An insertion

			obj = new String("?AND?");

			VectorUtilities.addAlphabeticallyOrdered(v1, obj);

			System.out.println("Test 4:\nObj: " + obj + "\nResults: " + v1);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test5() {

		try {

			// An insertion

			obj = new String("appgvSIG");

			VectorUtilities.addAlphabeticallyOrdered(v1, obj);

			System.out.println("Test 5:\nObj: " + obj + "\nResults: " + v1);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test6() {

		try {

			// An insertion

			obj = new String("libIverUtiles");

			VectorUtilities.addAlphabeticallyOrdered(v1, obj);

			System.out.println("Test 6:\nObj: " + obj + "\nResults: " + v1);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test7() {

		try {

			// An insertion

			obj = new String("libUI");

			VectorUtilities.addAlphabeticallyOrdered(v1, obj);

			System.out.println("Test 7:\nObj: " + obj + "\nResults: " + v1);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test8() {

		try {

			// An insertion

			obj = new String("libIverUtiles");

			VectorUtilities.addAlphabeticallyOrdered(v1, obj);

			System.out.println("Test 8:\nObj: " + obj + "\nResults: " + v1);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test9() {

		try {

			// An insertion

			obj = new String("extWFS");

			VectorUtilities.addAlphabeticallyOrdered(v1, obj);

			System.out.println("Test 9:\nObj: " + obj + "\nResults: " + v1);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	///// END TEST OPERATION: addAlphabeticallyOrdered(Vector, Object) /////

	///// TEST OPERATION: addAlphabeticallyOrdered(Vector, Object, Comparator) /////

	/**

	 * A test

	 */

	public void test11() {

		try {

			// Insert at the beginning

			obj = new String("First");

			VectorUtilities.addAlphabeticallyOrdered(v2, obj, stringComparator);

			System.out.println("Test 11:\nObj: " + obj + "\nResults: " + v2);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test12() {

		try {

			// Insert at the end

			obj = new String("ZZ????");

			VectorUtilities.addAlphabeticallyOrdered(v2, obj, stringComparator);

			System.out.println("Test 12:\nObj: " + obj + "\nResults: " + v2);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test13() {

		try {

			// An insertion

			obj = new String("?and?");

			VectorUtilities.addAlphabeticallyOrdered(v2, obj, stringComparator);

			System.out.println("Test 13:\nObj: " + obj + "\nResults: " + v2);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test14() {

		try {

			// An insertion

			obj = new String("?AND?");

			VectorUtilities.addAlphabeticallyOrdered(v2, obj, stringComparator);

			System.out.println("Test 14:\nObj: " + obj + "\nResults: " + v2);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test15() {

		try {

			// An insertion

			obj = new String("appgvSIG");

			VectorUtilities.addAlphabeticallyOrdered(v2, obj, stringComparator);

			System.out.println("Test 15:\nObj: " + obj + "\nResults: " + v2);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test16() {

		try {

			// An insertion

			obj = new String("libIverUtiles");

			VectorUtilities.addAlphabeticallyOrdered(v2, obj, stringComparator);

			System.out.println("Test 16:\nObj: " + obj + "\nResults: " + v2);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test17() {

		try {

			// An insertion

			obj = new String("libUI");

			VectorUtilities.addAlphabeticallyOrdered(v2, obj, stringComparator);

			System.out.println("Test 17:\nObj: " + obj + "\nResults: " + v2);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test18() {

		try {

			// An insertion

			obj = new String("libIverUtiles");

			VectorUtilities.addAlphabeticallyOrdered(v2, obj, stringComparator);

			System.out.println("Test 18:\nObj: " + obj + "\nResults: " + v2);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	/**

	 * A test

	 */

	public void test19() {

		try {

			// An insertion

			obj = new String("extWFS");

			VectorUtilities.addAlphabeticallyOrdered(v2, obj, stringComparator);

			System.out.println("Test 19:\nObj: " + obj + "\nResults: " + v2);

		} catch (Exception e) {

			e.printStackTrace();

		}

	}

	///// END TEST OPERATION: addAlphabeticallyOrdered(Vector, Object, Comparator) /////

}

/**

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

import org.gvsig.utils.StringUtilities;

import junit.framework.TestCase;

/* 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 tests some methods of the 'StringUtilities' class

 * (Now only tests the methods 'numberOfOccurrencesOfSubStringInString' and 'numberOfOccurrencesOfSubStringInStringUpToPosition')

 * 

 * @author Pablo Piqueras Bartolom? (p_queras@hotmail.com)

 */

public class TestStringUtilities extends TestCase{

	private String word_String;

	private String word_subString;

	private boolean case_Sensitive;

	private int start_position;

	private int end_position;

	/*

	 *  (non-Javadoc)

	 * @see junit.framework.TestCase#setUp()

	 */

	protected void setUp() throws Exception {

		super.setUp();

		word_String = new String();

		word_subString = new String();

		case_Sensitive = true; // By default, case sensitive		

	}

	/*

	 *  (non-Javadoc)

	 * @see junit.framework.TestCase#tearDown()

	 */

	protected void tearDown() throws Exception {

		super.tearDown();

	}

	/**

	 * A test

	 */

	public void test1() {

		word_String = "la casa es grande";

		word_subString = "a";

		case_Sensitive = true;

		System.out.print("Test1: El n?mero de ocurrencias");

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInString(word_String, word_subString, case_Sensitive));

	}

	/**

	 * A test

	 */

	public void test2() {

		word_String = "la casa es grande";

		word_subString = "a";

		case_Sensitive = false;

		System.out.print("Test2: El n?mero de ocurrencias");

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInString(word_String, word_subString, case_Sensitive));

	}

	/**

	 * A test

	 */

	public void test3() {

		word_String = "la casa es grande";

		word_subString = "A";

		case_Sensitive = true;

		System.out.print("Test3: El n?mero de ocurrencias");

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInString(word_String, word_subString, case_Sensitive));

	}

	/**

	 * A test

	 */

	public void test4() {

		word_String = "la casa es grande";

		word_subString = "A";

		case_Sensitive = false;

		System.out.print("Test4: El n?mero de ocurrencias");

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInString(word_String, word_subString, case_Sensitive));

	}

	/**

	 * A test

	 */

	public void test5() {

		word_String = "la casa es grande";

		word_subString = "z";

		case_Sensitive = true;

		System.out.print("Test5: El n?mero de ocurrencias");

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInString(word_String, word_subString, case_Sensitive));

	}

	/**

	 * A test

	 */

	public void test6() {

		word_String = "la casa es grande";

		word_subString = "z";

		case_Sensitive = false;

		System.out.print("Test6: El n?mero de ocurrencias");

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInString(word_String, word_subString, case_Sensitive));

	}

	/**

	 * A test

	 */

	public void test7() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos dos";

		case_Sensitive = true;

		System.out.print("Test7: El n?mero de ocurrencias");

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInString(word_String, word_subString, case_Sensitive));

	}

	/**

	 * A test

	 */

	public void test8() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos Dos";

		case_Sensitive = true;

		System.out.print("Test8: El n?mero de ocurrencias");

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInString(word_String, word_subString, case_Sensitive));

	}

	/**

	 * A test

	 */

	public void test9() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos dos";

		case_Sensitive = false;

		System.out.print("Test9: El n?mero de ocurrencias");

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInString(word_String, word_subString, case_Sensitive));

	}

	/**

	 * A test

	 */

	public void test10() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos Dos";

		case_Sensitive = false;

		System.out.print("Test10: El n?mero de ocurrencias");

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInString(word_String, word_subString, case_Sensitive));

	}

	/**

	 * A test

	 */

	public void test11() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos Dos";

		case_Sensitive = false;

		start_position = 0;

		end_position = word_String.length();

		System.out.print("Test11: El n?mero de ocurrencias entre posiciones " + start_position + " y " + end_position);

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInStringBetweenPositions(word_String, word_subString, case_Sensitive, start_position, end_position));

	}

	/**

	 * A test

	 */

	public void test12() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos dos";

		case_Sensitive = true;

		start_position = 20;

		end_position = 72;

		System.out.print("Test12: El n?mero de ocurrencias entre posiciones " + start_position + " y " + end_position);

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInStringBetweenPositions(word_String, word_subString, case_Sensitive, start_position, end_position));

	}

	/**

	 * A test

	 */

	public void test13() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos Dos";

		case_Sensitive = true;

		start_position = 20;

		end_position = 72;

		System.out.print("Test13: El n?mero de ocurrencias entre posiciones " + start_position + " y " + end_position);

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInStringBetweenPositions(word_String, word_subString, case_Sensitive, start_position, end_position));

	}

	/**

	 * A test

	 */

	public void test14() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos dos";

		case_Sensitive = false;

		start_position = 20;

		end_position = 72;

		System.out.print("Test14: El n?mero de ocurrencias entre posiciones " + start_position + " y " + end_position);

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInStringBetweenPositions(word_String, word_subString, case_Sensitive, start_position, end_position));

	}

	/**

	 * A test

	 */

	public void test15() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos Dos";

		case_Sensitive = false;

		start_position = 20;

		end_position = 72;

		System.out.print("Test15: El n?mero de ocurrencias entre posiciones " + start_position + " y " + end_position);

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInStringBetweenPositions(word_String, word_subString, case_Sensitive, start_position, end_position));

	}

	/**

	 * A test

	 */

	public void test16() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos dos";

		case_Sensitive = true;

		start_position = 21;

		end_position = 72;

		System.out.print("Test16: El n?mero de ocurrencias entre posiciones " + start_position + " y " + end_position);

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInStringBetweenPositions(word_String, word_subString, case_Sensitive, start_position, end_position));

	}

	/**

	 * A test

	 */

	public void test17() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos Dos";

		case_Sensitive = true;

		start_position = 21;

		end_position = 72;

		System.out.print("Test17: El n?mero de ocurrencias entre posiciones " + start_position + " y " + end_position);

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInStringBetweenPositions(word_String, word_subString, case_Sensitive, start_position, end_position));

	}

	/**

	 * A test

	 */

	public void test18() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos dos";

		case_Sensitive = false;

		start_position = 21;

		end_position = 72;

		System.out.print("Test18: El n?mero de ocurrencias entre posiciones " + start_position + " y " + end_position);

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInStringBetweenPositions(word_String, word_subString, case_Sensitive, start_position, end_position));

	}

	/**

	 * A test

	 */

	public void test19() {

		word_String = "Frasecica: tres mas cuAtro menos dos no es lo mismo que cuatro menos dos mas cinco ni que cuatro menos dos mas dos ni que cuatro menos cuatro mas diez. ?Cierto no?";

		word_subString = "cuatro menos Dos";

		case_Sensitive = false;

		start_position = 21;

		end_position = 72;

		System.out.print("Test19: El n?mero de ocurrencias entre posiciones " + start_position + " y " + end_position);

		if (case_Sensitive)

			System.out.print(" con distinci?n min?sculas/may?sculas ");

		else

			System.out.print(" sin distinci?n min?sculas/may?sculas ");

		System.out.println("de '" + word_subString + "' en '" + word_String + " es " + StringUtilities.numberOfOccurrencesOfSubStringInStringBetweenPositions(word_String, word_subString, case_Sensitive, start_position, end_position));

	}

}

/**

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

import java.awt.Color;

import java.awt.Dimension;

import java.awt.Point;

import java.awt.Rectangle;

import java.awt.Toolkit;

import java.awt.event.MouseAdapter;

import java.awt.event.MouseEvent;

import javax.swing.JDesktopPane;

import javax.swing.JDialog;

import javax.swing.JFrame;

import javax.swing.JInternalFrame;

import javax.swing.JPanel;

import org.gvsig.utils.centerComponent.CenterComponent;

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

 *

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