GeneralIndexedSeqOps

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   Any

2. final def ##(): Int

   

   Definition Classes

   Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   Any

4. val __: IndexedSeq[A]

   

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. macro def choose[B](q: PartialFunction[A, B]): Maybe[B]

   

7. macro def count(p: (A) ⇒ Boolean): Int

   

8. macro def eagerly: StrictIndexedSeqOps[A, IndexedSeq[_]]

   

9. macro def exists(p: (A) ⇒ Boolean): Boolean

   

10. macro def find(p: (A) ⇒ Boolean): Maybe[A]

    

11. macro def fold[B >: A](z: B)(op: (B, B) ⇒ B): B

    

12. macro def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

    

13. macro def foldRight[B](z: B)(op: (A, B) ⇒ B): B

    

14. macro def forall(p: (A) ⇒ Boolean): Boolean

    

15. macro def foreach[U](f: (A) ⇒ U): Unit

    

16. def getClass(): Class[_ <: AnyVal]

    

    Definition Classes

    AnyVal → Any

17. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

18. macro def lazily: NonStrictIndexedSeqOps[A]

    

19. macro def mayReduce[B >: A](op: (B, B) ⇒ B): Maybe[B]

    

20. macro def mayReduceLeft[B >: A](op: (B, A) ⇒ B): Maybe[B]

    

21. macro def mayReduceRight[B >: A](op: (A, B) ⇒ B): Maybe[B]

    

22. macro def reduce[B >: A](op: (B, B) ⇒ B): B

    

23. macro def reduceLeft[B >: A](op: (B, A) ⇒ B): B

    

24. macro def reduceRight[B >: A](op: (A, B) ⇒ B): B

    

25. def toString(): String

    

    Definition Classes

    Any