Sha256: ee04ec9f582017dcdadbd7739663640d55f4781743217032b2b65e0008eb60e2
Contents?: true
Size: 1.51 KB
Versions: 12
Compression:
Stored size: 1.51 KB
Contents
o:$YARD::CodeObjects::MethodObject:
@name:&:@docstringIC:YARD::Docstring"˜Set Intersection---Returns a new array
containing elements common to the two arrays, with no duplicates.
[ 1, 1, 3, 5 ] & [ 1, 2, 3 ] #=> [ 1, 3 ]
: @objectu:YARD::StubProxy Array#&:
@summary0: @all"³Set Intersection---Returns a new array
containing elements common to the two arrays, with no duplicates.
[ 1, 1, 3, 5 ] & [ 1, 2, 3 ] #=> [ 1, 3 ]
@overload &(other_array):@ref_tags[ :
@tags[o: YARD::Tags::OverloadTag
;
u; Array#&;;;IC; "
;
u; Array#&; 0;
" ;[ ;[ : @types0:@parameters[[:other_array0:
@text0:@signature"&(other_array):@tag_name"
overload: @current_file_has_commentsF: @scope:
instance;[ :@docstring_extra0: @files[[" array.c0:@namespaceu;
Array:
@path" Array#&;[ :@visibility: public: @source"³/*
* call-seq:
* array & other_array
*
* Set Intersection---Returns a new array
* containing elements common to the two arrays, with no duplicates.
*
* [ 1, 1, 3, 5 ] & [ 1, 2, 3 ] #=> [ 1, 3 ]
*/
static VALUE
rb_ary_and(ary1, ary2)
VALUE ary1, ary2;
{
VALUE hash, ary3, v, vv;
long i;
ary2 = to_ary(ary2);
ary3 = rb_ary_new2(RARRAY(ary1)->len < RARRAY(ary2)->len ?
RARRAY(ary1)->len : RARRAY(ary2)->len);
hash = ary_make_hash(ary2, 0);
for (i=0; i<RARRAY(ary1)->len; i++) {
v = vv = rb_ary_elt(ary1, i);
if (st_delete(RHASH(hash)->tbl, (st_data_t*)&vv, 0)) {
rb_ary_push(ary3, v);
}
}
return ary3;
}:@source_type:c
Version data entries
12 entries across 12 versions & 2 rubygems