Add TraverseFilter instance for Set to alleycats

alleycats-core/src/main/scala/alleycats/std/all.scala

@@ -3,12 +3,16 @@ package std
 
 import export._
 
-@reexports(
-  EmptyKInstances,
-  ListInstances,
-  OptionInstances,
-  SetInstances,
-  TryInstances,
-  IterableInstances,
-  FutureInstances
-) object all extends LegacySetInstances with LegacyTryInstances with LegacyIterableInstances with MapInstances
+@reexports(EmptyKInstances,
+           ListInstances,
+           OptionInstances,
+           SetInstances,
+           TryInstances,
+           IterableInstances,
+           FutureInstances) object all
+    extends LegacySetInstances
+    with LegacySetInstancesBinCompat0
+    with LegacyTryInstances
+    with LegacyIterableInstances
+    with MapInstances
+    with MapInstancesBinCompat0

alleycats-core/src/main/scala/alleycats/std/map.scala

@@ -3,7 +3,7 @@ package std
 
 import cats._
 
-object map extends MapInstances
+object map extends MapInstances with MapInstancesBinCompat0
 
 trait MapInstances {
 
@@ -59,3 +59,21 @@ trait MapInstances {
         collectFirst(fa)(Function.unlift(f))
     }
 }
+
+trait MapInstancesBinCompat0 extends MapInstances {
+  implicit def mapTraverseFilter[K]: TraverseFilter[Map[K, ?]] =
+    new TraverseFilter[Map[K, ?]] {
+      def traverse: Traverse[Map[K, ?]] = alleycatsStdInstancesForMap
+
+      def traverseFilter[G[_], A, B](fa: Map[K, A])(f: A => G[Option[B]])(implicit G: Applicative[G]): G[Map[K, B]] = {
+        val gba: Eval[G[Map[K, B]]] = Always(G.pure(Map.empty))
+        Foldable
+          .iterateRight(fa, gba) { (kv, lbuf) =>
+            G.map2Eval(f(kv._2), lbuf)({ (ob, buf) =>
+              ob.fold(buf)(b => buf + (kv._1 -> b))
+            })
+          }
+          .value
+      }
+    }
+}

alleycats-core/src/main/scala/alleycats/std/set.scala

@@ -1,6 +1,6 @@
 package alleycats.std
 
-import cats.{Applicative, Eval, Foldable, Monad, Monoid, Traverse}
+import cats.{Applicative, Eval, Foldable, Monad, Monoid, Traverse, TraverseFilter}
 import export._
 
 import scala.annotation.tailrec
@@ -116,14 +116,32 @@ object SetInstances {
       override def collectFirstSome[A, B](fa: Set[A])(f: A => Option[B]): Option[B] =
         fa.collectFirst(Function.unlift(f))
     }
+
+  @export(Orphan)
+  implicit val setTraverseFilter: TraverseFilter[Set] =
+    new TraverseFilter[Set] {
+      val traverse: Traverse[Set] = setTraverse
+
+      def traverseFilter[G[_], A, B](fa: Set[A])(f: A => G[Option[B]])(implicit G: Applicative[G]): G[Set[B]] =
+        fa.foldLeft(G.pure(Set.empty[B])) { (gSet, a) =>
+          G.map2(f(a), gSet) {
+            case (Some(b), set) => set + b
+            case (None, set)    => set
+          }
+        }
+    }
 }
 
 @reexports(SetInstances)
-object set extends LegacySetInstances
+object set extends LegacySetInstances with LegacySetInstancesBinCompat0
 
 // TODO: remove when cats.{ Set, Traverse } support export-hook
 trait LegacySetInstances {
   implicit def legacySetMonad(implicit e: ExportOrphan[Monad[Set]]): Monad[Set] = e.instance
 
   implicit def legacySetTraverse(implicit e: ExportOrphan[Traverse[Set]]): Traverse[Set] = e.instance
 }
+
+trait LegacySetInstancesBinCompat0 {
+  implicit def legacySetTraverseFilter(implicit e: ExportOrphan[TraverseFilter[Set]]): TraverseFilter[Set] = e.instance
+}