Hi, Guido.<br><br><div class="gmail_quote">On Wed, May 19, 2010 at 12:11 AM, Guido van Rossum <span dir="ltr">&lt;<a href="mailto:guido@python.org">guido@python.org</a>&gt;</span> wrote:<br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
This is typically called a &quot;bag&quot;. Maybe searching for that will help<br>
you find a recipe?<br></blockquote><div><br>A bag/multiset is close to what I need, except for one thing: I need to iterate over the elements in the original order, not in a random order.<br><br>The data structure I&#39;m proposing is basically a list/tuple, and the only thing that changes is comparison with another unordered list/tuple: If they both have the same elements with the same multiplicity, they are equivalent (regardless of the order).<br>
<br>Cheers,<br><br> - Gustavo.<br></div></div>