annoy-rb 0.2.1 → 0.4.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 70396ca8391b29a97b873c9e19a604cbc7257ce4b78cdf8381be4e892c518b62
-  data.tar.gz: 56feaa427374443780b141a3edf3707cf350409a229367f052436f773b6d1c75
+  metadata.gz: c4cdefee51cf2cd6e8eef8bccf558de5f70007625815817312c4f6a5c0ada3fb
+  data.tar.gz: 327b8c21596c7e7688dfa318095d4cbf9253d93e74a72703ce14f3c5d81d0590
 SHA512:
-  metadata.gz: a3c736168dcea72535931d759c849ffc006bfcfecf3cdca704fc0b1859712a810817bfc7581f87dc40754bedea07563dd5ad777ca54b028acc4d5c3dcf3f6671
-  data.tar.gz: 65ada80b03e1e1ffec4353f7db9c77c2aca8bc79523229b8b52865f38524a272bac10c650d0333b46fee2d13c8109a1fa61ee41d2eb022eaeefdee0509a3bf54
+  metadata.gz: 52bc21959f96e2e33e8bebe6f585311d15614015093a6b2a354e9d736e6343a90c60350a9ee0039387226490a7e613b1622c61ff998d5cb1a4ad3df7533f4960
+  data.tar.gz: 9b34a4e7416dbc50fa1626764a84eea4921c93ef5d59833c2f176f96519a52f8a009a41460f5e097ac86acebfc67478b79ea6dfe759682b87cafc4a41f0ec8fc

data/.github/workflows/build.yml

@@ -1,21 +1,20 @@
 name: build
 
-on: [push]
+on: [push, pull_request]
 
 jobs:
   build:
     runs-on: ubuntu-latest
     strategy:
+      fail-fast: false
       matrix:
-        ruby: [ '2.5', '2.6', '2.7' ]
+        ruby: [ '2.6', '2.7', '3.0' ]
     steps:
       - uses: actions/checkout@v2
       - name: Set upt Ruby ${{ matrix.ruby }}
-        uses: actions/setup-ruby@v1
+        uses: ruby/setup-ruby@v1
         with:
           ruby-version: ${{ matrix.ruby }}
+          bundler-cache: true
       - name: Build and test with Rake
-        run: |
-          gem install bundler
-          bundle install --jobs 4 --retry 3
-          bundle exec rake
+        run: bundle exec rake

data/CHANGELOG.md

@@ -1,3 +1,17 @@
+## 0.4.0
+- Add dummy constructor call at memory allocation of binding class to prevent occuring segment fault on GC when initialize method is failed.
+
+## 0.3.0
+- Add type declaration file: sig/annoy.rbs
+- Fix get_distance method to return integer typed value on hamming metric index.
+- Rename native extension files.
+
+## 0.2.3
+- Add GC guard to index saving and loading methods.
+
+## 0.2.2
+- Replace Data_ functions to TypedData_ functions.
+
 ## 0.2.1
 - Fix to free char array of error message before calling rb_raise.
 - Fix to use array allocated with ruby_xmalloc instead of vector class in C++.

data/Gemfile

@@ -1,8 +1,10 @@
-source "https://rubygems.org"
+source 'https://rubygems.org'
 
 # Specify your gem's dependencies in annoy.gemspec
 gemspec
 
-gem "rake", "~> 12.0"
-gem "rake-compiler"
-gem "rspec", "~> 3.0"
+gem 'rake', '~> 13.0'
+gem 'rake-compiler', '~> 1.1'
+gem 'rspec', '~> 3.0'
+gem 'rbs', '~> 1.2'
+gem 'steep', '~> 0.44'

data/README.md

@@ -2,10 +2,10 @@
 
 [![Build Status](https://github.com/yoshoku/annoy.rb/workflows/build/badge.svg)](https://github.com/yoshoku/annoy.rb/actions?query=workflow%3Abuild)
 [![Gem Version](https://badge.fury.io/rb/annoy-rb.svg)](https://badge.fury.io/rb/annoy-rb)
-[![License](https://img.shields.io/badge/License-Apache%202.0-yellowgreen.svg)](https://github.com/yoshoku/annoy.rb/blob/master/LICENSE.txt)
+[![License](https://img.shields.io/badge/License-Apache%202.0-yellowgreen.svg)](https://github.com/yoshoku/annoy.rb/blob/main/LICENSE.txt)
 [![Documentation](http://img.shields.io/badge/api-reference-blue.svg)](https://yoshoku.github.io/annoy.rb/doc/)
 
-Annoy.rb is a Ruby binding for the [Annoy (Approximate Nearest Neighbors Oh Yeah)](https://github.com/spotify/annoy).
+Annoy.rb provides Ruby bindings for the [Annoy (Approximate Nearest Neighbors Oh Yeah)](https://github.com/spotify/annoy).
 
 ## Installation
 
@@ -56,8 +56,6 @@ The gem is available as open source under the terms of the [Apache-2.0 License](
 
 ## Contributing
 
-Bug reports and pull requests are welcome on GitHub at https://github.com/yoshoku/annoy.rb. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://github.com/yoshoku/annoy.rb/blob/master/CODE_OF_CONDUCT.md).
-
-## Code of Conduct
-
-Everyone interacting in the Annoy.rb project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/yoshoku/annoy.rb/blob/master/CODE_OF_CONDUCT.md).
+Bug reports and pull requests are welcome on GitHub at https://github.com/yoshoku/annoy.rb.
+This project is intended to be a safe, welcoming space for collaboration,
+and contributors are expected to adhere to the [code of conduct](https://github.com/yoshoku/annoy.rb/blob/main/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -7,7 +7,8 @@ require 'rake/extensiontask'
 
 task :build => :compile
 
-Rake::ExtensionTask.new('annoy') do |ext|
+Rake::ExtensionTask.new('annoyext') do |ext|
+  ext.ext_dir = 'ext/annoy'
   ext.lib_dir = 'lib/annoy'
 end
 

data/Steepfile

@@ -0,0 +1,20 @@
+target :lib do
+  signature "sig"
+
+  check "lib"                       # Directory name
+#   check "Gemfile"                   # File name
+#   check "app/models/**/*.rb"        # Glob
+#   # ignore "lib/templates/*.rb"
+#
+#   # library "pathname", "set"       # Standard libraries
+#   # library "strong_json"           # Gems
+end
+
+# target :spec do
+#   signature "sig", "sig-private"
+#
+#   check "spec"
+#
+#   # library "pathname", "set"       # Standard libraries
+#   # library "rspec"
+# end

data/annoy-rb.gemspec

@@ -6,14 +6,14 @@ Gem::Specification.new do |spec|
   spec.authors       = ['yoshoku']
   spec.email         = ['yoshoku@outlook.com']
 
-  spec.summary       = 'Ruby binding for the Annoy (Approximate Nearest Neighbors Oh Yeah).'
-  spec.description   = 'Annoy.rb is a Ruby binding for the Annoy (Approximate Nearest Neighbors Oh Yeah).'
+  spec.summary       = 'Ruby bindings for the Annoy (Approximate Nearest Neighbors Oh Yeah).'
+  spec.description   = 'Annoy.rb provides Ruby bindings for the Annoy (Approximate Nearest Neighbors Oh Yeah).'
   spec.homepage      = 'https://github.com/yoshoku/annoy.rb'
   spec.license       = 'Apache-2.0'
 
   spec.metadata['homepage_uri'] = spec.homepage
   spec.metadata['source_code_uri'] = spec.homepage
-  spec.metadata['changelog_uri'] = 'https://github.com/yoshoku/annoy.rb/blob/master/CHANGELOG.md'
+  spec.metadata['changelog_uri'] = 'https://github.com/yoshoku/annoy.rb/blob/main/CHANGELOG.md'
   spec.metadata['documentation_uri'] = 'https://yoshoku.github.io/annoy.rb/doc/'
 
   # Specify which files should be added to the gem when it is released.

data/ext/annoy/{annoy.cpp → annoyext.cpp}

@@ -16,10 +16,10 @@
  * limitations under the License.
  */
 
-#include "annoy.hpp"
+#include "annoyext.hpp"
 
 extern "C"
-void Init_annoy(void)
+void Init_annoyext(void)
 {
   VALUE rb_mAnnoy = rb_define_module("Annoy");
   RbAnnoyIndex<AnnoyIndexAngular, double>::define_class(rb_mAnnoy, "AnnoyIndexAngular");

data/ext/annoy/{annoy.hpp → annoyext.hpp}

@@ -16,8 +16,8 @@
  * limitations under the License.
  */
 
-#ifndef ANNOY_HPP
-#define ANNOY_HPP 1
+#ifndef ANNOYEXT_HPP
+#define ANNOYEXT_HPP 1
 
 #include <typeinfo>
 
@@ -42,17 +42,22 @@ template<class T, typename F> class RbAnnoyIndex
   public:
     static VALUE annoy_index_alloc(VALUE self) {
       T* ptr = (T*)ruby_xmalloc(sizeof(T));
-      return Data_Wrap_Struct(self, NULL, annoy_index_free, ptr);
+      new (ptr) T();
+      return TypedData_Wrap_Struct(self, &annoy_index_type, ptr);
     };
 
-    static void annoy_index_free(T* ptr) {
-      ptr->~AnnoyIndex();
+    static void annoy_index_free(void* ptr) {
+      ((T*)ptr)->~AnnoyIndex();
       ruby_xfree(ptr);
     };
 
+    static size_t annoy_index_size(const void* ptr) {
+      return sizeof(*((T*)ptr));
+    };
+
     static T* get_annoy_index(VALUE self) {
       T* ptr;
-      Data_Get_Struct(self, T, ptr);
+      TypedData_Get_Struct(self, T, &annoy_index_type, ptr);
       return ptr;
     };
 
@@ -79,6 +84,7 @@ template<class T, typename F> class RbAnnoyIndex
     };
 
   private:
+    static const rb_data_type_t annoy_index_type;
 
     static VALUE _annoy_index_init(VALUE self, VALUE _n_dims) {
       const int n_dims = NUM2INT(_n_dims);
@@ -142,6 +148,7 @@ template<class T, typename F> class RbAnnoyIndex
         rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
         return Qfalse;
       }
+      RB_GC_GUARD(_filename);
       return Qtrue;
     };
 
@@ -155,6 +162,7 @@ template<class T, typename F> class RbAnnoyIndex
         rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
         return Qfalse;
       }
+      RB_GC_GUARD(_filename);
       return Qtrue;
     };
 
@@ -264,8 +272,8 @@ template<class T, typename F> class RbAnnoyIndex
     static VALUE _annoy_index_get_distance(VALUE self, VALUE _i, VALUE _j) {
       const int i = NUM2INT(_i);
       const int j = NUM2INT(_j);
-      const double dist = get_annoy_index(self)->get_distance(i, j);
-      return DBL2NUM(dist);
+      const F dist = get_annoy_index(self)->get_distance(i, j);
+      return typeid(F) == typeid(double) ? DBL2NUM(dist) : UINT2NUM(dist);
     };
 
     static VALUE _annoy_index_get_n_items(VALUE self) {
@@ -287,6 +295,7 @@ template<class T, typename F> class RbAnnoyIndex
         rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
         return Qfalse;
       }
+      RB_GC_GUARD(_filename);
       return Qtrue;
     };
 
@@ -308,4 +317,17 @@ template<class T, typename F> class RbAnnoyIndex
     };
 };
 
-#endif /* ANNOY_HPP */
+template<class T, typename F>
+const rb_data_type_t RbAnnoyIndex<T, F>::annoy_index_type = {
+  "RbAnnoyIndex",
+  {
+    NULL,
+    RbAnnoyIndex::annoy_index_free,
+    RbAnnoyIndex::annoy_index_size
+  },
+  NULL,
+  NULL,
+  RUBY_TYPED_FREE_IMMEDIATELY
+};
+
+#endif /* ANNOYEXT_HPP */

data/ext/annoy/extconf.rb

@@ -6,4 +6,4 @@ $CXXFLAGS << " -std=c++14 -march=native -DANNOYLIB_MULTITHREADED_BUILD"
 $INCFLAGS << " -I$(srcdir)/src"
 $VPATH << "$(srcdir)/src"
 
-create_makefile('annoy/annoy')
+create_makefile('annoy/annoyext')

data/ext/annoy/src/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

data/ext/annoy/src/annoylib.h

@@ -868,6 +868,8 @@ protected:
   bool _built;
 public:
 
+   AnnoyIndex() : _f(0), _fd(0), _nodes(NULL), _n_items(0), _n_nodes(0), _nodes_size(0),
+                  _is_seeded(false), _loaded(false), _verbose(false), _on_disk(false), _built(false)  { }
    AnnoyIndex(int f) : _f(f) {
     _s = offsetof(Node, v) + _f * sizeof(T); // Size of each node
     _verbose = false;

data/lib/annoy.rb

@@ -1,7 +1,7 @@
 # frozen_string_literal: true
 
 require 'annoy/version'
-require 'annoy/annoy'
+require 'annoy/annoyext'
 
 module Annoy
   # AnnoyIndex is a class that provides functions for k-nearest neighbors search.

data/lib/annoy/version.rb

@@ -3,5 +3,8 @@
 # Annoy.rb is a Ruby wrapper for Annoy (Approximate Nearest Neighbors Oh Yeah).
 module Annoy
   # The version of Annoy.rb you are using.
-  VERSION = '0.2.1'.freeze
+  VERSION = '0.4.0'
+
+  # The version of Annoy included with gem.
+  ANNOY_VERSION = '1.17.0'
 end

data/sig/annoy.rbs

@@ -0,0 +1,114 @@
+module Annoy
+  VERSION: String
+
+  class AnnoyIndex
+    attr_reader n_features: Integer
+    attr_reader metric: String
+
+    def initialize: (n_features: Integer n_features, ?metric: String metric) -> void
+    def add_item: (Integer i, Array[Float | Integer] v) -> bool
+    def build: (Integer n_trees, ?n_jobs: Integer n_jobs) -> bool
+    def save: (String filename, ?prefault: bool prefault) -> bool
+    def load: (String filename, ?prefault: bool prefault) -> bool
+    def unload: () -> bool
+    def get_nns_by_item: (Integer i, Integer n, ?search_k: Integer search_k, ?include_distances: (true | false) include_distances) -> ([Array[Integer], Array[Float | Integer]] | Array[Integer])
+    def get_nns_by_vector: (Array[Float | Integer] v, Integer n, ?search_k: Integer search_k, ?include_distances: (true | false) include_distances) -> ([Array[Integer], Array[Float | Integer]] | Array[Integer])
+    def get_item: (Integer i) -> Array[Float | Integer]
+    def get_distance: (Integer i, Integer j) -> (Float | Integer)
+    def n_items: () -> Integer
+    def n_trees: () -> Integer
+    def on_disk_build: (String filename) -> bool
+    def verbose: (bool flag) -> nil
+    def seed: (Integer s) -> nil
+  end
+
+  class AnnoyIndexAngular
+    def initialize: (Integer n_features) -> void
+    def add_item: (Integer i, Array[Float] v) -> bool
+    def build: (Integer n_trees, Integer n_jobs) -> bool
+    def save: (String filename, bool prefault) -> bool
+    def load: (String filename, bool prefault) -> bool
+    def unload: () -> bool
+    def get_nns_by_item: (Integer i, Integer n, Integer search_k, (true | false) include_distances) -> ([Array[Integer], Array[Float]] | Array[Integer])
+    def get_nns_by_vector: (Array[Float] v, Integer n, Integer search_k, (true | false) include_distances) -> ([Array[Integer], Array[Float]] | Array[Integer])
+    def get_item: (Integer i) -> Array[Float]
+    def get_distance: (Integer i, Integer j) -> Float
+    def n_items: () -> Integer
+    def n_trees: () -> Integer
+    def on_disk_build: (String filename) -> bool
+    def verbose: (bool flag) -> nil
+    def seed: (Integer s) -> nil
+  end
+
+  class AnnoyIndexDotProduct
+    def initialize: (Integer n_features) -> void
+    def add_item: (Integer i, Array[Float] v) -> bool
+    def build: (Integer n_trees, Integer n_jobs) -> bool
+    def save: (String filename, bool prefault) -> bool
+    def load: (String filename, bool prefault) -> bool
+    def unload: () -> bool
+    def get_nns_by_item: (Integer i, Integer n, Integer search_k, (true | false) include_distances) -> ([Array[Integer], Array[Float]] | Array[Integer])
+    def get_nns_by_vector: (Array[Float] v, Integer n, Integer search_k, (true | false) include_distances) -> ([Array[Integer], Array[Float]] | Array[Integer])
+    def get_item: (Integer i) -> Array[Float]
+    def get_distance: (Integer i, Integer j) -> Float
+    def n_items: () -> Integer
+    def n_trees: () -> Integer
+    def on_disk_build: (String filename) -> bool
+    def verbose: (bool flag) -> nil
+    def seed: (Integer s) -> nil
+  end
+
+  class AnnoyIndexHamming
+    def initialize: (Integer n_features) -> void
+    def add_item: (Integer i, Array[Integer] v) -> bool
+    def build: (Integer n_trees, Integer n_jobs) -> bool
+    def save: (String filename, bool prefault) -> bool
+    def load: (String filename, bool prefault) -> bool
+    def unload: () -> bool
+    def get_nns_by_item: (Integer i, Integer n, Integer search_k, (true | false) include_distances) -> ([Array[Integer], Array[Integer]] | Array[Integer])
+    def get_nns_by_vector: (Array[Integer] v, Integer n, Integer search_k, (true | false) include_distances) -> ([Array[Integer], Array[Integer]] | Array[Integer])
+    def get_item: (Integer i) -> Array[Integer]
+    def get_distance: (Integer i, Integer j) -> Integer
+    def n_items: () -> Integer
+    def n_trees: () -> Integer
+    def on_disk_build: (String filename) -> bool
+    def verbose: (bool flag) -> nil
+    def seed: (Integer s) -> nil
+  end
+
+  class AnnoyIndexEuclidean
+    def initialize: (Integer n_features) -> void
+    def add_item: (Integer i, Array[Float] v) -> bool
+    def build: (Integer n_trees, Integer n_jobs) -> bool
+    def save: (String filename, bool prefault) -> bool
+    def load: (String filename, bool prefault) -> bool
+    def unload: () -> bool
+    def get_nns_by_item: (Integer i, Integer n, Integer search_k, (true | false) include_distances) -> ([Array[Integer], Array[Float]] | Array[Integer])
+    def get_nns_by_vector: (Array[Float] v, Integer n, Integer search_k, (true | false) include_distances) -> ([Array[Integer], Array[Float]] | Array[Integer])
+    def get_item: (Integer i) -> Array[Float]
+    def get_distance: (Integer i, Integer j) -> Float
+    def n_items: () -> Integer
+    def n_trees: () -> Integer
+    def on_disk_build: (String filename) -> bool
+    def verbose: (bool flag) -> nil
+    def seed: (Integer s) -> nil
+  end
+
+  class AnnoyIndexManhattan
+    def initialize: (Integer n_features) -> void
+    def add_item: (Integer i, Array[Float] v) -> bool
+    def build: (Integer n_trees, Integer n_jobs) -> bool
+    def save: (String filename, bool prefault) -> bool
+    def load: (String filename, bool prefault) -> bool
+    def unload: () -> bool
+    def get_nns_by_item: (Integer i, Integer n, Integer search_k, (true | false) include_distances) -> ([Array[Integer], Array[Float]] | Array[Integer])
+    def get_nns_by_vector: (Array[Float] v, Integer n, Integer search_k, (true | false) include_distances) -> ([Array[Integer], Array[Float]] | Array[Integer])
+    def get_item: (Integer i) -> Array[Float]
+    def get_distance: (Integer i, Integer j) -> Float
+    def n_items: () -> Integer
+    def n_trees: () -> Integer
+    def on_disk_build: (String filename) -> bool
+    def verbose: (bool flag) -> nil
+    def seed: (Integer s) -> nil
+  end
+end

metadata

@@ -1,16 +1,16 @@
 --- !ruby/object:Gem::Specification
 name: annoy-rb
 version: !ruby/object:Gem::Version
-  version: 0.2.1
+  version: 0.4.0
 platform: ruby
 authors:
 - yoshoku
-autorequire: 
+autorequire:
 bindir: exe
 cert_chain: []
-date: 2020-10-24 00:00:00.000000000 Z
+date: 2021-08-06 00:00:00.000000000 Z
 dependencies: []
-description: Annoy.rb is a Ruby binding for the Annoy (Approximate Nearest Neighbors
+description: Annoy.rb provides Ruby bindings for the Annoy (Approximate Nearest Neighbors
   Oh Yeah).
 email:
 - yoshoku@outlook.com
@@ -28,24 +28,27 @@ files:
 - LICENSE.txt
 - README.md
 - Rakefile
+- Steepfile
 - annoy-rb.gemspec
-- ext/annoy/annoy.cpp
-- ext/annoy/annoy.hpp
+- ext/annoy/annoyext.cpp
+- ext/annoy/annoyext.hpp
 - ext/annoy/extconf.rb
+- ext/annoy/src/LICENSE
 - ext/annoy/src/annoylib.h
 - ext/annoy/src/kissrandom.h
 - ext/annoy/src/mman.h
 - lib/annoy.rb
 - lib/annoy/version.rb
+- sig/annoy.rbs
 homepage: https://github.com/yoshoku/annoy.rb
 licenses:
 - Apache-2.0
 metadata:
   homepage_uri: https://github.com/yoshoku/annoy.rb
   source_code_uri: https://github.com/yoshoku/annoy.rb
-  changelog_uri: https://github.com/yoshoku/annoy.rb/blob/master/CHANGELOG.md
+  changelog_uri: https://github.com/yoshoku/annoy.rb/blob/main/CHANGELOG.md
   documentation_uri: https://yoshoku.github.io/annoy.rb/doc/
-post_install_message: 
+post_install_message:
 rdoc_options: []
 require_paths:
 - lib
@@ -60,8 +63,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.1.4
-signing_key: 
+rubygems_version: 3.2.22
+signing_key:
 specification_version: 4
-summary: Ruby binding for the Annoy (Approximate Nearest Neighbors Oh Yeah).
+summary: Ruby bindings for the Annoy (Approximate Nearest Neighbors Oh Yeah).
 test_files: []