Rubyを使用したハッシュ配列の再帰的（または通常の検索）検索

Question

私はこのフォーマットのハッシュの配列を持っており、深い要素のインデックスを検索したいと思います。

[{:users => [{:admins => [:address, :stage]}]}, :client]と私は（のような:stage）

def return_index(array، value) 
return "" #the index even as a string. "[0][:admins][1]". I can use eval to find the index 
end 

Answer 1

def return_path(arr, value, path=[]) 
    ndx = arr.index(value) 
    return path + [ndx] unless ndx.nil? 
    arr.each_with_index do |o,i| 
    next unless o.is_a?(Hash) 
    o.each do |k,v| 
     next unless v.is_a?(Array) 
     path = return_path(v, value, path+[i,k]) 
     return path unless path.nil? 
    end 
    end 
    nil 
end 

value = :stage 

arr = [{ :users=>[{ :admins=>[:address, :stage] }] }]  
return_path(arr, :stage) 
    #=> [0, :users, 0, :admins, 1] 

arr = [{ :users=>[{ :admins=>[:what, { :huh => [:stage, :address] }] }] }] 
return_path(arr, :stage) 
    #=> [0, :users, 0, :admins, 1, :huh, 0] 

arr = [{ :users=>[{ :admins=>[{ :huh => [:name, :address] }, :what ] }] }] 
return_path(arr, :stage) 
    #=> nil