Documentation Source Text

Check-in [3af544a1b7]
Login

Many hyperlinks are disabled.
Use anonymous login to enable hyperlinks.

Overview
Comment:Fix mistaken latitude values in the examples in the RTree documentation.
Timelines: family | ancestors | descendants | both | trunk
Files: files | file ages | folders
SHA1: 3af544a1b7f47710515bc40cf4549d6d793b3770
User & Date: drh 2012-12-12 14:45:30
Context
2012-12-12
15:33
Remove references to GIFs used for rounded corners. Rounded corners have not used those GIFs since check-in [2912fc93f779] on 2012-09-04. check-in: 708a9a33a8 user: drh tags: trunk
14:45
Fix mistaken latitude values in the examples in the RTree documentation. check-in: 3af544a1b7 user: drh tags: trunk
14:44
Update the changelog with the sha1 and source-id for 3715. check-in: acbd6231fa user: dan tags: trunk
Changes
Hide Diffs Side-by-Side Diffs Ignore Whitespace Patch

Changes to pages/rtree.in.

   126    126   R*Tree index, we can do something like this:
   127    127   </p>
   128    128   
   129    129   <blockquote><pre>
   130    130   INSERT INTO demo_index VALUES(
   131    131       1,                   -- Primary key
   132    132       -80.7749, -80.7747,  -- Longitude range
   133         -    30.3776, 30.3778     -- Latitude range
          133  +    33.3776, 35.3778     -- Latitude range
   134    134   );
   135    135   INSERT INTO demo_index VALUES(
   136    136       2,
   137    137       -81.0, -79.6,
   138    138       35.0, 36.2
   139    139   );
   140    140   </pre></blockquote>)^
   141    141   
   142    142   <p>
   143    143   The entries above might represent (for example) a bounding box around
   144         -the offices for SQLite.org and bounding box around the
   145         -12th Congressional District of North Carolina in which SQLite.org is located.  
          144  +the main office for SQLite.org and bounding box around the
          145  +12th Congressional District of North Carolina (prior to the 2011
          146  +redistricting) in which SQLite.org was located.  
   146    147   </p>
   147    148   
   148    149   <h3>3.3 Querying An R*Tree Index</h3>
   149    150   
   150    151   <p>
   151    152   ^Any valid query will work against an R*Tree index.  But the R*Tree
   152    153   implementation is designed to make two kinds of queries especially