Application: gvSIG desktop » gvSIG data provider for DWG

/*

 * Created on 08-feb-2007

 *

 * 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

 */

/* CVS MESSAGES:

*

* $Id: DwgTestSuite.java 28970 2009-05-25 13:27:14Z jmvivo $

* $Log$

* Revision 1.1.2.1  2007-02-28 07:35:10  jmvivo

* Actualizado desde el HEAD.

*

* Revision 1.1  2007/02/08 20:27:57  azabala

* *** empty log message ***

*

*

*/

package org.gvsig.dwg.lib;

import junit.framework.Test;

import junit.framework.TestSuite;

public class DwgTestSuite {

	public static Test suite() {

		TestSuite suite = new TestSuite("Test for com.iver.cit.jdwglib.dwg");

		//$JUnit-BEGIN$

		suite.addTestSuite(DwgFileTest.class);

		//$JUnit-END$

		return suite;

	}

}

package org.gvsig.dwg.lib;

import java.io.File;

import java.io.IOException;

import java.net.URL;

import junit.framework.TestCase;

public class DwgFileTest extends TestCase {

	private File baseDataPath;

	protected void setUp() throws Exception {

		super.setUp();

		URL url = this.getClass().getResource("data");

		if (url == null) {

			throw new Exception("Can't find 'data' dir");

		}

		baseDataPath = new File(url.getFile());

		if (!baseDataPath.exists()) {

			throw new Exception("Can't find 'data' dir");

		}

	}

	protected void tearDown() throws Exception {

		super.tearDown();

	}

	public void test1() throws IOException, DwgVersionNotSupportedException {

//		String fileName = baseDataPath.getAbsolutePath()+"/Un punto.dwg";

//		DwgFile dwg = new DwgFile(fileName);

//

//		dwg.read();

//		dwg.calculateGisModelDwgPolylines();

//		dwg.blockManagement();

//		LinkedList dwgObjects = dwg.getDwgObjects();

	}

	public void test2() throws RuntimeException, CorruptedDwgEntityException{

        //Dwg Object that is supposed to be

        //an LWPOLYLINE in V14 version

		/*

        int[] data = new int[]{61,64,64,183,19,227,104,16

                            ,0,5,8,59,72,32,252,47,90,142,

                            234,145,50,10,71,11,213,36,229,

                            162,130,10,228,126,23,174,130,

                            145,50,15,98,141,196,244,229,

                            162,130,12,126,23,169,66,58,

                            145,50,12,47,90,138,68,229,

                            162,130,8,0,0,4,7,74,137,50,

                            15,177,66,231,252,221,162,130,

                            9,130,151,21,242,151,21,190,

                            8,21,8,56};

         */

//		int[] data = new int[]{62,128,64,71,99,

//							   40,48,0,5,8,27,72,

//							   100,126,23,169,68,

//							   178,105,50,13,114,

//							   63,11,82,165,162,130,

//							   13,114,63,11,210,138,

//							   105,50,8,173,114,59,

//							   138,205,162,130,15,98,

//							   141,192,241,58,105,50,

//							   11,51,51,52,178,229,162,

//							   130,14,110,102,98,97,234,

//							   105,50,11,51,51,52,179,21,

//							   162,130,10,149,192,240,42,

//							   162,105,50,14,189,27,131,

//							   107,69,162,130,14,31,169,

//							   66,227,74,105,50,9,240,86,

//							   185,27,117,162,130,11,59,

//							   51,51,52,234,105,50,13,114,

//							   63,11,83,85,162,130,9,74,228,

//							   126,22,186,105,50,11,51,51,50,

//							   51,53,162,130,11,137,232,82,190,

//							   58,105,50,9,74,228,122,147,13,162,

//							   130,11,137,232,82,189,106,105,50,9,

//							   74,228,122,146,213,162,130,9,74,228,122,20,202,105,50,12,126,23,171,194,173,162,130,12,126,23,169,68,178,105,50,13,114,63,11,82,165,162,130,9,130,151,22,10,136,182,8,21,8,120};

//        //1er intento: suponemos que la LWPOLYLINE cumple la especificaci?n

//        //a rajatabla

//        int bitPos = 0;

//        List val = DwgUtil.getBitShort(data, bitPos);

//        bitPos = ((Integer) val.get(0)).intValue();

//        int type = ((Integer) val.get(1)).intValue();

//        System.out.println("type = " + type);

//

//        DwgHandleReference hr = new DwgHandleReference();

//        bitPos = hr.read(data, bitPos);

//        System.out.println("handle, code="+

//                    hr.getCode()+

//                    " ,offset="+

//                    hr.getOffset());

//

//        //Ahora pasamos a la extended data

//        val = DwgUtil.getBitShort(data, bitPos);

//        bitPos = ((Integer) val.get(0)).intValue();

//        int extendedDataSize = ((Integer) val.get(1)).intValue();

//        System.out.println("EED size="+extendedDataSize);

//        //como el size es 0, me lo salto

//

//        //ver si tiene datos graficos

//        val = DwgUtil.testBit(data, bitPos);

//        bitPos = ((Integer) val.get(0)).intValue();

//        boolean hasGraphicsData = ((Boolean) val.get(1))

//                .booleanValue();

//        System.out.println("graphics = "+hasGraphicsData);

//

//        //como se que no hay graphics me lo salto

//        //tama?o en bits

//        val = DwgUtil.getRawLong(data, bitPos);

//        bitPos = ((Integer) val.get(0)).intValue();

//        int sizeInBits = ((Integer) val.get(1)).intValue();

//        System.out.println("sizeInBits = "+sizeInBits);

//

//        /*

//         * Ahora, lo que viene es lo que en la spec se dice

//         * "Common entity data". Revisar bien pues PythonCAD no lo lee

//         * como en la spec.

//         *

//         * pag 42.

//          R13-R14 Only:

//          	RL	:	Size of object data in bits

//          	6B	:	Flags (FEDCBA)

//          	6B	:	Common parameters (CCSSII)

//          	Segun esto, deberia leer 6 bits y 6 bits

//

//          	FLAGS

//	      	Mas adelante (pag 43), dice:

//	      	DC	:	This is the number of reactors attached to an

//	      	entity as a bitshort.

//	      	This feature may have been dormant in R13,

//	      	but it appears in R14, and in files saved as R13 by R14.

//

//	      	Ahora bien, pythoncad las est? leyendo como bitLong

//          	?En que quedamos, son 2 bits, 1 bitLong o 1 bitShort?

//          	TODO REVISAR

//

//          	COMMON PARAMETERS

//          	Al principio, dice que son 6 bits (CC, SS, II)

//          	pero luego dice (pag 43):

//          	CC	:	Color bitshort

//          	SS	:	Linetype scale bitdouble

//          	II	:	"Invisible" flag bitshort

//

//			Pythoncad, en vez de como 2 bits, los est? leyendo

//			como BitShort, BitDouble y BitShort

//

//         * */

//

//        Integer mode = (Integer) DwgUtil.getBits(data, 2, bitPos);

//		bitPos += 2;

//		System.out.println("mode = "+mode);

//

//	/*

//		val = DwgUtil.getBitLong(data, bitPos);

//		bitPos = ((Integer) val.get(0)).intValue();

//		int rnum = ((Integer) val.get(1)).intValue();

//		System.out.println("numReactors = "+rnum);

//*/

//		val = DwgUtil.getBitShort(data, bitPos);

//		bitPos = ((Integer) val.get(0)).intValue();

//		int rnum = ((Integer) val.get(1)).intValue();

//		System.out.println("numReactors = "+rnum);

//

//

//		val = DwgUtil.testBit(data, bitPos);

//		bitPos = ((Integer) val.get(0)).intValue();

//		boolean isLyrByLineType = ((Boolean) val.get(1)).booleanValue();

//		System.out.println("isLyrByLineType="+isLyrByLineType);

//

//		val = DwgUtil.testBit(data, bitPos);

//		bitPos = ((Integer) val.get(0)).intValue();

//		boolean noLinks = ((Boolean) val.get(1)).booleanValue();

//		System.out.println("noLinks="+noLinks);

//

//

//		val = DwgUtil.getBitShort(data, bitPos);

//		bitPos = ((Integer) val.get(0)).intValue();

//		int color = ((Integer) val.get(1)).intValue();

//		System.out.println("color="+color);

//

//

//		val = DwgUtil.getBitDouble(data, bitPos);

//		bitPos = ((Integer) val.get(0)).intValue();

//		float ltscale = ((Double) val.get(1)).floatValue();

//		System.out.println("ltscale="+ltscale);

//

//		val = DwgUtil.getBitShort(data, bitPos);

//		bitPos = ((Integer) val.get(0)).intValue();

//		int invis = ((Integer) val.get(1)).intValue();

//		System.out.println("invis="+invis);

//

//		val = DwgUtil.getBitShort(data, bitPos);

//		bitPos = ((Integer) val.get(0)).intValue();

//		int flag = ((Integer) val.get(1)).intValue();

//		System.out.println("flag="+flag);

//

//		double dVal = 0d;

//		if((flag & 0x4) > 0){

//			val = DwgUtil.getBitDouble(data, bitPos);

//			bitPos = ((Integer) val.get(0)).intValue();

//			dVal = ((Double) val.get(1)).doubleValue();

//		}

//		System.out.println("constWidth="+dVal);

//

//		dVal = 0d;

//		if((flag & 0x8) > 0){

//			val = DwgUtil.getBitDouble(data, bitPos);

//			bitPos = ((Integer) val.get(0)).intValue();

//			dVal = ((Double) val.get(1)).doubleValue();

//		}

//		System.out.println("elevation="+dVal);

//

//		dVal = 0d;

//		if ((flag & 0x2) > 0){

//			val = DwgUtil.getBitDouble(data, bitPos);

//			bitPos = ((Integer) val.get(0)).intValue();

//			dVal = ((Double) val.get(1)).doubleValue();

//		}

//		System.out.println("thickness="+dVal);

//

//		double x, y, z ;

//		x = 0d;

//		y = 0d;

//		z = 0d;

//

//		if ((flag & 0x1) > 0){

//			val = DwgUtil.getBitDouble(data, bitPos);

//			bitPos = ((Integer) val.get(0)).intValue();

//			x = ((Double) val.get(1)).doubleValue();

//

//			val = DwgUtil.getBitDouble(data, bitPos);

//			bitPos = ((Integer) val.get(0)).intValue();

//			y = ((Double) val.get(1)).doubleValue();

//

//			val = DwgUtil.getBitDouble(data, bitPos);

//			bitPos = ((Integer) val.get(0)).intValue();

//			z = ((Double) val.get(1)).doubleValue();

//		}

//		System.out.println("normal="+x+","+y+","+z);

//

//		val = DwgUtil.getBitLong(data, bitPos);

//		bitPos = ((Integer) val.get(0)).intValue();

//		int np = ((Integer) val.get(1)).intValue();

//		System.out.println("numPoints="+np);

//

//		int nb = 0;

//		if((flag & 0x10) > 0){

//			val = DwgUtil.getBitLong(data, bitPos);

//			bitPos = ((Integer) val.get(0)).intValue();

//			nb = ((Integer) val.get(1)).intValue();

//		}

//		System.out.println("numBulges="+nb);

//		int nw = 0;

//		if((flag & 0x20) > 0){

//			val = DwgUtil.getBitLong(data, bitPos);

//			bitPos = ((Integer) val.get(0)).intValue();

//			nw = ((Integer) val.get(1)).intValue();

//		}

//		System.out.println("numWidths="+nw);

//		if(np > 0){

//			Point2D[] points = new Point2D[np];

//			for(int i = 0; i < np; i++){

//				val = DwgUtil.getRawDouble(data, bitPos);

//				bitPos = ((Integer) val.get(0)).intValue();

//				x = ((Double) val.get(1)).doubleValue();

//

//				val = DwgUtil.getRawDouble(data, bitPos);

//				bitPos = ((Integer) val.get(0)).intValue();

//				y = ((Double) val.get(1)).doubleValue();

//

//				points[i] = new Point2D.Double(x, y);

//				System.out.println("Punto"+i+"="+x+","+y);

//			}//for

//		}//if np

//

//		if(nb > 0){

//			double[] bulges = new double[nb];

//			for(int i = 0; i < nb; i++){

//				val = DwgUtil.getRawDouble(data, bitPos);

//				bitPos = ((Integer) val.get(0)).intValue();

//				bulges[i] = ((Double) val.get(1)).doubleValue();

//				System.out.println("Bulge"+i+"="+bulges[i]);

//			}//for

//

//		}//if nb

//

//		if(nw > 0){

//			double[][] widths = new double[nw][2];

//			for(int i = 0; i < nw; i++){

//				val = DwgUtil.getBitDouble(data, bitPos);

//				bitPos = ((Integer) val.get(0)).intValue();

//				double sw = ((Double) val.get(1)).doubleValue();

//

//				val = DwgUtil.getBitDouble(data, bitPos);

//				bitPos = ((Integer) val.get(0)).intValue();

//				double ew = ((Double) val.get(1)).doubleValue();

//

//				widths[i][0] = sw;

//				widths[i][1] = ew;

//				System.out.println("Width"+i+"="+sw+","+ew);

//			}//for

//		}

     }

	public void test3(){

		//test of extrusion

		double[] coord = null;

		double[] extrusion = null;

		double[] extrusion2 = new double[]{0, 0, 1};

		coord = new double[]{790089.65, 4477974.75, 9.560000000114087};

		extrusion = new double[]{-0.5037965987025721, 0.07005064807841195, 0.8609772899673451};

		//1. algoritmo original, vector normal distinto

//		double[] newCoord = AcadExtrusionCalculator.extrude(coord, extrusion);

//		newCoord = AcadExtrusionCalculator.extrude3(coord, extrusion);

//

		//2? ahora con vector normal coincidente con eje Z

//		newCoord = AcadExtrusionCalculator.extrude(coord, extrusion2);

//		newCoord = AcadExtrusionCalculator.extrude3(coord, extrusion2);

	}

}

/* 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.dwg.lib;

import java.math.BigInteger;

/**

 * Clase que engloba m�todos para trabajar con bytes. 

 *

 * @author Vicente Caballero Navarro

 */

public class ByteUtils {

	public static final int SIZE_BOOL = 1;

	public static final int SIZE_SHORT = 2;

	public static final int SIZE_INT = 4;

	public static final int SIZE_LONG = 8;

	public static final int SIZE_DOUBLE = 8;

	/** A nibble->char mapping for printing out bytes. */

	public static final char[] digits = {

			'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd',

			'e', 'f'

		};

	/**

	 * Return the <code>int</code> represented by the bytes in

	 * <code>data</code> staring at offset <code>offset[0]</code>.

	 *

	 * @param data the array from which to read

	 * @param offset A single element array whose first element is the index in

	 * 		  data from which to begin reading on function entry, and which on

	 * 		  function exit has been incremented by the number of bytes read.

	 *

	 * @return the value of the <code>int</code> decoded

	 */

	public static final int bytesToInt(byte[] data, int[] offset) {

		/**

		 * TODO: We use network-order within OceanStore, but temporarily

		 * supporting intel-order to work with some JNI code until JNI code is

		 * set to interoperate with network-order.

		 */

		int result = 0;

		for (int i = 0; i < SIZE_INT; ++i) {

			result <<= 8;

			result |= byteToUnsignedInt(data[offset[0]++]);

		}

		return result;

	}

	/**

	 * Write the bytes representing <code>i</code> into the byte array

	 * <code>data</code>, starting at index <code>offset [0]</code>, and

	 * increment <code>offset [0]</code> by the number of bytes written; if

	 * <code>data == null</code>, increment <code>offset [0]</code> by the

	 * number of bytes that would have been written otherwise.

	 *

	 * @param i the <code>int</code> to encode

	 * @param data The byte array to store into, or <code>null</code>.

	 * @param offset A single element array whose first element is the index in

	 * 		  data to begin writing at on function entry, and which on

	 * 		  function exit has been incremented by the number of bytes

	 * 		  written.

	 */

	public static final void intToBytes(int i, byte[] data, int[] offset) {

		/**

		 * TODO: We use network-order within OceanStore, but temporarily

		 * supporting intel-order to work with some JNI code until JNI code is

		 * set to interoperate with network-order.

		 */

		if (data != null) {

			for (int j = (offset[0] + SIZE_INT) - 1; j >= offset[0]; --j) {

				data[j] = (byte) i;

				i >>= 8;

			}

		}

		offset[0] += SIZE_INT;

	}

	/**

	 * Return the <code>short</code> represented by the bytes in

	 * <code>data</code> staring at offset <code>offset[0]</code>.

	 *

	 * @param data the array from which to read

	 * @param offset A single element array whose first element is the index in

	 * 		  data from which to begin reading on function entry, and which on

	 * 		  function exit has been incremented by the number of bytes read.

	 *

	 * @return the value of the <code>short</code> decoded

	 */

	public static final short bytesToShort(byte[] data, int[] offset) {

		/**

		 * TODO: We use network-order within OceanStore, but temporarily

		 * supporting intel-order to work with some JNI code until JNI code is

		 * set to interoperate with network-order.

		 */

		short result = 0;

		for (int i = 0; i < SIZE_SHORT; ++i) {

			result <<= 8;

			result |= (short) byteToUnsignedInt(data[offset[0]++]);

		}

		return result;

	}

	/**

	 * Write the bytes representing <code>s</code> into the byte array

	 * <code>data</code>, starting at index <code>offset [0]</code>, and

	 * increment <code>offset [0]</code> by the number of bytes written; if

	 * <code>data == null</code>, increment <code>offset [0]</code> by the

	 * number of bytes that would have been written otherwise.

	 *

	 * @param s the <code>short</code> to encode

	 * @param data The byte array to store into, or <code>null</code>.

	 * @param offset A single element array whose first element is the index in

	 * 		  data to begin writing at on function entry, and which on

	 * 		  function exit has been incremented by the number of bytes

	 * 		  written.

	 */

	public static final void shortToBytes(short s, byte[] data, int[] offset) {

		/**

		 * TODO: We use network-order within OceanStore, but temporarily

		 * supporting intel-order to work with some JNI code until JNI code is

		 * set to interoperate with network-order.

		 */

		if (data != null) {

			data[offset[0] + 1] = (byte) s;

			data[offset[0]] = (byte) (s >> 8);

		}

		offset[0] += SIZE_SHORT;

	}

	/**

	 * Return the <code>long</code> represented by the bytes in

	 * <code>data</code> staring at offset <code>offset[0]</code>.

	 *

	 * @param data the array from which to read

	 * @param offset A single element array whose first element is the index in

	 * 		  data from which to begin reading on  function entry, and which

	 * 		  on function exit has been incremented by the number of bytes

	 * 		  read.

	 *

	 * @return the value of the <code>long</code> decoded

	 */

	public static final long bytesToLong(byte[] data, int[] offset) {

		long result = 0;

		for (int i = 0; i < SIZE_LONG; ++i) {

			result <<= 8;

			int res = byteToUnsignedInt(data[offset[0]++]);

			result = result | res;

		}

		return result;

	}

	/**

	 * Write the bytes representing <code>l</code> into the byte array

	 * <code>data</code>, starting at index <code>offset [0]</code>, and

	 * increment <code>offset [0]</code> by the number of bytes written; if

	 * <code>data == null</code>, increment <code>offset [0]</code> by the

	 * number of bytes that would have been written otherwise.

	 *

	 * @param l the <code>long</code> to encode

	 * @param data The byte array to store into, or <code>null</code>.

	 * @param offset A single element array whose first element is the index in

	 * 		  data to begin writing at on function entry, and which on

	 * 		  function exit has been incremented by the number of bytes

	 * 		  written.

	 */

	public static final void longToBytes(long l, byte[] data, int[] offset) {

		/**

		 * TODO: We use network-order within OceanStore, but temporarily

		 * supporting intel-order to work with some JNI code until JNI code is

		 * set to interoperate with network-order.

		 */

		if (data != null) {

			for (int j = (offset[0] + SIZE_LONG) - 1; j >= offset[0]; --j) {

				data[j] = (byte) l;

				l >>= 8;

			}

		}

		offset[0] += SIZE_LONG;

	}

	/**

	 * Return the <code>double</code> represented by the bytes in

	 * <code>data</code> staring at offset <code>offset[0]</code>.

	 *

	 * @param data the array from which to read

	 * @param offset A single element array whose first element is the index in

	 * 		  data from which to begin reading on  function entry, and which

	 * 		  on function exit has been incremented by the number of bytes

	 * 		  read.

	 *

	 * @return the value of the <code>double</code> decoded

	 */

	public static final double bytesToDouble(byte[] data, int[] offset) {

		long bits = bytesToLong(data, offset);

		return Double.longBitsToDouble(bits);

	}

	/**

	 * Write the bytes representing <code>d</code> into the byte array

	 * <code>data</code>, starting at index <code>offset [0]</code>, and

	 * increment <code>offset [0]</code> by the number of bytes written; if

	 * <code>data == null</code>, increment <code>offset [0]</code> by the

	 * number of bytes that would have been written otherwise.

	 *

	 * @param d the <code>double</code> to encode

	 * @param data The byte array to store into, or <code>null</code>.

	 * @param offset A single element array whose first element is the index in

	 * 		  data to begin writing at on function entry, and which on

	 * 		  function exit has been incremented by the number of bytes

	 * 		  written.

	 */

	public static final void doubleToBytes(double d, byte[] data, int[] offset) {

		long bits = Double.doubleToLongBits(d);

		longToBytes(bits, data, offset);

	}

	/**

	 * Return the <code>String</code> represented by the bytes in

	 * <code>data</code> staring at offset <code>offset[0]</code>. This method

	 * relies on the user using the corresponding <code>stringToBytes</code>

	 * method to encode the <code>String</code>, so that it may properly

	 * retrieve the <code>String</code> length.

	 *

	 * @param data the array from which to read

	 * @param offset A single element array whose first element is the index in

	 * 		  data from which to begin reading on function entry, and which on

	 * 		  function exit has been incremented by the number of bytes read.

	 *

	 * @return the value of the <code>String</code> decoded

	 */

	public static final String bytesToString(byte[] data, int[] offset) {

		offset[0] = 0;

		int length = bytesToInt(data, offset);

		String st = null;

		if ((length < 0) || (length > data.length)) {

			st = new String(data);

		} else {

			st = new String(data, offset[0], length);

		}

		offset[0] += length;

		return st;

	}

	/**

	 * Write the bytes representing <code>s</code> into the byte array

	 * <code>data</code>, starting at index <code>offset [0]</code>, and

	 * increment <code>offset [0]</code> by the number of bytes written; if

	 * <code>data == null</code>, increment <code>offset [0]</code> by the

	 * number of bytes that would have been written otherwise.

	 *

	 * @param s the <code>String</code> to encode

	 * @param data The byte array to store into, or <code>null</code>.

	 * @param offset A single element array whose first element is the index in

	 * 		  data to begin writing at on function entry, and which on

	 * 		  function exit has been incremented by the number of bytes

	 * 		  written.

	 */

	public static final void stringToBytes(String s, byte[] data, int[] offset) {

		byte[] s_bytes = s.getBytes();

		if (data != null) {

			intToBytes(s_bytes.length, data, offset);

			memcpy(data, offset[0], s_bytes, 0, s_bytes.length);

		} else {

			offset[0] += SIZE_INT;

		}

		offset[0] += s_bytes.length;

	}

	/**

	 * Return the <code>boolean</code> represented by the bytes in

	 * <code>data</code> staring at offset <code>offset[0]</code>.

	 *

	 * @param data the array from which to read

	 * @param offset A single element array whose first element is the index in

	 * 		  data from which to begin reading on  function entry, and which

	 * 		  on function exit has been incremented by the number of bytes

	 * 		  read.

	 *

	 * @return the value of the <code>boolean</code> decoded

	 */

	public static final boolean bytesToBool(byte[] data, int[] offset) {

		boolean result = true;

		if (data[offset[0]] == 0) {

			result = false;

		}

		offset[0] += SIZE_BOOL;

		return result;

	}

	/**

	 * Write the bytes representing <code>b</code> into the byte array

	 * <code>data</code>, starting at index <code>offset [0]</code>, and

	 * increment <code>offset [0]</code> by the number of bytes written; if

	 * <code>data == null</code>, increment <code>offset [0]</code> by the

	 * number of bytes that would have been written otherwise.

	 *

	 * @param b the <code>boolean</code> to encode

	 * @param data The byte array to store into, or <code>null</code>.

	 * @param offset A single element array whose first element is the index in

	 * 		  data to begin writing at on function entry, and which on

	 * 		  function exit has been incremented by the number of bytes

	 * 		  written.

	 */

	public static final void boolToBytes(boolean b, byte[] data, int[] offset) {

		if (data != null) {

			data[offset[0]] = (byte) (b ? 1 : 0);

		}

		offset[0] += SIZE_BOOL;

	}

	/**

	 * Return the <code>BigInteger</code> represented by the bytes in

	 * <code>data</code> staring at offset <code>offset[0]</code>.

	 *

	 * @param data the array from which to read

	 * @param offset A single element array whose first element is the index in

	 * 		  data from which to begin reading on  function entry, and which

	 * 		  on function exit has been incremented by the number of bytes

	 * 		  read.

	 *

	 * @return the <code>BigInteger</code> decoded

	 */

	public static final BigInteger bytesToBigInteger(byte[] data, int[] offset) {

		int length = bytesToInt(data, offset);

		byte[] bytes = new byte[length];

		offset[0] += memcpy(bytes, 0, data, offset[0], length);

		return new BigInteger(bytes);

	}

	/**

	 * Write the bytes representing <code>n</code> into the byte array

	 * <code>data</code>, starting at index <code>offset [0]</code>, and

	 * increment <code>offset [0]</code> by the number of bytes written; if

	 * <code>data == null</code>, increment <code>offset [0]</code> by the

	 * number of bytes that would have been written otherwise.

	 *

	 * @param n the <code>BigInteger</code> to encode

	 * @param data The byte array to store into, or <code>null</code>.

	 * @param offset A single element array whose first element is the index in

	 * 		  data to begin writing at on function entry, and which on

	 * 		  function exit has been incremented by the number of bytes

	 * 		  written.

	 */

	public static final void bigIntegerToBytes(BigInteger n, byte[] data,

		int[] offset) {

		byte[] bytes = n.toByteArray();

		intToBytes(bytes.length, data, offset);

		offset[0] += memcpy(data, offset[0], bytes, 0, bytes.length);

	}

	/**

	 * Convert an array of <code>bytes</code>s into an array of

	 * <code>ints</code>.

	 *

	 * @param dst the array to write

	 * @param dst_offset the start offset in <code>dst</code>, times 4. This

	 * 		  measures the offset as if <code>dst</code> were an array of

	 * 		  <code>byte</code>s (rather than <code>int</code>s).

	 * @param src the array to read

	 * @param src_offset the start offset in <code>src</code>

	 * @param length the number of <code>byte</code>s to copy.

	 */

	public static final void bytesToInts(int[] dst, int dst_offset, byte[] src,

		int src_offset, int length) {

		if ((src == null) || (dst == null) ||

				((src_offset + length) > src.length) ||

				((dst_offset + length) > (dst.length * 4)) ||

				((dst_offset % 4) != 0) || ((length % 4) != 0)) {

			croak("bytesToInts parameters are invalid" + " src==" + src +

				" dst==" + dst +

				(((src == null) || (dst == null)) ? " "

												  : (" (src_offset+length)>src.length==" +

				(src_offset + length) + ">" + src.length +

				" (dst_offset+length)>(dst.length*4)==" +

				(dst_offset + length) + ">" + (dst.length * 4) +

				" (dst_offset%4)==" + (dst_offset % 4) + " (length%4)==" +

				(length % 4) + " dest.length==" + dst.length + " length==" +

				length)));

		}

		// Convert parameters to normal format

		int[] offset = new int[1];

		offset[0] = src_offset;

		int int_dst_offset = dst_offset / 4;

		for (int i = 0; i < (length / 4); ++i) {

			dst[int_dst_offset++] = bytesToInt(src, offset);

		}

	}

	/**

	 * Convert an array of <code>int</code>s into an array of

	 * <code>bytes</code>.

	 *

	 * @param dst the array to write

	 * @param dst_offset the start offset in <code>dst</code>

	 * @param src the array to read

	 * @param src_offset the start offset in <code>src</code>, times 4. This

	 * 		  measures the offset as if <code>src</code> were an array of

	 * 		  <code>byte</code>s (rather than <code>int</code>s).

	 * @param length the number of <code>byte</code>s to copy.

	 */

	public static final void intsToBytes(byte[] dst, int dst_offset, int[] src,

		int src_offset, int length) {

		if ((src == null) || (dst == null) ||

				((dst_offset + length) > dst.length) ||

				((src_offset + length) > (src.length * 4)) ||

				((src_offset % 4) != 0) || ((length % 4) != 0)) {

			croak("intsToBytes parameters are invalid:" + " src=" + src +

				" dst=" + dst + " (dst_offset=" + dst_offset + " + length=" +

				length + ")=" + (dst_offset + length) + " > dst.length=" +

				((dst == null) ? 0 : dst.length) + " (src_offset=" +

				src_offset + " + length=" + length + ")=" +

				(src_offset + length) + " > (src.length=" +

				((src == null) ? 0 : src.length) + "*4)=" +

				((src == null) ? 0 : (src.length * 4)) + " (src_offset=" +

				src_offset + " % 4)=" + (src_offset % 4) + " != 0" +

				" (length=" + length + " % 4)=" + (length % 4) + " != 0");

		}

		// Convert parameters to normal format

		int[] offset = new int[1];

		offset[0] = dst_offset;

		int int_src_offset = src_offset / 4;

		for (int i = 0; i < (length / 4); ++i) {

			intToBytes(src[int_src_offset++], dst, offset);

		}

	}

	/**

	 * Convert a <code>byte</code> into an unsigned integer.

	 *

	 * @param b the <code>byte</code> to cast

	 *

	 * @return a postiive <code>int</code> whose lowest byte contains the bits

	 * 		   of <code>b</code>.

	 */

	public static final int byteToUnsignedInt(byte b) {

		return ((int) b) & 0xff;

	}

	/**

	 * Copy contents of one array of <code>bytes</code> into another. If either

	 * array is <code>null</code>, simply return the <code>length</code>

	 * parameter directly.

	 *

	 * @param dst the array to write, or <code>null</code>

	 * @param dst_offset the start offset in <code>dst</code>

	 * @param src the array to read, or <code>null</code>

	 * @param src_offset the start offset in <code>src</code>

	 * @param length the number of <code>byte</code>s to copy.

	 *

	 * @return DOCUMENT ME!

	 */

	public static int memcpy(byte[] dst, int dst_offset, byte[] src,

		int src_offset, int length) {

		if ((dst != null) && (src != null)) {

			if (dst.length < (dst_offset + length)) {

				croak("dst.length = " + dst.length + ", but " +

					"dst_offset = " + dst_offset + " and length = " + length +

					".");

			}

			if (src.length < (src_offset + length)) {

				croak("src.length = " + src.length + ", but " +

					"src_offset = " + src_offset + " and length = " + length +

					".");

			}

			for (int i = 0; i < length; ++i, ++dst_offset, ++src_offset)

				dst[dst_offset] = src[src_offset];

		}

		return length;

	}

	/**

	 * Compare the contents of one array of <code>bytes</code> to another.

	 *

	 * @param a the first array

	 * @param a_offset the start offset in <code>a</code>

	 * @param b the second array

	 * @param b_offset the start offset in <code>b</code>

	 * @param length the number of <code>byte</code>s to compare.

	 *

	 * @return DOCUMENT ME!

	 */

	public static boolean memcmp(byte[] a, int a_offset, byte[] b,

		int b_offset, int length) {

		if ((a == null) && (b == null)) {

			return true;

		}

		if ((a == null) || (b == null)) {

			return false;

		}

		for (int i = 0; i < length; ++i, ++a_offset, ++b_offset)

			if (a[a_offset] != b[b_offset]) {

				return false;

			}

		return true;

	}

	/**

	 * Fill the given array with zeros.

	 *

	 * @param array the array to clear

	 * @param offset the start offset

	 * @param length the number of <code>byte</code>s to clear.

	 */

	public static void memclr(byte[] array, int offset, int length) {

		for (int i = 0; i < length; ++i, ++offset)

			array[offset] = 0;

	}

	/**

	 * Round a number up to a given multiple.

	 *

	 * @param value the number to be rounded

	 * @param multiple the number to which to be rounded

	 *

	 * @return the smallest <code>int</code> greater than or equal to

	 * 		   <code>value</code> which divides <code>multiple</code> exactly.

	 */

	public static int round_up(int value, int multiple) {

		return (((value - 1) / multiple) + 1) * multiple;

	}

	/**

	 * Return a new array equal to original except zero-padded to an integral

	 * mulitple of blocks.  If the original is already an integral multiple of

	 * blocks, just return it.

	 *

	 * @param original the array of <code>byte</code>s to be padded

	 * @param block_size the size of the blocks

	 *

	 * @return an array whose size divides <code>block_size</code> exactly. The

	 * 		   array is either <code>original</code> itself, or a copy whose

	 * 		   first <code>original.length</code> bytes are equal to

	 * 		   <code>original</code>.

	 */

	public static byte[] zero_pad(byte[] original, int block_size) {

		if ((original.length % block_size) == 0) {

			return original;

		}

		byte[] result = new byte[round_up(original.length, block_size)];

		memcpy(result, 0, original, 0, original.length);

		// Unnecessary - jvm sets bytes to 0.

		// memclr (result, original.length, result.length - original.length);

		return result;

	}

	/**

	 * Determines whether two arrays of <code>byte</code>s contain the same

	 * contents.

	 *

	 * @param b1 The first array

	 * @param b2 The second array

	 *

	 * @return <code>true</code> if both arrays are <code>null</code>, both

	 * 		   empty, or both of the same length with equal contents.

	 */

	public static boolean equals(byte[] b1, byte[] b2) {

		if (b1 == b2) {

			return true;

		}

		if ((b1 == null) || (b2 == null)) { // only one is null

			return false;

		}

		if (b1.length != b2.length) {

			return false;

		}

		for (int i = 0; i < b1.length; ++i)

			if (b1[i] != b2[i]) {

				return false;

			}

		return true;

	}

	/**

	 * Produce a <code>String</code> representation for the specified array of

	 * <code>byte</code>s.  Print each <code>byte</code> as two hexadecimal

	 * digits.

	 *

	 * @param data The array to print

	 * @param offset the start offset in <code>data</code>

	 * @param length the number of <code>byte</code>s to print

	 *

	 * @return DOCUMENT ME!

	 */

	public static String print_bytes(byte[] data, int offset, int length) {

		int size = 2 * length;

		size += ((size / 8) + (size / 64));

		char[] buf = new char[size];

		int low_mask = 0x0f;

		int high_mask = 0xf0;

		int buf_pos = 0;

		byte b;

		int j = 0;

		for (int i = offset; i < (offset + length); ++i) {

			b = data[i];

			buf[buf_pos++] = digits[(high_mask & b) >> 4];

			buf[buf_pos++] = digits[(low_mask & b)];

			if ((j % 4) == 3) {

				buf[buf_pos++] = ' ';

			}

			if ((j % 32) == 31) {

				buf[buf_pos++] = '\n';

			}

			++j;

		}

		return new String(buf);

	}

	/**

	 * DOCUMENT ME!

	 *

	 * @param data DOCUMENT ME!

	 * @param offset DOCUMENT ME!

	 * @param length DOCUMENT ME!

	 *

	 * @return DOCUMENT ME!

	 */

	public static String print_bytes_exact(byte[] data, int offset, int length) {

		int size = 2 * length;

		char[] buf = new char[size];

		int low_mask = 0x0f;

		int high_mask = 0xf0;

		int buf_pos = 0;

		byte b;

		int j = 0;

		for (int i = offset; i < (offset + length); ++i) {

			b = data[i];

			buf[buf_pos++] = digits[(high_mask & b) >> 4];

			buf[buf_pos++] = digits[(low_mask & b)];

			++j;

		}

		return new String(buf);

	}

	/**

	 * DOCUMENT ME!

	 *

	 * @param data DOCUMENT ME!

	 *

	 * @return DOCUMENT ME!

	 */

	public static String print_bytes(byte[] data) {

		return print_bytes(data, 0, data.length);

	}

	/**

	 * DOCUMENT ME!

	 *

	 * @param msg DOCUMENT ME!

	 */

	private static void croak(String msg) {

		// throw new java.AssertionViolatedException(msg);

	}

	/**

	 * DOCUMENT ME!

	 *

	 * @param b DOCUMENT ME!

	 *

	 * @return DOCUMENT ME!

	 */

	public static int getUnsigned(byte b) {

		return ((b & 0xff)); // >> 8);

	}

}

/*

 * Created on 01-feb-2007

 *

 * 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

 */

/* CVS MESSAGES:

*

* $Id: CorruptedDwgEntityException.java 28969 2009-05-25 13:23:12Z jmvivo $

* $Log$

* Revision 1.1.2.2  2007-03-21 19:49:16  azabala

* implementation of dwg 12, 13, 14.

*

* Revision 1.1  2007/02/01 20:00:27  azabala

* *** empty log message ***

*

*

*/

package org.gvsig.dwg.lib;

public class CorruptedDwgEntityException extends Exception {

	public CorruptedDwgEntityException(String string) {

		super(string);

	}

}

/*

 * Created on 04-mar-2007

 *

 * 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

 */

/* CVS MESSAGES:

*

* $Id: IDwgVertex.java 28969 2009-05-25 13:23:12Z jmvivo $

* $Log$

* Revision 1.2.2.1  2007-03-21 19:49:16  azabala

* implementation of dwg 12, 13, 14.

*

* Revision 1.2  2007/03/20 19:55:27  azabala

* source code cleaning

*

* Revision 1.1  2007/03/06 19:39:38  azabala

* Changes to adapt dwg 12 to general architecture

*

*

*/

package org.gvsig.dwg.lib;

/**

 * Base interface for all DWG vertices. 

 * 

 * @author azabala

 * 

 * */

public interface IDwgVertex {

	public double[] getPoint();

	public void setPoint(double[] point);

}

/* jdwglib. Java Library for reading Dwg files.

 * 

 * Author: Jose Morell Rama (jose.morell@gmail.com).

 * Port from the Pythoncad Dwg library by Art Haas.

 *

 * Copyright (C) 2005 Jose Morell, IVER TI S.A. 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:

 *

 * Jose Morell (jose.morell@gmail.com)

 * 

 * or

 *

 * IVER TI S.A.

 *  C/Salamanca, 50

 *  46005 Valencia

 *  Spain

 *  +34 963163400

 *  dac@iver.es

 */

package org.gvsig.dwg.lib;

/**

 * The DwgHeader class implements the Header of a DWG file

 * 

 * @author jmorell

 */

public class DwgHeader {

}

/* jdwglib. Java Library for reading Dwg files.

 * 

 * Author: Jose Morell Rama (jose.morell@gmail.com).

 * Port from the Pythoncad Dwg library by Art Haas.

 *

 * Copyright (C) 2005 Jose Morell, IVER TI S.A. 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:

 *

 * Jose Morell (jose.morell@gmail.com)

 * 

 * or

 *

 * IVER TI S.A.

 *  C/Salamanca, 50

 *  46005 Valencia

 *  Spain

 *  +34 963163400

 *  dac@iver.es

 */

package org.gvsig.dwg.lib.util;

import java.text.StringCharacterIterator;

/**

 * This class allows to convert an Autocad text in an Unicode text

 * 

 * @author jmorell

 */

public class TextToUnicodeConverter {

    /**

     * This method allows to convert an Autocad text in an Unicode text

     * 

     * @param s Autocad text

     * @return String Unicode text

     */

	public static String convertText(String s) {

        StringCharacterIterator stringcharacteriterator = new StringCharacterIterator(s);

        StringBuffer stringbuffer = new StringBuffer();

        int ai[] = new int[s.length()];

        int i = 0;

        int j = 0;

        for(char c = stringcharacteriterator.first(); c != '\uFFFF'; c = stringcharacteriterator.next())

            if(c == '%')

            {

                c = stringcharacteriterator.next();

                if(c != '%')

                {

                    stringbuffer.append('%');

                    c = stringcharacteriterator.previous();

                } else

                {

                    c = stringcharacteriterator.next();

                    switch(c)

                    {

                    case 37: // '%'

                        stringbuffer.append('%');

                        break;

                    case 80: // 'P'

                    case 112: // 'p'

                        stringbuffer.append('\361');

                        break;

                    case 67: // 'C'

                    case 99: // 'c'

                        stringbuffer.append('\355');

                        break;

                    case 68: // 'D'

                    case 100: // 'd'

                        stringbuffer.append('\u00b0');

                        break;

                    case 85: // 'U'

                    case 117: // 'u'

                        ai[stringbuffer.length()] ^= 1;

                        i++;

                        break;

                    case 79: // 'O'

                    case 111: // 'o'

                        ai[stringbuffer.length()] ^= 2;

                        j++;

                        break;

                    default:

                        if(c >= '0' && c <= '9')

                        {

                            int k = 3;

                            char c1 = (char)(c - 48);

                            for(c = stringcharacteriterator.next(); c >= '0' && c <= '9' && --k > 0; c = stringcharacteriterator.next())

                                c1 = (char)(10 * c1 + (c - 48));

                            stringbuffer.append(c1);

                        }

                        c = stringcharacteriterator.previous();

                        break;

                    }

                }

            } else

            if(c == '^')

            {

                c = stringcharacteriterator.next();

                if(c == ' ')

                    stringbuffer.append('^');

            } else

            {

                stringbuffer.append(c);

            }

        s = Unicode.char2DOS437(stringbuffer, 2, '?');

		String ss = s;

		return ss;