Open tel opened 8 years ago
@bagl is knocking bits of this one out! Wonderful!
I've merged all my commits to future
branch in my fork. If it looks good I can make pull request from there so you don't need to deal with merge conflicts :)
Oh! I just went and landed some of those :/ My bad about that. I'm happy to incorporate those changes. Please let me know the best way to continue moving forward!
At this point, @bagl, I'm going to give you a commit bit. Don't feel like you need to go through me!
Functions available in
Data.IntMap.Strict
but not available herenull :: forall a . IntMap a -> Boolean
size :: forall a . IntMap a -> Int
member :: forall a . Int -> IntMap a -> Boolean
lookupDefault :: forall a . Int -> a -> IntMap a -> a
delete :: forall a . Int -> IntMap a -> IntMap a
adjust :: forall a . (a -> a) -> IntMap a -> IntMap a
adjustWithKey :: forall a . (Int -> a -> a) -> Int -> IntMap a -> IntMap a
update :: forall a . (a -> Maybe a) -> Int -> IntMap a -> IntMap a
updateWithKey :: forall a . (Int -> a -> Maybe a) -> Int -> IntMap a -> IntMap a
alter :: forall a . (Maybe a -> Maybe a) -> Int -> IntMap a -> IntMap a
difference :: forall a . IntMap a -> IntMap b -> IntMap a
a.k.a.(\\)
, but I don't really like that infixdifferenceWith :: forall a . (a -> b -> Maybe a) -> IntMap a -> IntMap b -> IntMap a
differenceWithKey :: forall a . (Int -> a -> b -> Maybe a) -> IntMap a -> IntMap b -> IntMap a
intersectLeft :: forall a b . IntMap a -> IntMap b -> IntMap a
intersectRight :: forall a b . IntMap a -> IntMap b -> IntMap b
intersectWith :: forall a b c . (a -> b -> c) -> IntMap a -> IntMap b -> IntMap c
intersectionWithKey :: forall a b c . (Int -> a -> b -> c) -> IntMap a -> IntMap b -> IntMap c
traverseWithKey :: forall a t b . Applicative t => (Int -> a -> t b) -> IntMap a -> t (IntMap b)
filter :: forall a. (a -> Boolean) -> IntMap a -> IntMap a
filterWithKey :: forall a. (Int -> a -> Boolean) -> IntMap a -> IntMap a
Many more as well, but this is a good start. Ha ha.