+1<br><br><div class="gmail_quote">On Tue, Jul 3, 2012 at 3:10 PM, Patrick Palka <span dir="ltr"><<a href="mailto:patrick@parcs.ath.cx" target="_blank">patrick@parcs.ath.cx</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
I'd like to add the following indexing operations for Data.Set.Set, to complement the existing functions for Data.Map.Map:<br>
<br>
findIndex :: Ord a => a -> Set a -> Int<br>
lookupIndex :: Ord a => a -> Set a -> Maybe Int<br>
elemAt :: Int -> Set a -> a<br>
deleteAt :: Int -> Set a -> Set a<br>
<br>
A tentative patch can be found here <a href="https://github.com/haskell/containers/pull/13" target="_blank">https://github.com/haskell/<u></u>containers/pull/13</a><br>
<br>
Discussion period: 2 weeks<br>
<br>
______________________________<u></u>_________________<br>
Libraries mailing list<br>
<a href="mailto:Libraries@haskell.org" target="_blank">Libraries@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/libraries" target="_blank">http://www.haskell.org/<u></u>mailman/listinfo/libraries</a><br>
</blockquote></div><br>