Commit Graph

53 Commits

Author SHA1 Message Date
Björn Harrtell
44e04be67f Get rid of goog.functions 2016-04-01 10:32:15 +02:00
Frederic Junod
ad3c6713da Return if the element is added to the ol.structs.PriorityQueue 2015-12-09 15:27:07 +01:00
Éric Lemoine
132861e175 Use interim tiles when changing dynamic parameters 2015-11-12 14:40:35 +01:00
Frederic Junod
e6a38d8211 Use goog.functions.identity instead of goog.identityFunction
goog.identityFunction is deprecated
2015-07-28 09:44:51 +02:00
Frederic Junod
baf424f99c Only update the rbush item if the extent has changed 2015-01-14 13:29:28 +01:00
Éric Lemoine
57db47ac18 Rename ol.structs.Buffer to ol.webgl.Buffer
The Buffer class is WebGL specific, and it's not really a "data structure", in the pure sense of the term.
2014-11-21 15:48:31 +01:00
Éric Lemoine
1e12e7ca90 Remove unused WebGL related code 2014-11-21 10:51:00 +01:00
Tim Schaub
93716fc7f0 Extend expect.js rather than modify the source 2014-07-06 12:40:03 -06:00
Frederic Junod
23383c9979 Add more tests for ol.structs.RBush#forEach 2014-06-11 13:45:18 +02:00
Frederic Junod
c0d8fe4126 Remove unneeded goog.require 2014-05-01 13:41:16 +02:00
Tom Payne
e5ee44f8ad Rename ol.structs.RBush#getAllInExtent to getInExtent 2014-03-06 14:30:56 +01:00
Frederic Junod
c94b78144f Fix test description 2014-02-06 12:48:51 +01:00
Tom Payne
8a7484c0de Add test for ol.structs.RBush#update with single object 2014-01-20 18:16:49 +01:00
ahocevar
67d2cddb84 Verify that removing random extent nodes also works 2013-12-13 18:27:33 +01:00
ahocevar
4d03c0bfaa Show an issue with ol.structs.RBush
Note that the same test passes in the original implementation.
2013-12-12 17:03:40 +01:00
Tom Payne
2be40a1ae6 Add ol.structs.RBush#isEmpty 2013-12-04 15:05:43 +01:00
ahocevar
45d9f6ce0b Rename rbush test to match the naming scheme 2013-11-28 16:17:29 +01:00
ahocevar
d4bdac715b Get rid of ol.structs.RTree 2013-11-28 16:17:17 +01:00
Tim Schaub
1877f92d46 Add forEach method to rtree, use it in feature cache
This saves having to create feature lookup objects and iterate through lookup properties multiple times.
2013-11-27 12:22:33 -07:00
Tom Payne
f847b37261 Rename ol.structs.RBush#allInExtent to getAllInExtent 2013-11-27 15:10:18 +01:00
Tom Payne
828456d18e Rename ol.structs.RBush#all to getAll 2013-11-27 15:10:18 +01:00
Tom Payne
665781ee03 Throw an exception if an ol.structs.RBush is modified while reading 2013-11-27 15:10:17 +01:00
Tom Payne
1293294d40 Implement ol.structs.RBush#remove_ 2013-11-26 12:02:59 -07:00
Tom Payne
0ea7c2cd50 Refactor ol.structs.RBush tests 2013-11-26 12:02:59 -07:00
Tom Payne
e823e7fde3 Add ol.structs.RBush 2013-11-26 12:02:59 -07:00
Tim Schaub
e806f51b3d Changing extent structure back to single array: [minX, minY, maxX, maxY]
This means we'll have to have a new structure and new methods for 3D envelopes.
2013-09-15 00:31:32 -06:00
Tim Schaub
6955499534 Update rtree to use new extent structure 2013-09-14 21:11:52 -06:00
Tom Payne
db2f805ed9 Return split values in a single interleaved Float32Array 2013-06-01 18:16:43 +02:00
Tom Payne
42f15f000b Add ol.structs.Buffer#getSplit32 2013-06-01 18:16:43 +02:00
Tom Payne
f4d54ace1d Remove unused variables in structs 2013-05-28 16:01:34 +02:00
ahocevar
d1beaff8e4 Merge pull request #731 from ahocevar/rtree-api-tests
RTree API improvements and more tests. r=@twpayne
2013-05-23 08:28:56 -07:00
ahocevar
10e3a16f40 RTree API improvements and more tests
This change reverts the RTree API back to the original one (i.e.
insert() instead of put(), search() instead of find()), and
creates a new searchReturningObject() method that returns an
object keyed by UIDs.

It also adds missing tests for type restricted search and
searchReturningObject().
2013-05-22 18:25:40 -05:00
ahocevar
597405c288 Fixing bug in tests
That's what you get from copying and pasting and forgetting to
modify the pasted lines to suit your needs.
2013-05-22 13:41:29 -05:00
ahocevar
0f4a5c09af Porting tests from http://github.com/imbcmdth/RTree/
Also fixes some issues that were revealed by the new tests.
2013-05-20 17:47:04 +02:00
ahocevar
79e4ee2717 More sophisticated RTree implementation
This new implementation is based on
http://github.com/imbcmdth/RTree/, with only a few modifications
to add the optional type and provide the API of the previous
implementation.

There is still room for optimization, but this is such an
improvement over the previous RTree already that it's worth
bringing it in now.
2013-05-19 01:47:21 +02:00
Tom Payne
efccede678 Use eql instead of equalArray 2013-04-30 18:21:58 +02:00
Tom Payne
1d4eaf6824 Port ol.structs.RTree to new extents 2013-04-19 10:03:35 +02:00
Tom Payne
4be8c991f7 Add missing Closure Library requires 2013-04-06 14:28:12 +02:00
Tom Payne
f12f5ccc67 Factor out core elements of ol.TileQueue into ol.structs.PriorityQueue 2013-03-27 14:34:28 +01:00
Tom Payne
ba0e7ae89c Allow a ol.structs.Buffer to update multiple dirty sets 2013-03-22 17:33:19 +01:00
Tom Payne
4ee73bc02f Add ol.structs.IntegerSet.intersectsRange 2013-03-22 17:33:13 +01:00
Tom Payne
657f58005e Remove unused function 2013-03-22 17:24:26 +01:00
Tom Payne
5192c5e64a Reverse order of arguments to set and s/index/offset/ 2013-03-22 17:23:30 +01:00
Tom Payne
713ad2cfb7 Replace unused entries with NaNs 2013-03-22 17:23:25 +01:00
Tom Payne
6ab5cfae8c Add ol.structs.IntegerSet.toString 2013-03-22 17:23:15 +01:00
Tom Payne
9047e98889 Add initial ol.structs.Buffer 2013-03-22 17:23:08 +01:00
Tom Payne
1833ec15e2 Refactor ol.structs.IntegerSet to use a packed array 2013-03-22 17:23:03 +01:00
Tom Payne
070b80c28d Add ol.structs.IntegerSet 2013-03-22 17:22:57 +01:00
Tom Payne
a1a2ab415f Fix some trivial typos 2013-03-19 21:34:31 +01:00
Tom Payne
6cc4cb33d0 Use more consistent directory structure 2013-03-19 12:03:31 +01:00