Cleaning up docs to no longer use fine grained imports (#2664)

* Cleaning up docs to no longer use fine grained imports

* Getting imports in /datatypes

docs/src/main/tut/datatypes/either.md

@@ -69,7 +69,7 @@ in the standard library. Since Cats builds on 2.10.x and 2.11.x, the gaps have b
 enrichments available under `cats.syntax.either._` or `cats.implicits._`.
 
 ```tut:book
-import cats.syntax.either._
+import cats.implicits._
 
 val right: Either[String, Int] = Right(5)
 right.map(_ + 1)

docs/src/main/tut/datatypes/ior.md

@@ -33,7 +33,7 @@ val both = Ior.both("Warning", 3)
 Cats also offers syntax enrichment for `Ior`. The `leftIor` and `rightIor` functions can be imported from `cats.syntax.ior._`:
 
 ```tut
-import cats.syntax.ior._
+import cats.implicits._
 
 val right = 3.rightIor
 

docs/src/main/tut/datatypes/nested.md

@@ -29,8 +29,7 @@ x.map(_.map(_.toString))
 
 ```tut:silent
 import cats.data.Nested
-import cats.instances.option._
-import cats.syntax.functor._
+import cats.implicits._
 val nested: Nested[Option, Validated[String, ?], Int] = Nested(Some(Valid(123)))
 ```
 
@@ -88,10 +87,7 @@ import scala.concurrent.ExecutionContext.Implicits.global
 import scala.concurrent.duration._
 import cats.Applicative
 import cats.data.Nested
-import cats.instances.either._
-import cats.instances.future._
-import cats.instances.list._
-import cats.syntax.traverse._
+import cats.implicits._
 
 def createUsers(userInfos: List[UserInfo]): Future[Either[List[String], List[User]]] =
   userInfos.traverse(userInfo => Nested(createUser(userInfo))).value

docs/src/main/tut/datatypes/validated.md

@@ -77,7 +77,7 @@ case object AgeIsInvalid extends DomainValidation {
 We have our `RegistrationData` case class that will hold the information the user has submitted, alongside the definition of the error model that we'll be using for displaying the possible errors of every field. Now, let's explore the proposed implementation:
 
 ```tut:silent
-import cats.syntax.either._
+import cats.implicits._
 
 sealed trait FormValidator {
  def validateUserName(userName: String): Either[DomainValidation, String] =
@@ -627,7 +627,7 @@ val houseNumber = config.parse[Int]("house_number").andThen{ n =>
 The `withEither` method allows you to temporarily turn a `Validated` instance into an `Either` instance and apply it to a function.
 
 ```tut:silent
-import cats.syntax.either._ // get Either#flatMap
+import cats.implicits._ // get Either#flatMap
 
 def positive(field: String, i: Int): Either[ConfigError, Int] = {
   if (i >= 0) Right(i)

docs/src/main/tut/typeclasses/applicative.md

@@ -87,7 +87,7 @@ def product3[F[_]: Applicative, A, B, C](fa: F[A], fb: F[B], fc: F[C]): F[(A, B,
 Let's see what happens if we try to compose two effectful values with just `map`.
 
 ```tut:book:silent
-import cats.instances.option._
+import cats.implicits._
 
 val f: (Int, Char) => Double = (i, c) => (i + c).toDouble
 
@@ -109,7 +109,7 @@ does `F[G[_]]`.
 
 ```tut:book:silent
 import cats.data.Nested
-import cats.instances.future._
+import cats.implicits._
 import scala.concurrent.Future
 import scala.concurrent.ExecutionContext.Implicits.global
 
@@ -181,7 +181,7 @@ This works...but if we look carefully at the implementation there's nothing `Opt
 another example let's implement the same function but for `Either`.
 
 ```tut:book:silent
-import cats.instances.either._
+import cats.implicits._
 
 def traverseEither[E, A, B](as: List[A])(f: A => Either[E, B]): Either[E, List[B]] =
   as.foldRight(Right(List.empty[B]): Either[E, List[B]]) { (a: A, acc: Either[E, List[B]]) =>
@@ -212,8 +212,7 @@ This function is provided by Cats via the `Traverse[List]` instance and syntax,
 tutorial.
 
 ```tut:book:silent
-import cats.instances.list._
-import cats.syntax.traverse._
+import cats.implicits
 ```
 
 ```tut:book

docs/src/main/tut/typeclasses/functor.md

@@ -66,8 +66,7 @@ Such composition can be achieved via the `Functor#compose` method.
 
 ```tut:reset:book:silent
 import cats.Functor
-import cats.instances.list._
-import cats.instances.option._
+import cats.implicits._
 ```
 
 ```tut:book
@@ -96,7 +95,7 @@ We can make this nicer at the cost of boxing with the `Nested` data type.
 
 ```tut:book:silent
 import cats.data.Nested
-import cats.syntax.functor._
+import cats.implicits._
 ```
 
 ```tut:book

docs/src/main/tut/typeclasses/monoid.md

@@ -58,7 +58,7 @@ def combineAll[A: Monoid](as: List[A]): A =
 which can be used for any type that has a `Monoid` instance.
 
 ```tut:book:silent
-import cats.instances.all._
+import cats.implicits._
 ```
 
 ```tut:book
@@ -100,7 +100,7 @@ How then can we collapse a `List[NonEmptyList[A]]` ? For such types that only ha
 lift into `Option` to get a `Monoid`.
 
 ```tut:book:silent
-import cats.syntax.semigroup._
+import cats.implicits._
 
 implicit def optionMonoid[A: Semigroup]: Monoid[Option[A]] = new Monoid[Option[A]] {
   def empty: Option[A] = None
@@ -124,7 +124,7 @@ Thus:
 ```tut:reset:book:silent
 import cats.Monoid
 import cats.data.NonEmptyList
-import cats.instances.option._
+import cats.implicits._
 
 val list = List(NonEmptyList(1, List(2, 3)), NonEmptyList(4, List(5, 6)))
 val lifted = list.map(nel => Option(nel))

docs/src/main/tut/typeclasses/semigroup.md

@@ -47,7 +47,7 @@ Semigroup[Int].combine(Semigroup[Int].combine(x, y), z)
 Infix syntax is also available for types that have a `Semigroup` instance.
 
 ```tut:book
-import cats.syntax.semigroup._
+import cats.implicits._
 
 1 |+| 2
 ```
@@ -56,7 +56,7 @@ A more compelling example which we'll see later in this tutorial is the `Semigro
 for `Map`s.
 
 ```tut:book:silent
-import cats.instances.map._
+import cats.implicits._
 
 val map1 = Map("hello" -> 0, "world" -> 1)
 val map2 = Map("hello" -> 2, "cats"  -> 3)
@@ -74,7 +74,7 @@ Cats provides many `Semigroup` instances out of the box such as `Int` (`+`) and
 
 ```tut:reset:book:silent
 import cats.Semigroup
-import cats.instances.all._
+import cats.implicits._
 ```
 
 ```tut:book
@@ -108,8 +108,7 @@ type say, `Int` or `List[String]`, but we can write it once and for all for
 any type with a `Semigroup` instance.
 
 ```tut:book:silent
-import cats.instances.all._
-import cats.syntax.semigroup._
+import cats.implicits._
 
 def optionCombine[A: Semigroup](a: A, opt: Option[A]): A =
   opt.map(a |+| _).getOrElse(a)

docs/src/main/tut/typeclasses/traverse.md

@@ -72,9 +72,7 @@ a `List[Option[A]]`. Since the values themselves are effects, traversing with `i
 will turn the traversable "inside out."
 
 ```tut:reset:book:silent
-import cats.instances.list._
-import cats.instances.option._
-import cats.syntax.traverse._
+import cats.implicits._
 ```
 
 ```tut:book