Merge branch 'master' into binested

core/src/main/scala/cats/syntax/all.scala

@@ -60,6 +60,7 @@ trait AllSyntaxBinCompat0
     with TrySyntax
 
 trait AllSyntaxBinCompat1
-    extends FlatMapOptionSyntax
+  extends FlatMapOptionSyntax
     with NestedSyntax
     with BinestedSyntax
+    with ParallelFlatSyntax

core/src/main/scala/cats/syntax/parallel.scala

@@ -13,20 +13,37 @@ trait ParallelSyntax extends TupleParallelSyntax {
     new ParallelApOps[M, A](ma)
 }
 
+trait ParallelFlatSyntax {
+  implicit final def catsSyntaxParallelFlatTraverse[T[_]: Traverse: FlatMap, A]
+  (ta: T[A]): ParallelFlatTraversableOps[T, A] = new ParallelFlatTraversableOps[T, A](ta)
+
+  implicit final def catsSyntaxParallelFlatSequence[T[_]: Traverse: FlatMap, M[_]: Monad, A]
+  (tmta: T[M[T[A]]]): ParallelFlatSequenceOps[T, M, A] = new ParallelFlatSequenceOps[T, M, A](tmta)
+}
 
 final class ParallelTraversableOps[T[_], A](val ta: T[A]) extends AnyVal {
 
   def parTraverse[M[_]: Monad, F[_], B]
   (f: A => M[B])(implicit T: Traverse[T], P: Parallel[M, F]): M[T[B]] =
     Parallel.parTraverse(ta)(f)
+}
 
+final class ParallelFlatTraversableOps[T[_], A](val ta: T[A]) extends AnyVal {
+  def parFlatTraverse[M[_]: Monad, F[_], B]
+  (f: A => M[T[B]])(implicit T0: Traverse[T], T1 : FlatMap[T], P: Parallel[M, F]): M[T[B]] =
+    Parallel.parFlatTraverse(ta)(f)
 }
 
 final class ParallelSequenceOps[T[_], M[_], A](val tma: T[M[A]]) extends AnyVal {
   def parSequence[F[_]]
   (implicit M: Monad[M], T: Traverse[T], P: Parallel[M, F]): M[T[A]] =
     Parallel.parSequence(tma)
+}
 
+final class ParallelFlatSequenceOps[T[_], M[_], A](val tmta: T[M[T[A]]]) extends AnyVal {
+  def parFlatSequence[F[_]]
+  (implicit M: Monad[M], T0: Traverse[T], T1 : FlatMap[T], P: Parallel[M, F]): M[T[A]] =
+    Parallel.parFlatSequence(tmta)
 }
 
 final class ParallelApOps[M[_], A](val ma: M[A]) extends AnyVal {

docs/src/main/tut/resources_for_learners.md

@@ -10,7 +10,7 @@ position: 30
    specifically cover Cats, it is a great introduction to functional
    programming in Scala in general and covers some of the abstractions
    that can be found in Cats.
- * [Advanced Scala with Cats](http://underscore.io/books/advanced-scala/) 
+ * [Scala with Cats](https://underscore.io/books/scala-with-cats/) 
    by Noel Welsh and Dave Gurnell - The aims of this book are two-fold: 
    to introduce monads, functors, and other functional programming patterns
    as a way to structure program design, and to explain how these 

tests/src/test/scala/cats/tests/ParallelSuite.scala

@@ -79,6 +79,20 @@ class ParallelSuite extends CatsSuite with ApplicativeErrorForEitherTest {
     }
   }
 
+  test("ParFlatSequence syntax should be equivalent to Parallel.parFlatSequence") {
+    forAll { es: List[Either[String, List[Int]]] =>
+      es.parFlatSequence should === (Parallel.parFlatSequence(es))
+    }
+  }
+
+  test("ParFlatTraverse syntax should be equivalent to Parallel.parFlatTraverse") {
+    forAll { es: List[Either[String, Int]] =>
+      val f: Int => List[Int] = i => List(i, i + 1)
+      Parallel.parFlatTraverse(es)(e => e.map(f)) should
+        === (es.parFlatTraverse(e => e.map(f)))
+    }
+  }
+
   test("ParNonEmptyFlatTraverse should be equivalent to parNonEmptyTraverse map flatten") {
     forAll { es: NonEmptyList[Either[String, Int]] =>
       val f: Int => NonEmptyList[Int] = i => NonEmptyList.of(i, i + 1)

tests/src/test/scala/cats/tests/SyntaxSuite.scala

@@ -179,6 +179,15 @@ object SyntaxSuite extends AllSyntaxBinCompat with AllInstances with AllSyntax {
     val ma2: M[A] = ma <& mb
   }
 
+  def testParallelFlat[M[_]: Monad, F[_], T[_]: Traverse: FlatMap, A, B](implicit P: Parallel[M, F]): Unit = {
+    val ta = mock[T[A]]
+    val f = mock[A => M[T[B]]]
+    val mtb = ta.parFlatTraverse(f)
+
+    val tmta = mock[T[M[T[A]]]]
+    val mta = tmta.parFlatSequence
+  }
+
   def testParallelTuple[M[_]: Monad, F[_], A, B, C, Z](implicit P: NonEmptyParallel[M, F]) = {
     val tfabc = mock[(M[A], M[B], M[C])]
     val fa = mock[M[A]]