metanorma 2.5.23 → 2.5.24

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: b10fe30704e90dd64f266eccf4924730880bbd373d4edc3abcf14680e9d7bf65
-  data.tar.gz: e558651f1522eb3f278a97da5c9a3884fe037dc9e67b6d863a3365df097a5eb4
+  metadata.gz: 5b7f24f8333462e860db4b5e24a6e92f48da2c2ce8dc53f42d0b91da79ffbd9b
+  data.tar.gz: b3496f8ce83f4ccdc72b7f757b12ad2108d938de33764b5a7e6be86426f15ffe
 SHA512:
-  metadata.gz: fd160507ec2c4095036e73fc0e59d3fddb3d904c9f3d02d583a19739591184ef6df32fb234952f516498ef0cd7e8da4b757b3f6bb416134f4657dd7e054063b8
-  data.tar.gz: 3bd440249de25476c58639323a600100832a349d46bb37fcfed5b11c9a6db8495e7a26c95ed2ed5be074f986a8e0a5c2b6a7ba770684bc7532a4b32d727e1903
+  metadata.gz: 5bc44aaac9aed93d4f70d7a31e15874f8fc37a13d6e222d5f24d5d36dddd7ba8cb1f60e218c574e4be835c8fc309669c3e51f4f03fa1c346f93dfc6ecc42c27f
+  data.tar.gz: de64618a5753ed9cf54632ccc79847dc19f836ad805ec7d04f18389eb358ca246d54b63066cfd5bde11db9a46093c8b8b0f862837291aca40ad9c0be9287f1fa

data/lib/metanorma/collection/renderer/svg.rb

@@ -416,15 +416,35 @@ module Metanorma
       # name (geometry_schema.cartesian_point_ISO_10303-42_2025_...), so
       # the plain name resolves by prefix. Multiple equal-length matches
       # are ambiguous and refuse, as do differing ids at the same key.
+      # Memoized per prefix: the index is immutable once built, and a
+      # mega-member's svgmap erefs hit this per stage pass (the linear
+      # scan showed up at 24%+ of a 104-style render's wall).
       def hotspot_prefix_lookup(idx, prefix)
-        return idx[prefix] if idx[prefix]
+        @hotspot_prefix_memo ||= {}
+        @hotspot_prefix_memo.fetch(prefix) do
+          @hotspot_prefix_memo[prefix] =
+            idx[prefix] || prefix_lookup_scan(idx, prefix)
+        end
+      end
 
-        candidates = idx.select { |k, r| r && k.start_with?("#{prefix}_") }
+      # Candidate keys sharing the prefix, by binary search over the
+      # sorted index keys: keys with the stem prefix are contiguous in
+      # sort order, so the slice between the lower bound and the first
+      # non-matching key is the entire candidate set.
+      def prefix_lookup_scan(idx, prefix)
+        stem = "#{prefix}_"
+        keys = hotspot_sorted_keys(idx)
+        lo = keys.bsearch_index { |k| k >= stem } or return nil
+        candidates = keys[lo..].take_while { |k| k.start_with?(stem) }
         return nil if candidates.empty?
 
-        shortest = candidates.min_by { |k, _| k.length }
-        ties = candidates.count { |k, _| k.length == shortest[0].length }
-        ties == 1 ? shortest[1] : nil
+        shortest = candidates.min_by(&:length)
+        ties = candidates.count { |k| k.length == shortest.length }
+        ties == 1 ? idx[shortest] : nil
+      end
+
+      def hotspot_sorted_keys(idx)
+        @hotspot_sorted_keys ||= idx.keys.select { |k| idx[k] }.sort
       end
     end
   end

data/lib/metanorma/version.rb

@@ -1,3 +1,3 @@
 module Metanorma
-  VERSION = "2.5.23".freeze
+  VERSION = "2.5.24".freeze
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: metanorma
 version: !ruby/object:Gem::Version
-  version: 2.5.23
+  version: 2.5.24
 platform: ruby
 authors:
 - Ribose Inc.