Skip to content

Commit a218a97

Browse files
committed
Remove trailing whitespace
1 parent 0493cf6 commit a218a97

10 files changed

+49
-49
lines changed

DEPENDENCIES.txt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
11
- python 3.8+
22
- setuptools
3-
- libspatialindex C library 1.8.5+:
3+
- libspatialindex C library 1.8.5+:
44
https://libspatialindex.org/

LICENSE.txt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
The MIT License (MIT)
22

3-
Copyright (c) 2018: Sean C. Gillies, Howard Butler and contributors
3+
Copyright (c) 2018: Sean C. Gillies, Howard Butler and contributors
44

55
Permission is hereby granted, free of charge, to any person obtaining a copy
66
of this software and associated documentation files (the "Software"), to deal

ci/CMakeLists.txt

+2-2
Original file line numberDiff line numberDiff line change
@@ -23,7 +23,7 @@ mark_as_advanced(CMAKE_VERBOSE_MAKEFILE)
2323
set(CMAKE_MODULE_PATH "${PROJECT_SOURCE_DIR}/cmake/modules" ${CMAKE_MODULE_PATH})
2424

2525
# Make string comparison in cmake behave like you'd expect
26-
cmake_policy(SET CMP0054 NEW)
26+
cmake_policy(SET CMP0054 NEW)
2727

2828
if (WIN32)
2929
if(${CMAKE_VERSION} VERSION_GREATER "3.14.5")
@@ -72,7 +72,7 @@ if(WIN32)
7272
endif( CMAKE_SIZEOF_VOID_P EQUAL 8 )
7373
endif()
7474
endif()
75-
75+
7676
set(CMAKE_INCLUDE_DIRECTORIES_PROJECT_BEFORE ON)
7777

7878
include (CheckFunctionExists)

ci/install_libspatialindex.bat

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ python -c "import sys; print(sys.version)"
22

33
set SIDX_VERSION=1.9.3
44

5-
curl -OL "https://github.com/libspatialindex/libspatialindex/archive/%SIDX_VERSION%.zip"
5+
curl -OL "https://github.com/libspatialindex/libspatialindex/archive/%SIDX_VERSION%.zip"
66

77
tar xvf "%SIDX_VERSION%.zip"
88

docs/source/class.txt

+2-2
Original file line numberDiff line numberDiff line change
@@ -5,9 +5,9 @@ Class Documentation
55

66
.. autoclass:: rtree.index.Index
77
:members: __init__, insert, intersection, nearest, delete, bounds, count, close, dumps, loads
8-
8+
99
.. autoclass:: rtree.index.Property
10-
:members:
10+
:members:
1111

1212
.. autoclass:: rtree.index.Item
1313
:members: __init__, bbox, object

docs/source/history.txt

+4-4
Original file line numberDiff line numberDiff line change
@@ -24,11 +24,11 @@ of new features and much more flexibility. See :ref:`changes` for more detail.
2424
.. note::
2525
A significant bug in the 1.6.1+ `libspatialindex`_ C API was found where
2626
it was using unsigned integers for index entry IDs instead of signed
27-
integers. Because `Rtree`_ appeared to be the only significant user of the
28-
C API at this time, it was corrected immediately. You should update
29-
immediately and re-insert data into new indexes if this is an important
27+
integers. Because `Rtree`_ appeared to be the only significant user of the
28+
C API at this time, it was corrected immediately. You should update
29+
immediately and re-insert data into new indexes if this is an important
3030
consideration for your application.
31-
31+
3232
Rtree 0.5.0 included a C library that is now the C API for libspatialindex and
3333
is part of that source tree. The code bases are independent from each other
3434
and can now evolve separately. Rtree is pure Python as of 0.6.0+.

docs/source/index.txt

+3-3
Original file line numberDiff line numberDiff line change
@@ -3,8 +3,8 @@
33
Rtree: Spatial indexing for Python
44
------------------------------------------------------------------------------
55

6-
`Rtree`_ is a `ctypes`_ Python wrapper of `libspatialindex`_ that provides a
7-
number of advanced spatial indexing features for the spatially curious Python
6+
`Rtree`_ is a `ctypes`_ Python wrapper of `libspatialindex`_ that provides a
7+
number of advanced spatial indexing features for the spatially curious Python
88
user. These features include:
99

1010
* Nearest neighbor search
@@ -21,7 +21,7 @@ Documentation
2121

2222
.. toctree::
2323
:maxdepth: 2
24-
24+
2525
install
2626
tutorial
2727
class

docs/source/install.txt

+6-6
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
Installation
44
------------------------------------------------------------------------------
55

6-
\*nix
6+
\*nix
77
..............................................................................
88

99
First, download and install version 1.8.5+ of the `libspatialindex`_ library from:
@@ -14,8 +14,8 @@ The library is a GNU-style build, so it is a matter of::
1414

1515
$ ./configure; make; make install
1616

17-
You may need to run the ``ldconfig`` command after installing the library to
18-
ensure that applications can find it at startup time.
17+
You may need to run the ``ldconfig`` command after installing the library to
18+
ensure that applications can find it at startup time.
1919

2020
At this point you can get Rtree 0.7.0 via easy_install::
2121

@@ -29,11 +29,11 @@ You can build and test in place like::
2929

3030
$ python setup.py test
3131

32-
Windows
32+
Windows
3333
..............................................................................
3434

35-
The Windows DLLs of `libspatialindex`_ are pre-compiled in
36-
windows installers that are available from `PyPI`_. Installation on Windows
35+
The Windows DLLs of `libspatialindex`_ are pre-compiled in
36+
windows installers that are available from `PyPI`_. Installation on Windows
3737
is as easy as::
3838

3939
c:\python2x\scripts\easy_install.exe Rtree

docs/source/performance.txt

+8-8
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
Performance
44
------------------------------------------------------------------------------
55

6-
See the `tests/benchmarks.py`_ file for a comparison of various query methods
6+
See the `tests/benchmarks.py`_ file for a comparison of various query methods
77
and how much acceleration can be obtained from using Rtree.
88

99
.. _tests/benchmarks.py: https://raw.github.com/Rtree/Rtree/master/tests/benchmarks.py
@@ -12,19 +12,19 @@ There are a few simple things that will improve performance.
1212

1313
Use stream loading
1414
..............................................................................
15-
15+
1616
This will substantially (orders of magnitude in many cases) improve
1717
performance over :py:meth:`~rtree.index.Index.insert` by allowing the data to
18-
be pre-sorted
18+
be pre-sorted
1919

20-
::
20+
::
2121

2222
>>> def generator_function(somedata):
2323
... for i, obj in enumerate(somedata):
2424
... yield (i, (obj.xmin, obj.ymin, obj.xmax, obj.ymax), obj)
2525
>>> r = index.Index(generator_function(somedata))
2626

27-
After bulk loading the index, you can then insert additional records into
27+
After bulk loading the index, you can then insert additional records into
2828
the index using :py:meth:`~rtree.index.Index.insert`
2929

3030
Override :py:data:`~rtree.index.Index.dumps` to use the highest pickle protocol
@@ -42,7 +42,7 @@ Override :py:data:`~rtree.index.Index.dumps` to use the highest pickle protocol
4242
Use objects='raw'
4343
...............................................................................
4444

45-
In any :py:meth:`~rtree.index.Index.intersection` or
45+
In any :py:meth:`~rtree.index.Index.intersection` or
4646
:py:meth:`~rtree.index.Index.nearest` or query, use objects='raw' keyword
4747
argument ::
4848

@@ -61,7 +61,7 @@ Adjust :py:class:`rtree.index.Property` appropriate to your index.
6161
* Increase the :py:data:`~rtree.index.Property.fill_factor` to something
6262
near 0.9. Smaller fill factors mean more splitting, which means more
6363
nodes. This may be bad or good depending on your usage.
64-
64+
6565
Limit dimensionality to the amount you need
6666
...............................................................................
6767

@@ -71,7 +71,7 @@ point comparisons for each query, search, and insert operation of the index.
7171

7272
Use the correct query method
7373
...............................................................................
74-
74+
7575
Use :py:meth:`~rtree.index.Index.count` if you only need a count and
7676
:py:meth:`~rtree.index.Index.intersection` if you only need the ids.
7777
Otherwise, lots of data may potentially be copied.

docs/source/tutorial.txt

+21-21
Original file line numberDiff line numberDiff line change
@@ -3,21 +3,21 @@
33
Tutorial
44
------------------------------------------------------------------------------
55

6-
This tutorial demonstrates how to take advantage of :ref:`Rtree <home>` for
7-
querying data that have a spatial component that can be modeled as bounding
6+
This tutorial demonstrates how to take advantage of :ref:`Rtree <home>` for
7+
querying data that have a spatial component that can be modeled as bounding
88
boxes.
99

1010

1111
Creating an index
1212
..............................................................................
1313

14-
The following section describes the basic instantiation and usage of
14+
The following section describes the basic instantiation and usage of
1515
:ref:`Rtree <home>`.
1616

1717
Import
1818
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1919

20-
After :ref:`installing <installation>` :ref:`Rtree <home>`, you should be able to
20+
After :ref:`installing <installation>` :ref:`Rtree <home>`, you should be able to
2121
open up a Python prompt and issue the following::
2222

2323
>>> from rtree import index
@@ -30,21 +30,21 @@ with the index.
3030
Construct an instance
3131
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
3232

33-
After importing the index module, construct an index with the default
33+
After importing the index module, construct an index with the default
3434
construction::
3535

3636
>>> idx = index.Index()
3737

3838
.. note::
3939

40-
While the default construction is useful in many cases, if you want to
41-
manipulate how the index is constructed you will need pass in a
42-
:py:class:`rtree.index.Property` instance when creating the index.
40+
While the default construction is useful in many cases, if you want to
41+
manipulate how the index is constructed you will need pass in a
42+
:py:class:`rtree.index.Property` instance when creating the index.
4343

4444
Create a bounding box
4545
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
4646

47-
After instantiating the index, create a bounding box that we can
47+
After instantiating the index, create a bounding box that we can
4848
insert into the index::
4949

5050
>>> left, bottom, right, top = (0.0, 0.0, 1.0, 1.0)
@@ -67,16 +67,16 @@ Insert an entry into the index::
6767

6868
.. note::
6969

70-
Entries that are inserted into the index are not unique in either the
71-
sense of the `id` or of the bounding box that is inserted with index
72-
entries. If you need to maintain uniqueness, you need to manage that before
70+
Entries that are inserted into the index are not unique in either the
71+
sense of the `id` or of the bounding box that is inserted with index
72+
entries. If you need to maintain uniqueness, you need to manage that before
7373
inserting entries into the Rtree.
7474

7575
.. note::
7676

7777
Inserting a point, i.e. where left == right && top == bottom, will
7878
essentially insert a single point entry into the index instead of copying
79-
extra coordinates and inserting them. There is no shortcut to explicitly
79+
extra coordinates and inserting them. There is no shortcut to explicitly
8080
insert a single point, however.
8181

8282
Query the index
@@ -95,7 +95,7 @@ Given a query window, return ids that are contained within the window::
9595
>>> list(idx.intersection((1.0, 1.0, 2.0, 2.0)))
9696
[0]
9797

98-
Given a query window that is beyond the bounds of data we have in the
98+
Given a query window that is beyond the bounds of data we have in the
9999
index::
100100

101101
>>> list(idx.intersection((1.0000001, 1.0000001, 2.0, 2.0)))
@@ -106,7 +106,7 @@ Nearest Neighbors
106106

107107
The following finds the 1 nearest item to the given bounds. If multiple items
108108
are of equal distance to the bounds, both are returned::
109-
109+
110110
>>> idx.insert(1, (left, bottom, right, top))
111111
>>> list(idx.nearest((1.0000001, 1.0000001, 2.0, 2.0), 1))
112112
[0, 1]
@@ -138,10 +138,10 @@ to intersection::
138138
Serializing your index to a file
139139
..............................................................................
140140

141-
One of :ref:`Rtree <home>`'s most useful properties is the ability to
142-
serialize Rtree indexes to disk. These include the clustered indexes
141+
One of :ref:`Rtree <home>`'s most useful properties is the ability to
142+
serialize Rtree indexes to disk. These include the clustered indexes
143143
described :ref:`here <clustered>`::
144-
144+
145145
>>> file_idx = index.Rtree('rtree')
146146
>>> file_idx.insert(1, (left, bottom, right, top))
147147
>>> file_idx.insert(2, (left - 1.0, bottom - 1.0, right + 1.0, top + 1.0))
@@ -191,7 +191,7 @@ stored on disk as the files ``3d_index.data`` and ``3d_index.index``::
191191
>>> p = index.Property()
192192
>>> p.dimension = 3
193193
>>> p.dat_extension = 'data'
194-
>>> p.idx_extension = 'index'
194+
>>> p.idx_extension = 'index'
195195
>>> idx3d = index.Index('3d_index',properties=p)
196196
>>> idx3d.insert(1, (0, 60, 23.0, 0, 60, 42.0))
197197
>>> idx3d.intersection( (-1, 62, 22, -1, 62, 43))
@@ -200,9 +200,9 @@ stored on disk as the files ``3d_index.data`` and ``3d_index.index``::
200200
ZODB and Custom Storages
201201
..............................................................................
202202

203-
https://mail.zope.org/pipermail/zodb-dev/2010-June/013491.html contains a custom
203+
https://mail.zope.org/pipermail/zodb-dev/2010-June/013491.html contains a custom
204204
storage backend for `ZODB`_
205205

206206
.. _ZODB: http://www.zodb.org/
207207

208-
.. _`libspatialindex`: https://libspatialindex.org/
208+
.. _`libspatialindex`: https://libspatialindex.org/

0 commit comments

Comments
 (0)