annoy-rb 0.4.0 → 0.6.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: c4cdefee51cf2cd6e8eef8bccf558de5f70007625815817312c4f6a5c0ada3fb
-  data.tar.gz: 327b8c21596c7e7688dfa318095d4cbf9253d93e74a72703ce14f3c5d81d0590
+  metadata.gz: 504bef50c398d29e30123e694558cbbb9edc5c3958f457ce3b5622e51467decf
+  data.tar.gz: 39965aeddd097635ccdd9e926d2a1b349c294c41a44c2cc5f729c5bc5431d99e
 SHA512:
-  metadata.gz: 52bc21959f96e2e33e8bebe6f585311d15614015093a6b2a354e9d736e6343a90c60350a9ee0039387226490a7e613b1622c61ff998d5cb1a4ad3df7533f4960
-  data.tar.gz: 9b34a4e7416dbc50fa1626764a84eea4921c93ef5d59833c2f176f96519a52f8a009a41460f5e097ac86acebfc67478b79ea6dfe759682b87cafc4a41f0ec8fc
+  metadata.gz: 56dfefa366db41856aebc90c23ccbd775bbc0eaf354e80f87568049ff05b039ce07e875da2be6a4e5730415f255d8e972800326a597ce073056803508de1291c
+  data.tar.gz: 353473a64ffcae0beb9f0d4af7eb6fac85404f3103ad325ece10d7a59813b5eb778e98195d16801036fc167a118d408e4cfd58825c954db077c0234927faf3d2

data/CHANGELOG.md

@@ -1,3 +1,37 @@
+## 0.6.1
+
+- Refactor codes and configs with RuboCop and clang-format.
+
+## 0.6.0
+- Add `dtype` argument to initialize method to specify the data type of vector element.
+If you want to load a search index created with the Python bindings, specify 'float32' to the dtype argument.
+
+```
+require 'annoy'
+
+f = 40
+t = Annoy::AnnoyIndex.new(n_features: f, metric: 'angular', dtype: 'float32')
+t.load('index_with_python_bindings.ann')
+```
+
+- Change the data type of item index from int to int32_t.
+- Update type declarations and documentations.
+- Introduce conventional commits.
+
+## 0.5.0
+### Breaking change
+- Remove `-march=native` and `-DANNOYLIB_MULTITHREADED_BUILD` from CXXFLAGS.
+For example, the installation command to reproduce the same build as the previous version is as follows:
+
+```
+$ gem install annoy-rb -- --with-cxxflags=-march=native -DANNOYLIB_MULTITHREADED_BUILD
+```
+
+```
+$ bundle config --local build.annoy-rb "--with-cxxflags=-march=native -DANNOYLIB_MULTITHREADED_BUILD"
+$ bundle install
+```
+
 ## 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.
 

data/README.md

@@ -1,11 +1,11 @@
-# Annoy.rb
+# annoy-rb
 
 [![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/main/LICENSE.txt)
-[![Documentation](http://img.shields.io/badge/api-reference-blue.svg)](https://yoshoku.github.io/annoy.rb/doc/)
+[![Documentation](https://img.shields.io/badge/api-reference-blue.svg)](https://yoshoku.github.io/annoy.rb/doc/)
 
-Annoy.rb provides Ruby bindings 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
 
@@ -23,11 +23,24 @@ Or install it yourself as:
 
     $ gem install annoy-rb
 
-Note: Annoy.rb does not require the installation of another external library.
+Note: annoy-rb does not require the installation of another external library.
+In addition, annoy-rb does not give any optimization options when building native extensions.
+If necessary, add optimization options yourself during installation, as follows;
+
+```
+$ bundle config --local build.annoy-rb "--with-cxxflags=-march=native"
+$ bundle install
+```
+
+Or:
+
+```
+$ gem install annoy-rb -- --with-cxxflags=-march=native
+```
 
 ## Documentation
 
-* [Annoy.rb API Documentation](https://yoshoku.github.io/annoy.rb/doc/)
+* [annoy-rb API Documentation](https://yoshoku.github.io/annoy.rb/doc/)
 
 ## Usage
 
@@ -50,6 +63,18 @@ u.load('test.ann')
 p u.get_nns_by_item(0, 100) # will find the 100 nearest neighbors.
 ```
 
+With the default argument, annoy-rb uses double precision floating point type for the data type of vector element.
+On the other hand, the [Python bindings of Annoy](https://pypi.org/project/annoy/) use single precision floating point type.
+If you want to load a search index created with the Python bindings, specify 'float32' to the dtype argument.
+
+```ruby
+require 'annoy'
+
+f = 40
+t = Annoy::AnnoyIndex.new(n_features: f, metric: 'angular', dtype: 'float32')
+t.load('index_with_python_bindings.ann')
+```
+
 ## License
 
 The gem is available as open source under the terms of the [Apache-2.0 License](https://www.apache.org/licenses/LICENSE-2.0).
@@ -58,4 +83,4 @@ The gem is available as open source under the terms of the [Apache-2.0 License](
 
 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).
+and contributors are expected to adhere to the [Contributor Covenant](https://contributor-covenant.org) code of conduct.

data/ext/annoy/annoyext.cpp

@@ -1,7 +1,7 @@
 /**
  * Annoy.rb is a Ruby binding for the Annoy (Approximate Nearest Neighbors Oh Yeah).
  *
- * Copyright (c) 2020 Atsushi Tatsuma
+ * Copyright (c) 2020-2022 Atsushi Tatsuma
  *
  * Licensed under the Apache License, Version 2.0 (the "License");
  * you may not use this file except in compliance with the License.
@@ -18,13 +18,16 @@
 
 #include "annoyext.hpp"
 
-extern "C"
-void Init_annoyext(void)
-{
+extern "C" void Init_annoyext(void) {
   VALUE rb_mAnnoy = rb_define_module("Annoy");
-  RbAnnoyIndex<AnnoyIndexAngular, double>::define_class(rb_mAnnoy, "AnnoyIndexAngular");
-  RbAnnoyIndex<AnnoyIndexDotProduct, double>::define_class(rb_mAnnoy, "AnnoyIndexDotProduct");
-  RbAnnoyIndex<AnnoyIndexHamming, uint64_t>::define_class(rb_mAnnoy, "AnnoyIndexHamming");
-  RbAnnoyIndex<AnnoyIndexEuclidean, double>::define_class(rb_mAnnoy, "AnnoyIndexEuclidean");
-  RbAnnoyIndex<AnnoyIndexManhattan, double>::define_class(rb_mAnnoy, "AnnoyIndexManhattan");
+  RbAnnoyIndex<AnnoyIndexAngular<double>, double>::define_class(rb_mAnnoy, "AnnoyIndexAngular");
+  RbAnnoyIndex<AnnoyIndexDotProduct<double>, double>::define_class(rb_mAnnoy, "AnnoyIndexDotProduct");
+  RbAnnoyIndex<AnnoyIndexHamming<uint64_t>, uint64_t>::define_class(rb_mAnnoy, "AnnoyIndexHamming");
+  RbAnnoyIndex<AnnoyIndexEuclidean<double>, double>::define_class(rb_mAnnoy, "AnnoyIndexEuclidean");
+  RbAnnoyIndex<AnnoyIndexManhattan<double>, double>::define_class(rb_mAnnoy, "AnnoyIndexManhattan");
+
+  RbAnnoyIndex<AnnoyIndexAngular<float>, float>::define_class(rb_mAnnoy, "AnnoyIndexAngularFloat32");
+  RbAnnoyIndex<AnnoyIndexDotProduct<float>, float>::define_class(rb_mAnnoy, "AnnoyIndexDotProductFloat32");
+  RbAnnoyIndex<AnnoyIndexEuclidean<float>, float>::define_class(rb_mAnnoy, "AnnoyIndexEuclideanFloat32");
+  RbAnnoyIndex<AnnoyIndexManhattan<float>, float>::define_class(rb_mAnnoy, "AnnoyIndexManhattanFloat32");
 }

data/ext/annoy/annoyext.hpp

@@ -1,7 +1,7 @@
 /**
  * Annoy.rb is a Ruby binding for the Annoy (Approximate Nearest Neighbors Oh Yeah).
  *
- * Copyright (c) 2020 Atsushi Tatsuma
+ * Copyright (c) 2020-2022 Atsushi Tatsuma
  *
  * Licensed under the Apache License, Version 2.0 (the "License");
  * you may not use this file except in compliance with the License.
@@ -22,301 +22,304 @@
 #include <typeinfo>
 
 #include <ruby.h>
+
 #include <annoylib.h>
 #include <kissrandom.h>
 
 #ifdef ANNOYLIB_MULTITHREADED_BUILD
-  typedef AnnoyIndexMultiThreadedBuildPolicy AnnoyIndexThreadedBuildPolicy;
+typedef AnnoyIndexMultiThreadedBuildPolicy AnnoyIndexThreadedBuildPolicy;
 #else
-  typedef AnnoyIndexSingleThreadedBuildPolicy AnnoyIndexThreadedBuildPolicy;
+typedef AnnoyIndexSingleThreadedBuildPolicy AnnoyIndexThreadedBuildPolicy;
 #endif
 
-typedef AnnoyIndex<int, double, Angular, Kiss64Random, AnnoyIndexThreadedBuildPolicy> AnnoyIndexAngular;
-typedef AnnoyIndex<int, double, DotProduct, Kiss64Random, AnnoyIndexThreadedBuildPolicy> AnnoyIndexDotProduct;
-typedef AnnoyIndex<int, uint64_t, Hamming, Kiss64Random, AnnoyIndexThreadedBuildPolicy> AnnoyIndexHamming;
-typedef AnnoyIndex<int, double, Euclidean, Kiss64Random, AnnoyIndexThreadedBuildPolicy> AnnoyIndexEuclidean;
-typedef AnnoyIndex<int, double, Manhattan, Kiss64Random, AnnoyIndexThreadedBuildPolicy> AnnoyIndexManhattan;
-
-template<class T, typename F> class RbAnnoyIndex
-{
-  public:
-    static VALUE annoy_index_alloc(VALUE self) {
-      T* ptr = (T*)ruby_xmalloc(sizeof(T));
-      new (ptr) T();
-      return TypedData_Wrap_Struct(self, &annoy_index_type, ptr);
-    };
-
-    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;
-      TypedData_Get_Struct(self, T, &annoy_index_type, ptr);
-      return ptr;
-    };
-
-    static VALUE define_class(VALUE rb_mAnnoy, const char* class_name) {
-      VALUE rb_cAnnoyIndex = rb_define_class_under(rb_mAnnoy, class_name, rb_cObject);
-      rb_define_alloc_func(rb_cAnnoyIndex, annoy_index_alloc);
-      rb_define_method(rb_cAnnoyIndex, "initialize", RUBY_METHOD_FUNC(_annoy_index_init), 1);
-      rb_define_method(rb_cAnnoyIndex, "add_item", RUBY_METHOD_FUNC(_annoy_index_add_item), 2);
-      rb_define_method(rb_cAnnoyIndex, "build", RUBY_METHOD_FUNC(_annoy_index_build), 2);
-      rb_define_method(rb_cAnnoyIndex, "save", RUBY_METHOD_FUNC(_annoy_index_save), 2);
-      rb_define_method(rb_cAnnoyIndex, "load", RUBY_METHOD_FUNC(_annoy_index_load), 2);
-      rb_define_method(rb_cAnnoyIndex, "unload", RUBY_METHOD_FUNC(_annoy_index_unload), 0);
-      rb_define_method(rb_cAnnoyIndex, "get_nns_by_item", RUBY_METHOD_FUNC(_annoy_index_get_nns_by_item), 4);
-      rb_define_method(rb_cAnnoyIndex, "get_nns_by_vector", RUBY_METHOD_FUNC(_annoy_index_get_nns_by_vector), 4);
-      rb_define_method(rb_cAnnoyIndex, "get_item", RUBY_METHOD_FUNC(_annoy_index_get_item), 1);
-      rb_define_method(rb_cAnnoyIndex, "get_distance", RUBY_METHOD_FUNC(_annoy_index_get_distance), 2);
-      rb_define_method(rb_cAnnoyIndex, "get_n_items", RUBY_METHOD_FUNC(_annoy_index_get_n_items), 0);
-      rb_define_method(rb_cAnnoyIndex, "get_n_trees", RUBY_METHOD_FUNC(_annoy_index_get_n_trees), 0);
-      rb_define_method(rb_cAnnoyIndex, "on_disk_build", RUBY_METHOD_FUNC(_annoy_index_on_disk_build), 1);
-      rb_define_method(rb_cAnnoyIndex, "set_seed", RUBY_METHOD_FUNC(_annoy_index_set_seed), 1);
-      rb_define_method(rb_cAnnoyIndex, "verbose", RUBY_METHOD_FUNC(_annoy_index_verbose), 1);
-      rb_define_method(rb_cAnnoyIndex, "get_f", RUBY_METHOD_FUNC(_annoy_index_get_f), 0);
-      return rb_cAnnoyIndex;
-    };
-
-  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);
-      T* ptr = get_annoy_index(self);
-      new (ptr) T(n_dims);
-      return Qnil;
-    };
-
-    static VALUE _annoy_index_add_item(VALUE self, VALUE _idx, VALUE arr) {
-      const int idx = NUM2INT(_idx);
-      const int n_dims = get_annoy_index(self)->get_f();
-
-      if (!RB_TYPE_P(arr, T_ARRAY)) {
-        rb_raise(rb_eArgError, "Expect item vector to be Array.");
-        return Qfalse;
-      }
-
-      if (n_dims != RARRAY_LEN(arr)) {
-        rb_raise(rb_eArgError, "Array size does not match to index dimensionality.");
-        return Qfalse;
-      }
-
-      F* vec = (F*)ruby_xmalloc(n_dims * sizeof(F));
-      for (int i = 0; i < n_dims; i++) {
-        vec[i] = typeid(F) == typeid(double) ? NUM2DBL(rb_ary_entry(arr, i)) : NUM2UINT(rb_ary_entry(arr, i));
-      }
-
-      char* error;
-      if (!get_annoy_index(self)->add_item(idx, vec, &error)) {
-        VALUE error_str = rb_str_new_cstr(error);
-        free(error);
-        ruby_xfree(vec);
-        rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
-        return Qfalse;
-      }
-
-      ruby_xfree(vec);
-      return Qtrue;
-    };
-
-    static VALUE _annoy_index_build(VALUE self, VALUE _n_trees, VALUE _n_jobs) {
-      const int n_trees = NUM2INT(_n_trees);
-      const int n_jobs = NUM2INT(_n_jobs);
-      char* error;
-      if (!get_annoy_index(self)->build(n_trees, n_jobs, &error)) {
-        VALUE error_str = rb_str_new_cstr(error);
-        free(error);
-        rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
-        return Qfalse;
-      }
-      return Qtrue;
-    };
-
-    static VALUE _annoy_index_save(VALUE self, VALUE _filename, VALUE _prefault) {
-      const char* filename = StringValuePtr(_filename);
-      const bool prefault = _prefault == Qtrue ? true : false;
-      char* error;
-      if (!get_annoy_index(self)->save(filename, prefault, &error)) {
-        VALUE error_str = rb_str_new_cstr(error);
-        free(error);
-        rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
-        return Qfalse;
-      }
-      RB_GC_GUARD(_filename);
-      return Qtrue;
-    };
-
-    static VALUE _annoy_index_load(VALUE self, VALUE _filename, VALUE _prefault) {
-      const char* filename = StringValuePtr(_filename);
-      const bool prefault = _prefault == Qtrue ? true : false;
-      char* error;
-      if (!get_annoy_index(self)->load(filename, prefault, &error)) {
-        VALUE error_str = rb_str_new_cstr(error);
-        free(error);
-        rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
-        return Qfalse;
-      }
-      RB_GC_GUARD(_filename);
-      return Qtrue;
-    };
-
-    static VALUE _annoy_index_unload(VALUE self) {
-      get_annoy_index(self)->unload();
-      return Qnil;
-    };
-
-    static VALUE _annoy_index_get_nns_by_item(VALUE self, VALUE _idx, VALUE _n_neighbors, VALUE _search_k, VALUE _include_distances) {
-      const int idx = NUM2INT(_idx);
-      const int n_neighbors = NUM2INT(_n_neighbors);
-      const int search_k = NUM2INT(_search_k);
-      const bool include_distances = _include_distances == Qtrue ? true : false;
-      std::vector<int> neighbors;
-      std::vector<F> distances;
-
-      get_annoy_index(self)->get_nns_by_item(idx, n_neighbors, search_k, &neighbors, include_distances ? &distances : NULL);
-
-      const int sz_neighbors = neighbors.size();
-      VALUE neighbors_arr = rb_ary_new2(sz_neighbors);
-
-      for (int i = 0; i < sz_neighbors; i++) {
-        rb_ary_store(neighbors_arr, i, INT2NUM(neighbors[i]));
-      }
-
-      if (include_distances) {
-        const int sz_distances = distances.size();
-        VALUE distances_arr = rb_ary_new2(sz_distances);
-        for (int i = 0; i < sz_distances; i++) {
-          rb_ary_store(distances_arr, i, typeid(F) == typeid(double) ? DBL2NUM(distances[i]) : UINT2NUM(distances[i]));
-        }
-        VALUE res = rb_ary_new2(2);
-        rb_ary_store(res, 0, neighbors_arr);
-        rb_ary_store(res, 1, distances_arr);
-        return res;
-      }
-
-      return neighbors_arr;
-    };
-
-    static VALUE _annoy_index_get_nns_by_vector(VALUE self, VALUE _vec, VALUE _n_neighbors, VALUE _search_k, VALUE _include_distances) {
-      const int n_dims = get_annoy_index(self)->get_f();
-
-      if (!RB_TYPE_P(_vec, T_ARRAY)) {
-        rb_raise(rb_eArgError, "Expect item vector to be Array.");
-        return Qfalse;
-      }
-
-      if (n_dims != RARRAY_LEN(_vec)) {
-        rb_raise(rb_eArgError, "Array size does not match to index dimensionality.");
-        return Qfalse;
-      }
-
-      F* vec = (F*)ruby_xmalloc(n_dims * sizeof(F));
-      for (int i = 0; i < n_dims; i++) {
-        vec[i] = typeid(F) == typeid(double) ? NUM2DBL(rb_ary_entry(_vec, i)) : NUM2UINT(rb_ary_entry(_vec, i));
-      }
-
-      const int n_neighbors = NUM2INT(_n_neighbors);
-      const int search_k = NUM2INT(_search_k);
-      const bool include_distances = _include_distances == Qtrue ? true : false;
-      std::vector<int> neighbors;
-      std::vector<F> distances;
-
-      get_annoy_index(self)->get_nns_by_vector(vec, n_neighbors, search_k, &neighbors, include_distances ? &distances : NULL);
-
+// clang-format off
+template<typename F> using AnnoyIndexAngular = AnnoyIndex<int32_t, F, Angular, Kiss64Random, AnnoyIndexThreadedBuildPolicy>;
+template<typename F> using AnnoyIndexDotProduct = AnnoyIndex<int32_t, F, DotProduct, Kiss64Random, AnnoyIndexThreadedBuildPolicy>;
+template<typename F> using AnnoyIndexHamming = AnnoyIndex<int32_t, F, Hamming, Kiss64Random, AnnoyIndexThreadedBuildPolicy>;
+template<typename F> using AnnoyIndexEuclidean = AnnoyIndex<int32_t, F, Euclidean, Kiss64Random, AnnoyIndexThreadedBuildPolicy>;
+template<typename F> using AnnoyIndexManhattan = AnnoyIndex<int32_t, F, Manhattan, Kiss64Random, AnnoyIndexThreadedBuildPolicy>;
+// clang-format on
+
+template <class T, typename F> class RbAnnoyIndex {
+public:
+  static VALUE annoy_index_alloc(VALUE self) {
+    T* ptr = (T*)ruby_xmalloc(sizeof(T));
+    new (ptr) T();
+    return TypedData_Wrap_Struct(self, &annoy_index_type, ptr);
+  };
+
+  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;
+    TypedData_Get_Struct(self, T, &annoy_index_type, ptr);
+    return ptr;
+  };
+
+  static VALUE define_class(VALUE rb_mAnnoy, const char* class_name) {
+    VALUE rb_cAnnoyIndex = rb_define_class_under(rb_mAnnoy, class_name, rb_cObject);
+    rb_define_alloc_func(rb_cAnnoyIndex, annoy_index_alloc);
+    rb_define_method(rb_cAnnoyIndex, "initialize", RUBY_METHOD_FUNC(_annoy_index_init), 1);
+    rb_define_method(rb_cAnnoyIndex, "add_item", RUBY_METHOD_FUNC(_annoy_index_add_item), 2);
+    rb_define_method(rb_cAnnoyIndex, "build", RUBY_METHOD_FUNC(_annoy_index_build), 2);
+    rb_define_method(rb_cAnnoyIndex, "save", RUBY_METHOD_FUNC(_annoy_index_save), 2);
+    rb_define_method(rb_cAnnoyIndex, "load", RUBY_METHOD_FUNC(_annoy_index_load), 2);
+    rb_define_method(rb_cAnnoyIndex, "unload", RUBY_METHOD_FUNC(_annoy_index_unload), 0);
+    rb_define_method(rb_cAnnoyIndex, "get_nns_by_item", RUBY_METHOD_FUNC(_annoy_index_get_nns_by_item), 4);
+    rb_define_method(rb_cAnnoyIndex, "get_nns_by_vector", RUBY_METHOD_FUNC(_annoy_index_get_nns_by_vector), 4);
+    rb_define_method(rb_cAnnoyIndex, "get_item", RUBY_METHOD_FUNC(_annoy_index_get_item), 1);
+    rb_define_method(rb_cAnnoyIndex, "get_distance", RUBY_METHOD_FUNC(_annoy_index_get_distance), 2);
+    rb_define_method(rb_cAnnoyIndex, "get_n_items", RUBY_METHOD_FUNC(_annoy_index_get_n_items), 0);
+    rb_define_method(rb_cAnnoyIndex, "get_n_trees", RUBY_METHOD_FUNC(_annoy_index_get_n_trees), 0);
+    rb_define_method(rb_cAnnoyIndex, "on_disk_build", RUBY_METHOD_FUNC(_annoy_index_on_disk_build), 1);
+    rb_define_method(rb_cAnnoyIndex, "set_seed", RUBY_METHOD_FUNC(_annoy_index_set_seed), 1);
+    rb_define_method(rb_cAnnoyIndex, "verbose", RUBY_METHOD_FUNC(_annoy_index_verbose), 1);
+    rb_define_method(rb_cAnnoyIndex, "get_f", RUBY_METHOD_FUNC(_annoy_index_get_f), 0);
+    return rb_cAnnoyIndex;
+  };
+
+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);
+    T* ptr = get_annoy_index(self);
+    new (ptr) T(n_dims);
+    return Qnil;
+  };
+
+  static VALUE _annoy_index_add_item(VALUE self, VALUE _idx, VALUE arr) {
+    const int32_t idx = (int32_t)NUM2INT(_idx);
+    const int n_dims = get_annoy_index(self)->get_f();
+
+    if (!RB_TYPE_P(arr, T_ARRAY)) {
+      rb_raise(rb_eArgError, "Expect item vector to be Array.");
+      return Qfalse;
+    }
+
+    if (n_dims != RARRAY_LEN(arr)) {
+      rb_raise(rb_eArgError, "Array size does not match to index dimensionality.");
+      return Qfalse;
+    }
+
+    F* vec = (F*)ruby_xmalloc(n_dims * sizeof(F));
+    for (int i = 0; i < n_dims; i++) {
+      vec[i] = typeid(F) == typeid(double) ? NUM2DBL(rb_ary_entry(arr, i)) : NUM2UINT(rb_ary_entry(arr, i));
+    }
+
+    char* error;
+    if (!get_annoy_index(self)->add_item(idx, vec, &error)) {
+      VALUE error_str = rb_str_new_cstr(error);
+      free(error);
       ruby_xfree(vec);
-
-      const int sz_neighbors = neighbors.size();
-      VALUE neighbors_arr = rb_ary_new2(sz_neighbors);
-
-      for (int i = 0; i < sz_neighbors; i++) {
-        rb_ary_store(neighbors_arr, i, INT2NUM(neighbors[i]));
+      rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
+      return Qfalse;
+    }
+
+    ruby_xfree(vec);
+    return Qtrue;
+  };
+
+  static VALUE _annoy_index_build(VALUE self, VALUE _n_trees, VALUE _n_jobs) {
+    const int n_trees = NUM2INT(_n_trees);
+    const int n_jobs = NUM2INT(_n_jobs);
+    char* error;
+    if (!get_annoy_index(self)->build(n_trees, n_jobs, &error)) {
+      VALUE error_str = rb_str_new_cstr(error);
+      free(error);
+      rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
+      return Qfalse;
+    }
+    return Qtrue;
+  };
+
+  static VALUE _annoy_index_save(VALUE self, VALUE _filename, VALUE _prefault) {
+    const char* filename = StringValuePtr(_filename);
+    const bool prefault = _prefault == Qtrue ? true : false;
+    char* error;
+    if (!get_annoy_index(self)->save(filename, prefault, &error)) {
+      VALUE error_str = rb_str_new_cstr(error);
+      free(error);
+      rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
+      return Qfalse;
+    }
+    RB_GC_GUARD(_filename);
+    return Qtrue;
+  };
+
+  static VALUE _annoy_index_load(VALUE self, VALUE _filename, VALUE _prefault) {
+    const char* filename = StringValuePtr(_filename);
+    const bool prefault = _prefault == Qtrue ? true : false;
+    char* error;
+    if (!get_annoy_index(self)->load(filename, prefault, &error)) {
+      VALUE error_str = rb_str_new_cstr(error);
+      free(error);
+      rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
+      return Qfalse;
+    }
+    RB_GC_GUARD(_filename);
+    return Qtrue;
+  };
+
+  static VALUE _annoy_index_unload(VALUE self) {
+    get_annoy_index(self)->unload();
+    return Qnil;
+  };
+
+  static VALUE _annoy_index_get_nns_by_item(VALUE self, VALUE _idx, VALUE _n_neighbors, VALUE _search_k,
+                                            VALUE _include_distances) {
+    const int32_t idx = (int32_t)NUM2INT(_idx);
+    const int n_neighbors = NUM2INT(_n_neighbors);
+    const int search_k = NUM2INT(_search_k);
+    const bool include_distances = _include_distances == Qtrue ? true : false;
+    std::vector<int32_t> neighbors;
+    std::vector<F> distances;
+
+    get_annoy_index(self)->get_nns_by_item(idx, n_neighbors, search_k, &neighbors, include_distances ? &distances : NULL);
+
+    const int sz_neighbors = neighbors.size();
+    VALUE neighbors_arr = rb_ary_new2(sz_neighbors);
+
+    for (int i = 0; i < sz_neighbors; i++) {
+      rb_ary_store(neighbors_arr, i, INT2NUM((int)(neighbors[i])));
+    }
+
+    if (include_distances) {
+      const int sz_distances = distances.size();
+      VALUE distances_arr = rb_ary_new2(sz_distances);
+      for (int i = 0; i < sz_distances; i++) {
+        rb_ary_store(distances_arr, i, typeid(F) == typeid(double) ? DBL2NUM(distances[i]) : UINT2NUM(distances[i]));
       }
-
-      if (include_distances) {
-        const int sz_distances = distances.size();
-        VALUE distances_arr = rb_ary_new2(sz_distances);
-        for (int i = 0; i < sz_distances; i++) {
-          rb_ary_store(distances_arr, i, typeid(F) == typeid(double) ? DBL2NUM(distances[i]) : UINT2NUM(distances[i]));
-        }
-        VALUE res = rb_ary_new2(2);
-        rb_ary_store(res, 0, neighbors_arr);
-        rb_ary_store(res, 1, distances_arr);
-        return res;
-      }
-
-      return neighbors_arr;
-    };
-
-    static VALUE _annoy_index_get_item(VALUE self, VALUE _idx) {
-      const int idx = NUM2INT(_idx);
-      const int n_dims = get_annoy_index(self)->get_f();
-      F* vec = (F*)ruby_xmalloc(n_dims * sizeof(F));
-      VALUE arr = rb_ary_new2(n_dims);
-
-      get_annoy_index(self)->get_item(idx, vec);
-
-      for (int i = 0; i < n_dims; i++) {
-        rb_ary_store(arr, i, typeid(F) == typeid(double) ? DBL2NUM(vec[i]) : UINT2NUM(vec[i]));
-      }
-
-      ruby_xfree(vec);
-      return arr;
-    };
-
-    static VALUE _annoy_index_get_distance(VALUE self, VALUE _i, VALUE _j) {
-      const int i = NUM2INT(_i);
-      const int j = NUM2INT(_j);
-      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) {
-      const int32_t n_items = get_annoy_index(self)->get_n_items();
-      return INT2NUM(n_items);
-    };
-
-    static VALUE _annoy_index_get_n_trees(VALUE self) {
-      const int32_t n_trees = get_annoy_index(self)->get_n_trees();
-      return INT2NUM(n_trees);
-    };
-
-    static VALUE _annoy_index_on_disk_build(VALUE self, VALUE _filename) {
-      const char* filename = StringValuePtr(_filename);
-      char* error;
-      if (!get_annoy_index(self)->on_disk_build(filename, &error)) {
-        VALUE error_str = rb_str_new_cstr(error);
-        free(error);
-        rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
-        return Qfalse;
+      VALUE res = rb_ary_new2(2);
+      rb_ary_store(res, 0, neighbors_arr);
+      rb_ary_store(res, 1, distances_arr);
+      return res;
+    }
+
+    return neighbors_arr;
+  };
+
+  static VALUE _annoy_index_get_nns_by_vector(VALUE self, VALUE _vec, VALUE _n_neighbors, VALUE _search_k,
+                                              VALUE _include_distances) {
+    const int n_dims = get_annoy_index(self)->get_f();
+
+    if (!RB_TYPE_P(_vec, T_ARRAY)) {
+      rb_raise(rb_eArgError, "Expect item vector to be Array.");
+      return Qfalse;
+    }
+
+    if (n_dims != RARRAY_LEN(_vec)) {
+      rb_raise(rb_eArgError, "Array size does not match to index dimensionality.");
+      return Qfalse;
+    }
+
+    F* vec = (F*)ruby_xmalloc(n_dims * sizeof(F));
+    for (int i = 0; i < n_dims; i++) {
+      vec[i] = typeid(F) == typeid(double) ? NUM2DBL(rb_ary_entry(_vec, i)) : NUM2UINT(rb_ary_entry(_vec, i));
+    }
+
+    const int n_neighbors = NUM2INT(_n_neighbors);
+    const int search_k = NUM2INT(_search_k);
+    const bool include_distances = _include_distances == Qtrue ? true : false;
+    std::vector<int32_t> neighbors;
+    std::vector<F> distances;
+
+    get_annoy_index(self)->get_nns_by_vector(vec, n_neighbors, search_k, &neighbors, include_distances ? &distances : NULL);
+
+    ruby_xfree(vec);
+
+    const int sz_neighbors = neighbors.size();
+    VALUE neighbors_arr = rb_ary_new2(sz_neighbors);
+
+    for (int i = 0; i < sz_neighbors; i++) {
+      rb_ary_store(neighbors_arr, i, INT2NUM((int)(neighbors[i])));
+    }
+
+    if (include_distances) {
+      const int sz_distances = distances.size();
+      VALUE distances_arr = rb_ary_new2(sz_distances);
+      for (int i = 0; i < sz_distances; i++) {
+        rb_ary_store(distances_arr, i, typeid(F) == typeid(double) ? DBL2NUM(distances[i]) : UINT2NUM(distances[i]));
       }
-      RB_GC_GUARD(_filename);
-      return Qtrue;
-    };
-
-    static VALUE _annoy_index_set_seed(VALUE self, VALUE _seed) {
-      const int seed = NUM2INT(_seed);
-      get_annoy_index(self)->set_seed(seed);
-      return Qnil;
-    };
-
-    static VALUE _annoy_index_verbose(VALUE self, VALUE _flag) {
-      const bool flag = _flag == Qtrue ? true : false;
-      get_annoy_index(self)->verbose(flag);
-      return Qnil;
-    };
-
-    static VALUE _annoy_index_get_f(VALUE self) {
-      const int32_t f = get_annoy_index(self)->get_f();
-      return INT2NUM(f);
-    };
+      VALUE res = rb_ary_new2(2);
+      rb_ary_store(res, 0, neighbors_arr);
+      rb_ary_store(res, 1, distances_arr);
+      return res;
+    }
+
+    return neighbors_arr;
+  };
+
+  static VALUE _annoy_index_get_item(VALUE self, VALUE _idx) {
+    const int32_t idx = (int32_t)NUM2INT(_idx);
+    const int n_dims = get_annoy_index(self)->get_f();
+    F* vec = (F*)ruby_xmalloc(n_dims * sizeof(F));
+    VALUE arr = rb_ary_new2(n_dims);
+
+    get_annoy_index(self)->get_item(idx, vec);
+
+    for (int i = 0; i < n_dims; i++) {
+      rb_ary_store(arr, i, typeid(F) == typeid(double) ? DBL2NUM(vec[i]) : UINT2NUM(vec[i]));
+    }
+
+    ruby_xfree(vec);
+    return arr;
+  };
+
+  static VALUE _annoy_index_get_distance(VALUE self, VALUE _i, VALUE _j) {
+    const int32_t i = (int32_t)NUM2INT(_i);
+    const int32_t j = (int32_t)NUM2INT(_j);
+    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) {
+    const int32_t n_items = get_annoy_index(self)->get_n_items();
+    return INT2NUM(n_items);
+  };
+
+  static VALUE _annoy_index_get_n_trees(VALUE self) {
+    const int32_t n_trees = get_annoy_index(self)->get_n_trees();
+    return INT2NUM(n_trees);
+  };
+
+  static VALUE _annoy_index_on_disk_build(VALUE self, VALUE _filename) {
+    const char* filename = StringValuePtr(_filename);
+    char* error;
+    if (!get_annoy_index(self)->on_disk_build(filename, &error)) {
+      VALUE error_str = rb_str_new_cstr(error);
+      free(error);
+      rb_raise(rb_eRuntimeError, "%s", StringValuePtr(error_str));
+      return Qfalse;
+    }
+    RB_GC_GUARD(_filename);
+    return Qtrue;
+  };
+
+  static VALUE _annoy_index_set_seed(VALUE self, VALUE _seed) {
+    const int seed = NUM2INT(_seed);
+    get_annoy_index(self)->set_seed(seed);
+    return Qnil;
+  };
+
+  static VALUE _annoy_index_verbose(VALUE self, VALUE _flag) {
+    const bool flag = _flag == Qtrue ? true : false;
+    get_annoy_index(self)->verbose(flag);
+    return Qnil;
+  };
+
+  static VALUE _annoy_index_get_f(VALUE self) {
+    const int32_t f = get_annoy_index(self)->get_f();
+    return INT2NUM(f);
+  };
 };
 
+// clang-format off
 template<class T, typename F>
 const rb_data_type_t RbAnnoyIndex<T, F>::annoy_index_type = {
   "RbAnnoyIndex",
@@ -329,5 +332,6 @@ const rb_data_type_t RbAnnoyIndex<T, F>::annoy_index_type = {
   NULL,
   RUBY_TYPED_FREE_IMMEDIATELY
 };
+// clang-format on
 
 #endif /* ANNOYEXT_HPP */

data/ext/annoy/extconf.rb

@@ -2,7 +2,7 @@ require 'mkmf'
 
 abort 'libstdc++ is not found.' unless have_library('stdc++')
 
-$CXXFLAGS << " -std=c++14 -march=native -DANNOYLIB_MULTITHREADED_BUILD"
+$CXXFLAGS << " -std=c++14"
 $INCFLAGS << " -I$(srcdir)/src"
 $VPATH << "$(srcdir)/src"
 

data/lib/annoy/version.rb

@@ -3,7 +3,7 @@
 # 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.4.0'
+  VERSION = '0.6.1'
 
   # The version of Annoy included with gem.
   ANNOY_VERSION = '1.17.0'

data/lib/annoy-rb.rb

@@ -0,0 +1,3 @@
+# frozen_string_literal: true
+
+require_relative 'annoy'

data/lib/annoy.rb

@@ -30,30 +30,40 @@ module Annoy
     # @return [String]
     attr_reader :metric
 
+    # Returns the data type of feature.
+    # @return [String]
+    attr_reader :dtype
+
     # Create a new search index.
     #
     # @param n_features [Integer] The number of features (dimensions) of stored vector.
     # @param metric [String] The distance metric between vectors ('angular', 'dot', 'hamming', 'euclidean', or 'manhattan').
-    def initialize(n_features:, metric: 'angular')
+    # @param dtype [String] The data type of features ('float64' and 'float32').
+    #   If metric is given 'hamming', 'uint64' is automatically assigned to this argument.
+    def initialize(n_features:, metric: 'angular', dtype: 'float64') # rubocop:disable Metrics/AbcSize, Metrics/CyclomaticComplexity, Metrics/MethodLength
       raise ArgumentError, 'Expect n_features to be Integer.' unless n_features.is_a?(Numeric)
 
       @n_features = n_features.to_i
       @metric = metric
+      @dtype = dtype
 
+      # rubocop:disable Layout/LineLength
       @index = case @metric
                when 'angular'
-                 AnnoyIndexAngular.new(@n_features)
+                 @dtype == 'float64' ? AnnoyIndexAngular.new(@n_features) : AnnoyIndexAngularFloat32.new(@n_features)
                when 'dot'
-                 AnnoyIndexDotProduct.new(@n_features)
+                 @dtype == 'float64' ? AnnoyIndexDotProduct.new(@n_features) : AnnoyIndexDotProductFloat32.new(@n_features)
                when 'hamming'
+                 @dtype = 'uint64'
                  AnnoyIndexHamming.new(@n_features)
                when 'euclidean'
-                 AnnoyIndexEuclidean.new(@n_features)
+                 @dtype == 'float64' ? AnnoyIndexEuclidean.new(@n_features) : AnnoyIndexEuclideanFloat32.new(@n_features)
                when 'manhattan'
-                 AnnoyIndexManhattan.new(@n_features)
+                 @dtype == 'float64' ? AnnoyIndexManhattan.new(@n_features) : AnnoyIndexManhattanFloat32.new(@n_features)
                else
                  raise ArgumentError, "No such metric: #{@metric}."
                end
+      # rubocop:enable Layout/LineLength
     end
 
     # Add item to be indexed.
@@ -69,6 +79,7 @@ module Annoy
     #
     # @param n_trees [Integer] The number of trees. More trees gives higher search precision.
     # @param n_jobs [Integer] The number of threads used to build the trees. If -1 is given, uses all available CPU cores.
+    # This parameter is enabled only if "-DANNOYLIB_MULTITHREADED_BUILD" is specified on gem installation.
     # @return [Boolean]
     def build(n_trees, n_jobs: -1)
       @index.build(n_trees, n_jobs)

data/sig/annoy.rbs

@@ -1,11 +1,13 @@
 module Annoy
   VERSION: String
+  ANNOY_VERSION: String
 
   class AnnoyIndex
     attr_reader n_features: Integer
     attr_reader metric: String
+    attr_reader dtype: String
 
-    def initialize: (n_features: Integer n_features, ?metric: String metric) -> void
+    def initialize: (n_features: Integer n_features, ?metric: String metric, ?dtype: String dtype) -> 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
@@ -40,6 +42,24 @@ module Annoy
     def seed: (Integer s) -> nil
   end
 
+  class AnnoyIndexAngularFloat32
+    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
@@ -58,6 +78,24 @@ module Annoy
     def seed: (Integer s) -> nil
   end
 
+  class AnnoyIndexDotProductFloat32
+    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
@@ -94,6 +132,24 @@ module Annoy
     def seed: (Integer s) -> nil
   end
 
+  class AnnoyIndexEuclideanFloat32
+    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
@@ -111,4 +167,22 @@ module Annoy
     def verbose: (bool flag) -> nil
     def seed: (Integer s) -> nil
   end
+
+  class AnnoyIndexManhattanFloat32
+    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,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: annoy-rb
 version: !ruby/object:Gem::Version
-  version: 0.4.0
+  version: 0.6.1
 platform: ruby
 authors:
 - yoshoku
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2021-08-06 00:00:00.000000000 Z
+date: 2022-05-22 00:00:00.000000000 Z
 dependencies: []
 description: Annoy.rb provides Ruby bindings for the Annoy (Approximate Nearest Neighbors
   Oh Yeah).
@@ -19,17 +19,9 @@ extensions:
 - ext/annoy/extconf.rb
 extra_rdoc_files: []
 files:
-- ".github/workflows/build.yml"
-- ".gitignore"
-- ".rspec"
 - CHANGELOG.md
-- CODE_OF_CONDUCT.md
-- Gemfile
 - LICENSE.txt
 - README.md
-- Rakefile
-- Steepfile
-- annoy-rb.gemspec
 - ext/annoy/annoyext.cpp
 - ext/annoy/annoyext.hpp
 - ext/annoy/extconf.rb
@@ -37,6 +29,7 @@ files:
 - ext/annoy/src/annoylib.h
 - ext/annoy/src/kissrandom.h
 - ext/annoy/src/mman.h
+- lib/annoy-rb.rb
 - lib/annoy.rb
 - lib/annoy/version.rb
 - sig/annoy.rbs
@@ -48,6 +41,7 @@ metadata:
   source_code_uri: https://github.com/yoshoku/annoy.rb
   changelog_uri: https://github.com/yoshoku/annoy.rb/blob/main/CHANGELOG.md
   documentation_uri: https://yoshoku.github.io/annoy.rb/doc/
+  rubygems_mfa_required: 'true'
 post_install_message:
 rdoc_options: []
 require_paths:
@@ -63,7 +57,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.2.22
+rubygems_version: 3.2.33
 signing_key:
 specification_version: 4
 summary: Ruby bindings for the Annoy (Approximate Nearest Neighbors Oh Yeah).

data/.github/workflows/build.yml

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

data/.gitignore

@@ -1,21 +0,0 @@
-/.bundle/
-/.yardoc
-/_yardoc/
-/coverage/
-/doc/
-/pkg/
-/spec/reports/
-/tmp/
-*.bundle
-*.so
-*.o
-*.a
-mkmf.log
-
-# rspec failure tracking
-.rspec_status
-
-*.swp
-*.dat
-tags
-.DS_Store

data/.rspec

@@ -1,3 +0,0 @@
---format documentation
---color
---require spec_helper

data/CODE_OF_CONDUCT.md

@@ -1,74 +0,0 @@
-# Contributor Covenant Code of Conduct
-
-## Our Pledge
-
-In the interest of fostering an open and welcoming environment, we as
-contributors and maintainers pledge to making participation in our project and
-our community a harassment-free experience for everyone, regardless of age, body
-size, disability, ethnicity, gender identity and expression, level of experience,
-nationality, personal appearance, race, religion, or sexual identity and
-orientation.
-
-## Our Standards
-
-Examples of behavior that contributes to creating a positive environment
-include:
-
-* Using welcoming and inclusive language
-* Being respectful of differing viewpoints and experiences
-* Gracefully accepting constructive criticism
-* Focusing on what is best for the community
-* Showing empathy towards other community members
-
-Examples of unacceptable behavior by participants include:
-
-* The use of sexualized language or imagery and unwelcome sexual attention or
-advances
-* Trolling, insulting/derogatory comments, and personal or political attacks
-* Public or private harassment
-* Publishing others' private information, such as a physical or electronic
-  address, without explicit permission
-* Other conduct which could reasonably be considered inappropriate in a
-  professional setting
-
-## Our Responsibilities
-
-Project maintainers are responsible for clarifying the standards of acceptable
-behavior and are expected to take appropriate and fair corrective action in
-response to any instances of unacceptable behavior.
-
-Project maintainers have the right and responsibility to remove, edit, or
-reject comments, commits, code, wiki edits, issues, and other contributions
-that are not aligned to this Code of Conduct, or to ban temporarily or
-permanently any contributor for other behaviors that they deem inappropriate,
-threatening, offensive, or harmful.
-
-## Scope
-
-This Code of Conduct applies both within project spaces and in public spaces
-when an individual is representing the project or its community. Examples of
-representing a project or community include using an official project e-mail
-address, posting via an official social media account, or acting as an appointed
-representative at an online or offline event. Representation of a project may be
-further defined and clarified by project maintainers.
-
-## Enforcement
-
-Instances of abusive, harassing, or otherwise unacceptable behavior may be
-reported by contacting the project team at yoshoku@outlook.com. All
-complaints will be reviewed and investigated and will result in a response that
-is deemed necessary and appropriate to the circumstances. The project team is
-obligated to maintain confidentiality with regard to the reporter of an incident.
-Further details of specific enforcement policies may be posted separately.
-
-Project maintainers who do not follow or enforce the Code of Conduct in good
-faith may face temporary or permanent repercussions as determined by other
-members of the project's leadership.
-
-## Attribution
-
-This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
-available at [https://contributor-covenant.org/version/1/4][version]
-
-[homepage]: https://contributor-covenant.org
-[version]: https://contributor-covenant.org/version/1/4/

data/Gemfile

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

data/Rakefile

@@ -1,15 +0,0 @@
-require 'bundler/gem_tasks'
-require 'rspec/core/rake_task'
-
-RSpec::Core::RakeTask.new(:spec)
-
-require 'rake/extensiontask'
-
-task :build => :compile
-
-Rake::ExtensionTask.new('annoyext') do |ext|
-  ext.ext_dir = 'ext/annoy'
-  ext.lib_dir = 'lib/annoy'
-end
-
-task :default => [:clobber, :compile, :spec]

data/Steepfile

@@ -1,20 +0,0 @@
-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

@@ -1,28 +0,0 @@
-require_relative 'lib/annoy/version'
-
-Gem::Specification.new do |spec|
-  spec.name          = 'annoy-rb'
-  spec.version       = Annoy::VERSION
-  spec.authors       = ['yoshoku']
-  spec.email         = ['yoshoku@outlook.com']
-
-  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/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.
-  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
-  spec.files = Dir.chdir(File.expand_path(__dir__)) do
-    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
-  end
-  spec.bindir        = 'exe'
-  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
-  spec.require_paths = ['lib']
-  spec.extensions    = ['ext/annoy/extconf.rb']
-end