Packages

p

scales

utils

package utils

Linear Supertypes
ConcurrentMapUtils, Paths, Trees, EquivFunctions, Iteratees, StackUtils, AsBooleanTrait, IterableUtils, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. utils
  2. ConcurrentMapUtils
  3. Paths
  4. Trees
  5. EquivFunctions
  6. Iteratees
  7. StackUtils
  8. AsBooleanTrait
  9. IterableUtils
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type AsBoolean[T] = (T) ⇒ Boolean
    Definition Classes
    AsBooleanTrait
  2. class BooleanAndTMatcher[X, T] extends AnyRef
    Definition Classes
    AsBooleanTrait
  3. class BooleanMatcher[X, T] extends AnyRef
    Definition Classes
    AsBooleanTrait
  4. type FoldR[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]] = Either[Path[Item, Section, CC], FoldError]
    Definition Classes
    Paths
  5. type ItemOrSectionWalk[Item, Section] = Either[Item, SectionWalk[Section]]
    Definition Classes
    Trees
  6. type ItemOrTree[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]] = EitherLike[Item, Tree[Item, Section, CC]]
    Definition Classes
    Trees
  7. type PathFoldR[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]] = (Path[Item, Section, CC]) ⇒ FoldR[Item, Section, CC]
    Definition Classes
    Paths
  8. type TreeCBF[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]] = CanBuildFrom[CC[_], ItemOrTree[Item, Section, CC], CC[ItemOrTree[Item, Section, CC]]]
    Definition Classes
    Trees

Value Members

  1. val ALREADY_RESTARTED: String
    Definition Classes
    IterableUtils
  2. val NotSameRoot: Int
    Definition Classes
    Paths
  3. val US_ASCII: Charset
  4. val UTF_8: Charset
  5. def boolean[T](it: T)(implicit arg0: AsBoolean[T]): Boolean
    Definition Classes
    AsBooleanTrait
  6. def booleanAndTMatcher[X, T](eval: (X) ⇒ T)(implicit arg0: AsBoolean[T]): BooleanAndTMatcher[X, T]
    Definition Classes
    AsBooleanTrait
  7. def booleanMatcher[X, T](eval: (X) ⇒ T)(implicit arg0: AsBoolean[T]): BooleanMatcher[X, T]
    Definition Classes
    AsBooleanTrait
  8. def calcOnce[K, T](key: K, map: ConcurrentHashMap[K, Once[T]])(calc: ⇒ T): T
    Definition Classes
    ConcurrentMapUtils
  9. def capture[A](orig: Iterator[A]): CapturedIterator[A]
    Definition Classes
    IterableUtils
  10. def collectFirst[A, B](in: Iterable[A])(f: (A) ⇒ Option[B]): Option[B]
    Definition Classes
    IterableUtils
  11. def comparePathPositions[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path1: Position[Item, Section, CC], path2: Position[Item, Section, CC]): Int
    Definition Classes
    Paths
  12. def comparePaths[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path1: Path[Item, Section, CC], path2: Path[Item, Section, CC]): (Int, Position[Item, Section, CC], Position[Item, Section, CC])
    Definition Classes
    Paths
  13. def comparePathsDirect[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path1: Path[Item, Section, CC], path2: Path[Item, Section, CC]): Boolean
    Definition Classes
    Paths
  14. def comparePathsP[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path1: (Position[Item, Section, CC], Path[Item, Section, CC]), path2: (Position[Item, Section, CC], Path[Item, Section, CC])): (Int, Position[Item, Section, CC], Position[Item, Section, CC])
    Definition Classes
    Paths
  15. def comparePathsT[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_], T](path1: (Position[Item, Section, CC], (T, Path[Item, Section, CC])), path2: (Position[Item, Section, CC], (T, Path[Item, Section, CC]))): (Int, Position[Item, Section, CC], Position[Item, Section, CC])
    Definition Classes
    Paths
  16. final def compareStack(p1: List[Int], p2: List[Int]): Int
    Definition Classes
    StackUtils
    Annotations
    @tailrec()
  17. def deepestLast[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path: Path[Item, Section, CC]): Path[Item, Section, CC]
    Definition Classes
    Paths
  18. val defaultCharset: Charset
  19. def equivalent[A, B, C](a: A, b: B)(implicit equiv: Equiv[C], viewA: (A) ⇒ C, viewB: (B) ⇒ C): Boolean
    Definition Classes
    EquivFunctions
  20. def error(string: String): Nothing
    Definition Classes
    Iteratees
  21. final def fold[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_], A](a: A)(folder: (ItemOrSectionWalk[Item, Section], A) ⇒ A)(tree: Tree[Item, Section, CC]): A
    Definition Classes
    Trees
  22. def foldPositions[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](locations: Iterable[Path[Item, Section, CC]])(folder: (Path[Item, Section, CC]) ⇒ FoldOperation[Item, Section, CC])(implicit iseqLikeThing: SeqLikeThing[CC[_], ItemOrTree[Item, Section, CC], CC], cm: ClassManifest[(Position[Item, Section, CC], Path[Item, Section, CC])]): FoldR[Item, Section, CC]
    Definition Classes
    Paths
  23. def foldPositions[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_], ACC](locations: Iterable[Path[Item, Section, CC]], accumulator: ACC)(folder: (ACC, Path[Item, Section, CC]) ⇒ (ACC, FoldOperation[Item, Section, CC]))(implicit iseqLikeThing: SeqLikeThing[CC[_], ItemOrTree[Item, Section, CC], CC], cm: ClassManifest[(Position[Item, Section, CC], Path[Item, Section, CC])]): Either[(ACC, Path[Item, Section, CC]), FoldError]
    Definition Classes
    Paths
  24. def following[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path: Path[Item, Section, CC]): Option[Path[Item, Section, CC]]
    Definition Classes
    Paths
  25. def getList[K, T](key: K, mapToList: ConcurrentHashMap[K, ConcurrentLinkedQueue[T]]): ConcurrentLinkedQueue[T]
    Definition Classes
    ConcurrentMapUtils
  26. implicit val idIteratees: IterateeFunctions[scalaz.Id.Id]
    Definition Classes
    Iteratees
  27. implicit val ioIteratees: IterateeFunctions[IO]
    Definition Classes
    Iteratees
  28. final def item[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](item: Item): ItemOrTree[Item, Section, CC]
    Annotations
    @inline()
  29. def iterateesOf[F[_]](implicit F: Monad[F]): IterateeFunctions[F]
    Definition Classes
    Iteratees
  30. def mkString[A](itr: Iterable[A], builder: StringBuilder, separator: String)(thunk: (A) ⇒ String): StringBuilder
    Definition Classes
    IterableUtils
  31. def moveTo[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path: Path[Item, Section, CC], newPos: Position[Item, Section, CC])(implicit seqLikeThing: SeqLikeThing[CC[_], ItemOrTree[Item, Section, CC], CC]): Path[Item, Section, CC]
    Definition Classes
    Paths
  32. def noPath[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](implicit seqLikeThing: SeqLikeThing[CC[_], ItemOrTree[Item, Section, CC], CC]): Path[Item, Section, CC]
    Definition Classes
    Paths
  33. final def one[T](i: T): List[T]
    Annotations
    @inline()
  34. def positions[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](paths: Iterable[Path[Item, Section, CC]]): Iterable[(Position[Item, Section, CC], Path[Item, Section, CC])]
    Definition Classes
    Paths
  35. def positionsT[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_], T](paths: Iterable[(T, Path[Item, Section, CC])]): Iterable[(Position[Item, Section, CC], (T, Path[Item, Section, CC]))]
    Definition Classes
    Paths
  36. def preceding[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path: Path[Item, Section, CC]): Option[Path[Item, Section, CC]]
    Definition Classes
    Paths
  37. def removeList[K, T](key: K, mapToList: ConcurrentHashMap[K, ConcurrentLinkedQueue[T]]): ConcurrentLinkedQueue[T]
    Definition Classes
    ConcurrentMapUtils
  38. def removeOr[K, T](key: K, map: ConcurrentHashMap[K, T])(newT: ⇒ T): T
    Definition Classes
    ConcurrentMapUtils
  39. def resource(a: AnyRef, path: String): URL
  40. def rootPath[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path: Path[Item, Section, CC]): Path[Item, Section, CC]
    Definition Classes
    Paths
  41. def sameBase(test: List[Int], against: List[Int]): Boolean
    Definition Classes
    StackUtils
  42. def sort[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](paths: Iterable[Path[Item, Section, CC]], isDescending: Boolean)(implicit cm: ClassManifest[(Position[Item, Section, CC], Path[Item, Section, CC])]): Iterable[Path[Item, Section, CC]]
    Definition Classes
    Paths
  43. def sortPositions[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](paths: Iterable[Path[Item, Section, CC]], isDescending: Boolean)(implicit cm: ClassManifest[(Position[Item, Section, CC], Path[Item, Section, CC])]): Iterable[(Position[Item, Section, CC], Path[Item, Section, CC])]
    Definition Classes
    Paths
  44. def sortPositionsT[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[X], T](paths: Iterable[(T, Path[Item, Section, CC])], isDescending: Boolean)(implicit cm: ClassManifest[(Position[Item, Section, CC], (T, Path[Item, Section, CC]))]): Iterable[(Position[Item, Section, CC], (T, Path[Item, Section, CC]))]
    Definition Classes
    Paths
  45. def sortT[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_], T](paths: Iterable[(T, Path[Item, Section, CC])], isDescending: Boolean)(implicit cm: ClassManifest[(Position[Item, Section, CC], (T, Path[Item, Section, CC]))]): Iterable[(T, Path[Item, Section, CC])]
    Definition Classes
    Paths
  46. final def subtree[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](section: Section, children: CC[ItemOrTree[Item, Section, CC]])(implicit iseqLikeThing: SeqLikeThing[CC[_], ItemOrTree[Item, Section, CC], CC]): ItemOrTree[Item, Section, CC]
    Annotations
    @inline()
  47. def toPositionalEqual[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]]: Equal[Path[Item, Section, CC]]
    Definition Classes
    Paths
  48. def top[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](tree: Tree[Item, Section, CC])(implicit seqLikeThing: SeqLikeThing[CC[_], ItemOrTree[Item, Section, CC], CC]): Path[Item, Section, CC]
    Definition Classes
    Paths
  49. implicit val trampolineIteratees: IterateeFunctions[Trampoline]
    Definition Classes
    Iteratees
  50. def valueOf[K, T](key: K, map: ConcurrentHashMap[K, T])(newT: ⇒ T): T
    Definition Classes
    ConcurrentMapUtils

Inherited from ConcurrentMapUtils

Inherited from Paths

Inherited from Trees

Inherited from EquivFunctions

Inherited from Iteratees

Inherited from StackUtils

Inherited from AsBooleanTrait

Inherited from IterableUtils

Inherited from AnyRef

Inherited from Any

Ungrouped