<!doctype html>
<title>CodeMirror: Scala mode</title>
<meta charset="utf-8"/>
<link rel=stylesheet href="../../doc/docs.css">
<link rel="stylesheet" href="../../lib/codemirror.css">
<link rel="stylesheet" href="../../theme/ambiance.css">
<script src="../../lib/codemirror.js"></script>
<script src="../../addon/edit/matchbrackets.js"></script>
<script src="clike.js"></script>
<div id=nav>
<a href="http://codemirror.net"><h1>CodeMirror</h1><img id=logo src="../../doc/logo.png"></a>
<ul>
<li><a href="../../index.html">Home</a>
<li><a href="../../doc/manual.html">Manual</a>
<li><a href="https://github.com/codemirror/codemirror">Code</a>
</ul>
<ul>
<li><a href="../index.html">Language modes</a>
<li><a class=active href="#">Scala</a>
</ul>
</div>
<article>
<h2>Scala mode</h2>
<form>
<textarea id="code" name="code">
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2003-2011, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | http://scala-lang.org/ **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
\* */
package scala.collection
import generic._
import mutable.{ Builder, ListBuffer }
import annotation.{tailrec, migration, bridge}
import annotation.unchecked.{ uncheckedVariance => uV }
import parallel.ParIterable
/** A template trait for traversable collections of type `Traversable[A]`.
*
* $traversableInfo
* @define mutability
* @define traversableInfo
* This is a base trait of all kinds of $mutability Scala collections. It
* implements the behavior common to all collections, in terms of a method
* `foreach` with signature:
* {{{
* def foreach[U](f: Elem => U): Unit
* }}}
* Collection classes mixing in this trait provide a concrete
* `foreach` method which traverses all the
* elements contained in the collection, applying a given function to each.
* They also need to provide a method `newBuilder`
* which creates a builder for collections of the same kind.
*
* A traversable class might or might not have two properties: strictness
* and orderedness. Neither is represented as a type.
*
* The instances of a strict collection class have all their elements
* computed before they can be used as values. By contrast, instances of
* a non-strict collection class may defer computation of some of their
* elements until after the instance is available as a value.
* A typical example of a non-strict collection class is a
* <a href="../immutable/Stream.html" target="ContentFrame">
* `scala.collection.immutable.Stream`</a>.
* A more general class of examples are `TraversableViews`.
*
* If a collection is an instance of an ordered collection class, traversing
* its elements with `foreach` will always visit elements in the
* same order, even for different runs of the program. If the class is not
* ordered, `foreach` can visit elements in different orders for
* different runs (but it will keep the same order in the same run).'
*
* A typical example of a collection class which is not ordered is a
* `HashMap` of objects. The traversal order for hash maps will
* depend on the hash codes of its elements, and these hash codes might
* differ from one run to the next. By contrast, a `LinkedHashMap`
* is ordered because it's `foreach` method visits elements in the
* order they were inserted into the `HashMap`.
*
* @author Martin Odersky
* @version 2.8
* @since 2.8
* @tparam A the element type of the collection
* @tparam Repr the type of the actual collection containing the elements.
*
* @define Coll Traversable
* @define coll traversable collection
*/
trait TraversableLike[+A, +Repr] extends HasNewBuilder[A, Repr]
with FilterMonadic[A, Repr]
with TraversableOnce[A]
with GenTraversableLike[A, Repr]
with Parallelizable[A, ParIterable[A]]
{
self =>
import Traversable.breaks._
/** The type implementing this traversable */
protected type Self = Repr
/** The collection of type $coll underlying this `TraversableLike` object.
* By default this is implemented as the `TraversableLike` object itself,
* but this can be overridden.
*/
def repr: Repr = this.asInstanceOf[Repr]
/** The underlying collection seen as an instance of `$Coll`.
* By default this is implemented as the current collection object itself,
* but this can be overridden.
*/
protected[this] def thisCollection: Traversable[A] = this.asInstanceOf[Traversable[A]]
/** A conversion from collections of type `Repr` to `$Coll` objects.
* By default this is implemented as just a cast, but this can be overridden.
*/
protected[this] def toCollection(repr: Repr): Traversable[A] = repr.asInstanceOf[Traversable[A]]
/** Creates a new builder for this collection type.
*/
protected[this] def newBuilder: Builder[A, Repr]
protected[this] def parCombiner = ParIterable.newCombiner[A]
/** Applies a function `f` to all elements of this $coll.
*
* Note: this method underlies the implementation of most other bulk operations.
* It's important to implement this method in an efficient way.
*
*
* @param f the function that is applied for its side-effect to every element.
* The result of function `f` is discarded.
*
* @tparam U the type parameter describing the result of function `f`.
* This result will always be ignored. Typically `U` is `Unit`,
* but this is not necessary.
*
* @usecase def foreach(f: A => Unit): Unit
*/
def foreach[U](f: A => U): Unit
/** Tests whether this $coll is empty.
*
* @return `true` if the $coll contain no elements, `false` otherwise.
*/
def isEmpty: Boolean = {
var result = true
breakable {
for (x <- this) {
result = false
break
}
}
result
}
/** Tests whether this $coll is known to have a finite size.
* All strict collections are known to have finite size. For a non-strict collection
* such as `Stream`, the predicate returns `true` if all elements have been computed.
* It returns `false` if the stream is not yet evaluated to the end.
*
* Note: many collection methods will not work on collections of infinite sizes.
*
* @return `true` if this collection is known to have finite size, `false` otherwise.
*/
def hasDefiniteSize = true
def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = {
val b = bf(repr)
if (that.isInstanceOf[IndexedSeqLike[_, _]]) b.sizeHint(this, that.seq.size)
b ++= thisCollection
b ++= that.seq
b.result
}
@bridge
def ++[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That =
++(that: GenTraversableOnce[B])(bf)
/** Concatenates this $coll with the elements of a traversable collection.
* It differs from ++ in that the right operand determines the type of the
* resulting collection rather than the left one.
*
* @param that the traversable to append.
* @tparam B the element type of the returned collection.
* @tparam That $thatinfo
* @param bf $bfinfo
* @return a new co
基于Node.js的云转码切片平台express-ffmpeg通用版设计源码 （605个子文件） 
AUTHORS 6KB fonts.conf 2KB editormd.css 81KB layui.css 68KB editormd.min.css 60KB editormd.preview.css 59KB editormd.preview.min.css 44KB DPlayer.min.css 43KB ambiance.css 26KB swiper.min.css 19KB layer.css 14KB layer.css 14KB layui.mobile.css 10KB style.css 9KB codemirror.css 8KB laydate.css 7KB codemirror.min.css 5KB layer.css 5KB mdn-like.css 5KB solarized.css 5KB merge.css 3KB lint.css 3KB xq-dark.css 3KB lesser-dark.css 2KB pastel-on-dark.css 2KB xq-light.css 2KB editormd.logo.css 2KB tomorrow-night-eighties.css 2KB erlang-dark.css 2KB zenburn.css 2KB twilight.css 2KB midnight.css 2KB vibrant-ink.css 2KB mbo.css 2KB base16-dark.css 2KB base16-light.css 2KB tern.css 2KB 3024-night.css 2KB paraiso-dark.css 2KB paraiso-light.css 2KB tomorrow-night-bright.css 2KB 3024-day.css 2KB blackboard.css 2KB colorforth.css 2KB editormd.logo.min.css 2KB the-matrix.css 2KB night.css 2KB rubyblue.css 2KB monokai.css 1KB cobalt.css 1KB simplescrollbars.css 1KB eclipse.css 1KB code.css 1KB neo.css 932B elegant.css 768B neat.css 693B show-hint.css 662B dialog.css 502B tiki.css 440B foldgutter.css 435B tiddlywiki.css 220B matchesonscrollbar.css 188B fullscreen.css 116B ambiance-mobile.css 103B fontawesome-webfont.eot 59KB iconfont.eot 40KB editormd-logo.eot 1KB
loading@3x.gif 21KB loading@2x.gif 16KB 59.gif 10KB 22.gif 10KB 24.gif 8KB loading.gif 8KB 13.gif 7KB 16.gif 7KB 39.gif 6KB 64.gif 6KB 63.gif 6KB 50.gif 6KB loading-0.gif 6KB loading-0.gif 6KB 4.gif 6KB 1.gif 5KB 42.gif 5KB 71.gif 5KB 21.gif 5KB 20.gif 5KB 29.gif 5KB 70.gif 4KB 5.gif 4KB 17.gif 4KB 27.gif 4KB 9.gif 4KB 44.gif 4KB 11.gif 4KB 8.gif 4KB 3.gif 4KB 23.gif 4KB 34.gif 4KB 41.gif 4KB共 605 条
- 1
- 2
- 3
- 4
- 5
- 6
- 7
资源评论
csbysj2020
- 粉丝: 3203
- 资源: 6141
最新资源
- 基于断裂力学理论及COMSOL模拟的横观各向同性介质水力压裂扩展：考虑裂纹形态变化、单边拉伸剪切及地应力影响的相场法模拟研究,基于COMSOL软件的水力压裂模拟研究：从多裂纹扩展到断裂力学的破坏分析
- 基于断裂力学理论与Comsol软件模拟横观各向同性介质水力压裂裂纹扩展模型及多工况下裂纹扩展的相场法数值模拟研究,基于断裂力学理论与comsol软件的横观各向同性介质水力压裂裂纹扩展模型研究及相场法数
- Springboot+vue的敬老院管理系统。Javaee项目，springboot vue前后端分离项目。
- 《COMSOL模拟多裂纹水力压裂扩展：拉伸与压缩破坏下的应用研究》,探究comsol多裂纹水力压裂扩展机制：拉伸与压缩下的破坏行为分析,comsol多裂纹水力压裂扩展，可以实现拉伸和压缩下的破坏
- Springboot+vue的新冠病毒密接者跟踪系统(有报告)。Javaee项目，springboot vue前后端分离项目
- 经典激光技术：COMSOL模拟下的激光烧蚀、融覆与选区激光融化-探究熔池内复杂输运现象及热行为对凝固组织与性能的影响,深度解析激光直接沉积过程中的复杂输运现象与热行为影响-以COMSOL激光烧
- 智慧社区解决方案PPT(45页).pptx
- 智慧社区示范区智能化系统详细规划设计方案PPT(43页).pptx
- 智慧社区解决方案-8Word(152页).docx
- 智慧社区物联网解决方案PPT(31页).pptx
- 智慧社区解决方案-5PPT(26页).pptx
- 智慧社区解决方案-7PPT(36页).pptx
- 35页-智慧社区解决方案.pdf
- 智慧社区项目方案PPT(38页).pptx
- 基于Springboot的智慧社区居家养老健康管理系统（有报告）。Javaee项目，springboot项目。
- 38页-智能智慧社区解决方案.pdf
资源上传下载、课程学习等过程中有任何疑问或建议，欢迎提出宝贵意见哦~我们会及时处理！
点击此处反馈
