[prev in list] [next in list] [prev in thread] [next in thread]
List: postgis-users
Subject: [postgis] shp2psql memory leak and FIX
From: jeff lounsbury <jeffloun () refractions ! net>
Date: 2001-10-23 23:54:13
Message-ID: 3BD60325.5670A5E1 () refractions ! net
[Download RAW message or body]
I was notified of a problem in shp2pgsql today and it turned out to be a
memory leak when processing polygon files.
So if anyone is seeing a shp2pgsql process allocate huge amounts of
memory you will want to get the updated version of the the program. I
have also attached the shp2pgsql.c file.
-Jeff
------------------------ Yahoo! Groups Sponsor ---------------------~-->
Pinpoint the right security solution for your company- Learn how to add 128- bit \
encryption and to authenticate your web site with VeriSign's FREE guide! \
http://us.click.yahoo.com/yQix2C/33_CAA/yigFAA/PhFolB/TM
---------------------------------------------------------------------~->
To unsubscribe from this group, send an email to:
postgis-unsubscribe@yahoogroups.com
Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
["shp2pgsql.c" (application/x-unknown-content-type-cfile)]
// usage: shp2pgsql.c [<options>] <shapefile name> <table name> <database>
// -s SR_ID : set the SR_ID field, if not specified it defaults to -1
// -d: drops the table , then recreates it and populates it with current shape file \
data // -a: appends shape file into current table, must be excatly the same table \
schema // -c: creates a new table and populates it, this is the default if you don't \
specify any options // -D: use postgresql dump format (defaults to sql insert \
statements). Use // this option whenever possible for much faster application
// Using shapelib 1.2.8, this program reads in shape files and processes it's \
contents // into a Insert statements which can be easily piped into a database \
frontend. // Specifically designed to insert type 'geometry' (a custom written \
PostgreSQL type) // for the shape files and PostgreSQL standard types for all \
attributes of the entity. //
// Basically the program determines which type of shape (currently supports: 2d \
points,2d lines,2d // polygons,3d points, and 3d lines) is in the file and takes \
appropriate // action to create the table,geometry and load the attributes.
// BUGS:
// possible: no row # for polygons?
#include "shapefil.h"
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef struct {double x, y;} Point;
typedef struct Ring{
Point *list; //list of points
struct Ring *next;
int n; //number of points in list
} Ring;
int dump_format = 0; //0=insert statements, 1 = dump
int Insert_attributes(DBFHandle hDBFHandle, int row);
char *make_good_string(char *str);
int ring_check(SHPObject* obj, char *table, char *sr_id, int rings,
DBFHandle hDBFHandle);
char *protect_quotes_string(char *str);
int PIP( Point P, Point* V, int n );
char *make_good_string(char *str){
//find all the tabs and make them \<tab>s
//
// 1. find # of tabs
// 2. make new string
//
// we dont escape already escaped tabs
char *result;
char *str2;
char *start,*end;
int num_tabs = 0;
(str2) = (str);
while ((str2 = strchr(str2, '\t')) )
{
if ( (str2 == str) || (str2[-1] != '\\') ) //the previous char isnt a '\'
num_tabs ++;
str2++;
}
if (num_tabs == 0)
return str;
result =(char *) malloc ( strlen(str) + num_tabs+1);
memset(result,0, strlen(str) + num_tabs+1 );
start = str;
while((end = strchr((start),'\t')))
{
if ( (end == str) || (end[-1] != '\\' ) ) //the previous char isnt a '\'
{
strncat(result, start, (end-start));
strcat(result,"\\\t");
start = end +1;
}
else
{
strncat(result, start, (end-start));
strcat(result,"\t");
start = end +1;
}
}
strcat(result,start);
return result;
}
char *protect_quotes_string(char *str){
//find all the tabs and make them \<tab>s
//
// 1. find # of quotes
// 2. make new string
char *result;
char *str2;
char *start,*end;
int num_tabs = 0;
str2 = str;
while ((str2 = strchr((str2), '\'')) )
{
if ( (str2 == str) || (str2[-1] != '\\') ) //the previous char isnt a '\'
num_tabs ++;
str2++;
}
if (num_tabs == 0)
return str;
result =(char *) malloc ( strlen(str) + num_tabs+1);
memset(result,0, strlen(str) + num_tabs+1 );
start = str;
while((end = strchr((start),'\'')))
{
if ( (end == str) || (end[-1] != '\\' ) ) //the previous char isnt a '\'
{
strncat(result, start, (end-start));
strcat(result,"\\'");
start = end +1;
}
else
{
strncat(result, start, (end-start));
strcat(result,"'");
start = end +1;
}
}
strcat(result,start);
return result;
}
// PIP(): crossing number test for a point in a polygon
// input: P = a point,
// V[] = vertex points of a polygon V[n+1] with V[n]=V[0]
// returns: 0 = outside, 1 = inside
int PIP( Point P, Point* V, int n ){
int cn = 0; // the crossing number counter
int i;
// loop through all edges of the polygon
for (i=0; i<n; i++) { // edge from V[i] to V[i+1]
if (((V[i].y <= P.y) && (V[i+1].y > P.y)) // an upward crossing
|| ((V[i].y > P.y) && (V[i+1].y <= P.y))) { // a downward crossing
double vt = (float)(P.y - V[i].y) / (V[i+1].y - V[i].y);
if (P.x < V[i].x + vt * (V[i+1].x - V[i].x)) // P.x < intersect
++cn; // a valid crossing of y=P.y right of P.x
}
}
return (cn&1); // 0 if even (out), and 1 if odd (in)
}
//This function basically deals with the polygon case.
//it sorts the polys in order of outer,inner,inner, so that inners always come after \
outers they are within //return value is the number of rings seen so far, used to \
keep id's unique.
int ring_check(SHPObject* obj, char *table, char *sr_id, int rings,DBFHandle \
hDBFHandle){ Point pt,pt2;
Ring *Poly;
Ring *temp;
Ring **Outer; //pointer to a list of outer polygons
Ring **Inner; //pointer to a list of inner polygons
int out_index,in_index,indet_index; //indexes to the lists **Outer and **Inner
int in,temp2;
int u,i,N,n;
int next_ring; //the index of the panPartStart list
double area;
//initialize all counters/indexes
out_index=0;
in_index=0;
indet_index=0;
area=0;
n=0;
i=0;
N = obj->nVertices;
if(obj->nParts >1){
next_ring = 1;//if there is more than one part, set the next_ring index to one
}else{
next_ring = -99;
}
//allocate initial pointer memory
Outer = (Ring**)malloc(sizeof(Ring*)*obj->nParts);
Inner = (Ring**)malloc(sizeof(Ring*)*obj->nParts);
Poly = (Ring*)malloc(sizeof(Ring));
Poly->list = (Point*)malloc(sizeof(Point)*N);
Poly->next = NULL;
for (u=0;u<N;u++){
//check if the next point is the start of a new ring
if( ((next_ring != -99) && (u+1 == obj->panPartStart[next_ring] )) || u==N-1){
//check if a ring is clockwise(outer) or not(inner) by getting positive(inner) or \
negative(outer) area. //'area' is actually twice actual polygon area so divide by 2, \
not that it matters but in case we use it latter... area = area/2.0;
if(area < 0.0 || obj->nParts ==1){
//An outer ring so fill in the last point then put it in the 'Outer' list
Poly->list[n].x = obj->padfX[u]; //the polygon is ended with it's first \
co-ordinates reused Poly->list[n].y = obj->padfY[u];
Poly->n = n+1;
Outer[out_index] = Poly;
out_index++;
if(u != N-1){ //dont make another ring if we are finished
//allocate memory to start building the next ring
Poly = (Ring*)malloc(sizeof(Ring));
//temp2 is the number of points in the list of the next ring
//determined so that we can allocate the right amount of mem 6 lines down
if((next_ring + 1) == obj->nParts){
temp2 = N;
}else{
temp2 = obj->panPartStart[next_ring+1] - obj->panPartStart[next_ring];
}
Poly->list = (Point*)malloc(sizeof(Point)*temp2);
Poly->next = NULL;//make sure to make to initiale next to null or you never know \
when the list ends
//this never used to be here and was a pain in the ass bug to find...
}
n=0;//set your count of what point you are at in the current ring back to 0
}else{
Poly->list[n].x = obj->padfX[u]; //the polygon ends with it's first co-ordinates \
reused Poly->list[n].y = obj->padfY[u];
Poly->n = n+1;
Inner[in_index] = Poly;
in_index++;
Poly = (Ring*)malloc(sizeof(Ring));
temp2 = N;
if((next_ring + 1) == obj->nParts){
}else{
temp2 = obj->panPartStart[next_ring+1] - obj->panPartStart[next_ring];
}
Poly->list = (Point*)malloc(sizeof(Point)*temp2);
Poly->next = NULL;
n=0;
}
area=0.0;
if((next_ring + 1) == obj->nParts){
}else{
next_ring++;
}
}else{
Poly->list[n].x = obj->padfX[u];
Poly->list[n].y = obj->padfY[u];
n++;
area += (obj->padfX[u] * obj->padfY[u+1]) - (obj->padfY[u] * obj->padfX[u+1]); \
//calculate the area
}
}
//Put the inner rings into the list of the outer rings of which they are within
for(u=0; u < in_index; u++){
pt.x = Inner[u]->list[0].x;
pt.y = Inner[u]->list[0].y;
pt2.x = Inner[u]->list[1].x;
pt2.y = Inner[u]->list[1].y;
for(i=0;i< out_index; i++){
in = PIP(pt,Outer[i]->list,Outer[i]->n);
if(in==1 && PIP(pt2,Outer[i]->list,Outer[i]->n)){
Poly = Outer[i];
while(Poly->next != NULL){
Poly = Poly->next;
}
Poly->next = Inner[u];
break;
}
}
//if the ring wasn't within any outer rings, assume it is a new outer ring
if(i == out_index){
Outer[out_index] = Inner[u];
out_index++;
}
}
//start spitting out the sql for ordered entities now.
if (dump_format){
printf("%i",rings);
}else{
printf("\nInsert into %s values('%i'",table,rings);
}
rings++;
Insert_attributes(hDBFHandle,rings-1);
if (dump_format){
printf("%i\tSRID=%s ;MULTIPOLYGON(",rings,sr_id );
}else{
printf(",GeometryFromText('MULTIPOLYGON(");
}
for(u=0; u < out_index; u++){
Poly = Outer[u];
if(u==0){
printf("(");
}else{
printf(",(");
}
while(Poly != NULL){
for(i=0;i<Poly->n;i++){
if(i==0){
if(Poly != Outer[u]){
printf(",");
}
printf("(%.15g %.15g ",Poly->list[i].x,Poly->list[i].y);
}else{
printf(",%.15g %.15g ",Poly->list[i].x,Poly->list[i].y);
}
}
printf(")");
Poly = Poly->next;
}
printf(")");
}
if (dump_format){
printf(")\n");
}else{
printf(")',%s) );",sr_id);
}
for(u=0; u < out_index; u++){
Poly = Outer[u];
while(Poly != NULL){
temp = Poly;
Poly = Poly->next;
free(temp->list);
free(temp->next);
free(temp);
}
}
free(Outer);
free(Inner);
free(Poly);
return rings;
}
//Insert the attributes from the correct row of dbf file
int Insert_attributes(DBFHandle hDBFHandle, int row){
int i,num_fields;
num_fields = DBFGetFieldCount( hDBFHandle );
for( i = 0; i < num_fields; i++ ){
if (dump_format){
printf("\t%s",make_good_string((char*)DBFReadStringAttribute( hDBFHandle,row, i \
)) ); }else{
printf(",'%s'",protect_quotes_string((char*)DBFReadStringAttribute(hDBFHandle, \
row, i )) ); }
}
return 1;
}
// main()
//see description at the top of this file
int main (int ARGC, char **ARGV){
SHPHandle hSHPHandle;
DBFHandle hDBFHandle;
int num_fields,num_records,begin,trans;
int num_entities, phnshapetype,next_ring,errflg,c;
double padminbound[8], padmaxbound[8];
int u,j,tot_rings,curindex;
SHPObject *obj;
char name[12];
char opt;
char *sr_id,*shp_file,*table, *database;
DBFFieldType type;
extern char *optarg;
extern int optind;
opt = ' ';
errflg =0;
j=0;
sr_id =shp_file = table = database = NULL;
while ((c = getopt(ARGC, ARGV, "cdaDs:")) != EOF){
switch (c) {
case 'c':
if (opt == ' ')
opt ='c';
else
errflg =1;;
break;
case 'd':
if (opt == ' ')
opt ='d';
else
errflg =1;;
break;
case 'a':
if (opt == ' ')
opt ='a';
else
errflg =1;;
break;
case 'D':
dump_format =1;
break;
case 's':
sr_id = optarg;
break;
case '?':
errflg=1;
}
}
if(sr_id == NULL){
sr_id = "-1";
}
if(opt == ' '){
opt = 'c';
}
curindex=0;
for ( ; optind < ARGC; optind++){
if(curindex ==0){
shp_file = ARGV[optind];
}else if(curindex == 1){
table = ARGV[optind];
}else if(curindex == 2){
database = ARGV[optind];
}
curindex++;
}
if(curindex != 3){
errflg = 1;
}
if (errflg==1) {
printf("\n**ERROR** invalid option or command parameters\n");
printf("\n");
printf("USAGE: shp2pgsql [<options>] <shapefile name> <table name> <database>\n");
printf("\n");
printf("OPTIONS:\n");
printf(" -s <srid> Set the SRID field. If not specified it defaults to -1.\n");
printf("\n");
printf(" (-d|a|c) These are mutually exclusive options:\n");
printf(" -d Drops the table , then recreates it and populates\n");
printf(" it with current shape file data.\n");
printf(" -a Appends shape file into current table, must be\n");
printf(" exacatly the same table schema.\n");
printf(" -c Creates a new table and populates it, this is the\n");
printf(" default if you do not specify any options.\n");
printf("\n");
printf(" -D use postgresql dump format (defaults to sql insert\n");
printf(" statments.\n");
printf("\n");
exit (2);
}
//Open the shp and dbf files
hSHPHandle = SHPOpen( shp_file, "rb" );
hDBFHandle = DBFOpen( shp_file, "rb" );
if (hSHPHandle == NULL || hDBFHandle == NULL){
printf ("shape is null\n");
exit(-1);
}
if(opt == 'd'){
//-------------------------Drop the table--------------------------------
//drop the table given
printf("select DropGeometryColumn('%s','%s','the_geom');",database,table);
printf("\ndrop table %s;\n",table);
}
if(opt == 'c' || opt == 'd'){ //if opt is 'a' do nothing, go straight to making \
inserts
//-------------------------Create the table--------------------------------
//create a table for inserting the shapes into with appropriate columns and types
printf("create table %s (gid int4 ",table);
num_fields = DBFGetFieldCount( hDBFHandle );
num_records = DBFGetRecordCount(hDBFHandle);
for(j=0;j<num_fields;j++){
type = DBFGetFieldInfo(hDBFHandle, j, name, NULL, NULL);
if(strcmp(name,"gid")==0){
printf(", %s__2 ",name);
}else{
printf(", %s ",name);
}
if(hDBFHandle->pachFieldType[j] == 'D' ){
printf ("varchar(8)");//date data-type is not supported in API so check for it \
explicity before the api call. }else{
if(type == FTString){
printf ("varchar");
}else if(type == FTInteger){
printf ("int4");
}else if(type == FTDouble){
printf ("float8");
}else{
printf ("Invalid type in DBF file");
}
}
}
printf (");\n");
//finished creating the table
}
SHPGetInfo( hSHPHandle, &num_entities, &phnshapetype, &padminbound[0], \
&padmaxbound[0]); obj = SHPReadObject(hSHPHandle,0);
trans=0;
//create the geometry column with an addgeometry call to dave's function
if(opt != 'a'){
printf("select AddGeometryColumn('%s','%s','the_geom','%s',",database,table,sr_id);
if( obj->nSHPType == 1 ){ //2d point
printf("'MULTIPOINT',2);\n");
}else if( obj->nSHPType == 3){ //2d arcs/lines
printf("'MULTILINESTRING',2);\n");
}else if( obj->nSHPType == 5){ //2d polygons
printf("'MULTIPOLYGON',2);\n");
}else if( obj->nSHPType == 11){ //3d points
printf("'MULTIPOINT',3);\n");
}else if( obj->nSHPType == 13){ //3d arcs/lines
printf("'MULTILINESTRING',3);\n");
}else{
printf("'GEOMETRY',3);\n");
}
}
if (dump_format){
printf("COPY \"%s\" from stdin;\n",table);
}
//Determine what type of shape is in the file and do appropriate processing
if (obj->nVertices == 0){
if (dump_format){
printf("\\N");
Insert_attributes(hDBFHandle,j);//add the attributes of each shape to the insert \
statement SHPDestroyObject(obj);
}else{
printf("NULL");
Insert_attributes(hDBFHandle,j);//add the attributes of each shape to the insert \
statement SHPDestroyObject(obj);
}
}
else
{
if( obj->nSHPType == 5 ){
//---------------------------------------------------------------------------------
//---------POLYGONS----------------------------------------------------------------
// sorts of all the rings so that they are outer,inner,iner,outer,inner...
// with the inner ones coming after the outer ones they are within spatially
tot_rings = 0;
//go through each entity and call ring_check() to sort the rings and print out the \
sql statement // keep track of total number of inserts in tot_rings so
// you can pass it to the function for the next entity
for (j=0;j<num_entities; j++){
//wrap a transaction block around each 250 inserts...
if(trans == 250 || j==0){
if(j==0){
if (!(dump_format) )
printf("begin;");
}else{
if (!(dump_format) ){
printf("end;\n");
printf("begin;");
}
}
trans=0;
}
trans++;
// transaction stuff done
obj = SHPReadObject(hSHPHandle,j); //open the next object
tot_rings = ring_check(obj,table,sr_id,tot_rings,hDBFHandle);
SHPDestroyObject(obj); //close the object
}
if (!(dump_format) ){
printf("end;"); //End the last transaction block
}
}else if( obj->nSHPType == 1){
//---------------------------------------------------------------------
//----------POINTS-----------------------------------------------------
for (j=0;j<num_entities; j++){
//wrap a transaction block around each 250 inserts...
if(trans == 250 || j==0){
if(j==0){
if (!(dump_format) )
printf("begin;");
}else{
if (!(dump_format) ){
printf("end;\n");
printf("begin;");
}
}
trans=0;
}
trans++;
// transaction stuff done
if (dump_format){
printf("%i",j);
}else{
printf("insert into %s values ('%i'",table,j);
}
Insert_attributes(hDBFHandle,j); //add the attributes for each entity to the \
insert statement
if (dump_format){
printf("\tSRID=%s;MULTIPOINT(",sr_id);
}else{
printf(",GeometryFromText('MULTIPOINT (");
}
obj = SHPReadObject(hSHPHandle,j);
for (u=0;u<obj->nVertices; u++){
if (u>0){
printf(",%.15g %.15g",obj->padfX[u],obj->padfY[u]);
}else{
printf("%.15g %.15g",obj->padfX[u],obj->padfY[u]);
}
}
if (dump_format){
printf(")\n");
}
else{
printf(")',%s) );\n",sr_id);
}
SHPDestroyObject(obj);
}
if (!(dump_format) ){
printf("end;"); //End the last transaction
}
}else if( obj->nSHPType == 3){
//------------------------------------------------------------------------
//--------ARCs / LINES----------------------------------------------------
begin=0;//initialize the begin flag
for (j=0;j<num_entities; j++){
//wrap a transaction around each 250 inserts...
if(trans == 250 || j==0){
if(j==0){
if (!(dump_format) )
printf("begin;\n");
}else{
if (!(dump_format) )
printf("end;\n");
if (!(dump_format) )
printf("begin;");
}
trans=0;
}
trans++;
//end of transaction stuff
if (dump_format){
printf("%i",j);
}else{
printf("insert into %s values('%i'",table,j);
}
obj = SHPReadObject(hSHPHandle,j);
if(obj->nParts >1){
next_ring = 1;//if there is more than one part, set the next_ring index to one
}else{
next_ring = -99;
}
Insert_attributes(hDBFHandle,j); //add the attributes of each shape to the insert \
statement
if (dump_format){
printf("\tSRID=%s;MULTILINESTRING(",sr_id);
}else{
printf(",GeometryFromText('MULTILINESTRING (");
}
//for each vertice write out the coordinates in the insert statement, when there \
is a new line //you must end the brackets and start new ones etc.
for (u=0;u<obj->nVertices; u++){
//check if the next vertice is the start of a new line
//printf("\n\nu+1 = %d, next_ring = %d index = \
%d\n",u+1,next_ring,obj->panPartStart[next_ring]);
if(next_ring==-99 && obj->nVertices ==1){
printf("(%.15g %.15g )",obj->padfX[u],obj->padfY[u]);
}else if((next_ring != -99)&& (begin==1) && (u+1 == obj->panPartStart[next_ring]) \
){ printf("(%.15g %.15g )",obj->padfX[u],obj->padfY[u]);
next_ring++;
begin=1;
}else if(((next_ring != -99) && (u+1 == obj->panPartStart[next_ring] )) || \
u==(obj->nVertices-1) ){ printf(",%.15g %.15g ",obj->padfX[u],obj->padfY[u]);
printf(")");
next_ring++;
begin=1;//flag the fact that you area at a new line next time through the loop
}else{
if (u==0 || begin==1){ //if you are at the begging of a new line add comma and \
brackets if(u!=0) printf(",");
printf("(%.15g %.15g ",obj->padfX[u],obj->padfY[u]);
begin=0;
}else{
printf(",%.15g %.15g ",obj->padfX[u],obj->padfY[u]);
}
}
}
if (dump_format)
{
printf(")\n");
}
else
printf(")',%s) );\n",sr_id);
SHPDestroyObject(obj);
}
if (!(dump_format) )
printf("end;");//end the last transaction
}else if( obj->nSHPType == 13){
//---------------------------------------------------------------------
//------Linez(3D lines)--------------------------------------------
begin=0;//initialize the begin flag
for (j=0;j<num_entities; j++){
//wrap a transaction around each 250 inserts...
if(trans == 250 || j==0){
if(j==0){
if (!(dump_format) )
printf("begin;");
}else{
if (!(dump_format) )
printf("end;\n");
if (!(dump_format) )
printf("begin;");
}
trans=0;
}
trans++;
//end transaction stuff
if (dump_format){
printf("%i",j);
}else{
printf("insert into %s values ('%i'",table,j);
}
obj = SHPReadObject(hSHPHandle,j);
if(obj->nParts >1){
next_ring = 1;//if there is more than one part, set the next_ring index to one
}else{
next_ring = -99;
}
Insert_attributes(hDBFHandle,j);//add the attributes of each shape to the insert \
statement
if (dump_format){
printf("MULTILINESTRING(");
}else{
printf(",GeometryFromText('MULTILINESTRING (");
}
//for each vertice write out the coordinates in the insert statement, when there \
is a new line //you must end the brackets and start new ones etc.
for (u=0;u<obj->nVertices; u++){
//check if the next vertice is the start of a new line
if(((next_ring != -99) && (u+1 == obj->panPartStart[next_ring] )) || \
u==(obj->nVertices-1) ){ printf(",%.15g %.15g ",obj->padfX[u],obj->padfY[u]);
printf(")");
next_ring++;
begin =1;//flag the fact that you area at a new line next time through the loop
}else{
if (u==0 || begin==1){
if(u!=0) printf(",");
printf("(%.15g %.15g %.15g ",obj->padfX[u],obj->padfY[u],obj->padfZ[u]);
begin=0;
}else{
printf(",%.15g %.15g %.15g ",obj->padfX[u],obj->padfY[u],obj->padfZ[u]);
}
}
}
if (dump_format){
printf(")\n");
}else{
printf(")',%s));\n",sr_id);
}
SHPDestroyObject(obj);
}
if (!(dump_format) )
printf("end;");//close last transaction
}else if( obj->nSHPType == 11){
//---------------------------------------------------------------------------
//------POINTZ (3D POINTS)---------------------------------------------------
for (j=0;j<num_entities; j++){
//wrap a transaction around each 250 inserts...
if(trans == 250 || j==0){
if(j==0){
if (!(dump_format) )
printf("begin;\n");
}else{
if (!(dump_format) )
printf("end;\n");
if (!(dump_format) )
printf("begin;\n");
}
trans=0;
}
trans++;
//end of transaction stuff
if (dump_format){
printf("%i",j);
}else{
printf("insert into %s values('%i'",table,j);
}
obj = SHPReadObject(hSHPHandle,j);
Insert_attributes(hDBFHandle,j);//add the attributes of each shape to the insert \
statement
if (dump_format){
printf("\tSRID=%s;MULTIPOINT(",sr_id);
}else{
printf(",GeometryFromText('MULTIPOINT (");
}
for (u=0;u<obj->nVertices; u++){
if (u>0){
printf(",%.15g %.15g %.15g",obj->padfX[u],obj->padfY[u],obj->padfZ[u]);
}else{
printf("%.15g %.15g %.15g",obj->padfX[u],obj->padfY[u],obj->padfZ[u]);
}
}
if (dump_format)
{
printf(")\n");
}
else
printf(")',%s));\n",sr_id);
SHPDestroyObject(obj);
}
if (!(dump_format) )
printf("end;");//end the last transaction
}else{
printf ("\n\n**** Type is NOT SUPPORTED, type id = %d ****\n\n",obj->nSHPType);
//print out what type the file is and that it is not supported
}//end the if statement for shape types
}
if ((dump_format) ) {
printf("\\.\n");
}
return(1);
}//end main()
[prev in list] [next in list] [prev in thread] [next in thread]
Configure |
About |
News |
Add a list |
Sponsored by KoreLogic