package utils
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- utils
- ConcurrentMapUtils
- Paths
- Trees
- EquivFunctions
- Iteratees
- StackUtils
- AsBooleanTrait
- IterableUtils
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
-
type
AsBoolean[T] = (T) ⇒ Boolean
- Definition Classes
- AsBooleanTrait
-
class
BooleanAndTMatcher[X, T] extends AnyRef
- Definition Classes
- AsBooleanTrait
-
class
BooleanMatcher[X, T] extends AnyRef
- Definition Classes
- AsBooleanTrait
-
type
FoldR[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]] = Either[Path[Item, Section, CC], FoldError]
- Definition Classes
- Paths
-
type
ItemOrSectionWalk[Item, Section] = Either[Item, SectionWalk[Section]]
- Definition Classes
- Trees
-
type
ItemOrTree[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]] = EitherLike[Item, Tree[Item, Section, CC]]
- Definition Classes
- Trees
-
type
PathFoldR[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]] = (Path[Item, Section, CC]) ⇒ FoldR[Item, Section, CC]
- Definition Classes
- Paths
-
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
-
val
ALREADY_RESTARTED: String
- Definition Classes
- IterableUtils
-
val
NotSameRoot: Int
- Definition Classes
- Paths
- val US_ASCII: Charset
- val UTF_8: Charset
-
def
boolean[T](it: T)(implicit arg0: AsBoolean[T]): Boolean
- Definition Classes
- AsBooleanTrait
-
def
booleanAndTMatcher[X, T](eval: (X) ⇒ T)(implicit arg0: AsBoolean[T]): BooleanAndTMatcher[X, T]
- Definition Classes
- AsBooleanTrait
-
def
booleanMatcher[X, T](eval: (X) ⇒ T)(implicit arg0: AsBoolean[T]): BooleanMatcher[X, T]
- Definition Classes
- AsBooleanTrait
-
def
calcOnce[K, T](key: K, map: ConcurrentHashMap[K, Once[T]])(calc: ⇒ T): T
- Definition Classes
- ConcurrentMapUtils
-
def
capture[A](orig: Iterator[A]): CapturedIterator[A]
- Definition Classes
- IterableUtils
-
def
collectFirst[A, B](in: Iterable[A])(f: (A) ⇒ Option[B]): Option[B]
- Definition Classes
- IterableUtils
-
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
-
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
-
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
-
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
-
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
-
final
def
compareStack(p1: List[Int], p2: List[Int]): Int
- Definition Classes
- StackUtils
- Annotations
- @tailrec()
-
def
deepestLast[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path: Path[Item, Section, CC]): Path[Item, Section, CC]
- Definition Classes
- Paths
- val defaultCharset: Charset
-
def
equivalent[A, B, C](a: A, b: B)(implicit equiv: Equiv[C], viewA: (A) ⇒ C, viewB: (B) ⇒ C): Boolean
- Definition Classes
- EquivFunctions
-
def
error(string: String): Nothing
- Definition Classes
- Iteratees
-
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
-
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
-
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
-
def
following[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path: Path[Item, Section, CC]): Option[Path[Item, Section, CC]]
- Definition Classes
- Paths
-
def
getList[K, T](key: K, mapToList: ConcurrentHashMap[K, ConcurrentLinkedQueue[T]]): ConcurrentLinkedQueue[T]
- Definition Classes
- ConcurrentMapUtils
-
implicit
val
idIteratees: IterateeFunctions[scalaz.Id.Id]
- Definition Classes
- Iteratees
-
implicit
val
ioIteratees: IterateeFunctions[IO]
- Definition Classes
- Iteratees
-
final
def
item[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](item: Item): ItemOrTree[Item, Section, CC]
- Annotations
- @inline()
-
def
iterateesOf[F[_]](implicit F: Monad[F]): IterateeFunctions[F]
- Definition Classes
- Iteratees
-
def
mkString[A](itr: Iterable[A], builder: StringBuilder, separator: String)(thunk: (A) ⇒ String): StringBuilder
- Definition Classes
- IterableUtils
-
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
-
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
-
final
def
one[T](i: T): List[T]
- Annotations
- @inline()
-
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
-
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
-
def
preceding[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path: Path[Item, Section, CC]): Option[Path[Item, Section, CC]]
- Definition Classes
- Paths
-
def
removeList[K, T](key: K, mapToList: ConcurrentHashMap[K, ConcurrentLinkedQueue[T]]): ConcurrentLinkedQueue[T]
- Definition Classes
- ConcurrentMapUtils
-
def
removeOr[K, T](key: K, map: ConcurrentHashMap[K, T])(newT: ⇒ T): T
- Definition Classes
- ConcurrentMapUtils
- def resource(a: AnyRef, path: String): URL
-
def
rootPath[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](path: Path[Item, Section, CC]): Path[Item, Section, CC]
- Definition Classes
- Paths
-
def
sameBase(test: List[Int], against: List[Int]): Boolean
- Definition Classes
- StackUtils
-
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
-
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
-
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
-
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
-
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()
-
def
toPositionalEqual[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]]: Equal[Path[Item, Section, CC]]
- Definition Classes
- Paths
-
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
-
implicit
val
trampolineIteratees: IterateeFunctions[Trampoline]
- Definition Classes
- Iteratees
-
def
valueOf[K, T](key: K, map: ConcurrentHashMap[K, T])(newT: ⇒ T): T
- Definition Classes
- ConcurrentMapUtils