Pfthb

I have this structure

x = [8349310431, 8349314513]
y = [667984788, 667987788]
z = [148507632380, 153294624079]

map = Hash[x.zip([y, z].transpose).sort]
#=> 
# 8349310431=>[667984788, 148507632380],
# 8349314533=>[667987788, 153294624079]
# 

and I need to compare, the keys with the rest of the keys, but if the subtraction of the keys is less than 100, you have to compare the first elements to which the key points and if this subtraction of elements is less than 100 the procedure is repeated with the second element that the key points to

example

 key[0] - key[1] = 8349310431−8349314533 = 4102 (with value absolute)

so now we subtract the first elements that the key points to, because it is greater than 100 the subtraction

element1Key1 - element1Key2 = 667984788 - 667987788 = 3000 (with value absolute)

as the subtraction is greater than 100 we repeat this with the second elements

 element2Key1 - element2Key2 = 15329460 - 15329462 = 2 (with value absolute)

as it is less than 100 we stop here and keep this in a counter can be

if the subtraction is less than 100 since the operation with the keys, it can not be stopped there, it is necessary to do it until the second element to which the key points.

but how do I do it

Sorry for my English, but I don't speak it, I hope you understand, and thanks

Does this make sense?

x = [8349310431, 8349314513]
y = [667984788, 667987788]
z = [15329460, 15329462]

[x, y, z].detect # => [15329460, 15329462]

Just in case, why build a hash?