title: python lowest cost of checking various equalities at once
body: <p>I start with a list full of <code>False</code> elements.<br>
  Then those elements are switched to <code>True</code> independently over the course of iterations.<br>
  I need to know when the list is fully True.  </p>
  
  <p>Let's say I have 3 elements, they start as</p>
  
  <pre><code>[False, False, False]
  </code></pre>
  
  <p>then I check them over the iterations like:</p>
  
  <pre><code>elements == [True, True, True]
  </code></pre>
  
  <p>The list of elements is fixed and should not grow (or shrink). You can think of these elements as switches, the input determines how many there are and they start all switched off. The only thing that can happen over time is that individual switches are turned on (True) by events happening in the iteration.</p>
  
  <p>How does python do the checking and what is the cost?<br>
  What is the best way in terms of cost to check that?<br>
  Is there a way with bit operations or anything that checks all the elements at once?</p>