I have a quick brain teaser. I have an array full of data broken down
into indivdual entries. I running a simple if statement to check for an
entry in the array, if my if statement finds that entry its prints out
that entry. I want to add an extra step into this so, when my if
statement finds an entry, I want it to look at the next entry and check
for something else, if it finds that, I want to look at the next entry
and check for something else, if it finds all of the three entries in a
row, it prints out “You have found what you want”
I have a quick brain teaser. I have an array full of data broken down
into indivdual entries. I running a simple if statement to check for an
entry in the array, if my if statement finds that entry its prints out
that entry. I want to add an extra step into this so, when my if
statement finds an entry, I want it to look at the next entry and check
for something else, if it finds that, I want to look at the next entry
and check for something else, if it finds all of the three entries in a
row, it prints out “You have found what you want”
Any ideas?
Not as pretty as each_cons, but:
def foo?(array, a, b, c)
i = array.index(a)
return false unless i
if (array[i+1] == b) and (array[i+2] == c)
puts “You have found what you want”
return true
end
false
end
p foo?([1,2,3,4,5,6], 3, 4, 5)
p foo?([1,2,3,4,5,6], 3, 4, 6)
and check for something else, if it finds all of the three entries
in a
row, it prints out “You have found what you want”
Any ideas?
It might be a case where Enumerable.each_cons will do what you want.
Not knowing the size of the data set, and not having benchmarked it,
this does seem to work:
#!/usr/bin/env ruby
def search_array(array, look_for)
array.each_cons(look_for.length) do |chunk|
if chunk == look_for
puts “You have found what you want”
return
end
end
puts “no luck…”
end
and check for something else, if it finds all of the three entries in a
row, it prints out “You have found what you want”
Any ideas?
Depends on the objects in the array, but you might try #join followed
by #include?.
That may have been a bit unfair (and wrong too, because you might have
nils in your array and temporarily destroys objects you don’t expect).
How about (doesn’t work if you have trailing nils in your search
array)…
#this is just preemptive room cleaning, important code is further below
m = my_array.dup.unshift(Object.new) #big array
g = good_array #stuff I want to look for
#take one off the beginning until I match what I’m looking for
m.shift until (m[0…2] == g || m.empty?)
puts “Great!” if !m.empty?
…which makes a lot of english sense to me. The my_array is #dup’ed
because #shift is destructive in pulling each thing from the
beginning. g is just there to be concise.
You can condense this, too, if you wanted. I don’t know if you need
the #unshift or not.
You can also take advantage of the fact that each_cons returns an
enumerator when called without a block:
def search_array(array, look_for)
if array.each_cons(look_for.length).include?(look_for)
puts “You have found what you want”
else
puts “no luck…”
end
end
(which may or may not be to everyone’s taste, but kind of interesting
that it can be done this way).
David
This forum is not affiliated to the Ruby language, Ruby on Rails framework, nor any Ruby applications discussed here.