Proposal: containers: add indexing operations for Set

Edward Kmett ekmett at gmail.com
Wed Jul 4 02:12:48 CEST 2012


+1

On Tue, Jul 3, 2012 at 3:10 PM, Patrick Palka <patrick at parcs.ath.cx> wrote:

> I'd like to add the following indexing operations for Data.Set.Set, to
> complement the existing functions for Data.Map.Map:
>
> findIndex :: Ord a => a -> Set a -> Int
> lookupIndex :: Ord a => a -> Set a -> Maybe Int
> elemAt :: Int -> Set a -> a
> deleteAt :: Int -> Set a -> Set a
>
> A tentative patch can be found here https://github.com/haskell/**
> containers/pull/13 <https://github.com/haskell/containers/pull/13>
>
> Discussion period: 2 weeks
>
> ______________________________**_________________
> Libraries mailing list
> Libraries at haskell.org
> http://www.haskell.org/**mailman/listinfo/libraries<http://www.haskell.org/mailman/listinfo/libraries>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/libraries/attachments/20120703/c4cd010f/attachment.htm>


More information about the Libraries mailing list