I want to check if array has any elements that are instances of Array. I could make a recursive function and that iterates and finds all elements that are Array. Is there a shorter way to do this?
Get all elements that are of x type and manipulate them (i.e. modify or delete them)
It can be done this way:
array.any?{|e| e.is_a?(Array)}
array has any elements that are arrays, but will not check the sub arrays (and sub-sub arrays and so on) as the OP requested.
true) or no (false).Here is one possible solution,
You can use Ruby blocks to act on sub-arrays & nested sub-arrays recursively.
arr = [1, [2,3], [4,[5,6]]]
def act_on_array(arr, block)
arr.each do |i|
if i.is_a?(Array) then
block.yield(i)
act_on_array(i, block)
end
end
end
act_on_array(arr, lambda {|x| puts "I should act on #{x} as it is an array" })
Output of program
I should act on [2, 3] as it is an array
I should act on [4, [5, 6]] as it is an array
I should act on [5, 6] as it is an array
arr.flatten.size > arr.sizeworks, but @sawa's answer is more efficient and reads better.array.flatten == arraymay work.afromarreverything withinais gone, of course. Moreover, it would make no sense to start at the "bottom" and work up, because when you get to the "top" and deleted the elementaofarr, all your previous work would have been just a waste of time--those deletions would have occurred anyway had you just deletedain the first place.