librtree 1.0.6 → 1.0.7

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 1d23f82b41d0757dbca1d30fc447bd2573db6d1584727c3244c84bbae0bc6b83
-  data.tar.gz: 36b7cda50a05140949537890a4ab99ebc555f08d7f7789cd7d4d0bd14c7b4c27
+  metadata.gz: 3a28182f3e87b5fb00cbf5efea523d8c43bd02ed774261998b8d5b31ee6c90c0
+  data.tar.gz: 4fa0cd3c75e9bd942aca77085aed0f033bb3de7ef57cca79a742a43458207070
 SHA512:
-  metadata.gz: 5ad5636536266f5ac027bd9f7ee59b359f4a3b00c07107057c7b83d378122be21343ebb54db36fe0e7683c926e674a7c8e4f3a6013b4a38c3019078851995c38
-  data.tar.gz: 22292e552cd05823802107094df3ff12c0a0a04129e26dd0fe8a9dd1c1b966f47b1b1cf4a1ac046f0965710965235c5e3a195c4de87b5612aa968e042a3c38fb
+  metadata.gz: 947f0fcb19e4a7882b2e9d3bafdb4f4d20a85bbdd2d3e8e7245e584d2381400ac77d19f0a81b12e5b85c5cbcf36a52e7c7a948c320e6482af7ec4b01c32508d3
+  data.tar.gz: c0025ab24f0c93095e46d36a74bab89254a498c5da02928aa5341b80c94d362f30cca6677172cd5fc26f988291ce25b053552f3fbc123cc727a0db31c6efb660

data/CHANGELOG.md

@@ -1,9 +1,14 @@
 Changelog
 ---------
 
+### 1.0.7, 20-01-2026
+
+- Spelling
+- Tested on Ruby 3.4, 4.0
+
 ### 1.0.6, 07-04-2024
 
-- Update to librtree 1.3.0
+- Update to librtree 1.3.2
 - Adds `#envelope` `#csv_write`, `#to_csv`
 
 ### 1.0.5, 16-01-2024
@@ -62,7 +67,7 @@ Changelog
 ### 0.8.8, 14-07-2021
 
 - De-nest C base-class for neater documentation
-- Adopt "standard" naming-convention for the benfit of Yard
+- Adopt "standard" naming-convention for the benefit of Yard
   introspection
 - No functional changes
 

data/README.md

@@ -83,6 +83,6 @@ run the tests:
 
 
 [1]: http://www.digip.org/jansson/
-[3]: http://soliton.vm.bytemark.co.uk/pub/jjg/en/code/librtree/
+[3]: https://jjg.gitlab.io/en/code/librtree/
 [4]: https://github.com/rbenv/rbenv
 [5]: https://www.rubydoc.info/gems/librtree/RTree

data/ext/rtree/lib/branches.c

@@ -2,7 +2,7 @@
   The code here is to handle a void* buffer as an array of branch,
   we can't actually create an array of branch since its size is
   not known until runtime, so we have to perform those calculations
-  ourselves.  Note that we just do the arithmatic here, no error
+  ourselves.  Note that we just do the arithmetic here, no error
   checking -- so a over-sized index to branches_get()  will lead to
   a memory error, the caller is expected to do this check themselves
 */

data/ext/rtree/lib/bsrt.c

@@ -108,7 +108,7 @@ static int write_id(rtree_id_t id, FILE *stream)
   byte-order is big-endian, this saves time on little-endian
   hardware.  Note that in the big-endian case, we call htole32()
   which converts from the host integer byte-order to little-endian,
-  this will only be correct if integer and float endianess are
+  this will only be correct if integer and float endianness are
   the same, this is not true in general (!), there exists real
   hardware with big-endian floats and little-endian integers.
   So it would be better to use be32tole32() here, but that does

data/ext/rtree/lib/error.c

@@ -13,32 +13,31 @@ const char* strerror_rtree(int err)
   {
     int err;
     const char *msg;
-  } *m, mtab[] =
-      {
-        { RTREE_OK, "Success" },
-        { RTREE_ERR_INVAL, "Invalid argument" },
-        { RTREE_ERR_DOM, "Argument outside domain" },
-        { RTREE_ERR_NOMEM, "Out of memory" },
-        { RTREE_ERR_CSVPARSE, "Error parsing CSV" },
-        { RTREE_ERR_NOCSV, "Compiled without CSV support" },
-        { RTREE_ERR_JANSSON, "Error from the Jansson library" },
-        { RTREE_ERR_NOJSON, "Compiled without JSON support" },
-        { RTREE_ERR_NOBSRT, "Compiled without BSRT support" },
-        { RTREE_ERR_GETBRANCH, "Error getting branch" },
-        { RTREE_ERR_GETCHILD, "Error getting child node" },
-        { RTREE_ERR_NODECLONE, "Error cloning node" },
-        { RTREE_ERR_PICKBRANCH, "Error picking branch" },
-        { RTREE_ERR_ADDRECT, "Error adding rectangle" },
-        { RTREE_ERR_NOSUCHSPLIT, "No such splitting method" },
-        { RTREE_ERR_DIMS, "Bad R-tree dimension" },
-        { RTREE_ERR_EMPTY, "Empty R-tree" },
-        { RTREE_ERR_BUFFER, "Buffer to small" },
-        { RTREE_ERR_POSTSCRIPT, "Error generating PostScript" },
-        { RTREE_ERR_USER, "User abort" },
-        { RTREE_ERR_FWRITE, "Failed write" },
-        { RTREE_ERR_SPLIT, "Error in split" },
-        { -1, NULL }
-      };
+  } *m, mtab[] = {
+    { RTREE_OK, "Success" },
+    { RTREE_ERR_INVAL, "Invalid argument" },
+    { RTREE_ERR_DOM, "Argument outside domain" },
+    { RTREE_ERR_NOMEM, "Out of memory" },
+    { RTREE_ERR_CSVPARSE, "Error parsing CSV" },
+    { RTREE_ERR_NOCSV, "Compiled without CSV support" },
+    { RTREE_ERR_JANSSON, "Error from the Jansson library" },
+    { RTREE_ERR_NOJSON, "Compiled without JSON support" },
+    { RTREE_ERR_NOBSRT, "Compiled without BSRT support" },
+    { RTREE_ERR_GETBRANCH, "Error getting branch" },
+    { RTREE_ERR_GETCHILD, "Error getting child node" },
+    { RTREE_ERR_NODECLONE, "Error cloning node" },
+    { RTREE_ERR_PICKBRANCH, "Error picking branch" },
+    { RTREE_ERR_ADDRECT, "Error adding rectangle" },
+    { RTREE_ERR_NOSUCHSPLIT, "No such splitting method" },
+    { RTREE_ERR_DIMS, "Bad R-tree dimension" },
+    { RTREE_ERR_EMPTY, "Empty R-tree" },
+    { RTREE_ERR_BUFFER, "Buffer too small" },
+    { RTREE_ERR_POSTSCRIPT, "Error generating PostScript" },
+    { RTREE_ERR_USER, "User abort" },
+    { RTREE_ERR_FWRITE, "Failed write" },
+    { RTREE_ERR_SPLIT, "Error in split" },
+    { -1, NULL }
+  };
 
   for (m = mtab ; m->msg ; m++)
     if (m->err == err) return m->msg;

data/ext/rtree/lib/node.c

@@ -282,8 +282,8 @@ static node_t* node_split(const state_t *state, node_t *node, branch_t *branch)
 
 /*
   add branch to node, which may split the node: if so the new node
-  argumemnt is returned, so comparing the node argument and return
-  value is the way to detect that splitting has occured.
+  argument is returned, so comparing the node argument and return
+  value is the way to detect that splitting has occurred.
 */
 
 node_t* node_add_branch(const state_t *state, node_t *node, branch_t *branch)
@@ -306,7 +306,7 @@ node_t* node_add_branch(const state_t *state, node_t *node, branch_t *branch)
 
 /*
   Pick a branch.  Pick the one that will need the smallest increase
-  in volume to accomodate the new (hyper-)rectangle.  This will result
+  in volume to accommodate the new (hyper-)rectangle.  This will result
   in the least total volume for the covering rectangles in the current
   node.
 

data/ext/rtree/lib/package.c

@@ -5,7 +5,7 @@
 
 #include "rtree/package.h"
 
-const char rtree_package_version[] = "1.3.1";
+const char rtree_package_version[] = "1.3.2";
 const char rtree_package_name[] = "librtree";
 const char rtree_package_url[] = "https://gitlab.com/jjg/librtree";
 const char rtree_package_bugreport[] = "j.j.green@gmx.co.uk";

data/ext/rtree/lib/split.c

@@ -143,7 +143,7 @@ static int split_seed_linear(const state_t *state, split_t *split)
 /*
   Picks two rectangles to be the first (seed) elements of the
   partition groups.  They are the two that waste the most area
-  if convered by a single rectangle.
+  if covered by a single rectangle.
 
   Note that this is as implemented in the Guttman-Green version
   quadratic splitting, but is quadratic only in the page-size,

data/lib/rtree.rb

@@ -16,7 +16,7 @@ require 'fcntl'
 #
 # A Ruby native extension implementing the R-tree spatial index of
 # Guttman-Green.  The code is an embedded version of
-# {http://soliton.vm.bytemark.co.uk/pub/jjg/en/code/librtree librtree}.
+# {https://jjg.gitlab.io/en/code/librtree librtree}.
 #
 # Use
 #
@@ -346,7 +346,7 @@ class RTree < RTreeBase
     if block_given? then
       super
     else
-      ids = []
+      ids = [] #: Array[Integer]
       super(coords) { |id| ids << id }
       ids
     end
@@ -482,10 +482,10 @@ class RTree < RTreeBase
     super
   end
 
-  # @return [Array[float]] the bounding rectangle
-  # @note Ruturns the bounding rectangle (in the same format
-  #   as the rectangle input) for all rectangles in the tree.
-  #   In the case that the input is empty, returns nil.
+  # The bounding rectangle (in the same format as the rectangle
+  # input) for all rectangles in the tree.  In the case that the
+  # input is empty, returns nil.
+  # @return [Array<Float>] the bounding rectangle
   #
   def envelope
     super
@@ -627,11 +627,11 @@ class RTree::Style < RTreeStyleBase
     #     ]
     #   )
     #
-    def from_a(array)
+    def from_array(array)
       from_json(array.to_json)
     end
 
-    alias_method :from_array, :from_a
+    alias_method :from_a, :from_array
 
     private
 

metadata

@@ -1,139 +1,153 @@
 --- !ruby/object:Gem::Specification
 name: librtree
 version: !ruby/object:Gem::Version
-  version: 1.0.6
+  version: 1.0.7
 platform: ruby
 authors:
 - J.J. Green
-autorequire: 
+autorequire:
 bindir: bin
 cert_chain: []
-date: 2024-04-07 00:00:00.000000000 Z
+date: 2026-01-28 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '2.1'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '2.1'
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '13.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '13.0'
 - !ruby/object:Gem::Dependency
   name: rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '3.10'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '3.10'
 - !ruby/object:Gem::Dependency
   name: simplecov
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '0.22'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '0.22'
 - !ruby/object:Gem::Dependency
   name: yard
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '0.9'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '0.9'
 - !ruby/object:Gem::Dependency
   name: rubygems-tasks
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '0.2'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '0.2'
+- !ruby/object:Gem::Dependency
+  name: ostruct
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0.6'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0.6'
 - !ruby/object:Gem::Dependency
   name: rake-compiler
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '1.1'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '1.1'
 - !ruby/object:Gem::Dependency
   name: steep
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '1.4'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '1.4'
 - !ruby/object:Gem::Dependency
   name: rbs
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '3.2'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '3.2'
 description: |
@@ -205,7 +219,7 @@ homepage: https://gitlab.com/jjg/librtree-ruby
 licenses:
 - MIT
 metadata: {}
-post_install_message: 
+post_install_message:
 rdoc_options: []
 require_paths:
 - lib
@@ -214,7 +228,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: '2.0'
+      version: '3.0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
@@ -222,8 +236,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements:
 - The Jansson library
-rubygems_version: 3.3.7
-signing_key: 
+rubygems_version: 3.5.11
+signing_key:
 specification_version: 4
 summary: R-tree spatial index
 test_files: []