Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
| Comment: | Fix a typo in the RTREE documentation. |
|---|---|
| Timelines: | family | ancestors | descendants | both | trunk |
| Files: | files | file ages | folders |
| SHA1: | 9ceaba9f7f831c8fca0daa978b4363e5 |
| User & Date: | drh 2013-08-19 14:26:23 |
Context
|
2013-08-20
| ||
| 17:06 | Fix typos in the cache_spill pragma documentation. check-in: 4bfef7edb7 user: drh tags: trunk | |
|
2013-08-19
| ||
| 21:17 | Initial docs for tointeger() and toreal() SQL functions. check-in: 083cd58817 user: mistachkin tags: toTypeFuncs | |
| 14:26 | Fix a typo in the RTREE documentation. check-in: 9ceaba9f7f user: drh tags: trunk | |
|
2013-08-17
| ||
| 17:56 | Add documentation for the cache_spill pragma. check-in: 74740a2d9e user: drh tags: trunk | |
Changes
Changes to pages/rtree.in.
323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 |
<p>
The default virtual table ("rtree") normally stores coordinates as
single-precision (4-byte) floating point numbers. If integer coordinates
are desired, declare the table using "rtree_i32" instead:
<blockquote><pre>
CREATE VIRTUAL TABLE intrtree USING rtree_i32(id,x0,x1,y0,y1,z0,y1);
</pre></blockquote>
<p>
An rtree_i32 stores coordinates as 32-bit signed integers. But it still
using floating point computations internally as part of the r-tree algorithm.
For applications running on processors without hardware floating point,
it might be desirable to have a pure integer implementation of r-trees.
|
| |
323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 |
<p>
The default virtual table ("rtree") normally stores coordinates as
single-precision (4-byte) floating point numbers. If integer coordinates
are desired, declare the table using "rtree_i32" instead:
<blockquote><pre>
CREATE VIRTUAL TABLE intrtree USING rtree_i32(id,x0,x1,y0,y1,z0,z1);
</pre></blockquote>
<p>
An rtree_i32 stores coordinates as 32-bit signed integers. But it still
using floating point computations internally as part of the r-tree algorithm.
For applications running on processors without hardware floating point,
it might be desirable to have a pure integer implementation of r-trees.
|