librtree 0.9.0 → 1.0.0

data/ext/rtree/lib/spvol.c

@@ -0,0 +1,48 @@
+/* Autogenerated by spvol.py, do not edit */
+
+#include "spvol.h"
+
+int spvol(size_t dim, double *val)
+{
+  static const double table[] = {
+    0x1.0000000000000p+1,
+    0x1.921fb54442d18p+1,
+    0x1.0c152382d7366p+2,
+    0x1.3bd3cc9be45dep+2,
+    0x1.50e1eb50f3976p+2,
+    0x1.4abbce625be53p+2,
+    0x1.2e6290cef4eedp+2,
+    0x1.03c1f081b5ac4p+2,
+    0x1.a6358a2b69ee8p+1,
+    0x1.466bc6775aae2p+1,
+    0x1.e254a1c03f10dp+0,
+    0x1.55d3c7e3cbffap+0,
+    0x1.d23deea12eccap-1,
+    0x1.32d2cce62bd86p-1,
+    0x1.86991141a8ff6p-2,
+    0x1.e1f506891babbp-3,
+    0x1.20bab3dc8101bp-3,
+    0x1.50783487ee782p-4,
+    0x1.7dec9576c3b57p-5,
+    0x1.a6d1f2a204a8cp-6,
+    0x1.c915f468284fep-7,
+    0x1.e3074fde8871fp-8,
+    0x1.f378691d9b076p-9,
+    0x1.f9d38a3763cc3p-10,
+    0x1.f61f536576352p-11,
+    0x1.e8f434d018d63p-12,
+    0x1.d3658f946c006p-13,
+    0x1.b6e24f44b128fp-14,
+    0x1.95114f4a6c2b5p-15,
+    0x1.6fadb9f155744p-16,
+    0x1.4866e45924c72p-17,
+    0x1.20c62c2f2d7f5p-18,
+  };
+  static const size_t table_size = sizeof(table) / sizeof(double);
+  if (dim < 1) return 1;
+  size_t n = dim - 1;
+  if (n >= table_size) return 1;
+  *val = table[n];
+  return 0;
+}
+

data/ext/rtree/lib/spvol.h

@@ -0,0 +1,13 @@
+/*
+  spvol.h
+  Copyright (c) J.J. Green 2020
+*/
+
+#ifndef SPVOL_H
+#define SPVOL_H
+
+#include <stddef.h>
+
+int spvol(size_t, double*);
+
+#endif

data/ext/rtree/lib/state.c

@@ -0,0 +1,169 @@
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include "rtree/state.h"
+#include "rtree/branch.h"
+#include "rtree/node.h"
+
+#include "page.h"
+#include "constants.h"
+#include "spvol.h"
+
+#include <errno.h>
+#include <string.h>
+
+#ifdef HAVE_TGMATH_H
+#include <tgmath.h>
+#else
+#include <math.h>
+#endif
+
+#ifdef HAVE_UNISTD_H
+#include <unistd.h>
+#endif
+
+
+#define SPLIT_MASK ((1 << 2) - 1)
+#define SPLIT_SHIFT 0
+
+static state_flags_t flags_split(state_flags_t flags)
+{
+  return (flags << SPLIT_SHIFT) & SPLIT_MASK;
+}
+
+state_flags_t state_split(const state_t *state)
+{
+  return flags_split(state->flags);
+}
+
+#define NODE_PAGE_MASK ((1 << 8) - 1)
+#define NODE_PAGE_SHIFT 2
+
+static state_flags_t flags_node_page(state_flags_t flags)
+{
+  return (flags >> NODE_PAGE_SHIFT) & NODE_PAGE_MASK;
+}
+
+state_flags_t state_node_page(const state_t *state)
+{
+  return flags_node_page(state->flags);
+}
+
+/*
+  For dim 2 with floats and 4K page-size we find that a node-page
+  of 8 gives reasonable performance; here we guess a formula which
+  scales the way you would expect and choose the parameter 64 so that
+  it gives  8 in the dim 2 float case.  No doubt one could do better
+  with a case-by-case optimisation, but there are a lot of cases to
+  consider, look at that later ...
+*/
+
+static size_t node_page_default(size_t dims, size_t npg, size_t psz)
+{
+  if (npg != 0) return npg;
+  size_t guess = psz / (dims * SIZEOF_RTREE_COORD_T * 64);
+  return guess ? guess : 1;
+}
+
+state_t* state_new(size_t dims, state_flags_t flags)
+{
+  if (dims == 0)
+    {
+      errno = EDOM;
+      return NULL;
+    }
+
+  size_t psz;
+
+  if (page_size(&psz) != 0)
+    return NULL;
+
+  const size_t
+    npg = node_page_default(dims, flags_node_page(flags), psz),
+    nsz = psz / npg,
+    bsz = branch_sizeof(2 * dims),
+    factor = node_num_branch(nsz, bsz);
+
+  if (factor < 2)
+    {
+      errno = EINVAL;
+      return NULL;
+    }
+
+  double volume;
+
+  if (spvol(dims, &volume) != 0)
+    {
+      errno = EDOM;
+      return NULL;
+    }
+
+  state_t *state = malloc(sizeof(state_t));
+
+  if (state == NULL)
+    {
+      errno = ENOMEM;
+      return NULL;
+    }
+
+  state->dims = dims;
+  state->factor = factor;
+  state->size.page = psz;
+  state->size.branch = bsz;
+  state->size.node = nsz;
+  state->volume = volume;
+  state->flags = flags;
+  state->rectf.spherical_volume = rectf_spherical_volume(dims);
+  state->rectf.combine = rectf_combine(dims);
+
+  return state;
+}
+
+state_t* state_clone(const state_t *src)
+{
+  state_t *dest;
+
+  if ((dest = malloc(sizeof(state_t))) != NULL)
+    {
+      memcpy(dest, src, sizeof(state_t));
+      return dest;
+    }
+
+  errno = ENOMEM;
+  return NULL;
+}
+
+void state_destroy(state_t *state)
+{
+  free(state);
+}
+
+bool state_identical(const state_t *a, const state_t *b)
+{
+  if (a && b)
+    {
+      return
+        (state_dims(a) == state_dims(b)) &&
+        (state_page_size(a) == state_page_size(b)) &&
+        (state_node_size(a) == state_node_size(b)) &&
+        (state_rect_size(a) == state_rect_size(b)) &&
+        (state_branching_factor(a) == state_branching_factor(b));
+    }
+
+  return ! (a || b);
+}
+
+extern size_t state_dims(const state_t*);
+extern size_t state_page_size(const state_t*);
+extern size_t state_node_size(const state_t*);
+extern size_t state_rect_size(const state_t*);
+extern size_t state_branch_size(const state_t*);
+extern size_t state_branching_factor(const state_t*);
+extern double state_unit_sphere_volume(const state_t*);
+extern size_t state_bytes(const state_t*);
+extern rtree_coord_t state_rsv(const state_t*, const rtree_coord_t*);
+extern void state_rc(const state_t*,
+                     const rtree_coord_t*,
+                     const rtree_coord_t*,
+                     rtree_coord_t*);

data/ext/rtree/rtree.c

@@ -24,7 +24,7 @@ static size_t rt_dsize(const void *p)
 
 static VALUE rt_alloc(VALUE cls)
 {
-  rtree_t *rtree;;
+  rtree_t *rtree;
   if ((rtree = rtree_alloc()) == NULL)
     rb_raise(rb_eNoMemError, "failed to alloc rtree");
   return TypedData_Wrap_Struct(cls, &rtree_type, rtree);
@@ -534,6 +534,7 @@ void Init_rtree(void)
 
   VALUE cRTreeStyleBase = rb_const_get(rb_cObject, rb_intern("RTreeStyleBase"));
 
+  rb_undef_alloc_func(cRTreeStyleBase);
   rb_define_method(cRTreeStyleBase, "free", st_release, 0);
   rb_define_singleton_method(cRTreeStyleBase, "json_read", st_json_read, 1);
 }

data/lib/rtree.rb

@@ -271,7 +271,7 @@ class RTree < RTreeBase
   # @param node_page [Integer] the nodes-per-page value. This value can
   #   affect performance quite dramatically, particularly build time. A
   #   value which is too large would result in an infeasible branching
-  #   factor for the R-tree and will case the function to error with errno
+  #   factor for the R-tree and will cause the function to error with errno
   #   set to EINVAL. A value of zero is permitted and the default; in
   #   this case the function will choose a good value based on heuristics.
   #   You may get better performance for your use-case by manual
@@ -482,8 +482,6 @@ class RTree < RTreeBase
   # @param margin [Float] extra space around the plot in units of
   #   PostScript point (1/72 inch), default zero
   #
-  # rdoc-image:img/cb-bupu3.png
-  #
   def postscript(io, style, height: nil, width: nil, margin: 0)
     if height && width then
       raise ArgumentError, 'cannot specify both height and width'

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: librtree
 version: !ruby/object:Gem::Version
-  version: 0.9.0
+  version: 1.0.0
 platform: ruby
 authors:
 - J.J. Green
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2021-11-07 00:00:00.000000000 Z
+date: 2023-02-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -103,7 +103,54 @@ extensions:
 - ext/rtree/extconf.rb
 extra_rdoc_files: []
 files:
+- CHANGELOG.md
+- COPYING
+- README.md
 - ext/rtree/extconf.rb
+- ext/rtree/lib/bindex.c
+- ext/rtree/lib/bindex.h
+- ext/rtree/lib/bounds.h
+- ext/rtree/lib/branch.c
+- ext/rtree/lib/branches.c
+- ext/rtree/lib/bsrt.c
+- ext/rtree/lib/bsrt.h
+- ext/rtree/lib/constants.h
+- ext/rtree/lib/csv.c
+- ext/rtree/lib/csv.h
+- ext/rtree/lib/endianness.h
+- ext/rtree/lib/error.c
+- ext/rtree/lib/json.c
+- ext/rtree/lib/json.h
+- ext/rtree/lib/mk/Hdr.mk
+- ext/rtree/lib/mk/MakeDepend
+- ext/rtree/lib/mk/Obj.mk
+- ext/rtree/lib/node.c
+- ext/rtree/lib/package.c
+- ext/rtree/lib/page.c
+- ext/rtree/lib/page.h
+- ext/rtree/lib/postscript.c
+- ext/rtree/lib/rect.c
+- ext/rtree/lib/rectf.c
+- ext/rtree/lib/rtree-base.c
+- ext/rtree/lib/rtree.h
+- ext/rtree/lib/rtree/branch.h
+- ext/rtree/lib/rtree/branches.h
+- ext/rtree/lib/rtree/error.h
+- ext/rtree/lib/rtree/extent.h
+- ext/rtree/lib/rtree/node.h
+- ext/rtree/lib/rtree/package.h
+- ext/rtree/lib/rtree/postscript.h
+- ext/rtree/lib/rtree/rect.h
+- ext/rtree/lib/rtree/rectf.h
+- ext/rtree/lib/rtree/search.h
+- ext/rtree/lib/rtree/state.h
+- ext/rtree/lib/rtree/types.h
+- ext/rtree/lib/search.c
+- ext/rtree/lib/split.c
+- ext/rtree/lib/split.h
+- ext/rtree/lib/spvol.c
+- ext/rtree/lib/spvol.h
+- ext/rtree/lib/state.c
 - ext/rtree/rtree.c
 - lib/rtree.rb
 homepage: https://gitlab.com/jjg/librtree-ruby
@@ -126,8 +173,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements:
-- The librtree library (1.0.6 or later)
-rubygems_version: 3.1.2
+- The Jannson library
+rubygems_version: 3.1.6
 signing_key: 
 specification_version: 4
 summary: R-tree spatial index