acro_that 1.0.1 → 1.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 35e82f82af4a5ad469ce89111633daea2b86ca0f9a965282824c03bd5f9b8af6
-  data.tar.gz: 47e8c25c2f8d1a9243ed9c6e5c85ba6f65aa1cc52b8abe62c3fdaed3a72f8361
+  metadata.gz: e18f96c8c68c8c55a6081ebd91d6e5e45b49901f74224b1a192f0ddae567b097
+  data.tar.gz: 30b26260b600358b0be4bc2f212b175a3ec32c928d38f413a6aa92a7fe267707
 SHA512:
-  metadata.gz: d20594b2b72776e4eea071d87036e2151cfcbb5a36f09d1b11ecd4d055168a613ba1d8fcd308b1748706b30c4ea6cc84742e2f895a21f594ef6c9a79351f5cc1
-  data.tar.gz: fb36a88b91eced4f62b027f920e5233e626f4d469087fe7c46419091020324b9d92d0f5a70d55479064c93bd787513950b2ce84bbcb185834a706c7f83fa9555
+  metadata.gz: fb17fbe00e0f1ada261e12bc8025242a7a6884ff30a3aa9bbb12d86255bb3af8a1705e6e6621d2b2a2147cb432ed6b35b4228d1ffbf5795ab49e751ccb23f228
+  data.tar.gz: 1005a449cf42d39404c04667939dbba672325ee84437836a2bea5d40db02598ee8063acb9bd5a0fc902f3167cdde636a784436d98ed07c11a9aed67a08cc17e7

data/.gitignore

@@ -2,6 +2,8 @@
 .rspec_status
 
 *.pdf
+*.png
+*.jpg
 *.gem
 
 research/

data/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    acro_that (1.0.0)
+    acro_that (1.0.1)
       chunky_png (~> 1.4)
 
 GEM

data/lib/acro_that/pdf_writer.rb

@@ -47,29 +47,64 @@ module AcroThat
       # Sort offsets and group consecutive objects into subsections
       sorted = @offsets.sort_by { |num, gen, _offset| [num, gen] }
 
-      i = 0
-      while i < sorted.length
-        first_num = sorted[i][0]
-
-        # Find consecutive run
-        run_length = 1
-        while (i + run_length) < sorted.length &&
-              sorted[i + run_length][0] == first_num + run_length &&
-              sorted[i + run_length][1] == sorted[i][1]
-          run_length += 1
-        end
-
-        # Write subsection header
-        xref << "#{first_num} #{run_length}\n".b
+      # Find max object number to determine Size
+      max_obj_num = sorted.map { |num, _gen, _offset| num }.max || 0
 
-        # Write entries in this subsection
-        run_length.times do |j|
-          offset = sorted[i + j][2]
-          gen = sorted[i + j][1]
-          xref << format("%010d %05d n \n", offset, gen).b
+      # Build xref entries covering all objects from 0 to max_obj_num
+      # Missing objects are marked as free (type 'f')
+      i = 0
+      current_obj = 0
+
+      while current_obj <= max_obj_num
+        # Find next existing object
+        next_existing = sorted.find { |num, _gen, _offset| num >= current_obj }
+        
+        if next_existing && next_existing[0] == current_obj
+          # Object exists - find consecutive run of existing objects
+          first_num = current_obj
+          run_length = 1
+          
+          while (i + run_length) < sorted.length &&
+                sorted[i + run_length][0] == first_num + run_length &&
+                sorted[i + run_length][1] == sorted[i][1]
+            run_length += 1
+          end
+
+          # Write subsection header
+          xref << "#{first_num} #{run_length}\n".b
+
+          # Write entries in this subsection
+          run_length.times do |j|
+            offset = sorted[i + j][2]
+            gen = sorted[i + j][1]
+            xref << format("%010d %05d n \n", offset, gen).b
+          end
+
+          i += run_length
+          current_obj = first_num + run_length
+        else
+          # Object doesn't exist - find consecutive run of missing objects
+          first_missing = current_obj
+          missing_count = 1
+          
+          while current_obj + missing_count <= max_obj_num
+            check_obj = current_obj + missing_count
+            if sorted.any? { |num, _gen, _offset| num == check_obj }
+              break
+            end
+            missing_count += 1
+          end
+
+          # Write subsection header for missing objects
+          xref << "#{first_missing} #{missing_count}\n".b
+
+          # Write free entries
+          missing_count.times do
+            xref << "0000000000 65535 f \n".b
+          end
+
+          current_obj = first_missing + missing_count
         end
-
-        i += run_length
       end
 
       @buffer << xref

data/lib/acro_that/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module AcroThat
-  VERSION = "1.0.1"
+  VERSION = "1.0.2"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: acro_that
 version: !ruby/object:Gem::Version
-  version: 1.0.1
+  version: 1.0.2
 platform: ruby
 authors:
 - Michael Wynkoop