Skip to content

Instantly share code, notes, and snippets.

@d6y

d6y/symbols

Last active August 29, 2015 14:08
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save d6y/00fda09d3e64865dd801 to your computer and use it in GitHub Desktop.
Save d6y/00fda09d3e64865dd801 to your computer and use it in GitHub Desktop.
Download ZIP
scalaz symbols
Raw
symbols
scalaz (series/7.2.x)$ grep -R 'def [^A-Za-z_]' core effect concurrent iteratee
core/src/main/scala/scalaz/Arrow.scala: final def <<<[A, B, C](fbc: (B =>: C), fab: (A =>: B)): =>:[A, C] =
core/src/main/scala/scalaz/Arrow.scala: def >>>[A, B, C](fab: (A =>: B), fbc: (B =>: C)): (A =>: C) =
core/src/main/scala/scalaz/BijectionT.scala: def ***[C, D](g: Bijection[C, D])(implicit evF: F[B] =:= Id[B], evG: G[A] =:= Id[A]): Bijection[(A, C), (B, D)] =
core/src/main/scala/scalaz/BijectionT.scala: def ^^^[C, D](g: Bijection[C, D])(implicit evF: F[B] =:= Id[B], evG: G[A] =:= Id[A]): Bijection[A \/ C, B \/ D] =
core/src/main/scala/scalaz/BijectionT.scala: def <=<[C](that: BijectionT[F, G, C, A])(implicit FM: Bind[F], GM: Bind[G]): BijectionT[F, G, C, B] = compose(that)
core/src/main/scala/scalaz/BijectionT.scala: def >=>[C](that: BijectionT[F, G, B, C])(implicit M: Bind[F], GM: Bind[G]): BijectionT[F, G, A, C] = andThen(that)
core/src/main/scala/scalaz/Cofree.scala: final def =>>[B](f: Cofree[S, A] => B)(implicit S: Functor[S]): Cofree[S, B] = this extend f
core/src/main/scala/scalaz/Cokleisli.scala: def <<=(a: F[A])(implicit F: Cobind[F]): F[B] =
core/src/main/scala/scalaz/Cokleisli.scala: def =>=[C](c: Cokleisli[F, B, C])(implicit F: Cobind[F]): Cokleisli[F, A, C] =
core/src/main/scala/scalaz/Cokleisli.scala: def =<=[C](c: Cokleisli[F, C, A])(implicit F: Cobind[F]): Cokleisli[F, C, B] =
core/src/main/scala/scalaz/Cord.scala: def ++(xs: Cord): Cord = cord(self <++> xs.self)
core/src/main/scala/scalaz/Cord.scala: def :+(x: => String): Cord = cord(self :+ x)
core/src/main/scala/scalaz/Cord.scala: def +:(x: => String): Cord = cord(x +: self)
core/src/main/scala/scalaz/Cord.scala: def -:(x: => Char): Cord = cord(x.toString +: self)
core/src/main/scala/scalaz/Cord.scala: def :-(x: => Char): Cord = cord(self :+ x.toString)
core/src/main/scala/scalaz/Dequeue.scala: def +:(a: A): Dequeue[A] = cons(a)
core/src/main/scala/scalaz/Dequeue.scala: def :+(a: A): Dequeue[A] = snoc(a)
core/src/main/scala/scalaz/Dequeue.scala: def ++(other: Dequeue[A]): Dequeue[A] = this match {
core/src/main/scala/scalaz/Diev.scala: def +(interval: (A, A)): Diev[A]
core/src/main/scala/scalaz/Diev.scala: def +(value: A): Diev[A]
core/src/main/scala/scalaz/Diev.scala: def -(interval: (A, A)): Diev[A]
core/src/main/scala/scalaz/Diev.scala: def -(value: A): Diev[A]
core/src/main/scala/scalaz/Diev.scala: def ++(other: Diev[A]): Diev[A]
core/src/main/scala/scalaz/Diev.scala: def --(other: Diev[A]): Diev[A]
core/src/main/scala/scalaz/Diev.scala: def +(interval: (A, A)): Diev[A] = {
core/src/main/scala/scalaz/Diev.scala: def +(value: A): Diev[A] = this + (value, value)
core/src/main/scala/scalaz/Diev.scala: def -(interval: (A, A)): Diev[A] = {
core/src/main/scala/scalaz/Diev.scala: def -(value: A): Diev[A] = this - (value, value)
core/src/main/scala/scalaz/Diev.scala: def ++(other: Diev[A]): Diev[A] = other.intervals.foldLeft(this: Diev[A])(_ + _)
core/src/main/scala/scalaz/Diev.scala: def --(other: Diev[A]): Diev[A] = other.intervals.foldLeft(this: Diev[A])(_ - _)
core/src/main/scala/scalaz/DList.scala: def +:(a: A): DList[A] = mkDList(as => suspend(apply(as) map (a :: _)))
core/src/main/scala/scalaz/DList.scala: def :+(a: A): DList[A] = mkDList(as => suspend(apply( a :: as)))
core/src/main/scala/scalaz/DList.scala: def ++(as: => DList[A]): DList[A] =
core/src/main/scala/scalaz/Either.scala: def <<?:(left: => X): X =
core/src/main/scala/scalaz/Either.scala: def :?>>[X](right: => X): SwitchingDisjunction[X] =
core/src/main/scala/scalaz/Either.scala: def ~[AA, BB](k: (B \/ A) => (BB \/ AA)): (AA \/ BB) =
core/src/main/scala/scalaz/Either.scala: def |[BB >: B](x: => BB): BB =
core/src/main/scala/scalaz/Either.scala: def |||[AA >: A, BB >: B](x: => AA \/ BB): AA \/ BB =
core/src/main/scala/scalaz/Either.scala: def +++[AA >: A, BB >: B](x: => AA \/ BB)(implicit M1: Semigroup[BB], M2: Semigroup[AA]): AA \/ BB =
core/src/main/scala/scalaz/Either.scala: def ===[AA >: A, BB >: B](x: AA \/ BB)(implicit EA: Equal[AA], EB: Equal[BB]): Boolean =
core/src/main/scala/scalaz/Either.scala: def @\?/[AA, BB](k: Validation[A, B] => Validation[AA, BB]): AA \/ BB =
core/src/main/scala/scalaz/EitherT.scala: def <<?:(left: => X)(implicit F: Functor[F]): F[X] =
core/src/main/scala/scalaz/EitherT.scala: def :?>>[X](right: => X): Switching_\/[X] =
core/src/main/scala/scalaz/EitherT.scala: def ~[AA, BB](k: (B \/ A) => (BB \/ AA))(implicit F: Functor[F]): EitherT[F, AA, BB] =
core/src/main/scala/scalaz/EitherT.scala: def |(default: => B)(implicit F: Functor[F]): F[B] =
core/src/main/scala/scalaz/EitherT.scala: def |||(x: => EitherT[F, A, B])(implicit F: Bind[F]): EitherT[F, A, B] =
core/src/main/scala/scalaz/EitherT.scala: def +++(x: => EitherT[F, A, B])(implicit M1: Semigroup[B], M2: Semigroup[A], F: Apply[F]): EitherT[F, A, B] =
core/src/main/scala/scalaz/EitherT.scala: def ===(x: EitherT[F, A, B])(implicit EA: Equal[A], EB: Equal[B], F: Apply[F]): F[Boolean] =
core/src/main/scala/scalaz/EphemeralStream.scala: def ++(e: => EphemeralStream[A]): EphemeralStream[A] =
core/src/main/scala/scalaz/EphemeralStream.scala: def ##::(h: A): EphemeralStream[A] = cons(h, e)
core/src/main/scala/scalaz/FingerTree.scala: def +:(a: A): Finger[V, A]
core/src/main/scala/scalaz/FingerTree.scala: def :+(a: A): Finger[V, A]
core/src/main/scala/scalaz/FingerTree.scala: def |-:(a: A): Finger[V, A]
core/src/main/scala/scalaz/FingerTree.scala: def :-|(a: A): Finger[V, A]
core/src/main/scala/scalaz/FingerTree.scala: def +:(a: A) = Two(r.cons(a, v), a, a1)
core/src/main/scala/scalaz/FingerTree.scala: def :+(a: A) = Two(r.snoc(v, a), a1, a)
core/src/main/scala/scalaz/FingerTree.scala: def |-:(a: A) = one(a)
core/src/main/scala/scalaz/FingerTree.scala: def :-|(a: A) = one(a)
core/src/main/scala/scalaz/FingerTree.scala: def +:(a: A) = Three(r.cons(a, v), a, a1, a2)
core/src/main/scala/scalaz/FingerTree.scala: def :+(a: A) = Three(r.snoc(v, a), a1, a2, a)
core/src/main/scala/scalaz/FingerTree.scala: def |-:(a: A) = two(a, a2)
core/src/main/scala/scalaz/FingerTree.scala: def :-|(a: A) = two(a1, a)
core/src/main/scala/scalaz/FingerTree.scala: def +:(a: A) = Four(r.cons(a, v), a, a1, a2, a3)
core/src/main/scala/scalaz/FingerTree.scala: def :+(a: A) = Four(r.snoc(v, a), a1, a2, a3, a)
core/src/main/scala/scalaz/FingerTree.scala: def |-:(a: A) = three(a, a2, a3)
core/src/main/scala/scalaz/FingerTree.scala: def :-|(a: A) = three(a1, a2, a)
core/src/main/scala/scalaz/FingerTree.scala: def +:(a: A) = sys.error("Digit overflow")
core/src/main/scala/scalaz/FingerTree.scala: def :+(a: A) = sys.error("Digit overflow")
core/src/main/scala/scalaz/FingerTree.scala: def |-:(a: A) = four(a, a2, a3, a4)
core/src/main/scala/scalaz/FingerTree.scala: def :-|(a: A) = four(a1, a2, a3, a)
core/src/main/scala/scalaz/FingerTree.scala: def +:(a: => A): FingerTree[V, A] = {
core/src/main/scala/scalaz/FingerTree.scala: def :+(a: => A): FingerTree[V, A] = {
core/src/main/scala/scalaz/FingerTree.scala: def |-:(a: => A): FingerTree[V, A] = {
core/src/main/scala/scalaz/FingerTree.scala: def :-|(a: => A): FingerTree[V, A] = {
core/src/main/scala/scalaz/FingerTree.scala: def <++>(right: => FingerTree[V, A]): FingerTree[V, A] = {
core/src/main/scala/scalaz/FingerTree.scala: def ++(xs: IndSeq[A]): IndSeq[A] = indSeq(self <++> xs.self)
core/src/main/scala/scalaz/FingerTree.scala: def :+(x: => A): IndSeq[A] = indSeq(self :+ x)
core/src/main/scala/scalaz/FingerTree.scala: def +:(x: => A): IndSeq[A] = indSeq(x +: self)
core/src/main/scala/scalaz/FingerTree.scala: def ++(xs: OrdSeq[A]): OrdSeq[A] = xs.self.toList.foldLeft(this)(_ insert _)
core/src/main/scala/scalaz/Free.scala: final def >>=[B](f: A => Free[S, B]): Free[S, B] = this flatMap f
core/src/main/scala/scalaz/Heap.scala: final def +(a: A)(implicit o: Order[A]) = this insert a
core/src/main/scala/scalaz/IList.scala: def ++(as: IList[A]): IList[A] =
core/src/main/scala/scalaz/IList.scala: def ++:(as: IList[A]): IList[A] =
core/src/main/scala/scalaz/IList.scala: def +:(a: A): IList[A] =
core/src/main/scala/scalaz/IList.scala: def /:[B](b: B)(f: (B, A) => B): B =
core/src/main/scala/scalaz/IList.scala: def :+(a: A): IList[A] =
core/src/main/scala/scalaz/IList.scala: def ::(a: A): IList[A] =
core/src/main/scala/scalaz/IList.scala: def :::(as: IList[A]): IList[A] =
core/src/main/scala/scalaz/IList.scala: def :\[B](b: B)(f: (A, B) => B): B =
core/src/main/scala/scalaz/IList.scala: final def <^>[B](f: OneAnd[IList, A] => B)(implicit B: Monoid[B]): B =
core/src/main/scala/scalaz/ImmutableArray.scala: def ++[B >: A: ClassTag](other: ImmutableArray[B]): ImmutableArray[B]
core/src/main/scala/scalaz/ImmutableArray.scala: override def ++[B >: A: ClassTag](other: ImmutableArray[B]) = {
core/src/main/scala/scalaz/ImmutableArray.scala: def ++[B >: Char: ClassTag](other: ImmutableArray[B]) =
core/src/main/scala/scalaz/ISet.scala: final def \\ (other: ISet[A])(implicit o: Order[A]) =
core/src/main/scala/scalaz/Isomorphism.scala: def %~(f: Arr[B, B])(implicit C: Compose[Arr]): Arr[A, A] =
core/src/main/scala/scalaz/Isomorphism.scala: def %~(f: G ~> G)(implicit FG: Arr[F, G] <~< (F ~> G), GF: Arr[G, F] <~< (G ~> F)): F ~> F =
core/src/main/scala/scalaz/Isomorphism.scala: def %~(f: G ~~> G)(implicit FG: Arr[F, G] <~< (F ~~> G), GF: Arr[G, F] <~< (G ~~> F)): F ~~> F =
core/src/main/scala/scalaz/Kleisli.scala: def >=>[C](k: Kleisli[M, B, C])(implicit b: Bind[M]): Kleisli[M, A, C] = kleisli((a: A) => b.bind(this(a))(k.run))
core/src/main/scala/scalaz/Kleisli.scala: def >==>[C](k: B => M[C])(implicit b: Bind[M]): Kleisli[M, A, C] = this >=> kleisli(k)
core/src/main/scala/scalaz/Kleisli.scala: def <=<[C](k: Kleisli[M, C, A])(implicit b: Bind[M]): Kleisli[M, C, B] = k >=> this
core/src/main/scala/scalaz/Kleisli.scala: def <==<[C](k: C => M[A])(implicit b: Bind[M]): Kleisli[M, C, B] = kleisli(k) >=> this
core/src/main/scala/scalaz/Kleisli.scala: def =<<(a: M[A])(implicit m: Bind[M]): M[B] = m.bind(a)(run)
core/src/main/scala/scalaz/LazyEither.scala: def ?[X](left: => X, right: => X): X =
core/src/main/scala/scalaz/LazyEitherT.scala: def ?[X](left: => X, right: => X)(implicit F: Functor[F]): F[X] =
core/src/main/scala/scalaz/LazyOption.scala: def ?[X](some: => X, none: => X): X =
core/src/main/scala/scalaz/LazyOptionT.scala: def ?[X](some: => X, none: => X)(implicit F: Functor[F]): F[X] =
core/src/main/scala/scalaz/Lens.scala: def =>=(f: B1 => B2): A1 => A2 =
core/src/main/scala/scalaz/Lens.scala: def =>>=[X[_]](f: B1 => X[B2])(implicit XF: Functor[X]): A1 => X[A2] =
core/src/main/scala/scalaz/Lens.scala: def %=(f: B1 => B2): IndexedState[A1, A2, B2] =
core/src/main/scala/scalaz/Lens.scala: def <%=(f: B1 => B2): IndexedState[A1, A2, B1] =
core/src/main/scala/scalaz/Lens.scala: def :=(b: => B2): IndexedState[A1, A2, B2] =
core/src/main/scala/scalaz/Lens.scala: def <:=(b: => B2): IndexedState[A1, A2, B1] =
core/src/main/scala/scalaz/Lens.scala: def %==(f: B1 => B2): IndexedState[A1, A2, Unit] =
core/src/main/scala/scalaz/Lens.scala: def %%=[C](s: IndexedState[B1, B2, C]): IndexedState[A1, A2, C] =
core/src/main/scala/scalaz/Lens.scala: def >-[C](f: B1 => C): State[A1, C] = map(f)
core/src/main/scala/scalaz/Lens.scala: def >>-[C](f: B1 => IndexedState[A1, A2, C]): IndexedState[A1, A2, C] =
core/src/main/scala/scalaz/Lens.scala: def ->>-[C](f: => IndexedState[A1, A2, C]): IndexedState[A1, A2, C] =
core/src/main/scala/scalaz/Lens.scala: def <=<[C1, C2](that: LensFamily[C1, C2, A1, A2]): LensFamily[C1, C2, B1, B2] = compose(that)
core/src/main/scala/scalaz/Lens.scala: def >=>[C1, C2](that: LensFamily[B1, B2, C1, C2]): LensFamily[A1, A2, C1, C2] = andThen(that)
core/src/main/scala/scalaz/Lens.scala: def |||[C1, C2](that: => LensFamily[C1, C2, B1, B2]): LensFamily[A1 \/ C1, A2 \/ C2, B1, B2] = sum(that)
core/src/main/scala/scalaz/Lens.scala: def ***[C1, C2, D1, D2](that: LensFamily[ C1, C2, D1, D2]): LensFamily[(A1, C1), (A2, C2), (B1, D1), (B2, D2)] = product(that)
core/src/main/scala/scalaz/Lens.scala: def &=(that: Set[K]): IndexedState[S1, S2, Set[K]] =
core/src/main/scala/scalaz/Lens.scala: def &~=(that: Set[K]): IndexedState[S1, S2, Set[K]] =
core/src/main/scala/scalaz/Lens.scala: def |=(that: Set[K]): IndexedState[S1, S2, Set[K]] =
core/src/main/scala/scalaz/Lens.scala: def +=(elem: K): IndexedState[S1, S2, Set[K]] =
core/src/main/scala/scalaz/Lens.scala: def +=(elem1: K, elem2: K, elems: K*): IndexedState[S1, S2, Set[K]] =
core/src/main/scala/scalaz/Lens.scala: def ++=(xs: TraversableOnce[K]): IndexedState[S1, S2, Set[K]] =
core/src/main/scala/scalaz/Lens.scala: def -=(elem: K): IndexedState[S1, S2, Set[K]] =
core/src/main/scala/scalaz/Lens.scala: def -=(elem1: K, elem2: K, elems: K*): IndexedState[S1, S2, Set[K]] =
core/src/main/scala/scalaz/Lens.scala: def --=(xs: TraversableOnce[K]): IndexedState[S1, S2, Set[K]] =
core/src/main/scala/scalaz/Lens.scala: def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): IndexedState[S1, S2, Map[K, V]] =
core/src/main/scala/scalaz/Lens.scala: def +=(elem: (K, V)): IndexedState[S1, S2, Map[K, V]] =
core/src/main/scala/scalaz/Lens.scala: def ++=(xs: TraversableOnce[(K, V)]): IndexedState[S1, S2, Map[K, V]] =
core/src/main/scala/scalaz/Lens.scala: def -=(elem: K): IndexedState[S1, S2, Map[K, V]] =
core/src/main/scala/scalaz/Lens.scala: def -=(elem1: K, elem2: K, elems: K*): IndexedState[S1, S2, Map[K, V]] =
core/src/main/scala/scalaz/Lens.scala: def --=(xs: TraversableOnce[K]): IndexedState[S1, S2, Map[K, V]] =
core/src/main/scala/scalaz/Lens.scala: def +=(that: N): IndexedState[S1, S2, N] =
core/src/main/scala/scalaz/Lens.scala: def -=(that: N): IndexedState[S1, S2, N] =
core/src/main/scala/scalaz/Lens.scala: def *=(that: N): IndexedState[S1, S2, N] =
core/src/main/scala/scalaz/Lens.scala: def /=(that: F): IndexedState[S1, S2, F] =
core/src/main/scala/scalaz/Lens.scala: def %=(that: I): IndexedState[S1, S2, I] =
core/src/main/scala/scalaz/Liskov.scala: final def *[+[+_, +_], C, D](that: Liskov[C, D]): Liskov[A + C, B + D] = Liskov.lift2(this, that)
core/src/main/scala/scalaz/ListT.scala: def ::(a: A)(implicit M: Functor[M]) : ListT[M, A] = new ListT(M.map(run)(list => a :: list))
core/src/main/scala/scalaz/ListT.scala: def ++(bs: => ListT[M, A])(implicit M: Bind[M]) : ListT[M, A] = new ListT(M.bind(run){list1 =>
core/src/main/scala/scalaz/Map.scala: def + (a: (A, B))(implicit o: Order[A]): A ==>> B =
core/src/main/scala/scalaz/Map.scala: def -(k: A)(implicit o: Order[A]) =
core/src/main/scala/scalaz/Map.scala: def \\(other: A ==>> B)(implicit o: Order[A]): A ==>> B =
core/src/main/scala/scalaz/Maybe.scala: final def |(a: => A): A =
core/src/main/scala/scalaz/Maybe.scala: final def <\/[B](b: => B): A \/ B =
core/src/main/scala/scalaz/Maybe.scala: final def \/>[B](b: => B): B \/ A =
core/src/main/scala/scalaz/MonoidCoproduct.scala: def |+|[A >: M : Monoid, B >: N : Monoid](m: A :+: B): A :+: B = {
core/src/main/scala/scalaz/NonEmptyList.scala: def <::[AA >: A](b: AA): NonEmptyList[AA] = nel(b, head :: tail)
core/src/main/scala/scalaz/NonEmptyList.scala: def <:::[AA >: A](bs: List[AA]): NonEmptyList[AA] = bs match {
core/src/main/scala/scalaz/NonEmptyList.scala: def :::>[AA >: A](bs: List[AA]): NonEmptyList[AA] = nel(head, tail ::: bs)
core/src/main/scala/scalaz/NullArgument.scala: def ***[C, D](x: C ?=> D): (A, C) ?=> (B, D) =
core/src/main/scala/scalaz/NullArgument.scala: def +++[C, D](x: C ?=> D): (A \/ C) ?=> (B \/ D) =
core/src/main/scala/scalaz/NullArgument.scala: def |+|(x: A ?=> B)(implicit S: Semigroup[B]): A ?=> B =
core/src/main/scala/scalaz/NullResult.scala: def ***[C, D](x: C =>? D): (A, C) =>? (B, D) =
core/src/main/scala/scalaz/NullResult.scala: def +++[C, D](x: C =>? D): (A \/ C) =>? (B \/ D) =
core/src/main/scala/scalaz/NullResult.scala: def |(x: => A =>? B): A =>? B =
core/src/main/scala/scalaz/NullResult.scala: def |+|(x: A =>? B)(implicit S: Semigroup[B]): A =>? B =
core/src/main/scala/scalaz/NullResult.scala: def =>>[C](f: B ?=> C): A =>? C =
core/src/main/scala/scalaz/Optional.scala: def ?[A,X](fa: F[A])(some: => X, none: => X): X =
core/src/main/scala/scalaz/PLens.scala: def =?>=(f: B1 => B2): A1 => Option[A2] =
core/src/main/scala/scalaz/PLens.scala: def =>=[A >: A2 <: A1](f: B1 => B2): A => A =
core/src/main/scala/scalaz/PLens.scala: def %=[A >: A2 <: A1](f: B1 => B2): PState[A, B2] =
core/src/main/scala/scalaz/PLens.scala: def :=[A >: A2 <: A1](b: => B2): PState[A, B2] =
core/src/main/scala/scalaz/PLens.scala: def %==[A >: A2 <: A1](f: B1 => B2): State[A, Unit] =
core/src/main/scala/scalaz/PLens.scala: def %%=[A >: A2 <: A1, C](s: IndexedState[B1, B2, C]): PState[A, C] =
core/src/main/scala/scalaz/PLens.scala: def >-[A >: A2 <: A1, C](f: B1 => C): PState[A, C] =
core/src/main/scala/scalaz/PLens.scala: def >>-[A >: A2 <: A1, C](f: B1 => State[A, C]): PState[A, C] =
core/src/main/scala/scalaz/PLens.scala: def ->>-[A >: A2 <: A1, C](f: => State[A, C]): PState[A, C] =
core/src/main/scala/scalaz/PLens.scala: def <=<[C1, C2](that: PLensFamily[C1, C2, A1, A2]): PLensFamily[C1, C2, B1, B2] = compose(that)
core/src/main/scala/scalaz/PLens.scala: def >=>[C1, C2](that: PLensFamily[B1, B2, C1, C2]): PLensFamily[A1, A2, C1, C2] = andThen(that)
core/src/main/scala/scalaz/PLens.scala: def |||[C1, C2](that: => PLensFamily[C1, C2, B1, B2]): PLensFamily[A1 \/ C1, A2 \/ C2, B1, B2] = sum(that)
core/src/main/scala/scalaz/PLens.scala: def ***[C1, C2, D1, D2](that: PLensFamily[C1, C2, D1, D2]): PLensFamily[(A1, C1), (A2, C2), (B1, D1), (B2, D2)] = product(that)
core/src/main/scala/scalaz/PLens.scala: def +=(that: N): PState[S, N] =
core/src/main/scala/scalaz/PLens.scala: def -=(that: N): PState[S, N] =
core/src/main/scala/scalaz/PLens.scala: def *=(that: N): PState[S, N] =
core/src/main/scala/scalaz/PLens.scala: def /=(that: F): PState[S, F] =
core/src/main/scala/scalaz/PLens.scala: def %=(that: I): PState[S, I] =
core/src/main/scala/scalaz/std/List.scala: final def <^>[A, B: Monoid](as: List[A])(f: NonEmptyList[A] => B): B = as match {
core/src/main/scala/scalaz/std/Vector.scala: final def <^>[A, B: Monoid](as: Vector[A])(f: NonEmptyList[A] => B): B =
core/src/main/scala/scalaz/StoreT.scala: def ***[J, C, D](that: IndexedStoreT[F, J, C, D])(implicit M: Bind[F]): IndexedStoreT[F, (I, J), (A, C), (B, D)] = product(that)
core/src/main/scala/scalaz/StreamT.scala: def ::(a: => A)(implicit M: Applicative[M]): StreamT[M, A] = StreamT[M, A](M.point(Yield(a, this)))
core/src/main/scala/scalaz/StreamT.scala: def ++(bs: => StreamT[M, A])(implicit m: Functor[M]): StreamT[M, A] = stepMap {
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def ⊛[C](cc: M[C]) = new ApplicativeBuilder3[C] {
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def |@|[C](cc: M[C]) = ⊛(cc)
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def ⊛[D](dd: M[D]) = new ApplicativeBuilder4[D] {
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def |@|[D](dd: M[D]) = ⊛(dd)
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def ⊛[E](ee: M[E]) = new ApplicativeBuilder5[E] {
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def |@|[E](ee: M[E]) = ⊛(ee)
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def ⊛[F](f: M[F]) = new ApplicativeBuilder6[F] {
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def |@|[F](f: M[F]) = ⊛(f)
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def ⊛[G](gg: M[G]) = new ApplicativeBuilder7[G] {
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def |@|[G](gg: M[G]) = ⊛(gg)
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def ⊛[H](hh: M[H]) = new ApplicativeBuilder8[H] {
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def |@|[H](hh: M[H]) = ⊛(hh)
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def ⊛[I](ii: M[I]) = new ApplicativeBuilder9[I] {
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def |@|[I](ii: M[I]) = ⊛(ii)
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def ⊛[J](jj: M[J]) = new ApplicativeBuilder10[J] {
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def |@|[J](jj: M[J]) = ⊛(jj)
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def ⊛[K](kk: M[K]) = new ApplicativeBuilder11[K] {
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def |@|[K](kk: M[K]) = ⊛(kk)
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def ⊛[L](ll: M[L]) = new ApplicativeBuilder12[L] {
core/src/main/scala/scalaz/syntax/ApplicativeBuilder.scala: def |@|[L](ll: M[L]) = ⊛(ll)
core/src/main/scala/scalaz/syntax/ApplicativeSyntax.scala: def η[F[_] : Applicative]: F[A] = Applicative[F].point(self)
core/src/main/scala/scalaz/syntax/ApplicativeSyntax.scala: def η[A](a: => A)(implicit F: Applicative[F]): F[A] = F.point(a)
core/src/main/scala/scalaz/syntax/ApplicativeSyntax.scala: def η(implicit F: Applicative[F]): F[A] = Applicative[F].point(self)
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: final def <*>[B](f: F[A => B]): F[B] = F.ap(self)(f)
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: final def *>[B](fb: F[B]): F[B] = F.apply2(self,fb)((_,b) => b)
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: final def <*[B](fb: F[B]): F[A] = F.apply2(self,fb)((a,_) => a)
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: final def |@|[B](fb: F[B]) = new ApplicativeBuilder[F, A, B] {
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: final def ⊛[B](fb: F[B]) = |@|(fb)
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: def ^[F[_],A,B,C](fa: => F[A], fb: => F[B])(
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: def ^^[F[_],A,B,C,D](fa: => F[A], fb: => F[B], fc: => F[C])(
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: def ^^^[F[_],A,B,C,D,E](fa: => F[A], fb: => F[B], fc: => F[C], fd: => F[D])(
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: def ^^^^[F[_],A,B,C,D,E,I](fa: => F[A], fb: => F[B], fc: => F[C], fd: => F[D], fe: => F[E])(
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: def ^^^^^[F[_],A,B,C,D,E,I,J](fa: => F[A], fb: => F[B], fc: => F[C], fd: => F[D], fe: => F[E], fi: => F[I])(
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: def ^^^^^^[F[_],A,B,C,D,E,I,J,K](fa: => F[A], fb: => F[B], fc: => F[C], fd: => F[D], fe: => F[E], fi: => F[I], fj: => F[J])(
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: def ^[A,B,C](fa: => F[A], fb: => F[B])(
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: def ^^[A,B,C,D](fa: => F[A], fb: => F[B], fc: => F[C])(
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: def ^^^[A,B,C,D,E](fa: => F[A], fb: => F[B], fc: => F[C], fd: => F[D])(
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: def ^^^^[A,B,C,D,E,I](fa: => F[A], fb: => F[B], fc: => F[C], fd: => F[D], fe: => F[E])(
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: def ^^^^^[A,B,C,D,E,I,J](fa: => F[A], fb: => F[B], fc: => F[C], fd: => F[D], fe: => F[E], fi: => F[I])(
core/src/main/scala/scalaz/syntax/ApplySyntax.scala: def ^^^^^^[A,B,C,D,E,I,J,K](fa: => F[A], fb: => F[B], fc: => F[C], fd: => F[D], fe: => F[E], fi: => F[I], fj: => F[J])(
core/src/main/scala/scalaz/syntax/ArrowSyntax.scala: final def ***[C, D](k: F[C, D]): F[(A, C), (B, D)] =
core/src/main/scala/scalaz/syntax/ArrowSyntax.scala: final def &&&[C](k: F[A, C]): F[A, (B, C)] =
core/src/main/scala/scalaz/syntax/BifunctorSyntax.scala: final def :->[D](g: B => D): F[A, D] = F.bimap(self)(a => a, g)
core/src/main/scala/scalaz/syntax/BifunctorSyntax.scala: final def <-:[C](f: A => C): F[C, B] = F.bimap(self)(f, b => b)
core/src/main/scala/scalaz/syntax/BifunctorSyntax.scala: final def <:>[C](f: A => C)(implicit z: B <~< C): F[C, C] = F.bimap(self)(f, z)
core/src/main/scala/scalaz/syntax/BindSyntax.scala: def >>=[B](f: A => F[B]) = F.bind(self)(f)
core/src/main/scala/scalaz/syntax/BindSyntax.scala: def ∗[B](f: A => F[B]) = F.bind(self)(f)
core/src/main/scala/scalaz/syntax/BindSyntax.scala: def μ[B](implicit ev: A <~< F[B]): F[B] = F.bind(self)(ev(_))
core/src/main/scala/scalaz/syntax/BindSyntax.scala: def >>[B](b: => F[B]): F[B] = F.bind(self)(_ => b)
core/src/main/scala/scalaz/syntax/ChoiceSyntax.scala: final def |||[C](x: => F[C, B]): F[A \/ C, B] =
core/src/main/scala/scalaz/syntax/ComposeSyntax.scala: final def <<<[C](x: F[C, A]): F[C, B] =
core/src/main/scala/scalaz/syntax/ComposeSyntax.scala: final def ⋘[C](x: F[C, A]): F[C, B] =
core/src/main/scala/scalaz/syntax/ComposeSyntax.scala: final def >>>[C](x: F[B, C]): F[A, C] =
core/src/main/scala/scalaz/syntax/ComposeSyntax.scala: final def ⋙[C](x: F[B, C]): F[A, C] =
core/src/main/scala/scalaz/syntax/ContravariantSyntax.scala: final def ∙[B](f: B => A): F[B] = F.contramap(self)(f)
core/src/main/scala/scalaz/syntax/EnumSyntax.scala: final def -+-(n: Int): F =
core/src/main/scala/scalaz/syntax/EnumSyntax.scala: final def ---(n: Int): F =
core/src/main/scala/scalaz/syntax/EnumSyntax.scala: final def |=>(to: F): EphemeralStream[F] =
core/src/main/scala/scalaz/syntax/EnumSyntax.scala: final def |->(to: F): List[F] =
core/src/main/scala/scalaz/syntax/EnumSyntax.scala: final def |==>(step: Int, to: F): EphemeralStream[F] =
core/src/main/scala/scalaz/syntax/EnumSyntax.scala: final def |-->(step: Int, to: F): List[F] =
core/src/main/scala/scalaz/syntax/EqualSyntax.scala: final def ===(other: F): Boolean = F.equal(self, other)
core/src/main/scala/scalaz/syntax/EqualSyntax.scala: final def /==(other: F): Boolean = !F.equal(self, other)
core/src/main/scala/scalaz/syntax/EqualSyntax.scala: final def =/=(other: F): Boolean = /==(other)
core/src/main/scala/scalaz/syntax/EqualSyntax.scala: final def ≟(other: F): Boolean = F.equal(self, other)
core/src/main/scala/scalaz/syntax/EqualSyntax.scala: final def ≠(other: F): Boolean = !F.equal(self, other)
core/src/main/scala/scalaz/syntax/FoldableSyntax.scala: final def ∀(p: A => Boolean): Boolean = F.all(self)(p)
core/src/main/scala/scalaz/syntax/FoldableSyntax.scala: final def ∃(p: A => Boolean): Boolean = F.any(self)(p)
core/src/main/scala/scalaz/syntax/FunctorSyntax.scala: final def ∘[B](f: A => B): F[B] = F.map(self)(f)
core/src/main/scala/scalaz/syntax/FunctorSyntax.scala: final def >|[B](b: => B): F[B] = F.map(self)(_ => b)
core/src/main/scala/scalaz/syntax/IdOps.scala: final def ??(d: => A)(implicit ev: Null <:< A): A =
core/src/main/scala/scalaz/syntax/IdOps.scala: final def |>[B](f: A => B): B =
core/src/main/scala/scalaz/syntax/IdOps.scala: final def ▹[B](f: A => B): B =
core/src/main/scala/scalaz/syntax/IdOps.scala: final def <|(f: A => Any): A = unsafeTap(f)
core/src/main/scala/scalaz/syntax/IdOps.scala: final def ◃(f: A => Any): A = unsafeTap(f)
core/src/main/scala/scalaz/syntax/MonadTellSyntax.scala: final def :++>(w: => S): F[S, A] = F.bind(self)(a => F.map(F.tell(w))(_ => a))
core/src/main/scala/scalaz/syntax/MonadTellSyntax.scala: final def :++>>(f: A => S): F[S, A] =
core/src/main/scala/scalaz/syntax/MonoidSyntax.scala: def ∅[F](implicit F: Monoid[F]): F = F.zero
core/src/main/scala/scalaz/syntax/MonoidSyntax.scala: def ∅(implicit F: Monoid[F]): F = F.zero
core/src/main/scala/scalaz/syntax/OptionalSyntax.scala: def |(none: => X): X = F.?(self)(some,none)
core/src/main/scala/scalaz/syntax/OptionalSyntax.scala: def ?[X](some: => X): Conditional[X] = new Conditional[X](some)
core/src/main/scala/scalaz/syntax/OrderSyntax.scala: final def <(other: F): Boolean = F.lessThan(self, other)
core/src/main/scala/scalaz/syntax/OrderSyntax.scala: final def <=(other: F): Boolean = F.lessThanOrEqual(self, other)
core/src/main/scala/scalaz/syntax/OrderSyntax.scala: final def >(other: F): Boolean = F.greaterThan(self, other)
core/src/main/scala/scalaz/syntax/OrderSyntax.scala: final def >=(other: F): Boolean = F.greaterThanOrEqual(self, other)
core/src/main/scala/scalaz/syntax/OrderSyntax.scala: final def ?|?(other: F): Ordering = F.order(self, other)
core/src/main/scala/scalaz/syntax/PlusSyntax.scala: final def <+>(other: => F[A]) = F.plus(self, other)
core/src/main/scala/scalaz/syntax/ProfunctorSyntax.scala: final def ^>>[C](f: C => A): F[C, B] =
core/src/main/scala/scalaz/syntax/ProfunctorSyntax.scala: final def >>^[C](f: B => C): F[A, C] =
core/src/main/scala/scalaz/syntax/SemigroupSyntax.scala: final def |+|(other: => F): F = F.append(self, other)
core/src/main/scala/scalaz/syntax/SemigroupSyntax.scala: final def ⊹(other: => F): F = F.append(self, other)
core/src/main/scala/scalaz/syntax/SplitSyntax.scala: final def -*-[C, D](k: F[C, D]): F[(A, C), (B, D)] =
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def |∧| : Boolean @@ Conjunction = conjunction
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def |/\| : Boolean @@ Conjunction = conjunction
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def |∨| : Boolean @@ Disjunction = disjunction
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def |\/| : Boolean @@ Disjunction = disjunction
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def ∧(q: => Boolean) = b.conjunction(self, q)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def /\(q: => Boolean) =
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def ∨(q: => Boolean): Boolean = b.disjunction(self, q)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def \/(q: => Boolean): Boolean = ∨(q)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def !||(q: => Boolean) = b.nor(self, q)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def !&&(q: => Boolean) = b.nand(self, q)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def -->(q: => Boolean) = b.conditional(self, q)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def <--(q: => Boolean) = b.inverseConditional(self, q)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def ⇐(q: => Boolean) = b.inverseConditional(self, q)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def ⇏(q: => Boolean) = b.negConditional(self, q)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def -/>(q: => Boolean) = b.negConditional(self, q)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def ⇍(q: => Boolean) = b.negInverseConditional(self, q)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def <\-(q: => Boolean) = b.negInverseConditional(self, q)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: def |(f: => X) = if (self) t else f
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def ?[X](t: => X): Conditional[X] = new Conditional(t)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def ??[A](a: => A)(implicit z: Monoid[A]): A = b.valueOrZero(self)(a)
core/src/main/scala/scalaz/syntax/std/BooleanOps.scala: final def !?[A](a: => A)(implicit z: Monoid[A]): A = b.zeroOrValue(self)(a)
core/src/main/scala/scalaz/syntax/std/ListOps.scala: final def <^>[B: Monoid](f: NonEmptyList[A] => B): B = l.<^>(self)(f)
core/src/main/scala/scalaz/syntax/std/OptionOps.scala: def |(n: => X): X = self match {
core/src/main/scala/scalaz/syntax/std/OptionOps.scala: final def ?[X](s: => X): Conditional[X] = new Conditional(s)
core/src/main/scala/scalaz/syntax/std/OptionOps.scala: final def |(a: => A): A = self getOrElse a
core/src/main/scala/scalaz/syntax/std/OptionOps.scala: final def \/>[E](e: => E): E \/ A = o.toRight(self)(e)
core/src/main/scala/scalaz/syntax/std/OptionOps.scala: final def <\/[B](b: => B): A \/ B = o.toLeft(self)(b)
core/src/main/scala/scalaz/syntax/std/VectorOps.scala: final def <^>[B: Monoid](f: NonEmptyList[A] => B): B = v.<^>(self)(f)
core/src/main/scala/scalaz/syntax/TheseOps.scala: final def `this`[B]: A \&/ B =
core/src/main/scala/scalaz/syntax/ZipSyntax.scala: final def <*|*>[B](b: => F[A] => F[B]): F[(A, B)] = F.apzip(b, self)
core/src/main/scala/scalaz/These.scala: def ~[AA, BB](k: (B \&/ A) => (BB \&/ AA)): (AA \&/ BB) =
core/src/main/scala/scalaz/These.scala: def &&&[AA >: A, C](t: AA \&/ C)(implicit M: Semigroup[AA]): AA \&/ (B, C) =
core/src/main/scala/scalaz/These.scala: def |[BB >: B](bb: => BB): BB =
core/src/main/scala/scalaz/These.scala: def ===[AA >: A, BB >: B](x: AA \&/ BB)(implicit EA: Equal[AA], EB: Equal[BB]): Boolean =
core/src/main/scala/scalaz/Validation.scala: def <<?:(fail: => X): X =
core/src/main/scala/scalaz/Validation.scala: def :?>>[X](success: => X): SwitchingValidation[X] =
core/src/main/scala/scalaz/Validation.scala: def ~[EE, AA](k: Validation[A, E] => Validation[AA, EE]): Validation[EE, AA] =
core/src/main/scala/scalaz/Validation.scala: def |[AA >: A](x: => AA): AA =
core/src/main/scala/scalaz/Validation.scala: def |||[EE >: E, AA >: A](x: => Validation[EE, AA]): Validation[EE, AA] =
core/src/main/scala/scalaz/Validation.scala: def +++[EE >: E, AA >: A](x: => Validation[EE, AA])(implicit M1: Semigroup[AA], M2: Semigroup[EE]): Validation[EE, AA] =
core/src/main/scala/scalaz/Validation.scala: def ===[EE >: E, AA >: A](x: Validation[EE, AA])(implicit EE: Equal[EE], EA: Equal[AA]): Boolean =
core/src/main/scala/scalaz/Validation.scala: def +|+[EE >: E, AA >: A](x: Validation[EE, AA])(implicit es: Semigroup[EE], as: Semigroup[AA]): Validation[EE, AA] = append(x)
core/src/main/scala/scalaz/Validation.scala: def @\/[EE, AA](k: (E \/ A) => (EE \/ AA)): Validation[EE, AA] =
core/src/main/scala/scalaz/WriterT.scala: def :++>(w: => W)(implicit F: Functor[F], W: Semigroup[W]): WriterT[F, W, A] =
core/src/main/scala/scalaz/WriterT.scala: def :++>>(f: A => W)(implicit F: Functor[F], W: Semigroup[W]): WriterT[F, W, A] =
core/src/main/scala/scalaz/WriterT.scala: def <++:(w: => W)(implicit F: Functor[F], W: Semigroup[W]): WriterT[F, W, A] =
core/src/main/scala/scalaz/WriterT.scala: def <<++:(f: A => W)(implicit F: Functor[F], s: Semigroup[W]): WriterT[F, W, A] =
effect/src/main/scala/scalaz/effect/ST.scala: def |=(a: => A): ST[S, STRef[S, A]] =
concurrent/src/main/scala/scalaz/concurrent/Actor.scala: def !(a: A): Unit = {
concurrent/src/main/scala/scalaz/concurrent/Run.scala: def !(a: F): () => Unit = strategy(run(a))
iteratee/src/main/scala/scalaz/iteratee/EnumeratorP.scala: def :^[B](other: EnumeratorP[B, F]): EnumeratorP[(E, B), F] =
iteratee/src/main/scala/scalaz/iteratee/EnumeratorP.scala: def ^:[B](other: EnumeratorP[B, F]): EnumeratorP[(E, B), F] =
iteratee/src/main/scala/scalaz/iteratee/EnumeratorT.scala: def #::(e: => E)(implicit F: Monad[F]): EnumeratorT[E, F] = {
iteratee/src/main/scala/scalaz/iteratee/IterateeT.scala: def >>==[EE, AA](f: StepT[E, F, A] => IterateeT[EE, F, AA])(implicit F: Bind[F]): IterateeT[EE, F, AA] =
iteratee/src/main/scala/scalaz/iteratee/IterateeT.scala: def %=[O](e: EnumerateeT[O, E, F])(implicit m: Monad[F]): IterateeT[O, F, A] =
iteratee/src/main/scala/scalaz/iteratee/IterateeT.scala: def &=(e: EnumeratorT[E, F])(implicit F: Bind[F]): IterateeT[E, F, A] =
iteratee/src/main/scala/scalaz/iteratee/StepT.scala: def >-[Z](cont: => Z, done: => Z): Z =
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment