ruby-heap 0.2.2 → 1.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: c9974abcd60bd8451a0b255d5a92a5662f017643
-  data.tar.gz: 619d3a2efe5beb55f18451dfef513a55deb10255
+SHA256:
+  metadata.gz: a75592e069ff9bc6d12e7c4edd27c564a49a17c8f60e13a40bb53a79c533a2f8
+  data.tar.gz: 243c19ac2859deddf570ab38ebd1f6c9d8962f482f69f7a114117a9590035bd9
 SHA512:
-  metadata.gz: 0a49cc38bbdcb3d910ec6a80487bd6ff3fdbc7f9a5171d1a19e50db844702fa31b1320d78ab07f3496d0352c30ffe88f99829f655b01d24fefc57675b5a9e7e5
-  data.tar.gz: 3eb7d687cad878bf3d38bc7e373d21e8d6d132b5fa6604a2254aebc394874c4c48b1c554e2c78d6f590ed63f8e87d925d5022557448b345124f045c7d5311a1a
+  metadata.gz: 2895bb61d6f02985c73fe5c392f6781c28797c04f42335d421e3b909055446cdb3f4e968ca85671ad07eaac8d996de988efce9406add86b91b9fff573b6e7649
+  data.tar.gz: cf5588e1671b4e6b2bb93821d937680bb441520e9a1818e42499a770a192dbff265decede40fadd284760420eddd4371db11936129f5ba61c7e3eceef2aa9189

data/.gitignore

@@ -1,6 +1,5 @@
 /.bundle/
 /.yardoc
-/Gemfile.lock
 /_yardoc/
 /coverage/
 /doc/
@@ -8,3 +7,4 @@
 /spec/reports/
 /tmp/
 /.idea/
+*.gem

data/.tool-versions

@@ -0,0 +1 @@
+ruby 2.7.1

data/Gemfile.lock

@@ -0,0 +1,22 @@
+PATH
+  remote: .
+  specs:
+    ruby-heap (1.0.2)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    minitest (5.14.4)
+    rake (13.0.6)
+
+PLATFORMS
+  x86_64-darwin-20
+
+DEPENDENCIES
+  bundler (>= 2.2.10)
+  minitest (~> 5.0)
+  rake (~> 13.0)
+  ruby-heap!
+
+BUNDLED WITH
+   2.2.29

data/Heap.gemspec

@@ -1,5 +1,3 @@
-# coding: utf-8
-
 lib = File.expand_path('../lib', __FILE__)
 $LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
 require 'Heap/version'
@@ -21,7 +19,7 @@ Gem::Specification.new do |spec|
   spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
   spec.require_paths = ['lib']
 
-  spec.add_development_dependency 'bundler', '~> 1.14'
-  spec.add_development_dependency 'rake', '~> 10.0'
+  spec.add_development_dependency 'bundler', '~> 2.2', '>= 2.2.10'
+  spec.add_development_dependency 'rake', '~> 13.0'
   spec.add_development_dependency 'minitest', '~> 5.0'
 end

data/README.md

@@ -1,6 +1,12 @@
-# Heap (ruby heapsort)
+[![Gem Version](https://badge.fury.io/rb/ruby-heap.svg)](https://badge.fury.io/rb/ruby-heap)
+[![Gem](https://img.shields.io/gem/dt/ruby-heap.svg)](https://rubygems.org/gems/ruby-heap)
+[![Build Status](https://travis-ci.org/pups3s/ruby-heap.svg?branch=master)](https://travis-ci.org/pups3s/ruby-heap)
+[![Code Climate](https://codeclimate.com/github/pups3s/ruby-heap/badges/gpa.svg)](https://codeclimate.com/github/pups3s/ruby-heap)
+
+[Русская версия](README_ru.md)
 
-Gem is using for making Heaps (binary only for now).
+# Heap (ruby heapsort)
+Gem is using for making Heaps.
 
 ## Installation
 
@@ -20,6 +26,8 @@ Or install it yourself as:
 
 ## Usage
 
+### Binary Heaps
+
 #### Binary Heap with min root
 While Heap initialize you can add any comparable object in it (not numbers only).
 Objects must have compare functions (>, >=, <, <=).
@@ -72,10 +80,10 @@ b_heap.sort         # [3, 2, 1, -1]
 # Count of elements in Heap
 b_heap.count        # 4
 
-# Return min element without removing from Heap
+# Return max element without removing from Heap
 b_heap.extract_max  # 3
 
-# Return min element and remove it from Heap
+# Return max element and remove it from Heap
 b_heap.extract_max! # 3
 b_heap.count        # 3
 b_heap.elements     # [2, -1, 1]
@@ -99,19 +107,28 @@ max_heap = Heap::BinaryHeap::MaxHeap.new [9, -1, 4]
 # Merge heaps
 min_heap.add max_heap
 
+min_heap.count    # 6
+min_heap.sort     # [-1, 1, 2, 3, 4, 9]
 ```
 
-## Development
+### Multiple Heaps
 
-After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake test` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+Multiple (d-ary) heaps have **same methods as binary**. But initialize differs:
 
-To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+```ruby
+require 'Heap'
+
+# First param is "d" of heap
+# Second param is optional and can contain first elements
+min_heap = Heap::MultipleHeap::MinHeap.new(5, [10, 20, 30])
+max_heap = Heap::MultipleHeap::MaxHeap.new(7)
+```
 
 ## Contributing
 
-Bug reports and pull requests are welcome on GitHub at [Project page](https://github.com/pups3s/ruby-heap). This project is intended to be a safe, welcoming space for collaboration.
+Bug reports and pull requests are welcome on GitHub at [Project page](https://github.com/pups3s/ruby-heap).
 
 
 ## License
 
-The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).

data/README_ru.md

@@ -0,0 +1,131 @@
+[![Gem Version](https://badge.fury.io/rb/ruby-heap.svg)](https://badge.fury.io/rb/ruby-heap)
+[![Code Climate](https://codeclimate.com/github/pups3s/ruby-heap/badges/gpa.svg)](https://codeclimate.com/github/pups3s/ruby-heap)
+# Heap (ruby сортировка кучей)
+Библиотека используется для создания бинарной или d-ичной кучи (Heap).
+
+## Установка
+
+Добавьте данную строчку в Gemfile Вашего приложения:
+
+```ruby
+gem 'ruby-heap'
+```
+
+Затем выполните:
+
+    $ bundle
+
+Или установите библиотеку отдельно, выполнив:
+
+    $ gem install ruby-heap
+
+## Использование
+
+### Двоичные кучи
+
+#### Двоичная куча с минимальным корнем
+Во время инициализации (и после создания кучи) Вы можете добавить в нее любые сравниваемые объекты (не только числа).
+Используемые объекты должны иметь функции сравнения (>, >=, <, <=).
+```ruby
+require 'Heap'
+
+# Инициализация
+b_heap = Heap::BinaryHeap::MinHeap.new([2, 3, 1, -1])
+
+# Получение элементов кучи (доступ только для чтения)
+b_heap.elements     # [-1, 1, 3, 2]
+
+# Получение отсортированных элементов кучи без
+# изменения её элементов
+b_heap.sort         # [-1, 1, 2, 3]
+
+# Количество элементов в куче
+b_heap.count        # 4
+
+# Получение минимального элемента без удаления его из кучи
+b_heap.extract_min  # -1
+
+# Получение минимального элемента и его удаление из кучи
+b_heap.extract_min! # -1
+b_heap.count        # 3
+b_heap.elements     # [1, 2, 3]
+
+# Также Вы можете добавить новые элементы с помощью
+# функции add
+b_heap.add -1
+b_heap.elements     # [-1, 1, 3, 2]
+b_heap.add [0, 9, 200, -15, 6]
+b_heap.elements     # [-15, -1, 3, 0, 1, 9, 200, 2, 6]
+b_heap.sort         # [-15, -1, 0, 1, 2, 3, 6, 9, 200]
+```
+
+#### Те же действия с кучей (с максимальным корнем)
+```ruby
+require 'Heap'
+
+# Инициализация
+b_heap = Heap::BinaryHeap::MaxHeap.new([2, 3, 1, -1])
+
+# Получение элементов кучи (доступ только для чтения)
+b_heap.elements     # [3, 2, 1, -1]
+
+# Получение отсортированных элементов кучи без
+# изменения её элементов
+b_heap.sort         # [3, 2, 1, -1]
+
+# Количество элементов в куче
+b_heap.count        # 4
+
+# Получение максимального элемента без удаления его из кучи
+b_heap.extract_max  # 3
+
+# Получение максимального элемента и его удаление из кучи
+b_heap.extract_max! # 3
+b_heap.count        # 3
+b_heap.elements     # [2, -1, 1]
+
+# Также Вы можете добавить новые элементы с помощью
+# функции add
+b_heap.add -1
+b_heap.elements     # [2, -1, 1, -1]
+b_heap.add [0, 9, 200, -15, 6]
+b_heap.elements     # [200, 6, 9, 0, -1, 1, 2, -15, -1]
+b_heap.sort         # [200, 9, 6, 2, 1, 0, -1, -1, -15]
+```
+
+#### Слияние куч
+```ruby
+require 'Heap'
+
+# Инициализация
+min_heap = Heap::BinaryHeap::MinHeap.new [1, 2, 3]
+max_heap = Heap::BinaryHeap::MaxHeap.new [9, -1, 4]
+
+# Слияние
+min_heap.add max_heap
+
+min_heap.count    # 6
+min_heap.sort     # [-1, 1, 2, 3, 4, 9]
+```
+
+### Многомерные кучи
+
+Многомерные (d-ичные) кучи имеют **те же методы, что и бинарные**. Однако, отличается инициализация:
+
+```ruby
+require 'Heap'
+
+# Первый параметр - измерение кучи (d)
+# Второй параметр опционален и может содержать первые элементы в куче
+min_heap = Heap::MultipleHeap::MinHeap.new(5, [10, 20, 30])
+max_heap = Heap::MultipleHeap::MaxHeap.new(7)
+```
+
+## Вклад в проект
+
+**Баг репорты** и **pull реквесты** приветствуются на GitHub [Страница проекта](https://github.com/pups3s/ruby-heap).
+
+
+## Лицензия
+
+Библиотека является open source и регламентируется [MIT License](http://opensource.org/licenses/MIT).

data/lib/Heap/binary_heap/binary_heap.rb

@@ -0,0 +1,23 @@
+module Heap
+  module BinaryHeap
+    # Binary Heap template
+    class BinaryHeap < HeapTemplate
+
+      protected
+
+      def initialize(elements = [])
+        @elements = []
+        add(elements.pop) until elements.empty?
+      end
+
+      def get_children(index)
+        child1 = 2 * index
+        child2 = 2 * index + 1
+        children = {}
+        children[@elements[child1 - 1]] = child1 unless @elements[child1 - 1].nil?
+        children[@elements[child2 - 1]] = child2 unless @elements[child2 - 1].nil?
+        children
+      end
+    end
+  end
+end

data/lib/Heap/binary_heap/binary_heap_max.rb

@@ -1,93 +1,32 @@
 module Heap
   module BinaryHeap
-    class MaxHeap
-      attr_reader :elements
-
-      def initialize(elements = [])
-        @elements = []
-        add(elements.pop) until elements.empty?
-      end
-
-      def add(element)
-        if element.is_a? Array
-          element.each do |el|
-            @elements.push el
-            swim_up(count)
-          end
-        elsif defined? element.elements
-          add element.elements
-        else
-          @elements.push element
-          swim_up(count)
-        end
-      end
-
-      def count
-        @elements.length
-      end
-
+    # Binary Heap with max root
+    class MaxHeap < BinaryHeap
       def extract_max
-        @elements[0]
+        extract_root
       end
 
       def extract_max!
-        swap(1, count)
-        el = @elements.pop
-        swim_down(1)
-        el
-      end
-
-      def sort
-        el_temp = @elements.clone
-        result = []
-        result.push extract_max! while count > 0
-        @elements = el_temp
-        result
+        extract_root!
       end
 
       private
 
-      def swap(index1, index2)
-        temp = @elements[index1 - 1]
-        @elements[index1 - 1] = @elements[index2 - 1]
-        @elements[index2 - 1] = temp
-      end
-
       def swim_up(index)
         return if index == 1
-        parent_index = (index / 2).floor
+        parent_index = index / 2
         return if @elements[parent_index - 1] >= @elements[index - 1]
         swap(parent_index, index)
         swim_up parent_index
       end
 
       def swim_down(index)
-        child1_index = 2 * index
-        child2_index = 2 * index + 1
-        return if @elements[child1_index - 1].nil? && @elements[child2_index - 1].nil?
-        if @elements[child2_index - 1].nil?
-          return if @elements[child1_index - 1] <= @elements[index - 1]
-          swap(index, child1_index)
-          swim_down(child1_index)
-        else
-          if @elements[child2_index - 1] <= @elements[index - 1] && @elements[child1_index - 1] <= @elements[index - 1]
-            return
-          elsif @elements[child2_index - 1] > @elements[index - 1] && @elements[child1_index - 1] > @elements[index - 1]
-            if @elements[child2_index - 1] > @elements[child1_index - 1]
-              swap(child2_index, index)
-              swim_down(child2_index)
-            else
-              swap(child1_index, index)
-              swim_down(child1_index)
-            end
-          elsif @elements[child2_index - 1] > @elements[index - 1]
-            swap(child2_index, index)
-            swim_down(child2_index)
-          elsif @elements[child1_index - 1] > @elements[index - 1]
-            swap(child1_index, index)
-            swim_down(child1_index)
-          end
-        end
+        children = get_children(index)
+        return if children.empty?
+        max_child = children.max
+        return if @elements[index - 1] >= max_child[0]
+        swap index, max_child[1]
+        swim_down max_child[1]
       end
     end
   end

data/lib/Heap/binary_heap/binary_heap_min.rb

@@ -1,93 +1,32 @@
 module Heap
   module BinaryHeap
-    class MinHeap
-      attr_reader :elements
-
-      def initialize(elements = [])
-        @elements = []
-        add(elements.pop) until elements.empty?
-      end
-
-      def add(element)
-        if element.is_a? Array
-          element.each do |el|
-            @elements.push el
-            swim_up(count)
-          end
-        elsif defined? element.elements
-          add element.elements
-        else
-          @elements.push element
-          swim_up(count)
-        end
-      end
-
-      def count
-        @elements.length
-      end
-
+    # Binary Heap with min root
+    class MinHeap < BinaryHeap
       def extract_min
-        @elements[0]
+        extract_root
       end
 
       def extract_min!
-        swap(1, count)
-        el = @elements.pop
-        swim_down(1)
-        el
-      end
-
-      def sort
-        el_temp = @elements.clone
-        result = []
-        result.push extract_min! while count > 0
-        @elements = el_temp
-        result
+        extract_root!
       end
 
       private
 
-      def swap(index1, index2)
-        temp = @elements[index1 - 1]
-        @elements[index1 - 1] = @elements[index2 - 1]
-        @elements[index2 - 1] = temp
-      end
-
       def swim_up(index)
         return if index == 1
-        parent_index = (index / 2).floor
+        parent_index = index / 2
         return if @elements[parent_index - 1] <= @elements[index - 1]
         swap(parent_index, index)
         swim_up parent_index
       end
 
       def swim_down(index)
-        child1_index = 2 * index
-        child2_index = 2 * index + 1
-        return if @elements[child1_index - 1].nil? && @elements[child2_index - 1].nil?
-        if @elements[child2_index - 1].nil?
-          return if @elements[child1_index - 1] >= @elements[index - 1]
-          swap(index, child1_index)
-          swim_down(child1_index)
-        else
-          if @elements[child2_index - 1] >= @elements[index - 1] && @elements[child1_index - 1] >= @elements[index - 1]
-            return
-          elsif @elements[child2_index - 1] < @elements[index - 1] && @elements[child1_index - 1] < @elements[index - 1]
-            if @elements[child2_index - 1] < @elements[child1_index - 1]
-              swap(child2_index, index)
-              swim_down(child2_index)
-            else
-              swap(child1_index, index)
-              swim_down(child1_index)
-            end
-          elsif @elements[child2_index - 1] < @elements[index - 1]
-            swap(child2_index, index)
-            swim_down(child2_index)
-          elsif @elements[child1_index - 1] < @elements[index - 1]
-            swap(child1_index, index)
-            swim_down(child1_index)
-          end
-        end
+        children = get_children(index)
+        return if children.empty?
+        max_child = children.min
+        return if @elements[index - 1] <= max_child[0]
+        swap index, max_child[1]
+        swim_down max_child[1]
       end
     end
   end

data/lib/Heap/heap_template.rb

@@ -0,0 +1,51 @@
+module Heap
+  # Heap Template
+  class HeapTemplate
+    attr_reader :elements
+
+    def add(element)
+      if element.is_a? Array
+        element.each do |el|
+          @elements.push el
+          swim_up(count)
+        end
+      elsif defined? element.elements
+        add element.elements
+      else
+        @elements.push element
+        swim_up(count)
+      end
+    end
+
+    def count
+      @elements.length
+    end
+
+    def sort
+      el_temp = @elements.clone
+      result = []
+      result.push extract_root! while count > 0
+      @elements = el_temp
+      result
+    end
+
+    protected
+
+    def extract_root
+      @elements[0]
+    end
+
+    def extract_root!
+      swap(1, count)
+      el = @elements.pop
+      swim_down(1)
+      el
+    end
+
+    def swap(index1, index2)
+      temp = @elements[index1 - 1]
+      @elements[index1 - 1] = @elements[index2 - 1]
+      @elements[index2 - 1] = temp
+    end
+  end
+end

data/lib/Heap/multiple_heap/multiple_heap.rb

@@ -0,0 +1,27 @@
+module Heap
+  module MultipleHeap
+    # Multiple Heap template
+    class MultipleHeap < HeapTemplate
+      attr_reader :d
+
+      protected
+
+      def initialize(d, elements = [])
+        @elements = []
+        @d = d
+        add(elements.pop) until elements.empty?
+      end
+
+      def get_children(index)
+        child_indexes = []
+        (2..(@d + 1)).each { |i| child_indexes.push((index - 1) * @d + i) }
+        child_indexes.delete_if { |ind| ind > count }
+        return if child_indexes.empty?
+
+        children = {}
+        child_indexes.each { |ind| children[@elements[ind - 1]] = ind }
+        children
+      end
+    end
+  end
+end

data/lib/Heap/multiple_heap/multiple_heap_max.rb

@@ -0,0 +1,34 @@
+module Heap
+  module MultipleHeap
+    # Multiple Heap with max root
+    class MaxHeap < MultipleHeap
+      def extract_max
+        extract_root
+      end
+
+      def extract_max!
+        extract_root!
+      end
+
+      private
+
+      def swim_up(index)
+        return if index == 1
+        parent_index = ((index.to_f - 1) / @d).ceil
+        return if @elements[parent_index - 1] >= @elements[index - 1]
+        swap(parent_index, index)
+        swim_up parent_index
+      end
+
+      def swim_down(index)
+        children = get_children index
+        return if children.nil? || children.empty?
+        max_child = children.max
+
+        return if @elements[index - 1] >= max_child[0]
+        swap index, max_child[1]
+        swim_down max_child[1]
+      end
+    end
+  end
+end

data/lib/Heap/multiple_heap/multiple_heap_min.rb

@@ -0,0 +1,34 @@
+module Heap
+  module MultipleHeap
+    # Multiple Heap with min root
+    class MinHeap < MultipleHeap
+      def extract_min
+        extract_root
+      end
+
+      def extract_min!
+        extract_root!
+      end
+
+      private
+
+      def swim_up(index)
+        return if index == 1
+        parent_index = ((index.to_f - 1) / @d).ceil
+        return if @elements[parent_index - 1] <= @elements[index - 1]
+        swap(parent_index, index)
+        swim_up parent_index
+      end
+
+      def swim_down(index)
+        children = get_children index
+        return if children.nil? || children.empty?
+        min_child = children.min
+
+        return if @elements[index - 1] <= min_child[0]
+        swap index, min_child[1]
+        swim_down min_child[1]
+      end
+    end
+  end
+end

data/lib/Heap/version.rb

@@ -1,3 +1,3 @@
 module Heap
-  VERSION = '0.2.2'
+  VERSION = '1.0.4'
 end

data/lib/Heap.rb

@@ -1,6 +1,12 @@
 require 'Heap/version'
 
+# Main ruby-heap rb file
 module Heap
+  require 'Heap/heap_template'
+  require 'Heap/binary_heap/binary_heap'
   require 'Heap/binary_heap/binary_heap_min'
   require 'Heap/binary_heap/binary_heap_max'
+  require 'Heap/multiple_heap/multiple_heap'
+  require 'Heap/multiple_heap/multiple_heap_max'
+  require 'Heap/multiple_heap/multiple_heap_min'
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ruby-heap
 version: !ruby/object:Gem::Version
-  version: 0.2.2
+  version: 1.0.4
 platform: ruby
 authors:
 - Alexandr Sysoev
-autorequire: 
+autorequire:
 bindir: exe
 cert_chain: []
-date: 2017-06-19 00:00:00.000000000 Z
+date: 2021-10-14 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -16,28 +16,34 @@ dependencies:
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '1.14'
+        version: '2.2'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 2.2.10
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '1.14'
+        version: '2.2'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 2.2.10
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '10.0'
+        version: '13.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '10.0'
+        version: '13.0'
 - !ruby/object:Gem::Dependency
   name: minitest
   requirement: !ruby/object:Gem::Requirement
@@ -52,7 +58,7 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '5.0'
-description: 
+description:
 email:
 - sanchous.ok@gmail.com
 executables: []
@@ -60,24 +66,31 @@ extensions: []
 extra_rdoc_files: []
 files:
 - ".gitignore"
+- ".tool-versions"
 - ".travis.yml"
 - Gemfile
+- Gemfile.lock
 - Heap.gemspec
 - LICENSE.txt
 - README.md
+- README_ru.md
 - Rakefile
 - bin/console
 - bin/setup
 - lib/Heap.rb
+- lib/Heap/binary_heap/binary_heap.rb
 - lib/Heap/binary_heap/binary_heap_max.rb
 - lib/Heap/binary_heap/binary_heap_min.rb
+- lib/Heap/heap_template.rb
+- lib/Heap/multiple_heap/multiple_heap.rb
+- lib/Heap/multiple_heap/multiple_heap_max.rb
+- lib/Heap/multiple_heap/multiple_heap_min.rb
 - lib/Heap/version.rb
-- ruby-heap-0.2.1.gem
 homepage: https://github.com/pups3s/ruby-heap
 licenses:
 - MIT
 metadata: {}
-post_install_message: 
+post_install_message:
 rdoc_options: []
 require_paths:
 - lib
@@ -92,9 +105,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.6.12
-signing_key: 
+rubygems_version: 3.1.2
+signing_key:
 specification_version: 4
 summary: Binary or multiple heap
 test_files: []