<!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
基于SpringBoot的博客系统blog.zip （445个子文件） 
AUTHORS 6KB mvnw.cmd 6KB editormd.css 76KB editormd.min.css 60KB editormd.preview.css 55KB editormd.preview.min.css 44KB ambiance.css 26KB animate.css 23KB codemirror.css 8KB typo.css 7KB codemirror.min.css 5KB mdn-like.css 5KB solarized.css 5KB merge.css 3KB me.css 3KB lint.css 3KB xq-dark.css 3KB prism.css 3KB lesser-dark.css 2KB pastel-on-dark.css 2KB xq-light.css 2KB tomorrow-night-eighties.css 2KB editormd.logo.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 neo.css 932B tocbot.css 928B 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 editormd-logo.eot 1KB
loading@3x.gif 21KB loading@2x.gif 16KB loading.gif 8KB tongji.gif 2KB .gitignore 306B
scala.html 28KB index.html 22KB index.html 17KB index.html 13KB index.html 13KB index.html 11KB index.html 10KB index.html 9KB index.html 8KB index.html 8KB index.html 8KB index.html 7KB index.html 7KB index.html 6KB index.html 6KB index.html 6KB index.html 6KB index.html 6KB index.html 6KB _fragments.html 5KB index.html 5KB index.html 5KB index.html 4KB index.html 4KB index.html 4KB index.html 4KB index.html 4KB index.html 4KB index.html 4KB less.html 4KB index.html 4KB index.html 3KB index.html 3KB index.html 3KB共 445 条
- 1
- 2
- 3
- 4
- 5
资源评论
枫蜜柚子茶
- 粉丝: 9051
- 资源: 5352
最新资源
- 光伏电池模型 Matlab Simulink仿真模型（成品） 模拟了光伏电池的输出特性，可以自行改变光照强度和温度得到多组U-P、U-I曲线 图中光照强度400，温度为25度，这两个参数均可调节
- weixin小程序项目基于JAVA微信点餐小程序设计+ssm.zip
- weixin小程序项目基于微信的乐室预约小程序+ssm.zip
- weixin小程序项目会议发布与预约系统的设计与开发+ssm.zip
- weixin小程序项目绘画学习平台+ssm.zip
- weixin小程序项目基于h 移动网赚项目设计与实现+springboot.zip
- weixin小程序项目互助学习小程序的设计与实现+ssm.zip
- weixin小程序项目个人健康数据管理系统的设计与实现+ssm.zip
- weixin小程序项目公交信息在线查询系统+ssm.zip
- 光伏电池MATLAB数据线，Visio，可自己调，可直接使用，有快速出线教程
- weixin小程序项目高校寻物平台+ssm.zip
- weixin小程序项目房屋租赁管理系统的设计与实现+ssm.zip
- weixin小程序项目高校体育场管理系统+ssm.zip
- weixin小程序项目儿童预防接种预约微信小程序+springboot.zip
- weixin小程序项目订餐系统设计与实现+ssm.zip
- weixin小程序项目电子商城购物平台的设计与开发+ssm.zip
资源上传下载、课程学习等过程中有任何疑问或建议，欢迎提出宝贵意见哦~我们会及时处理！
点击此处反馈
