⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 linestring.java

📁 postGIS是一个能够使用postSQL数据库来管理GIS数据的小程序,充分发挥了该数据库的空间管理功能,非常有用哦
💻 JAVA
字号:
/* * LineString.java *  * PostGIS extension for PostgreSQL JDBC driver - geometry model *  * (C) 2004 Paul Ramsey, pramsey@refractions.net *  * (C) 2005 Markus Schaber, markus.schaber@logix-tt.com *  * 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. *  * 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 or visit the web at * http://www.gnu.org. *  * $Id: LineString.java 1622 2005-04-15 14:04:34Z mschaber $ */package org.postgis;import java.sql.SQLException;public class LineString extends PointComposedGeom {    /* JDK 1.5 Serialization */    private static final long serialVersionUID = 0x100;    double len = -1.;    public LineString() {        super(LINESTRING);    }    public LineString(Point[] points) {        super(LINESTRING, points);    }    public LineString(String value) throws SQLException {        super(LINESTRING, value);    }    public LineString(String value, boolean haveM) throws SQLException {        super(LINESTRING, value, haveM);    }    public LineString reverse() {        Point[] points = this.getPoints();        int l = points.length;        int i, j;        Point[] p = new Point[l];        for (i = 0, j = l - 1; i < l; i++, j--) {            p[i] = points[j];        }        return new LineString(p);    }    public LineString concat(LineString other) {        Point[] points = this.getPoints();        Point[] opoints = other.getPoints();        boolean cutPoint = this.getLastPoint() == null                || this.getLastPoint().equals(other.getFirstPoint());        int count = points.length + points.length - (cutPoint ? 1 : 0);        Point[] p = new Point[count];        // Maybe we should use System.arrayCopy here?        int i, j;        for (i = 0; i < points.length; i++) {            p[i] = points[i];        }        if (!cutPoint) {            p[i++] = other.getFirstPoint();        }        for (j = 1; j < opoints.length; j++, i++) {            p[i] = opoints[j];        }        return new LineString(p);    }    public double length() {        if (len < 0) {            Point[] points = this.getPoints();            if ((points == null) || (points.length < 2)) {                len = 0;            } else {                double sum = 0;                for (int i = 1; i < points.length; i++) {                    sum += points[i - 1].distance(points[i]);                }                len = sum;            }        }        return len;    }}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -