SequencesandArrays

final def !=(arg0: Any): Boolean

def !==[T](right: Spread[T]): TripleEqualsInvocationOnSpread[T]

def !==(right: Null): TripleEqualsInvocation[Null]

def !==[T](right: T): TripleEqualsInvocation[T]

final def ##(): Int

def <[T](right: T)(implicit arg0: Ordering[T]): ResultOfLessThanComparison[T]

def <=[T](right: T)(implicit arg0: Ordering[T]): ResultOfLessThanOrEqualToComparison[T]

final def ==(arg0: Any): Boolean

def ===[T](right: Spread[T]): TripleEqualsInvocationOnSpread[T]

def ===(right: Null): TripleEqualsInvocation[Null]

def ===[T](right: T): TripleEqualsInvocation[T]

def >[T](right: T)(implicit arg0: Ordering[T]): ResultOfGreaterThanComparison[T]

def >=[T](right: T)(implicit arg0: Ordering[T]): ResultOfGreaterThanOrEqualToComparison[T]

def a[T](implicit arg0: Manifest[T]): ResultOfATypeInvocation[T]

val a: AWord

val after: TheAfterWord

def alert: Alerter

def all(xs: String)(implicit collecting: Collecting[Char, String]): ResultOfCollectedAny[Char]

def all[K, V, JMAP[k, v] <: Map[k, v]](xs: JMAP[K, V])(implicit collecting: Collecting[Entry[K, V], JMAP[K, V]]): ResultOfCollectedAny[Entry[K, V]]

def all[E, C[_]](xs: C[E])(implicit collecting: Collecting[E, C[E]]): ResultOfCollectedAny[E]

def allOf(firstEle: Any, secondEle: Any, remainingEles: Any*): ResultOfAllOfApplication

def an[T](implicit arg0: Manifest[T]): ResultOfAnTypeInvocation[T]

val an: AnWord

final def asInstanceOf[T0]: T0

macro def assert(condition: Boolean, clue: Any): Unit

macro def assert(condition: Boolean): Unit

macro def assertCompiles(code: String): Unit

macro def assertDoesNotCompile(code: String): Unit

def assertResult(expected: Any)(actual: Any): Unit

def assertResult(expected: Any, clue: Any)(actual: Any): Unit

macro def assertTypeError(code: String): Unit

val assertionsHelper: AssertionsHelper

macro def assume(condition: Boolean, clue: Any): Unit

macro def assume(condition: Boolean): Unit

def atLeast(num: Int, xs: String)(implicit collecting: Collecting[Char, String]): ResultOfCollectedAny[Char]

def atLeast[K, V, JMAP[k, v] <: Map[k, v]](num: Int, xs: JMAP[K, V])(implicit collecting: Collecting[Entry[K, V], JMAP[K, V]]): ResultOfCollectedAny[Entry[K, V]]

def atLeast[E, C[_]](num: Int, xs: C[E])(implicit collecting: Collecting[E, C[E]]): ResultOfCollectedAny[E]

def atLeastOneOf(firstEle: Any, secondEle: Any, remainingEles: Any*): ResultOfAtLeastOneOfApplication

def atMost(num: Int, xs: String)(implicit collecting: Collecting[Char, String]): ResultOfCollectedAny[Char]

def atMost[K, V, JMAP[k, v] <: Map[k, v]](num: Int, xs: JMAP[K, V])(implicit collecting: Collecting[Entry[K, V], JMAP[K, V]]): ResultOfCollectedAny[Entry[K, V]]

def atMost[E, C[_]](num: Int, xs: C[E])(implicit collecting: Collecting[E, C[E]]): ResultOfCollectedAny[E]

def atMostOneOf(firstEle: Any, secondEle: Any, remainingEles: Any*): ResultOfAtMostOneOfApplication

val be: BeWord

val behave: BehaveWord

val behavior: BehaviorWord

def between(from: Int, upTo: Int, xs: String)(implicit collecting: Collecting[Char, String]): ResultOfCollectedAny[Char]

def between[K, V, JMAP[k, v] <: Map[k, v]](from: Int, upTo: Int, xs: JMAP[K, V])(implicit collecting: Collecting[Entry[K, V], JMAP[K, V]]): ResultOfCollectedAny[Entry[K, V]]

def between[E, C[_]](from: Int, upTo: Int, xs: C[E])(implicit collecting: Collecting[E, C[E]]): ResultOfCollectedAny[E]

def cancel(cause: Throwable): Nothing

def cancel(message: String, cause: Throwable): Nothing

def cancel(message: String): Nothing

def cancel(): Nothing

def clone(): AnyRef

val compile: CompileWord

val contain: ContainWord

def conversionCheckedConstraint[A, B](implicit equivalenceOfA: Equivalence[A], cnv: (B) ⇒ A): Constraint[A, B]

def convertEquivalenceToAToBConstraint[A, B](equivalenceOfB: Equivalence[B])(implicit ev: <:<[A, B]): Constraint[A, B]

def convertEquivalenceToAToBConversionConstraint[A, B](equivalenceOfB: Equivalence[B])(implicit ev: (A) ⇒ B): Constraint[A, B]

def convertEquivalenceToBToAConstraint[A, B](equivalenceOfA: Equivalence[A])(implicit ev: <:<[B, A]): Constraint[A, B]

def convertEquivalenceToBToAConversionConstraint[A, B](equivalenceOfA: Equivalence[A])(implicit ev: (B) ⇒ A): Constraint[A, B]

implicit def convertNumericToPlusOrMinusWrapper[T](pivot: T)(implicit arg0: Numeric[T]): PlusOrMinusWrapper[T]

implicit def convertSymbolToHavePropertyMatcherGenerator(symbol: Symbol): HavePropertyMatcherGenerator

implicit def convertToAnyShouldWrapper[T](o: T): AnyShouldWrapper[T]

def convertToCheckingEqualizer[T](left: T): CheckingEqualizer[T]

implicit def convertToEqualizer[T](left: T): Equalizer[T]

implicit def convertToInAndIgnoreMethods(resultOfStringPassedToVerb: ResultOfStringPassedToVerb): InAndIgnoreMethods

implicit def convertToInAndIgnoreMethodsAfterTaggedAs(resultOfTaggedAsInvocation: ResultOfTaggedAsInvocation): InAndIgnoreMethodsAfterTaggedAs

def convertToLegacyCheckingEqualizer[T](left: T): LegacyCheckingEqualizer[T]

def convertToLegacyEqualizer[T](left: T): LegacyEqualizer[T]

implicit def convertToRegexWrapper(o: Regex): RegexWrapper

implicit def convertToStringCanWrapper(o: String): StringCanWrapperForVerb

implicit def convertToStringMustWrapper(o: String): StringMustWrapperForVerb

implicit def convertToStringShouldWrapper(o: String): StringShouldWrapper

val decided: DecidedWord

def defaultEquality[A]: Equality[A]

val defined: DefinedWord

def definedAt[T](right: T): ResultOfDefinedAt[T]

val determined: DeterminedWord

val empty: EmptyWord

val endWith: EndWithWord

final def eq(arg0: AnyRef): Boolean

def equal(o: Null): Matcher[AnyRef]

def equal[T](spread: Spread[T]): Matcher[T]

def equal(right: Any): MatcherFactory1[Any, Equality]

def equals(arg0: Any): Boolean

def every(xs: String)(implicit collecting: Collecting[Char, String]): ResultOfCollectedAny[Char]

def every[K, V, JMAP[k, v] <: Map[k, v]](xs: JMAP[K, V])(implicit collecting: Collecting[Entry[K, V], JMAP[K, V]]): ResultOfCollectedAny[Entry[K, V]]

def every[E, C[_]](xs: C[E])(implicit collecting: Collecting[E, C[E]]): ResultOfCollectedAny[E]

def exactly(num: Int, xs: String)(implicit collecting: Collecting[Char, String]): ResultOfCollectedAny[Char]

def exactly[K, V, JMAP[k, v] <: Map[k, v]](num: Int, xs: JMAP[K, V])(implicit collecting: Collecting[Entry[K, V], JMAP[K, V]]): ResultOfCollectedAny[Entry[K, V]]

def exactly[E, C[_]](num: Int, xs: C[E])(implicit collecting: Collecting[E, C[E]]): ResultOfCollectedAny[E]

final def execute: Unit

final def execute(testName: String, configMap: ConfigMap, color: Boolean, durations: Boolean, shortstacks: Boolean, fullstacks: Boolean, stats: Boolean): Unit

val exist: ExistWord

def expectedTestCount(filter: Filter): Int

def fail(cause: Throwable): Nothing

def fail(message: String, cause: Throwable): Nothing

def fail(message: String): Nothing

def fail(): Nothing

def filterArraySequencesandArrays(res0: String, res1: String): Unit

You can also filter Arrays in the same way:

def filterPredicateSequencesandArrays(res0: String, res1: String): Unit

You can filter any sequence based on a predicate:

def finalize(): Unit

def fromForComprehensionSequencesandArrays(res0: List[Int]): Unit

You can create a sequence from a for comprehension:

val fullyMatch: FullyMatchWord

final def getClass(): Class[_]

def hashCode(): Int

val have: HaveWord

val ignore: IgnoreWord

def inOrder(firstEle: Any, secondEle: Any, remainingEles: Any*): ResultOfInOrderApplication

def inOrderOnly[T](firstEle: Any, secondEle: Any, remainingEles: Any*): ResultOfInOrderOnlyApplication

val include: IncludeWord

def info: Informer

def intercept[T <: AnyRef](f: ⇒ Any)(implicit manifest: Manifest[T]): T

final def isInstanceOf[T0]: Boolean

val it: ItWord

val key: KeyWord

val length: LengthWord

def lowPriorityConversionCheckedConstraint[A, B](implicit equivalenceOfB: Equivalence[B], cnv: (A) ⇒ B): Constraint[A, B]

def lowPriorityTypeCheckedConstraint[A, B](implicit equivalenceOfB: Equivalence[B], ev: <:<[A, B]): Constraint[A, B]

def mapValuesSequencesandArrays(res0: List[String]): Unit

You can map values in a sequence through a function:

def markup: Documenter

val matchPattern: MatchPatternWord

def message(expectedMessage: String): ResultOfMessageWordApplication

final def ne(arg0: AnyRef): Boolean

def nestedSuites: IndexedSeq[Suite]

def no(xs: String)(implicit collecting: Collecting[Char, String]): ResultOfCollectedAny[Char]

def no[K, V, JMAP[k, v] <: Map[k, v]](xs: JMAP[K, V])(implicit collecting: Collecting[Entry[K, V], JMAP[K, V]]): ResultOfCollectedAny[Entry[K, V]]

def no[E, C[_]](xs: C[E])(implicit collecting: Collecting[E, C[E]]): ResultOfCollectedAny[E]

val noException: NoExceptionWord

def noneOf(firstEle: Any, secondEle: Any, remainingEles: Any*): ResultOfNoneOfApplication

val not: NotWord

def note: Notifier

final def notify(): Unit

final def notifyAll(): Unit

def of[T](implicit ev: Manifest[T]): ResultOfOfTypeInvocation[T]

def oneOf(firstEle: Any, secondEle: Any, remainingEles: Any*): ResultOfOneOfApplication

def only(xs: Any*): ResultOfOnlyApplication

def orderedElementsSequencesandArrays(res0: List[Int]): Unit

Sequences are special cases of iterable collections of class Iterable.

def pending: PendingNothing

def pendingUntilFixed(f: ⇒ Unit): Unit

def produce[T](implicit arg0: Manifest[T]): ResultOfProduceInvocation[T]

val readable: ReadableWord

val regex: RegexWord

final def registerIgnoredTest(testText: String, testTags: Tag*)(testFun: ⇒ Unit): Unit

final def registerTest(testText: String, testTags: Tag*)(testFun: ⇒ Unit): Unit

def rerunner: Option[String]

def run(testName: Option[String], args: Args): Status

final def run(testName: Option[String], reporter: Reporter, stopper: Stopper, filter: Filter, configMap: Map[String, Any], distributor: Option[Distributor], tracker: Tracker): Status

def runNestedSuites(args: Args): Status

def runTest(testName: String, args: Args): Status

def runTests(testName: Option[String], args: Args): Status

def sequentialCollectionSequencesandArrays(res0: Int, res1: Int, res2: Int): Unit

Scala provides a data structure, the array, which stores a fixed-size sequential collection of elements of the same type.

implicit val shorthandSharedTestRegistrationFunction: (String) ⇒ BehaveWord

implicit val shorthandTestRegistrationFunction: (String, String, String) ⇒ ResultOfStringPassedToVerb

val size: SizeWord

val sorted: SortedWord

val startWith: StartWithWord

final val styleName: String

def suiteId: String

def suiteName: String

final def synchronized[T0](arg0: ⇒ T0): T0

def tags: Map[String, Set[String]]

def testDataFor(testName: String, theConfigMap: ConfigMap): TestData

def testNames: Set[String]

def the[T](implicit arg0: Manifest[T]): ResultOfTheTypeInvocation[T]

def theSameElementsAs(xs: GenTraversable[_]): ResultOfTheSameElementsAsApplication

def theSameElementsInOrderAs(xs: GenTraversable[_]): ResultOfTheSameElementsInOrderAsApplication

val theSameInstanceAs: TheSameInstanceAsPhrase

val they: TheyWord

def thrownBy(fun: ⇒ Any): ResultOfThrownByApplication

def toString(): String

def trap[T](f: ⇒ T): Throwable

val typeCheck: TypeCheckWord

def typeCheckedConstraint[A, B](implicit equivalenceOfA: Equivalence[A], ev: <:<[B, A]): Constraint[A, B]

implicit def unconstrainedEquality[A, B](implicit equalityOfA: Equality[A]): Constraint[A, B]

val value: ValueWord

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withClue[T](clue: Any)(fun: ⇒ T): T

def withConditionSequencesandArrays(res0: List[Int]): Unit

You can create a sequence from a for comprehension with a condition:

def withFixture(test: NoArgTest): Outcome

val writable: WritableWord

def assert(o: Option[String]): Unit

def assert(o: Option[String], clue: Any): Unit

def assume(o: Option[String]): Unit

def assume(o: Option[String], clue: Any): Unit

def evaluating(fun: ⇒ Any): ResultOfEvaluatingApplication

def expect(expected: Any)(actual: Any): Unit

def expect(expected: Any, clue: Any)(actual: Any): Unit

def expectResult(expected: Any)(actual: Any): Unit

def expectResult(expected: Any, clue: Any)(actual: Any): Unit