|
Scala example source code file (ListOps.scala)
The ListOps.scala Scala example source codepackage scalaz package syntax package std import scalaz.std.{list => l} final class ListOps[A](val self: List[A]) extends AnyVal { final def intersperse(a: A): List[A] = l.intersperse(self, a) final def tailOption: Option[List[A]] = l.tailOption(self) final def toNel: Option[NonEmptyList[A]] = l.toNel(self) final def toZipper: Option[Zipper[A]] = l.toZipper(self) final def zipperEnd: Option[Zipper[A]] = l.zipperEnd(self) final def <^>[B: Monoid](f: NonEmptyList[A] => B): B = l.<^>(self)(f) final def takeWhileM[M[_] : Monad](p: A => M[Boolean]): M[List[A]] = l.takeWhileM(self)(p) final def takeUntilM[M[_] : Monad](p: A => M[Boolean]): M[List[A]] = l.takeUntilM(self)(p) final def filterM[M[_] : Applicative](p: A => M[Boolean]): M[List[A]] = l.filterM(self)(p) final def findM[M[_] : Monad](p: A => M[Boolean]): M[Option[A]] = l.findM(self)(p) final def powerset: List[List[A]] = l.powerset(self) final def partitionM[M[_] : Applicative](p: A => M[Boolean]): M[(List[A], List[A])] = l.partitionM(self)(p) final def spanM[M[_] : Monad](p: A => M[Boolean]): M[(List[A], List[A])] = l.spanM(self)(p) final def breakM[M[_] : Monad](p: A => M[Boolean]): M[(List[A], List[A])] = l.breakM(self)(p) final def groupWhenM[M[_] : Monad](p: (A, A) => M[Boolean]): M[List[NonEmptyList[A]]] = l.groupWhenM(self)(p) final def groupBy1[B](f: A => B): Map[B, NonEmptyList[A]] = l.groupBy1(self)(f) final def groupWhen(p: (A, A) => Boolean): List[NonEmptyList[A]] = l.groupWhen(self)(p) final def lookup[B, C](key: B)(implicit eq: Equal[B], ev: A =:= (B, C)): Option[C] = self.find((x: A) => eq.equal(ev(x)._1, key)).map(_._2) final def mapAccumLeft[B, C](c: C, f: (C, A) => (C, B)): (C, List[B]) = l.mapAccumLeft(self)(c, f) final def mapAccumRight[B, C](c: C, f: (C, A) => (C, B)): (C, List[B]) = l.mapAccumRight(self)(c, f) final def tailz: List[List[A]] = l.tailz(self) final def initz: List[List[A]] = l.initz(self) final def allPairs: List[(A, A)] = l.allPairs(self) final def adjacentPairs: List[(A, A)] = l.adjacentPairs(self) } trait ToListOps { implicit def ToListOpsFromList[A](a: List[A]): ListOps[A] = new ListOps(a) } Other Scala examples (source code examples)Here is a short list of links related to this Scala ListOps.scala source code file: |
... this post is sponsored by my books ... | |
#1 New Release! |
FP Best Seller |
Copyright 1998-2021 Alvin Alexander, alvinalexander.com
All Rights Reserved.
A percentage of advertising revenue from
pages under the /java/jwarehouse
URI on this website is
paid back to open source projects.