archive/ruby
1
0
Fork 0
mirror of https://github.com/ruby/ruby.git synced 2025-08-15 13:39:04 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions 4

Add Enumerable#compact and Enumerator::Lazy#compact

Browse source
This commit is contained in:
zverok 2020-12-05 13:39:20 +02:00 • committed by Nobuyoshi Nakada
parent f690eb34e2
commit b8d33df1d9
Notes: git 2021-01-02 17:27:50 +09:00
4 changed files with 88 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

25
enumerator.c
View file

@ -2653,6 +2653,30 @@ lazy_uniq(VALUE obj)
return lazy_add_method(obj, 0, 0, Qnil, Qnil, funcs);
}
static struct MEMO *
lazy_compact_proc(VALUE proc_entry, struct MEMO *result, VALUE memos, long memo_index)
{
if (NIL_P(result->memo_value)) return 0;
return result;
}
static const lazyenum_funcs lazy_compact_funcs = {
lazy_compact_proc, 0,
};
/*
* call-seq:
* lazy.compact -> lazy_enumerator
*
* Like Enumerable#compact, but chains operation to be lazy-evaluated.
*/
static VALUE
lazy_compact(VALUE obj)
{
return lazy_add_method(obj, 0, 0, Qnil, Qnil, &lazy_compact_funcs);
}
static struct MEMO *
lazy_with_index_proc(VALUE proc_entry, struct MEMO* result, VALUE memos, long memo_index)
{
@ -4098,6 +4122,7 @@ InitVM_Enumerator(void)
rb_define_method(rb_cLazy, "slice_when", lazy_super, -1);
rb_define_method(rb_cLazy, "chunk_while", lazy_super, -1);
rb_define_method(rb_cLazy, "uniq", lazy_uniq, 0);
rb_define_method(rb_cLazy, "compact", lazy_compact, 0);
rb_define_method(rb_cLazy, "with_index", lazy_with_index, -1);
lazy_use_super_method = rb_hash_new_with_size(18);