com.vividsolutions.jts.io.ByteOrderValues Maven / Gradle / Ivy
Show all versions of JTSplus Show documentation
/*
* The JTS Topology Suite is a collection of Java classes that
* implement the fundamental operations required to validate a given
* geo-spatial data set to a known topological specification.
*
* Copyright (C) 2001 Vivid Solutions
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* For more information, contact:
*
* Vivid Solutions
* Suite #1A
* 2328 Government Street
* Victoria BC V8T 5G5
* Canada
*
* (250)385-6040
* www.vividsolutions.com
*/
package com.vividsolutions.jts.io;
/**
* Methods to read and write primitive Java datatypes from/to byte
* sequences, allowing the byte order to be specified
*
* Similar to the standard Java ByteBuffer class.
*/
public class ByteOrderValues
{
public static final int BIG_ENDIAN = 1;
public static final int LITTLE_ENDIAN = 2;
public static int getInt(byte[] buf, int byteOrder)
{
if (byteOrder == BIG_ENDIAN) {
return ( (int) (buf[0] & 0xff) << 24)
| ( (int) (buf[1] & 0xff) << 16)
| ( (int) (buf[2] & 0xff) << 8)
| (( int) (buf[3] & 0xff) );
}
else {// LITTLE_ENDIAN
return ( (int) (buf[3] & 0xff) << 24)
| ( (int) (buf[2] & 0xff) << 16)
| ( (int) (buf[1] & 0xff) << 8)
| ( (int) (buf[0] & 0xff) );
}
}
public static void putInt(int intValue, byte[] buf, int byteOrder)
{
if (byteOrder == BIG_ENDIAN) {
buf[0] = (byte)(intValue >> 24);
buf[1] = (byte)(intValue >> 16);
buf[2] = (byte)(intValue >> 8);
buf[3] = (byte) intValue;
}
else {// LITTLE_ENDIAN
buf[0] = (byte) intValue;
buf[1] = (byte)(intValue >> 8);
buf[2] = (byte)(intValue >> 16);
buf[3] = (byte)(intValue >> 24);
}
}
public static long getLong(byte[] buf, int byteOrder)
{
if (byteOrder == BIG_ENDIAN) {
return
(long) (buf[0] & 0xff) << 56
| (long) (buf[1] & 0xff) << 48
| (long) (buf[2] & 0xff) << 40
| (long) (buf[3] & 0xff) << 32
| (long) (buf[4] & 0xff) << 24
| (long) (buf[5] & 0xff) << 16
| (long) (buf[6] & 0xff) << 8
| (long) (buf[7] & 0xff);
}
else {// LITTLE_ENDIAN
return
(long) (buf[7] & 0xff) << 56
| (long) (buf[6] & 0xff) << 48
| (long) (buf[5] & 0xff) << 40
| (long) (buf[4] & 0xff) << 32
| (long) (buf[3] & 0xff) << 24
| (long) (buf[2] & 0xff) << 16
| (long) (buf[1] & 0xff) << 8
| (long) (buf[0] & 0xff);
}
}
public static void putLong(long longValue, byte[] buf, int byteOrder)
{
if (byteOrder == BIG_ENDIAN) {
buf[0] = (byte)(longValue >> 56);
buf[1] = (byte)(longValue >> 48);
buf[2] = (byte)(longValue >> 40);
buf[3] = (byte)(longValue >> 32);
buf[4] = (byte)(longValue >> 24);
buf[5] = (byte)(longValue >> 16);
buf[6] = (byte)(longValue >> 8);
buf[7] = (byte) longValue;
}
else { // LITTLE_ENDIAN
buf[0] = (byte) longValue;
buf[1] = (byte)(longValue >> 8);
buf[2] = (byte)(longValue >> 16);
buf[3] = (byte)(longValue >> 24);
buf[4] = (byte)(longValue >> 32);
buf[5] = (byte)(longValue >> 40);
buf[6] = (byte)(longValue >> 48);
buf[7] = (byte)(longValue >> 56);
}
}
public static double getDouble(byte[] buf, int byteOrder)
{
long longVal = getLong(buf, byteOrder);
return Double.longBitsToDouble(longVal);
}
public static void putDouble(double doubleValue, byte[] buf, int byteOrder)
{
long longVal = Double.doubleToLongBits(doubleValue);
putLong(longVal, buf, byteOrder);
}
}