[#62297] Re: [ruby-cvs:52906] nari:r45760 (trunk): * gc.c (gc_after_sweep): suppress unnecessary expanding heap. — Eric Wong <normalperson@...>
nari@ruby-lang.org wrote:
7 messages
2014/05/02
[#62307] Re: [ruby-cvs:52906] nari:r45760 (trunk): * gc.c (gc_after_sweep): suppress unnecessary expanding heap.
— SASADA Koichi <ko1@...>
2014/05/03
(2014/05/03 4:41), Eric Wong wrote:
[#62402] Re: [ruby-cvs:52906] nari:r45760 (trunk): * gc.c (gc_after_sweep): suppress unnecessary expanding heap.
— Eric Wong <normalperson@...>
2014/05/05
SASADA Koichi <ko1@atdot.net> wrote:
[#62523] [ruby-trunk - Feature #9632] [PATCH 0/2] speedup IO#close with linked-list from ccan — ko1@...
Issue #9632 has been updated by Koichi Sasada.
3 messages
2014/05/11
[#62556] doxygen (Re: Re: [ruby-trunk - Feature #9632] [PATCH 0/2] speedup IO#close with linked-list from ccan) — Tanaka Akira <akr@...>
2014-05-11 8:50 GMT+09:00 Eric Wong <normalperson@yhbt.net>:
3 messages
2014/05/13
[#62727] [RFC] vm_method.c (rb_method_entry_make): avoid freed me in m_tbl — Eric Wong <normalperson@...>
rb_unlink_method_entry may cause old_me to be swept before the new
7 messages
2014/05/24
[#63039] Re: [RFC] vm_method.c (rb_method_entry_make): avoid freed me in m_tbl
— SASADA Koichi <ko1@...>
2014/06/10
Hi,
[#63077] Re: [RFC] vm_method.c (rb_method_entry_make): avoid freed me in m_tbl
— Eric Wong <normalperson@...>
2014/06/10
SASADA Koichi <ko1@atdot.net> wrote:
[#63086] Re: [RFC] vm_method.c (rb_method_entry_make): avoid freed me in m_tbl
— SASADA Koichi <ko1@...>
2014/06/11
(2014/06/11 4:47), Eric Wong wrote:
[#63087] Re: [RFC] vm_method.c (rb_method_entry_make): avoid freed me in m_tbl
— Eric Wong <normalperson@...>
2014/06/11
SASADA Koichi <ko1@atdot.net> wrote:
[#62862] [RFC] README.EXT: document rb_gc_register_mark_object — Eric Wong <normalperson@...>
Any comment on officially supporting this as part of the C API?
5 messages
2014/05/30
[ruby-core:62424] [ruby-trunk - Feature #9808] [Feedback] Enumerable#argmin_by, #argmax_by
From:
nobu@...
Date:
2014-05-06 14:40:35 UTC
List:
ruby-core #62424
Issue #9808 has been updated by Nobuyoshi Nakada.
Description updated
Status changed from Open to Feedback
Could you explain what it does?
----------------------------------------
Feature #9808: Enumerable#argmin_by, #argmax_by
https://bugs.ruby-lang.org/issues/9808#change-46573
* Author: Ilya Vorontsov
* Status: Feedback
* Priority: Normal
* Assignee:
* Category:
* Target version:
----------------------------------------
What about introducing `Enumerable` `#argmin_by` (and `#argmax_by` too, of course) method?
Use cases are wide from mathematical problems to a general tasks. Here are two very simple examples:
~~~ruby
(1..2).step(0.01).argmin_by{|x| Math.sin(x)*x}
queues = [[],[],[],[]]
# ...
least_busy_queue = queues.argmin_by{|queue| queues.size }
least_busy_queue << new_task
~~~
For cases when `#argmin_by` isn't enough because one need to obtain index of minimal element I suggest `#index_min_by` method which returns index of element for which block yields minimal value. It prevents user from using ineffective but straight two-pass algorithm like `arr.index(arr.min)`:
~~~ruby
# guess the number game
hidden_number = rand(100)
player_answers = 5.times.map{ gets.to_i }
best_player = player_answers.index_min_by{|answer| (answer-hidden_number).abs}
~~~
--
https://bugs.ruby-lang.org/