hexapdf 0.12.3 → 0.14.3

data/test/hexapdf/utils/test_bit_field.rb

@@ -6,7 +6,9 @@ require 'hexapdf/utils/bit_field'
 class TestBitField
 
   extend HexaPDF::Utils::BitField
+
   attr_accessor :data
+
   bit_field(:data, {bit0: 0, bit1: 1, bit5: 5}, lister: "list", getter: "get", setter: "set",
             unsetter: 'unset')
 

data/test/hexapdf/utils/test_object_hash.rb

@@ -112,4 +112,9 @@ describe HexaPDF::Utils::ObjectHash do
       assert_equal(3, @hash.max_oid)
     end
   end
+
+  it "can return a list of all object IDs" do
+    @hash[1, 0] = @hash[3, 1] = 7
+    assert_equal([3, 1], @hash.oids)
+  end
 end

data/test/hexapdf/utils/test_sorted_tree_node.rb

@@ -13,9 +13,9 @@ describe HexaPDF::Utils::SortedTreeNode do
 
   def add_multilevel_entries
     @kid11 = @doc.add({Limits: ['c', 'f'], Names: ['c', 1, 'f', 1]}, type: HexaPDF::NameTreeNode)
-    @kid12 = @doc.add({Limits: ['i', 'm'], Names: ['i', 1, 'm', 1]})
+    @kid12 = @doc.add({Limits: ['i', 'm'], Names: ['i', 1, 'm', 1]}, type: HexaPDF::NameTreeNode)
     ref = HexaPDF::Reference.new(@kid11.oid, @kid11.gen)
-    @kid1 = @doc.add({Limits: ['c', 'm'], Kids: [ref, @kid12]})
+    @kid1 = @doc.add({Limits: ['c', 'm'], Kids: [ref, @kid12]}, type: HexaPDF::NameTreeNode)
     @kid21 = @doc.add({Limits: ['o', 'q'], Names: ['o', 1, 'q', 1]}, type: HexaPDF::NameTreeNode)
     @kid221 = @doc.add({Limits: ['s', 'u'], Names: ['s', 1, 'u', 1]}, type: HexaPDF::NameTreeNode)
     @kid22 = @doc.add({Limits: ['s', 'u'], Kids: [@kid221]}, type: HexaPDF::NameTreeNode)
@@ -73,11 +73,11 @@ describe HexaPDF::Utils::SortedTreeNode do
       @root.add_entry('p', 1)
       @root.add_entry('r', 1)
       @root.add_entry('v', 1)
-      assert_equal(['a', 'm'], @kid1[:Limits])
+      assert_equal(['a', 'm'], @kid1[:Limits].value)
       assert_equal(['a', 'f'], @kid11[:Limits].value)
       assert_equal(['a', 1, 'c', 1, 'e', 1, 'f', 1], @kid11[:Names].value)
-      assert_equal(['g', 'm'], @kid12[:Limits])
-      assert_equal(['g', 1, 'i', 1, 'j', 1, 'm', 1], @kid12[:Names])
+      assert_equal(['g', 'm'], @kid12[:Limits].value)
+      assert_equal(['g', 1, 'i', 1, 'j', 1, 'm', 1], @kid12[:Names].value)
       assert_equal(['n', 'v'], @kid2[:Limits].value)
       assert_equal(['n', 'q'], @kid21[:Limits].value)
       assert_equal(['n', 1, 'o', 1, 'p', 1, 'q', 1], @kid21[:Names].value)
@@ -193,15 +193,16 @@ describe HexaPDF::Utils::SortedTreeNode do
     end
 
     it "checks that all kid objects are indirect objects" do
-      @root[:Kids][0] = HexaPDF::Reference.new(@kid1.oid, @kid1.gen)
+      @root[:Kids][0] = ref = HexaPDF::Reference.new(@kid1.oid, @kid1.gen)
       assert(@root.validate)
 
-      @root[:Kids][0] = @kid1
+      @root[:Kids][0] = ref
       @kid1.oid = 0
-      refute(@root.validate do |message, c|
+      assert(@root.validate do |message, c|
                assert_match(/must be indirect objects/, message)
-               refute(c)
+               assert(c)
              end)
+      assert(@kid1.indirect?)
     end
 
     it "checks that leaf node containers have an even number of entries" do

data/test/test_helper.rb

@@ -16,6 +16,8 @@ require 'zlib'
 TEST_DATA_DIR = File.join(__dir__, 'data')
 MINIMAL_PDF = File.read(File.join(TEST_DATA_DIR, 'minimal.pdf')).freeze
 
+Minitest::Test.make_my_diffs_pretty!
+
 module TestHelper
 
   # Asserts that the method +name+ of +object+ gets invoked with the +expected_values+ when

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: hexapdf
 version: !ruby/object:Gem::Version
-  version: 0.12.3
+  version: 0.14.3
 platform: ruby
 authors:
 - Thomas Leitner
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2020-08-22 00:00:00.000000000 Z
+date: 2021-02-16 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: cmdparse
@@ -78,20 +78,14 @@ dependencies:
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '0.82'
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 0.82.0
+        version: '1.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '0.82'
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 0.82.0
+        version: '1.0'
 description: |
   HexaPDF is a pure Ruby library with an accompanying application for working with PDF
   files.
@@ -637,6 +631,7 @@ files:
 homepage: https://hexapdf.gettalong.org
 licenses:
 - AGPL-3.0
+- Nonstandard
 metadata: {}
 post_install_message: 
 rdoc_options: []
@@ -653,8 +648,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.7.6.2
+rubygems_version: 3.2.3
 signing_key: 
 specification_version: 4
 summary: HexaPDF - A Versatile PDF Creation and Manipulation Library For Ruby