annoy-rb 0.5.0 → 0.6.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: c8108550b7970bce06a297ee075182f286e451e902ade1254a1c095f05b53d2b
-  data.tar.gz: e35e6b247dfec3b21341339a56039ae63267c133ba53f4d6d3004f9acce90d67
+  metadata.gz: 1ae4f03fb87f0ea9ab0ff8ff13eb5c011cfd51931e5b4fc63c9a480560e9b102
+  data.tar.gz: 815d1f92d975ad932cc608a50a0bf983477d4fb3554aec5cd2978d904fe766b1
 SHA512:
-  metadata.gz: 60fc9c1c02215333eb63b8a6cc2c1228bf97da7da444ea5ba9b930f756ed5f4363f336b96332034d4f391f18e999dbb21c8e2df0dd6bb00a7491ea257d39a2ac
-  data.tar.gz: dd63d425a08a94a102e7731c040563a2f788e284b671babb0d9683275c9affcc2119eeb89968f699f642ad8203230e7b821b49ca88a03c9963be9ea66d95b893
+  metadata.gz: 2dd6f50030ac181a66633ea63c1e616ddb3b931227ce002d25b8ec5fb5b7d9094e6e0970bb9367bfe63004bce448bdb318658d17bc089d7af2978cdfdc33c776
+  data.tar.gz: f6c5995f2a7986e2c6dfba83bccf3a41b52e564dfce503c4def30395c3c19287422a93d1e62fd5a139e824bf2372910c415cb6cc66c22c41833153790f3bbc1f

data/CHANGELOG.md

@@ -1,3 +1,19 @@
+## 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.

data/README.md

@@ -50,6 +50,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 +70,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](http://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.
@@ -22,9 +22,14 @@ 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.
@@ -31,11 +31,11 @@
   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<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>;
 
 template<class T, typename F> class RbAnnoyIndex
 {
@@ -94,7 +94,7 @@ template<class T, typename F> class RbAnnoyIndex
     };
 
     static VALUE _annoy_index_add_item(VALUE self, VALUE _idx, VALUE arr) {
-      const int idx = NUM2INT(_idx);
+      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)) {
@@ -172,11 +172,11 @@ template<class T, typename F> class RbAnnoyIndex
     };
 
     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 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<int> neighbors;
+      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);
@@ -185,7 +185,7 @@ template<class T, typename F> class RbAnnoyIndex
       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_ary_store(neighbors_arr, i, INT2NUM((int)(neighbors[i])));
       }
 
       if (include_distances) {
@@ -224,7 +224,7 @@ template<class T, typename F> class RbAnnoyIndex
       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<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);
@@ -235,7 +235,7 @@ template<class T, typename F> class RbAnnoyIndex
       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_ary_store(neighbors_arr, i, INT2NUM((int)(neighbors[i])));
       }
 
       if (include_distances) {
@@ -254,7 +254,7 @@ template<class T, typename F> class RbAnnoyIndex
     };
 
     static VALUE _annoy_index_get_item(VALUE self, VALUE _idx) {
-      const int idx = NUM2INT(_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);
@@ -270,8 +270,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 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);
     };

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.5.0'
+  VERSION = '0.6.0'
 
   # The version of Annoy included with gem.
   ANNOY_VERSION = '1.17.0'

data/lib/annoy.rb

@@ -30,27 +30,35 @@ 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')
       raise ArgumentError, 'Expect n_features to be Integer.' unless n_features.is_a?(Numeric)
 
       @n_features = n_features.to_i
       @metric = metric
+      @dtype = dtype
 
       @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
@@ -69,6 +77,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.5.0
+  version: 0.6.0
 platform: ruby
 authors:
 - yoshoku
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2021-11-27 00:00:00.000000000 Z
+date: 2022-01-23 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
@@ -63,7 +55,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.2.32
+rubygems_version: 3.3.3
 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