Method: Array#zip

Defined in:

array.c

#zip(arg, ...) ⇒ Array #zip(arg, ...) {|arr| ... } ⇒ nil

Converts any arguments to arrays, then merges elements of self with corresponding elements from each argument.

This generates a sequence of ary.size n-element arrays, where n is one more than the count of arguments.

If the size of any argument is less than the size of the initial array, nil values are supplied.

If a block is given, it is invoked for each output array, otherwise an array of arrays is returned.

a = [ 4, 5, 6 ]
b = [ 7, 8, 9 ]
[1, 2, 3].zip(a, b)   #=> [[1, 4, 7], [2, 5, 8], [3, 6, 9]]
[1, 2].zip(a, b)      #=> [[1, 4, 7], [2, 5, 8]]
a.zip([1, 2], [8])    #=> [[4, 1, 8], [5, 2, nil], [6, nil, nil]]

Overloads:

• #zip(arg, ...) ⇒ Array

  Returns:

  • (Array)
• #zip(arg, ...) {|arr| ... } ⇒ nil

  Yields:

  • (arr)

  Returns:

  • (nil)

# File 'array.c', line 3222

static VALUE
rb_ary_zip(int argc, VALUE *argv, VALUE ary)
{
    int i, j;
    long len = RARRAY_LEN(ary);
    VALUE result = Qnil;

    for (i=0; i<argc; i++) {
  argv[i] = take_items(argv[i], len);
    }

    if (rb_block_given_p()) {
  int arity = rb_block_arity();

  if (arity > 1 && argc+1 < 0x100) {
      VALUE *tmp = ALLOCA_N(VALUE, argc+1);

      for (i=0; i<RARRAY_LEN(ary); i++) {
    tmp[0] = RARRAY_AREF(ary, i);
    for (j=0; j<argc; j++) {
        tmp[j+1] = rb_ary_elt(argv[j], i);
    }
    rb_yield_values2(argc+1, tmp);
      }
  }
  else {
      for (i=0; i<RARRAY_LEN(ary); i++) {
    VALUE tmp = rb_ary_new2(argc+1);

    rb_ary_push(tmp, RARRAY_AREF(ary, i));
    for (j=0; j<argc; j++) {
        rb_ary_push(tmp, rb_ary_elt(argv[j], i));
    }
    rb_yield(tmp);
      }
  }
    }
    else {
  result = rb_ary_new_capa(len);

  for (i=0; i<len; i++) {
      VALUE tmp = rb_ary_new_capa(argc+1);

      rb_ary_push(tmp, RARRAY_AREF(ary, i));
      for (j=0; j<argc; j++) {
    rb_ary_push(tmp, rb_ary_elt(argv[j], i));
      }
      rb_ary_push(result, tmp);
  }
    }

    return result;
}