neighbor-redis 0.1.0 → 0.1.1

Sign up to get free protection for your applications and to get access to all the features.
checksums.yaml CHANGED
@@ -1,7 +1,7 @@
1
1
  ---
2
2
  SHA256:
3
- metadata.gz: ca86068ccb3e4538661582c5cf25f58b522569ff2abc6fb69cb6c69f3171141e
4
- data.tar.gz: 455e7ce9a5c112b3ffb2e6f5004f4cc0598033b1b1ca409fdec7fdecdd936c86
3
+ metadata.gz: c1fc12e25414612134669a093f5779ac423c6ae58142e0da97c13261ab3e4098
4
+ data.tar.gz: e87cd80191c85449b5c790fe7d0e2e341b35e4bf2d1fc3bcd1e73ef63731c4b5
5
5
  SHA512:
6
- metadata.gz: 4ff369d81326391017aa7c8c98966d44200856f7fb7be32caa8dd773f55ab01a15674ed5bb2a58aa8bf8163604d26895516fcd4c29332caf5354dc101d5d7f54
7
- data.tar.gz: 5d00a85e5265d01617299daa1b0ce5a3e67f4d570c6a512eee5bc6b4023d5dedfc93a8e8583689a54fbb1cafae8401cb76acc35242b6d215cd1883aa34add26f
6
+ metadata.gz: 3864a125393a417385cfae7fd1a182468afec3778a782cdf3f8d1d1159bd8f0d5ac8f084aa6a783c51cf446f4be1fe6c57752d3da41e541ab4bcdf7585e9e9cd
7
+ data.tar.gz: b7093b40c2fc2b23dfbb9c58fe6905cbfb6e5084128b54c84ebbef9e20a2afda3494e70a127915cc5d715f741744ae33ae6880702fcee9714dd21b8d6f41ff4b
data/CHANGELOG.md CHANGED
@@ -1,3 +1,7 @@
1
+ ## 0.1.1 (2023-10-02)
2
+
3
+ - Added support for RediSearch 2.8
4
+
1
5
  ## 0.1.0 (2023-02-21)
2
6
 
3
7
  - First release
data/README.md CHANGED
@@ -9,7 +9,7 @@ Nearest neighbor search for Ruby and Redis
9
9
  First, [install RediSearch](https://redis.io/docs/stack/search/quick_start/). With Docker, use:
10
10
 
11
11
  ```sh
12
- docker run -p 6379:6379 redis/redis-stack-server:latest
12
+ docker run -p 6379:6379 redis/redis-stack-server
13
13
  ```
14
14
 
15
15
  Add this line to your application’s Gemfile:
@@ -41,7 +41,7 @@ index.add(2, [2, 2, 2])
41
41
  index.add(3, [1, 1, 2])
42
42
  ```
43
43
 
44
- Note: IDs are stored and returned as strings (uses less total storage)
44
+ Note: IDs are stored and returned as strings (uses less total memory)
45
45
 
46
46
  Get the nearest neighbors to an item
47
47
 
@@ -118,6 +118,12 @@ Add multiple items
118
118
  index.add_all(ids, embeddings)
119
119
  ```
120
120
 
121
+ Get an item
122
+
123
+ ```ruby
124
+ index.find(id)
125
+ ```
126
+
121
127
  Remove an item
122
128
 
123
129
  ```ruby
@@ -70,7 +70,7 @@ module Neighbor
70
70
  # fix for invalid value for Float(): "-nan"
71
71
  true
72
72
  rescue => e
73
- raise unless e.message.include?("Unknown Index name")
73
+ raise unless e.message.downcase.include?("unknown index name")
74
74
  false
75
75
  end
76
76
 
@@ -167,31 +167,51 @@ module Neighbor
167
167
 
168
168
  def search_by_blob(blob, count)
169
169
  resp = redis.call("FT.SEARCH", @index_name, "*=>[KNN #{count.to_i} @v $BLOB]", "PARAMS", "2", "BLOB", blob, "SORTBY", "__v_score", "DIALECT", "2")
170
- len = resp.shift
170
+ resp.is_a?(Hash) ? parse_results_hash(resp) : parse_results_array(resp)
171
+ end
172
+
173
+ def parse_results_hash(resp)
174
+ prefix_length = nil
175
+ resp["results"].map do |result|
176
+ key = result["id"]
177
+ info = result["extra_attributes"]
178
+ prefix_length ||= find_prefix_length(key)
179
+ search_result(key, info, prefix_length)
180
+ end
181
+ end
182
+
183
+ def parse_results_array(resp)
171
184
  prefix_length = nil
172
- len.times.map do |i|
185
+ resp.shift.times.map do |i|
173
186
  key, info = resp.shift(2)
174
187
  info = info.each_slice(2).to_h
175
- score = info["__v_score"].to_f
176
- distance =
177
- case @distance_metric
178
- when "L2"
179
- Math.sqrt(score)
180
- when "IP"
181
- (score * -1) + 1
182
- else
183
- score
184
- end
185
-
186
188
  prefix_length ||= find_prefix_length(key)
189
+ search_result(key, info, prefix_length)
190
+ end
191
+ end
187
192
 
188
- {
189
- id: key[prefix_length..-1],
190
- distance: distance
191
- }
193
+ def search_result(key, info, prefix_length)
194
+ score = info["__v_score"].to_f
195
+ distance = calculate_distance(score)
196
+
197
+ {
198
+ id: key[prefix_length..-1],
199
+ distance: distance
200
+ }
201
+ end
202
+
203
+ def calculate_distance(score)
204
+ case @distance_metric
205
+ when "L2"
206
+ Math.sqrt(score)
207
+ when "IP"
208
+ (score * -1) + 1
209
+ else
210
+ score
192
211
  end
193
212
  end
194
213
 
214
+ # can't just remove @prefix since may be an alias
195
215
  def find_prefix_length(key)
196
216
  key[@global_prefix.length..-1].index(":") + @global_prefix.length + 1
197
217
  end
@@ -1,5 +1,5 @@
1
1
  module Neighbor
2
2
  module Redis
3
- VERSION = "0.1.0"
3
+ VERSION = "0.1.1"
4
4
  end
5
5
  end
metadata CHANGED
@@ -1,14 +1,14 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: neighbor-redis
3
3
  version: !ruby/object:Gem::Version
4
- version: 0.1.0
4
+ version: 0.1.1
5
5
  platform: ruby
6
6
  authors:
7
7
  - Andrew Kane
8
8
  autorequire:
9
9
  bindir: bin
10
10
  cert_chain: []
11
- date: 2023-02-21 00:00:00.000000000 Z
11
+ date: 2023-10-02 00:00:00.000000000 Z
12
12
  dependencies:
13
13
  - !ruby/object:Gem::Dependency
14
14
  name: redis-client
@@ -58,7 +58,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
58
58
  - !ruby/object:Gem::Version
59
59
  version: '0'
60
60
  requirements: []
61
- rubygems_version: 3.4.6
61
+ rubygems_version: 3.4.10
62
62
  signing_key:
63
63
  specification_version: 4
64
64
  summary: Nearest neighbor search for Ruby and Redis