Creates a leaf node given the pointer to the start point of the segment.
170{
173 double value1;
174 double value2;
177
178 POSTGIS_DEBUGF(2, "RTreeCreateLeafNode called for point %d of %p", startPoint, pa);
179
180 if (pa->
npoints < startPoint + 2)
181 {
182 lwpgerror(
"RTreeCreateLeafNode: npoints = %d, startPoint = %d", pa->
npoints, startPoint);
183 }
184
185
186
187
188
189
191
195
199
201
207
208 POSTGIS_DEBUGF(3, "RTreeCreateLeafNode returning %p", parent);
209
210 return parent;
211}
POINTARRAY * ptarray_construct_empty(char hasz, char hasm, uint32_t maxpoints)
Create a new POINTARRAY with no points.
void * lwalloc(size_t size)
LWLINE * lwline_construct(int32_t srid, GBOX *bbox, POINTARRAY *points)
int getPoint4d_p(const POINTARRAY *pa, uint32_t n, POINT4D *point)
int ptarray_append_point(POINTARRAY *pa, const POINT4D *pt, int allow_duplicates)
Append a point to the end of an existing POINTARRAY If allow_duplicate is LW_FALSE,...
#define LW_TRUE
Return types for functions with status returns.
#define SRID_UNKNOWN
Unknown SRID value.
static RTREE_INTERVAL * RTreeCreateInterval(double value1, double value2)
Creates an interval given the min and max values, in arbitrary order.
struct rtree_node * leftNode
struct rtree_node * rightNode
RTREE_INTERVAL * interval
The following struct and methods are used for a 1D RTree implementation, described at: http://lin-ear...