Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.lang.ruby > #4556

Re: search nearest to elements in array (hash)

Path csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!aioe.org!feeder.news-service.com!de-l.enfer-du-nord.net!feeder2.enfer-du-nord.net!talisker.lacave.net!lacave.net!not-for-mail
From "Mateus .." <excanoe@gmail.com>
Newsgroups comp.lang.ruby
Subject Re: search nearest to elements in array (hash)
Date Sun, 15 May 2011 01:33:07 -0500
Organization Service de news de lacave.net
Lines 20
Message-ID <17dea7387ae93c70e11b2f0e5d3c914b@ruby-forum.com> (permalink)
References <86667b5fe1841c16852cd7c86dc82656@ruby-forum.com>
NNTP-Posting-Host bristol.highgroove.com
Content-Type text/plain; charset=UTF-8
Content-Transfer-Encoding 7bit
X-Trace talisker.lacave.net 1305441211 344 65.111.164.187 (15 May 2011 06:33:31 GMT)
X-Complaints-To abuse@lacave.net
NNTP-Posting-Date Sun, 15 May 2011 06:33:31 +0000 (UTC)
In-Reply-To <86667b5fe1841c16852cd7c86dc82656@ruby-forum.com>
X-Received-From This message has been automatically forwarded from the ruby-talk mailing list by a gateway at comp.lang.ruby. If it is SPAM, it did not originate at comp.lang.ruby. Please report the original sender, and not us. Thanks! For more details about this gateway, please visit: http://blog.grayproductions.net/categories/the_gateway
X-Mail-Count 383268
X-Ml-Name ruby-talk
X-Rubymirror Yes
X-Ruby-Talk <17dea7387ae93c70e11b2f0e5d3c914b@ruby-forum.com>
Xref x330-a1.tempe.blueboxinc.net comp.lang.ruby:4556

Show key headers only | View raw


thank you guys!
i really appreciate this.

i'm sorry if my question wasn't understandable. main reason for this 
purpose is consistent hashing, where we need to find for example next 
bigger key in array comparing to the "needle".

i haven't tested yet your solutions but i will.
hope this topic helps for someone in future.

i'm also googled and find this:

https://github.com/superfeedr/consistent_hashr/blob/master/lib/consistent_hashr.rb

but i'm not sure that this is efficient way of doing things if we have 
for example 10k elements in array.

-- 
Posted via http://www.ruby-forum.com/.

Back to comp.lang.ruby | Previous | NextPrevious in thread | Find similar | Unroll thread


Thread

search nearest to elements in array (hash) "Mateus .." <excanoe@gmail.com> - 2011-05-14 16:05 -0500
  Re: search nearest to elements in array (hash) serialhex <serialhex@gmail.com> - 2011-05-14 16:21 -0500
  Re: search nearest to elements in array (hash) 7stud -- <bbxx789_05ss@yahoo.com> - 2011-05-14 16:28 -0500
    Re: search nearest to elements in array (hash) Martin DeMello <martindemello@gmail.com> - 2011-05-14 16:33 -0500
    Re: search nearest to elements in array (hash) 7stud -- <bbxx789_05ss@yahoo.com> - 2011-05-14 16:36 -0500
  Re: search nearest to elements in array (hash) Martin DeMello <martindemello@gmail.com> - 2011-05-14 16:30 -0500
  Re: search nearest to elements in array (hash) "Mateus .." <excanoe@gmail.com> - 2011-05-15 01:33 -0500

csiph-web