title: Returning empty iterator in C++ hash table code
body: <p>I'm following some handwritten notes on the implementation of a hash table with separate chaining. In particular I'm looking to this function:</p>
  
  <pre><code>list&lt;ListCell&gt;::iterator TablaHash::FoundOnList(int key, int table_row){
      for(list&lt;ListCell&gt;::iterator found= table[table_row].begin(); 
              found != table[table_row].end();found++){
          if((*found).Key() == key){
              return found;
          }
      }
      return Ø;
  }
  </code></pre>
  
  <p>where the last symbol is the empty set. I understand I should return an "empty" iterator there but what should I do? Maybe return the end() iterator?</p>