pgtools 1.0.0 → 1.0.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 7e36398b3fbef0f7e869fce605df24a9cd6e22ac5c6b391f49254474d129d942
-  data.tar.gz: 92d27315789a8c08f6dcefa721bf32a1af992bb4b848e1597b402494208bbe5e
+  metadata.gz: b93db3608af5f88382180905f15693b4b892a8123609b9bf2763e540ab54d771
+  data.tar.gz: 88b27f7585d3f49eaaf5e32d00b825eea2144d6af8ba94c7b21c4b983acb6dc2
 SHA512:
-  metadata.gz: 904a07ac609d5d594d80f94e9611dd48ac747dca93407188081e1e678b82a0084592d039cfbad5082670223e09a068ae844fd2b536b148fcad6ace8eb54f2a62
-  data.tar.gz: 2767aca08e04ec6a22de97726bd482c59d90aeea08349a102902139c80e6168ab5032443d043da2664c519be935714f4293dc77900c615d7cdbc7e7d07e60d2e
+  metadata.gz: 0fbe72c0bf9c198551af629a6bb6ab8a991d4c9a2379065ab4b915ac65eccd77007cf24b9e302ea0063ae6ef544a13039ee7764135a84ec8f4bb4e47585e5b7e
+  data.tar.gz: 7a240821e4053eabb8d7b20e93ee06bcc3a76fbc366b452fd829bc2b446ca55b34dafbb4e905f1a7f91e3978df474d8485474249b51ebe4b0b35f08d757e01ee

data/LICENSE

@@ -1,25 +1,25 @@
-BSD 2-Clause License
-
-Copyright (c) 2017-2021, Brice Videau
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-* Redistributions of source code must retain the above copyright notice, this
-  list of conditions and the following disclaimer.
-
-* Redistributions in binary form must reproduce the above copyright notice,
-  this list of conditions and the following disclaimer in the documentation
-  and/or other materials provided with the distribution.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+BSD 2-Clause License
+
+Copyright (c) 2017-2021, Brice Videau
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

data/bin/bxm_decoder

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/bxm_decoder'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/bxm_decoder'

data/bin/bxm_encoder

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/bxm_encoder'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/bxm_encoder'

data/bin/clh_convert

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/clh_convert'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/clh_convert'

data/bin/clp_convert

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/clp_convert'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/clp_convert'

data/bin/clw_convert

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/clw_convert'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/clw_convert'

data/bin/dat_creator

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/dat_creator'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/dat_creator'

data/bin/dat_extractor

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/dat_extractor'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/dat_extractor'

data/bin/dat_ls

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/dat_ls'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/dat_ls'

data/bin/eff_idd_creator

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/eff_idd_creator'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/eff_idd_creator'

data/bin/eff_idd_extractor

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/eff_idd_extractor'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/eff_idd_extractor'

data/bin/exp_convert_wiiu_pc

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/exp_convert_wiiu_pc'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/exp_convert_wiiu_pc'

data/bin/exp_tool

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/exp_tool'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/exp_tool'

data/bin/mot_convert_wiiu_pc

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/mot_convert_wiiu_pc'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/mot_convert_wiiu_pc'

data/bin/mot_tool

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/mot_tool'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/mot_tool'

data/bin/pkz_extractor

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/pkz_extractor'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/pkz_extractor'

data/bin/scr_creator

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/scr_creator'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/scr_creator'

data/bin/scr_extractor

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/scr_extractor'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/scr_extractor'

data/bin/wmb_cleanup

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/wmb_cleanup'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/wmb_cleanup'

data/bin/wmb_common_bones

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/wmb_common_bones'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/wmb_common_bones'

data/bin/wmb_convert_pc_switch

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/wmb_convert_pc_switch'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/wmb_convert_pc_switch'

data/bin/wmb_convert_wiiu_pc

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/wmb_convert_wiiu_pc'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/wmb_convert_wiiu_pc'

data/bin/wmb_export_assimp

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/wmb_export_assimp'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/wmb_export_assimp'

data/bin/wmb_get_bone_map

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/wmb_get_bone_map'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/wmb_get_bone_map'

data/bin/wmb_import_assimp

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/wmb_import_assimp'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/wmb_import_assimp'

data/bin/wmb_import_nier

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/wmb_import_nier'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/wmb_import_nier'

data/bin/wmb_import_wiiu

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/wmb_import_geometry_wiiu_pc'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/wmb_import_geometry_wiiu_pc'

data/bin/wtb_convert_wiiu_pc

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/wtb_convert_wiiu_pc'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/wtb_convert_wiiu_pc'

data/bin/wtx_creator

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/wtx_creator'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/wtx_creator'

data/bin/wtx_extractor

@@ -1,2 +1,2 @@
-#!/usr/bin/env ruby
-require 'bayonetta/tools/wtx_extractor'
+#!/usr/bin/env ruby
+require 'bayonetta/tools/wtx_extractor'

data/lib/bayonetta/bxm.rb

@@ -1,180 +1,180 @@
-require 'nokogiri'
-require 'set'
-
-module Bayonetta
-#=begin
-  class BXMFile < LibBin::Structure
-
-    class Datum < LibBin::Structure
-      uint16 :name_offset
-      int16 :value_offset
-    end
-
-    class Node < LibBin::Structure
-      uint16 :child_count
-      uint16 :first_child_index
-      uint16 :attribute_count
-      uint16 :datum_index
-    end
-
-    class Header < LibBin::Structure
-      string :id, 4
-      uint32 :unknown
-      uint16 :node_count
-      uint16 :datum_count
-      uint32 :data_size
-    end
-
-    register_field :header, Header
-    register_field :nodes, Node, count: 'header\node_count'
-    register_field :datums, Datum, count: 'header\datum_count'
-    string :data, 'header\data_size'
-
-    def get_data_strings
-      io = StringIO::new(data, "rb")
-      pos = 0
-      data_strings = {-1 => nil}
-      while (l = io.gets("\0"))
-        data_strings[pos] = l.unpack("Z*").first
-        pos = io.tell
-      end
-      data_strings
-    end
-
-    def get_datas
-      data_strings = get_data_strings
-      datums.collect { |d| [data_strings[d.name_offset], data_strings[d.value_offset]] }
-    end
-
-    def build_xml_tree(doc, index, datas)
-      node = nodes[index]
-      name, value = datas[node.datum_index]
-      n = Nokogiri::XML::Node.new(name, doc)
-      n.content = value if value
-      node.attribute_count.times { |i|
-        name, value = datas[node.datum_index + i + 1]
-        n[name] = value
-      }
-      node.child_count.times { |i|
-        n << build_xml_tree(doc, node.first_child_index + i, datas)
-      }
-      n
-    end
-
-    def to_xml
-      datas = get_datas
-      doc = Nokogiri::XML::Document::new
-      doc << build_xml_tree(doc, 0, datas) if header.node_count > 0
-      doc
-    end
-
-    def process_node(node, index, next_node_index)
-      name = node.name
-      children = node.elements
-      value = node.content if children.empty?
-      value = value.strip if value
-      value = nil if value == ''
-      attributes = node.attributes
-
-      n = Node.new
-      n.child_count = children.size
-      n.first_child_index = next_node_index
-      n.attribute_count = attributes.size
-      nodes[index] = n
-
-      node_datums = [[name, value]]
-      attributes.each { |k, v| node_datums.push [k, v.value] }
-      datum_index = datums.each_cons(node_datums.size).find_index { |sub| sub == node_datums }
-      if datum_index
-        n.datum_index = datum_index
-      else
-        n.datum_index = datums.size
-        datums.push *node_datums
-        node_datums.flatten.each { |v| data.add v if v }
-      end
-      next_node_index += children.size
-      children.each_with_index { |c, i|
-        next_node_index = process_node(c, n.first_child_index + i, next_node_index)
-      }
-      next_node_index
-    end
-
-    def from_xml(xml, tag)
-      @header = Header.new
-      @nodes = []
-      @datums = []
-      @data = Set.new
-      header.id = tag
-      header.unknown = 0
-      process_node(xml.children.first, 0, 1)
-      header.node_count = nodes.length
-      header.datum_count = datums.length
-      io = StringIO::new("", "wb")
-      data_map = data.collect { |d|
-        pos = io.tell
-        io.write(d, "\0")
-        [d, pos]
-      }.to_h
-      data_map[nil] = -1
-      datums.collect! { |n, v|
-        d = Datum.new
-        d.name_offset = data_map[n]
-        d.value_offset = data_map[v]
-        d
-      }
-      @data = io.string
-      header.data_size = data.bytesize
-      self
-    end
-
-    def self.from_xml(xml, tag="BXM\x00".b)
-      bxm = self.new
-      bxm.from_xml(xml, tag)
-    end
-
-    def self.is_big?(f)
-      true
-    end
-
-    def self.load(input_name)
-      if input_name.respond_to?(:read) && input_name.respond_to?(:seek)
-        input = input_name
-      else
-        File.open(input_name, "rb") { |f|
-          input = StringIO::new(f.read, "rb")
-        }
-      end
-      tag = input.read(4).unpack("a4").first
-      raise "invalid file type #{tag}!" if tag != "XML\x00".b && tag != "BXM\x00".b
-      input.rewind
-      bxm = self.new
-      big = input_big = is_big?(input)
-      bxm.instance_variable_set(:@__was_big, big)
-      bxm.__load(input, big)
-      input.close unless input_name.respond_to?(:read) && input_name.respond_to?(:seek)
-      bxm
-    end
-
-    def dump(output_name, output_big = true)
-      if output_name.respond_to?(:write) && output_name.respond_to?(:seek)
-        output = output_name
-      else
-        output = StringIO::new("".b, "wb")
-      end
-
-      __set_dump_state(output, output_big, nil, nil)
-      __dump_fields
-      __unset_dump_state
-
-      unless output_name.respond_to?(:write) && output_name.respond_to?(:seek)
-        File.open(output_name, "wb") { |f|
-          f.write output.string
-        }
-        output.close
-      end
-      self
-    end
-
-  end
-
-end
+require 'nokogiri'
+require 'set'
+
+module Bayonetta
+#=begin
+  class BXMFile < LibBin::Structure
+
+    class Datum < LibBin::Structure
+      uint16 :name_offset
+      int16 :value_offset
+    end
+
+    class Node < LibBin::Structure
+      uint16 :child_count
+      uint16 :first_child_index
+      uint16 :attribute_count
+      uint16 :datum_index
+    end
+
+    class Header < LibBin::Structure
+      string :id, 4
+      uint32 :unknown
+      uint16 :node_count
+      uint16 :datum_count
+      uint32 :data_size
+    end
+
+    register_field :header, Header
+    register_field :nodes, Node, count: 'header\node_count'
+    register_field :datums, Datum, count: 'header\datum_count'
+    string :data, 'header\data_size'
+
+    def get_data_strings
+      io = StringIO::new(data, "rb")
+      pos = 0
+      data_strings = {-1 => nil}
+      while (l = io.gets("\0"))
+        data_strings[pos] = l.unpack("Z*").first
+        pos = io.tell
+      end
+      data_strings
+    end
+
+    def get_datas
+      data_strings = get_data_strings
+      datums.collect { |d| [data_strings[d.name_offset], data_strings[d.value_offset]] }
+    end
+
+    def build_xml_tree(doc, index, datas)
+      node = nodes[index]
+      name, value = datas[node.datum_index]
+      n = Nokogiri::XML::Node.new(name, doc)
+      n.content = value if value
+      node.attribute_count.times { |i|
+        name, value = datas[node.datum_index + i + 1]
+        n[name] = value
+      }
+      node.child_count.times { |i|
+        n << build_xml_tree(doc, node.first_child_index + i, datas)
+      }
+      n
+    end
+
+    def to_xml
+      datas = get_datas
+      doc = Nokogiri::XML::Document::new
+      doc << build_xml_tree(doc, 0, datas) if header.node_count > 0
+      doc
+    end
+
+    def process_node(node, index, next_node_index)
+      name = node.name
+      children = node.elements
+      value = node.content if children.empty?
+      value = value.strip if value
+      value = nil if value == ''
+      attributes = node.attributes
+
+      n = Node.new
+      n.child_count = children.size
+      n.first_child_index = next_node_index
+      n.attribute_count = attributes.size
+      nodes[index] = n
+
+      node_datums = [[name, value]]
+      attributes.each { |k, v| node_datums.push [k, v.value] }
+      datum_index = datums.each_cons(node_datums.size).find_index { |sub| sub == node_datums }
+      if datum_index
+        n.datum_index = datum_index
+      else
+        n.datum_index = datums.size
+        datums.push *node_datums
+        node_datums.flatten.each { |v| data.add v if v }
+      end
+      next_node_index += children.size
+      children.each_with_index { |c, i|
+        next_node_index = process_node(c, n.first_child_index + i, next_node_index)
+      }
+      next_node_index
+    end
+
+    def from_xml(xml, tag)
+      @header = Header.new
+      @nodes = []
+      @datums = []
+      @data = Set.new
+      header.id = tag
+      header.unknown = 0
+      process_node(xml.children.first, 0, 1)
+      header.node_count = nodes.length
+      header.datum_count = datums.length
+      io = StringIO::new("", "wb")
+      data_map = data.collect { |d|
+        pos = io.tell
+        io.write(d, "\0")
+        [d, pos]
+      }.to_h
+      data_map[nil] = -1
+      datums.collect! { |n, v|
+        d = Datum.new
+        d.name_offset = data_map[n]
+        d.value_offset = data_map[v]
+        d
+      }
+      @data = io.string
+      header.data_size = data.bytesize
+      self
+    end
+
+    def self.from_xml(xml, tag="BXM\x00".b)
+      bxm = self.new
+      bxm.from_xml(xml, tag)
+    end
+
+    def self.is_big?(f)
+      true
+    end
+
+    def self.load(input_name)
+      if input_name.respond_to?(:read) && input_name.respond_to?(:seek)
+        input = input_name
+      else
+        File.open(input_name, "rb") { |f|
+          input = StringIO::new(f.read, "rb")
+        }
+      end
+      tag = input.read(4).unpack("a4").first
+      raise "invalid file type #{tag}!" if tag != "XML\x00".b && tag != "BXM\x00".b
+      input.rewind
+      bxm = self.new
+      big = input_big = is_big?(input)
+      bxm.instance_variable_set(:@__was_big, big)
+      bxm.__load(input, big)
+      input.close unless input_name.respond_to?(:read) && input_name.respond_to?(:seek)
+      bxm
+    end
+
+    def dump(output_name, output_big = true)
+      if output_name.respond_to?(:write) && output_name.respond_to?(:seek)
+        output = output_name
+      else
+        output = StringIO::new("".b, "wb")
+      end
+
+      __set_dump_state(output, output_big, nil, nil)
+      __dump_fields
+      __unset_dump_state
+
+      unless output_name.respond_to?(:write) && output_name.respond_to?(:seek)
+        File.open(output_name, "wb") { |f|
+          f.write output.string
+        }
+        output.close
+      end
+      self
+    end
+
+  end
+
+end