what is quicker

[dsdsdsdsd]

hello;

I have a property list with a nested property list:

the_list = [ #prop_1 : [ #a_status:"good"],
                 #prop_2 : [ #a_status:"good"],
                -- with maybe 50  more #prop_n's with their respective sub-lists
              ]

I will search through the_list on every enterframe looking for any "bad" statuses:

repeat with i=1 to the_list.count()
  repeat with j=1 to the_list[i].count()
    if the_list[i][j].a_status = "bad" then
      -- do something
    end if
  end repeat
end repeat

OPTIONALLY I could have the_list as above BUT NOT search through it every enterframe and INSTEAD have a complimentary list, the_bad_status_list:

the_bad_status_list = ["prop_28" , "prop87" , "prop_NN"]

and search through this every enterframe;

any thoughts on the worthwhileness of the second approach;

thanks
dsdsdsdsd

 

[MentalFish]

The shorter your list is, the more speedy the search. Go for option 2.