Created
March 2, 2017 05:53
-
-
Save paulp/05482043c91c694923dfacf31fa1e5e6 to your computer and use it in GitHub Desktop.
library recursion
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| [info] Compiling 584 Scala sources and 120 Java sources to /s/github/scala/scala/build/quick/classes/library... | |
| [warn] scala/Responder.scala:44: [wartremover:Recursion] Unmarked recursion | |
| [warn] for (_ <- r; y <- loop(r)) yield y | |
| [warn] ^ | |
| [warn] scala/Responder.scala:47: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (cond) for (_ <- r; y <- loopWhile(cond)(r)) yield y | |
| [warn] ^ | |
| [warn] scala/StringContext.scala:240: [wartremover:Recursion] Unmarked recursion | |
| [warn] loop(idx, str.indexOf('\\', idx)) | |
| [warn] ^ | |
| [warn] scala/collection/IndexedSeqOptimized.scala:56: [wartremover:Recursion] Unmarked recursion | |
| [warn] else foldl(start + 1, end, op(z, this(start)), op) | |
| [warn] ^ | |
| [warn] scala/collection/IndexedSeqOptimized.scala:61: [wartremover:Recursion] Unmarked recursion | |
| [warn] else foldr(start, end - 1, op(this(end - 1), z), op) | |
| [warn] ^ | |
| [warn] scala/collection/Iterator.scala:189: [wartremover:Recursion] Unmarked recursion | |
| [warn] } else advance() | |
| [warn] ^ | |
| [warn] scala/collection/Iterator.scala:204: [wartremover:Recursion] Unmarked recursion | |
| [warn] merge() | |
| [warn] ^ | |
| [warn] scala/collection/Iterator.scala:724: [wartremover:Recursion] Unmarked recursion | |
| [warn] case 1 => store(hd) ; status = 0 ; finish() | |
| [warn] ^ | |
| [warn] scala/collection/Iterator.scala:1403: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (self.hasNext) Stream.cons(self.next(), self.toStream) | |
| [warn] ^ | |
| [warn] scala/collection/LinearSeqLike.scala:67: [wartremover:Recursion] Unmarked recursion | |
| [warn] else that.nonEmpty && p(head, that.head) && (tail corresponds that.tail)(p) | |
| [warn] ^ | |
| [warn] scala/collection/LinearSeqOptimized.scala:131: [wartremover:Recursion] Unmarked recursion | |
| [warn] else op(head, tail.foldRight(z)(op)) | |
| [warn] ^ | |
| [warn] scala/collection/LinearSeqOptimized.scala:142: [wartremover:Recursion] Unmarked recursion | |
| [warn] else op(head, tail.reduceRight(op)) | |
| [warn] ^ | |
| [warn] scala/collection/LinearSeqOptimized.scala:272: [wartremover:Recursion] Unmarked recursion | |
| [warn] loop(i + 1, xs.tail) | |
| [warn] ^ | |
| [warn] scala/collection/Searching.scala:94: [wartremover:Recursion] Unmarked recursion | |
| [warn] case -1 => binarySearch(elem, from, idx)(ord) | |
| [warn] ^ | |
| [warn] scala/collection/Searching.scala:95: [wartremover:Recursion] Unmarked recursion | |
| [warn] case 1 => binarySearch(elem, idx + 1, to)(ord) | |
| [warn] ^ | |
| [warn] scala/collection/SeqViewLike.scala:80: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (idx < index(mid)) findRow(idx, lo, mid - 1) | |
| [warn] ^ | |
| [warn] scala/collection/SeqViewLike.scala:81: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (idx >= index(mid + 1)) findRow(idx, mid + 1, hi) | |
| [warn] ^ | |
| [warn] scala/collection/SortedMapLike.scala:78: [wartremover:Recursion] Unmarked recursion | |
| [warn] override def rangeImpl(from : Option[A], until : Option[A]): SortedMap[A, B] = self.rangeImpl(from, until).filterKeys(p) | |
| [warn] ^ | |
| [warn] scala/collection/SortedMapLike.scala:86: [wartremover:Recursion] Unmarked recursion | |
| [warn] override def rangeImpl(from : Option[A], until : Option[A]): SortedMap[A, C] = self.rangeImpl(from, until).mapValues(f) | |
| [warn] ^ | |
| [warn] scala/collection/TraversableOnce.scala:289: [wartremover:Recursion] Unmarked recursion | |
| [warn] else toBuffer.toArray | |
| [warn] ^ | |
| [warn] scala/collection/TraversableOnce.scala:464: [wartremover:Recursion] Unmarked recursion | |
| [warn] def hasNext: Boolean = it.hasNext || its.hasNext && { it = its.next().toIterator; hasNext } | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:50: [wartremover:Recursion] Unmarked recursion | |
| [warn] else GCAS_Complete(/*READ*/mainnode, ct) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:63: [wartremover:Recursion] Unmarked recursion | |
| [warn] else GCAS_Complete(m, ct) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:67: [wartremover:Recursion] Unmarked recursion | |
| [warn] GCAS_Complete(/*READ*/mainnode, ct) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:113: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (startgen eq in.gen) in.rec_insert(k, v, hc, lev + 5, this, startgen, ct) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:115: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (GCAS(cn, cn.renewed(startgen, ct), ct)) rec_insert(k, v, hc, lev, parent, startgen, ct) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:159: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (startgen eq in.gen) in.rec_insertif(k, v, hc, cond, lev + 5, this, startgen, ct) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:161: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (GCAS(cn, cn.renewed(startgen, ct), ct)) rec_insertif(k, v, hc, cond, lev, parent, startgen, ct) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:249: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (ct.isReadOnly || (startgen eq in.gen)) in.rec_lookup(k, hc, lev + 5, this, startgen, ct) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:251: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (GCAS(cn, cn.renewed(startgen, ct), ct)) rec_lookup(k, hc, lev, parent, startgen, ct) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:292: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (startgen eq in.gen) in.rec_remove(k, v, hc, lev + 5, this, startgen, ct) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:294: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (GCAS(cn, cn.renewed(startgen, ct), ct)) rec_remove(k, v, hc, lev, parent, startgen, ct) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:321: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (ct.readRoot().gen == startgen) cleanParent(nonlive) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:575: [wartremover:Recursion] Unmarked recursion | |
| [warn] case cn: CNode[K, V] => cn.collectElems | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:599: [wartremover:Recursion] Unmarked recursion | |
| [warn] subinode.mainnode = dual(x, xhc, y, yhc, lev + 5, gen) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:710: [wartremover:Recursion] Unmarked recursion | |
| [warn] else RDCSS_Complete(abort) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:717: [wartremover:Recursion] Unmarked recursion | |
| [warn] } else RDCSS_Complete(abort) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:720: [wartremover:Recursion] Unmarked recursion | |
| [warn] else RDCSS_Complete(abort) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:736: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (!r.rec_insert(k, v, hc, 0, null, r.gen, this)) inserthc(k, hc, v) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:743: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (ret eq null) insertifhc(k, hc, v, cond) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:750: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (res eq INodeBase.RESTART) lookuphc(k, hc) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:771: [wartremover:Recursion] Unmarked recursion | |
| [warn] else removehc(k, v, hc) | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:801: [wartremover:Recursion] Unmarked recursion | |
| [warn] else snapshot() | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:820: [wartremover:Recursion] Unmarked recursion | |
| [warn] else readOnlySnapshot() | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:825: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (!RDCSS_ROOT(r, r.gcasRead(this), INode.newRootNode[K, V])) clear() | |
| [warn] ^ | |
| [warn] scala/collection/concurrent/TrieMap.scala:1052: [wartremover:Recursion] Unmarked recursion | |
| [warn] advance() | |
| [warn] ^ | |
| [warn] scala/collection/generic/Growable.scala:54: [wartremover:Recursion] Unmarked recursion | |
| [warn] loop(xs.tail) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/FilteredTraversableInternal.scala:39: [wartremover:Recursion] Unmarked recursion | |
| [warn] noneIn(t) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/FilteredTraversableInternal.scala:51: [wartremover:Recursion] Unmarked recursion | |
| [warn] allIn(start, remaining.tail) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/HashMap.scala:186: [wartremover:Recursion] Unmarked recursion | |
| [warn] elems(0) = makeHashTrieMap(hash0, elem0, hash1, elem1, level + 5, size) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/HashSet.scala:241: [wartremover:Recursion] Unmarked recursion | |
| [warn] val child = makeHashTrieSet(hash0, elem0, hash1, elem1, level + 5) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/HashSet.scala:838: [wartremover:Recursion] Unmarked recursion | |
| [warn] else removeAll(s.removed0(r.head, that.hash, level), r.tail) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:125: [wartremover:Recursion] Unmarked recursion | |
| [warn] next | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:188: [wartremover:Recursion] Unmarked recursion | |
| [warn] case IntMap.Bin(_, _, left, right) => { left.foreach(f); right.foreach(f) } | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:188: [wartremover:Recursion] Unmarked recursion | |
| [warn] case IntMap.Bin(_, _, left, right) => { left.foreach(f); right.foreach(f) } | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:205: [wartremover:Recursion] Unmarked recursion | |
| [warn] case IntMap.Bin(_, _, left, right) => { left.foreachKey(f); right.foreachKey(f) } | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:205: [wartremover:Recursion] Unmarked recursion | |
| [warn] case IntMap.Bin(_, _, left, right) => { left.foreachKey(f); right.foreachKey(f) } | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:222: [wartremover:Recursion] Unmarked recursion | |
| [warn] case IntMap.Bin(_, _, left, right) => { left.foreachValue(f); right.foreachValue(f) } | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:222: [wartremover:Recursion] Unmarked recursion | |
| [warn] case IntMap.Bin(_, _, left, right) => { left.foreachValue(f); right.foreachValue(f) } | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:233: [wartremover:Recursion] Unmarked recursion | |
| [warn] val (newleft, newright) = (left.filter(f), right.filter(f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:233: [wartremover:Recursion] Unmarked recursion | |
| [warn] val (newleft, newright) = (left.filter(f), right.filter(f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:244: [wartremover:Recursion] Unmarked recursion | |
| [warn] case [email protected](prefix, mask, left, right) => b.bin(left.transform(f), right.transform(f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:244: [wartremover:Recursion] Unmarked recursion | |
| [warn] case [email protected](prefix, mask, left, right) => b.bin(left.transform(f), right.transform(f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:252: [wartremover:Recursion] Unmarked recursion | |
| [warn] case IntMap.Bin(_, _, left, right) => left.size + right.size | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:252: [wartremover:Recursion] Unmarked recursion | |
| [warn] case IntMap.Bin(_, _, left, right) => left.size + right.size | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:256: [wartremover:Recursion] Unmarked recursion | |
| [warn] case IntMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left.get(key) else right.get(key) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:256: [wartremover:Recursion] Unmarked recursion | |
| [warn] case IntMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left.get(key) else right.get(key) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:265: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (zero(key, mask)) left.getOrElse(key, default) else right.getOrElse(key, default) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:265: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (zero(key, mask)) left.getOrElse(key, default) else right.getOrElse(key, default) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:269: [wartremover:Recursion] Unmarked recursion | |
| [warn] case IntMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left(key) else right(key) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:269: [wartremover:Recursion] Unmarked recursion | |
| [warn] case IntMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left(key) else right(key) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:279: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(key, mask)) IntMap.Bin(prefix, mask, left.updated(key, value), right) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:280: [wartremover:Recursion] Unmarked recursion | |
| [warn] else IntMap.Bin(prefix, mask, left, right.updated(key, value)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:307: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(key, mask)) IntMap.Bin(prefix, mask, left.updateWith(key, value, f), right) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:308: [wartremover:Recursion] Unmarked recursion | |
| [warn] else IntMap.Bin(prefix, mask, left, right.updateWith(key, value, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:318: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(key, mask)) bin(prefix, mask, left - key, right) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:319: [wartremover:Recursion] Unmarked recursion | |
| [warn] else bin(prefix, mask, left, right - key) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:337: [wartremover:Recursion] Unmarked recursion | |
| [warn] val newleft = left.modifyOrRemove(f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:338: [wartremover:Recursion] Unmarked recursion | |
| [warn] val newright = right.modifyOrRemove(f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:365: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(p2, m1)) IntMap.Bin(p1, m1, l1.unionWith(that, f), r1) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:366: [wartremover:Recursion] Unmarked recursion | |
| [warn] else IntMap.Bin(p1, m1, l1, r1.unionWith(that, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:369: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(p1, m2)) IntMap.Bin(p2, m2, this.unionWith(l2, f), r2) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:370: [wartremover:Recursion] Unmarked recursion | |
| [warn] else IntMap.Bin(p2, m2, l2, this.unionWith(r2, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:373: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (p1 == p2) IntMap.Bin(p1, m1, l1.unionWith(l2,f), r1.unionWith(r2, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:373: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (p1 == p2) IntMap.Bin(p1, m1, l1.unionWith(l2,f), r1.unionWith(r2, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:397: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(p2, m1)) l1.intersectionWith(that, f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:398: [wartremover:Recursion] Unmarked recursion | |
| [warn] else r1.intersectionWith(that, f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:399: [wartremover:Recursion] Unmarked recursion | |
| [warn] } else if (m1 == m2) bin(p1, m1, l1.intersectionWith(l2, f), r1.intersectionWith(r2, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:399: [wartremover:Recursion] Unmarked recursion | |
| [warn] } else if (m1 == m2) bin(p1, m1, l1.intersectionWith(l2, f), r1.intersectionWith(r2, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:402: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(p1, m2)) this.intersectionWith(l2, f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:403: [wartremover:Recursion] Unmarked recursion | |
| [warn] else this.intersectionWith(r2, f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:435: [wartremover:Recursion] Unmarked recursion | |
| [warn] case Bin(_, _, l, r) => l.firstKey | |
| [warn] ^ | |
| [warn] scala/collection/immutable/IntMap.scala:445: [wartremover:Recursion] Unmarked recursion | |
| [warn] case Bin(_, _, l, r) => r.lastKey | |
| [warn] ^ | |
| [warn] scala/collection/immutable/List.scala:180: [wartremover:Recursion] Unmarked recursion | |
| [warn] loop(mappedHead, mappedLast, unchanged, pending.tail) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/List.scala:197: [wartremover:Recursion] Unmarked recursion | |
| [warn] loop(mappedHead1, mappedLast1, tail0, tail0) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/List.scala:262: [wartremover:Recursion] Unmarked recursion | |
| [warn] case _ :: tail => loop(tail, lag.tail) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/List.scala:370: [wartremover:Recursion] Unmarked recursion | |
| [warn] else loop(xs.tail) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/List.scala:412: [wartremover:Recursion] Unmarked recursion | |
| [warn] else new Stream.Cons(head, tail.toStream) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/ListMap.scala:119: [wartremover:Recursion] Unmarked recursion | |
| [warn] else sizeInternal(cur.next, acc + 1) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/ListMap.scala:128: [wartremover:Recursion] Unmarked recursion | |
| [warn] else applyInternal(cur.next, k) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/ListMap.scala:135: [wartremover:Recursion] Unmarked recursion | |
| [warn] else getInternal(cur.next, k) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/ListMap.scala:142: [wartremover:Recursion] Unmarked recursion | |
| [warn] else containsInternal(cur.next, k) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/ListMap.scala:159: [wartremover:Recursion] Unmarked recursion | |
| [warn] else removeInternal(k, cur.next, cur :: acc) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/ListSet.scala:113: [wartremover:Recursion] Unmarked recursion | |
| [warn] else sizeInternal(n.next, acc + 1) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/ListSet.scala:120: [wartremover:Recursion] Unmarked recursion | |
| [warn] !n.isEmpty && (n.elem == e || containsInternal(n.next, e)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/ListSet.scala:129: [wartremover:Recursion] Unmarked recursion | |
| [warn] else removeInternal(k, cur.next, cur :: acc) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:117: [wartremover:Recursion] Unmarked recursion | |
| [warn] next | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:180: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(_, _, left, right) => { left.foreach(f); right.foreach(f) } | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:180: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(_, _, left, right) => { left.foreach(f); right.foreach(f) } | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:197: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(_, _, left, right) => { left.foreachKey(f); right.foreachKey(f) } | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:197: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(_, _, left, right) => { left.foreachKey(f); right.foreachKey(f) } | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:214: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(_, _, left, right) => { left.foreachValue(f); right.foreachValue(f) } | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:214: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(_, _, left, right) => { left.foreachValue(f); right.foreachValue(f) } | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:225: [wartremover:Recursion] Unmarked recursion | |
| [warn] val (newleft, newright) = (left.filter(f), right.filter(f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:225: [wartremover:Recursion] Unmarked recursion | |
| [warn] val (newleft, newright) = (left.filter(f), right.filter(f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:236: [wartremover:Recursion] Unmarked recursion | |
| [warn] case [email protected](prefix, mask, left, right) => b.bin(left.transform(f), right.transform(f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:236: [wartremover:Recursion] Unmarked recursion | |
| [warn] case [email protected](prefix, mask, left, right) => b.bin(left.transform(f), right.transform(f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:244: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(_, _, left, right) => left.size + right.size | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:244: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(_, _, left, right) => left.size + right.size | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:248: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left.get(key) else right.get(key) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:248: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left.get(key) else right.get(key) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:257: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (zero(key, mask)) left.getOrElse(key, default) else right.getOrElse(key, default) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:257: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (zero(key, mask)) left.getOrElse(key, default) else right.getOrElse(key, default) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:261: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left(key) else right(key) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:261: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left(key) else right(key) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:271: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(key, mask)) LongMap.Bin(prefix, mask, left.updated(key, value), right) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:272: [wartremover:Recursion] Unmarked recursion | |
| [warn] else LongMap.Bin(prefix, mask, left, right.updated(key, value)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:299: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(key, mask)) LongMap.Bin(prefix, mask, left.updateWith(key, value, f), right) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:300: [wartremover:Recursion] Unmarked recursion | |
| [warn] else LongMap.Bin(prefix, mask, left, right.updateWith(key, value, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:310: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(key, mask)) bin(prefix, mask, left - key, right) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:311: [wartremover:Recursion] Unmarked recursion | |
| [warn] else bin(prefix, mask, left, right - key) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:329: [wartremover:Recursion] Unmarked recursion | |
| [warn] val newleft = left.modifyOrRemove(f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:330: [wartremover:Recursion] Unmarked recursion | |
| [warn] val newright = right.modifyOrRemove(f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:356: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(p2, m1)) LongMap.Bin(p1, m1, l1.unionWith(that, f), r1) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:357: [wartremover:Recursion] Unmarked recursion | |
| [warn] else LongMap.Bin(p1, m1, l1, r1.unionWith(that, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:360: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(p1, m2)) LongMap.Bin(p2, m2, this.unionWith(l2, f), r2) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:361: [wartremover:Recursion] Unmarked recursion | |
| [warn] else LongMap.Bin(p2, m2, l2, this.unionWith(r2, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:364: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (p1 == p2) LongMap.Bin(p1, m1, l1.unionWith(l2,f), r1.unionWith(r2, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:364: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (p1 == p2) LongMap.Bin(p1, m1, l1.unionWith(l2,f), r1.unionWith(r2, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:388: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(p2, m1)) l1.intersectionWith(that, f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:389: [wartremover:Recursion] Unmarked recursion | |
| [warn] else r1.intersectionWith(that, f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:390: [wartremover:Recursion] Unmarked recursion | |
| [warn] } else if (m1 == m2) bin(p1, m1, l1.intersectionWith(l2, f), r1.intersectionWith(r2, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:390: [wartremover:Recursion] Unmarked recursion | |
| [warn] } else if (m1 == m2) bin(p1, m1, l1.intersectionWith(l2, f), r1.intersectionWith(r2, f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:393: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (zero(p1, m2)) this.intersectionWith(l2, f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:394: [wartremover:Recursion] Unmarked recursion | |
| [warn] else this.intersectionWith(r2, f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:423: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(_, _, l, r) => l.firstKey | |
| [warn] ^ | |
| [warn] scala/collection/immutable/LongMap.scala:430: [wartremover:Recursion] Unmarked recursion | |
| [warn] case LongMap.Bin(_, _, l, r) => r.lastKey | |
| [warn] ^ | |
| [warn] scala/collection/immutable/PagedSeq.scala:53: [wartremover:Recursion] Unmarked recursion | |
| [warn] else (more(data, start + cnt, len - cnt) max 0) + cnt | |
| [warn] ^ | |
| [warn] scala/collection/immutable/PagedSeq.scala:56: [wartremover:Recursion] Unmarked recursion | |
| [warn] more(data, start, len) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/PagedSeq.scala:248: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (later.next != null) later = later.next.latest | |
| [warn] ^ | |
| [warn] scala/collection/immutable/PagedSeq.scala:265: [wartremover:Recursion] Unmarked recursion | |
| [warn] next.addMore(more) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:41: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (cmp < 0) lookup(tree.left, x) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:42: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (cmp > 0) lookup(tree.right, x) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:57: [wartremover:Recursion] Unmarked recursion | |
| [warn] case (Some(lb), _) if ordering.lt(tree.key, lb) => countInRange(tree.right, from, to) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:59: [wartremover:Recursion] Unmarked recursion | |
| [warn] case (_, Some(ub)) if ordering.gteq(tree.key, ub) => countInRange(tree.left, from, to) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:63: [wartremover:Recursion] Unmarked recursion | |
| [warn] case _ => 1 + countInRange(tree.left, from, None) + countInRange(tree.right, None, to) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:63: [wartremover:Recursion] Unmarked recursion | |
| [warn] case _ => 1 + countInRange(tree.left, from, None) + countInRange(tree.right, None, to) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:100: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (tree.left ne null) _foreach(tree.left, f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:102: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (tree.right ne null) _foreach(tree.right, f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:108: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (tree.left ne null) _foreachKey(tree.left, f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:110: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (tree.right ne null) _foreachKey(tree.right, f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:120: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (n < count) nth(tree.left, n) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:121: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (n > count) nth(tree.right, n - count - 1) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:155: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (cmp < 0) balanceLeft(isBlackTree(tree), tree.key, tree.value, upd(tree.left, k, v, overwrite), tree.right) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:156: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (cmp > 0) balanceRight(isBlackTree(tree), tree.key, tree.value, tree.left, upd(tree.right, k, v, overwrite)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:164: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (idx < rank) balanceLeft(isBlackTree(tree), tree.key, tree.value, updNth(tree.left, idx, k, v, overwrite), tree.right) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:165: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (idx > rank) balanceRight(isBlackTree(tree), tree.key, tree.value, tree.left, updNth(tree.right, idx - rank, k, v, overwrite)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:217: [wartremover:Recursion] Unmarked recursion | |
| [warn] def delLeft = if (isBlackTree(tree.left)) balLeft(tree.key, tree.value, del(tree.left, k), tree.right) else RedTree(tree.key, tree.value, del(tree.left, k), tree.right) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:217: [wartremover:Recursion] Unmarked recursion | |
| [warn] def delLeft = if (isBlackTree(tree.left)) balLeft(tree.key, tree.value, del(tree.left, k), tree.right) else RedTree(tree.key, tree.value, del(tree.left, k), tree.right) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:218: [wartremover:Recursion] Unmarked recursion | |
| [warn] def delRight = if (isBlackTree(tree.right)) balRight(tree.key, tree.value, tree.left, del(tree.right, k)) else RedTree(tree.key, tree.value, tree.left, del(tree.right, k)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:218: [wartremover:Recursion] Unmarked recursion | |
| [warn] def delRight = if (isBlackTree(tree.right)) balRight(tree.key, tree.value, tree.left, del(tree.right, k)) else RedTree(tree.key, tree.value, tree.left, del(tree.right, k)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:224: [wartremover:Recursion] Unmarked recursion | |
| [warn] val bc = append(tl.right, tr.left) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:231: [wartremover:Recursion] Unmarked recursion | |
| [warn] val bc = append(tl.right, tr.left) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:238: [wartremover:Recursion] Unmarked recursion | |
| [warn] RedTree(tr.key, tr.value, append(tl, tr.left), tr.right) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:240: [wartremover:Recursion] Unmarked recursion | |
| [warn] RedTree(tl.key, tl.value, tl.left, append(tl.right, tr)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:253: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (ordering.lt(tree.key, from)) return doFrom(tree.right, from) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:254: [wartremover:Recursion] Unmarked recursion | |
| [warn] val newLeft = doFrom(tree.left, from) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:261: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (ordering.lt(to, tree.key)) return doTo(tree.left, to) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:262: [wartremover:Recursion] Unmarked recursion | |
| [warn] val newRight = doTo(tree.right, to) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:269: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (ordering.lteq(until, tree.key)) return doUntil(tree.left, until) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:270: [wartremover:Recursion] Unmarked recursion | |
| [warn] val newRight = doUntil(tree.right, until) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:277: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (ordering.lt(tree.key, from)) return doRange(tree.right, from, until) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:278: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (ordering.lteq(until, tree.key)) return doRange(tree.left, from, until) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:291: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (n > count) return doDrop(tree.right, n - count - 1) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:292: [wartremover:Recursion] Unmarked recursion | |
| [warn] val newLeft = doDrop(tree.left, n) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:301: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (n <= count) return doTake(tree.left, n) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:302: [wartremover:Recursion] Unmarked recursion | |
| [warn] val newRight = doTake(tree.right, n - count - 1) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:310: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (from > count) return doSlice(tree.right, from - count - 1, until - count - 1) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:311: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (until <= count) return doSlice(tree.left, from, until) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:335: [wartremover:Recursion] Unmarked recursion | |
| [warn] else unzip(cons(next, zipper), leftMost) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:346: [wartremover:Recursion] Unmarked recursion | |
| [warn] unzipBoth(left.right, right.left, cons(left, leftZipper), cons(right, rightZipper), smallerDepth + 1) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:348: [wartremover:Recursion] Unmarked recursion | |
| [warn] unzipBoth(left.right, right.left, cons(left, leftZipper), cons(right, rightZipper), smallerDepth) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:350: [wartremover:Recursion] Unmarked recursion | |
| [warn] unzipBoth(left, right.left, leftZipper, cons(right, rightZipper), smallerDepth) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:352: [wartremover:Recursion] Unmarked recursion | |
| [warn] unzipBoth(left.right, right, cons(left, leftZipper), rightZipper, smallerDepth) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:375: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (depth == 1) zipper else findDepth(zipper.tail, depth - 1) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:377: [wartremover:Recursion] Unmarked recursion | |
| [warn] findDepth(zipper.tail, depth) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:486: [wartremover:Recursion] Unmarked recursion | |
| [warn] else findLeftMostOrPopOnEmpty(goLeft(tree)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:504: [wartremover:Recursion] Unmarked recursion | |
| [warn] pushNext(tree) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/RedBlackTree.scala:537: [wartremover:Recursion] Unmarked recursion | |
| [warn] else find( | |
| [warn] ^ | |
| [warn] scala/collection/immutable/SortedMap.scala:90: [wartremover:Recursion] Unmarked recursion | |
| [warn] override def rangeImpl(from : Option[A], until : Option[A]): SortedMap[A, B] = self.rangeImpl(from, until).filterKeys(p) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/SortedMap.scala:98: [wartremover:Recursion] Unmarked recursion | |
| [warn] override def rangeImpl(from : Option[A], until : Option[A]): SortedMap[A, C] = self.rangeImpl(from, until).mapValues(f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:252: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (isEmpty) rest.toStream else cons(head, tail append rest) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:290: [wartremover:Recursion] Unmarked recursion | |
| [warn] loop(these.tail, sep) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:369: [wartremover:Recursion] Unmarked recursion | |
| [warn] else cons(head, asStream[A](tail ++ that)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:394: [wartremover:Recursion] Unmarked recursion | |
| [warn] else cons(z, asStream[B](tail.scanLeft(op(z, head))(op))) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:415: [wartremover:Recursion] Unmarked recursion | |
| [warn] else cons(f(head), asStream[B](tail map f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:494: [wartremover:Recursion] Unmarked recursion | |
| [warn] else prefix append asStream[B](nonEmptyPrefix.tail flatMap f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:531: [wartremover:Recursion] Unmarked recursion | |
| [warn] tail.foreach(f) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:546: [wartremover:Recursion] Unmarked recursion | |
| [warn] else tail.foldLeft(op(z, head))(op) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:624: [wartremover:Recursion] Unmarked recursion | |
| [warn] else cons((this.head, that.head), asStream[(A1, B)](this.tail zip that.tail)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:789: [wartremover:Recursion] Unmarked recursion | |
| [warn] else cons(head, tail take n-1) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:794: [wartremover:Recursion] Unmarked recursion | |
| [warn] else tail drop n-1 | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:825: [wartremover:Recursion] Unmarked recursion | |
| [warn] else cons(head, tail.init) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:857: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (stub0.isEmpty) advance(stub1.reverse, Nil, rest) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:858: [wartremover:Recursion] Unmarked recursion | |
| [warn] else cons(stub0.head, advance(stub0.tail, rest.head :: stub1, rest.tail)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:877: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (!isEmpty && p(head)) cons(head, tail takeWhile p) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:923: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (seen(rest.head)) loop(seen, rest.tail) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:924: [wartremover:Recursion] Unmarked recursion | |
| [warn] else cons(rest.head, loop(seen + rest.head, rest.tail)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:958: [wartremover:Recursion] Unmarked recursion | |
| [warn] else cons(these.head, loop(len - 1, these.tail)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:1015: [wartremover:Recursion] Unmarked recursion | |
| [warn] return h.toStream #::: st.tail.flatten | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:1185: [wartremover:Recursion] Unmarked recursion | |
| [warn] case bt: Cons[_] => (at eq bt) || consEq(at, bt) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:1205: [wartremover:Recursion] Unmarked recursion | |
| [warn] def iterate[A](start: A)(f: A => A): Stream[A] = cons(start, iterate(f(start))(f)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:1219: [wartremover:Recursion] Unmarked recursion | |
| [warn] cons(start, from(start+step, step)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:1236: [wartremover:Recursion] Unmarked recursion | |
| [warn] def continually[A](elem: => A): Stream[A] = cons(elem, continually(elem)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:1239: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (n <= 0) Empty else cons(elem, fill(n-1)(elem)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:1243: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (i >= n) Empty else cons(f(i), loop(i+1)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/Stream.scala:1252: [wartremover:Recursion] Unmarked recursion | |
| [warn] else cons(start, range(start + step, end, step)) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/TrieIterator.scala:92: [wartremover:Recursion] Unmarked recursion | |
| [warn] splitArray(getElems(ad(0))) | |
| [warn] ^ | |
| [warn] scala/collection/immutable/TrieIterator.scala:135: [wartremover:Recursion] Unmarked recursion | |
| [warn] next0(getElems(m), 0) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/ArrayLike.scala:43: [wartremover:Recursion] Unmarked recursion | |
| [warn] case x: AnyRef if x.getClass.isArray => WrappedArray.make(x).deep | |
| [warn] ^ | |
| [warn] scala/collection/mutable/BufferLike.scala:207: [wartremover:Recursion] Unmarked recursion | |
| [warn] case s: Script[_] => s.iterator foreach << | |
| [warn] ^ | |
| [warn] scala/collection/mutable/DoubleLinkedListLike.scala:75: [wartremover:Recursion] Unmarked recursion | |
| [warn] next.append(that) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/LinkedListLike.scala:72: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (elem.isEmpty) acc else length0(elem.next, acc + 1) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/LinkedListLike.scala:123: [wartremover:Recursion] Unmarked recursion | |
| [warn] else loop(x.next) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/ListBuffer.scala:181: [wartremover:Recursion] Unmarked recursion | |
| [warn] case x: AnyRef if x eq this => this ++= (this take size) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/ListBuffer.scala:187: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (xs.asInstanceOf[AnyRef] eq this) ++=: (this take size) else super.++=:(xs) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/ListMap.scala:63: [wartremover:Recursion] Unmarked recursion | |
| [warn] else remove(key, elems.tail, elems.head :: acc) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/ObservableBuffer.scala:55: [wartremover:Recursion] Unmarked recursion | |
| [warn] def undo() { update(n, oldelement) } | |
| [warn] ^ | |
| [warn] scala/collection/mutable/ObservableMap.scala:45: [wartremover:Recursion] Unmarked recursion | |
| [warn] def undo = +=((key, old)) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:57: [wartremover:Recursion] Unmarked recursion | |
| [warn] def size(node: Node[_, _]): Int = if (node eq null) 0 else 1 + size(node.left) + size(node.right) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:57: [wartremover:Recursion] Unmarked recursion | |
| [warn] def size(node: Node[_, _]): Int = if (node eq null) 0 else 1 + size(node.left) + size(node.right) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:73: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (cmp < 0) getNode(node.left, key) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:74: [wartremover:Recursion] Unmarked recursion | |
| [warn] else if (cmp > 0) getNode(node.right, key) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:94: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (node.left eq null) node else minNodeNonNull(node.left) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:110: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (node.right eq null) node else maxNodeNonNull(node.right) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:431: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (node.left ne null) foreachNodeNonNull(node.left, f) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:433: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (node.right ne null) foreachNodeNonNull(node.right, f) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:442: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (node.left ne null) foreachNodeKeyNonNull(node.left, f) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:444: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (node.right ne null) foreachNodeKeyNonNull(node.right, f) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:453: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (node.left ne null) transformNodeNonNull(node.left, f) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:455: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (node.right ne null) transformNodeNonNull(node.right, f) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:534: [wartremover:Recursion] Unmarked recursion | |
| [warn] else hasProperParentRefs(node.left) && hasProperParentRefs(node.right) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:534: [wartremover:Recursion] Unmarked recursion | |
| [warn] else hasProperParentRefs(node.left) && hasProperParentRefs(node.right) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:550: [wartremover:Recursion] Unmarked recursion | |
| [warn] else isValidBST(node.left) && isValidBST(node.right) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:550: [wartremover:Recursion] Unmarked recursion | |
| [warn] else isValidBST(node.left) && isValidBST(node.right) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:563: [wartremover:Recursion] Unmarked recursion | |
| [warn] else noRedAfterRed(node.left) && noRedAfterRed(node.right) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:563: [wartremover:Recursion] Unmarked recursion | |
| [warn] else noRedAfterRed(node.left) && noRedAfterRed(node.right) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:569: [wartremover:Recursion] Unmarked recursion | |
| [warn] val lh = blackHeight(node.left) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/RedBlackTree.scala:570: [wartremover:Recursion] Unmarked recursion | |
| [warn] val rh = blackHeight(node.right) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/SetLike.scala:232: [wartremover:Recursion] Unmarked recursion | |
| [warn] case s: Script[_] => s.iterator foreach << | |
| [warn] ^ | |
| [warn] scala/collection/mutable/UnrolledBuffer.scala:228: [wartremover:Recursion] Unmarked recursion | |
| [warn] next append elem | |
| [warn] ^ | |
| [warn] scala/collection/mutable/UnrolledBuffer.scala:246: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (idx < size) array(idx) else next.apply(idx - size) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/UnrolledBuffer.scala:248: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (idx < size) array(idx) = newelem else next.update(idx - size, newelem) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/UnrolledBuffer.scala:250: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (idx < size) this else next.locate(idx - size) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/UnrolledBuffer.scala:284: [wartremover:Recursion] Unmarked recursion | |
| [warn] } else next.remove(idx - size, buffer) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/UnrolledBuffer.scala:329: [wartremover:Recursion] Unmarked recursion | |
| [warn] else next.insertAll(idx - size, t, buffer) | |
| [warn] ^ | |
| [warn] scala/collection/mutable/UnrolledBuffer.scala:348: [wartremover:Recursion] Unmarked recursion | |
| [warn] override def toString = array.take(size).mkString("Unrolled@%08x".format(System.identityHashCode(this)) + "[" + size + "/" + array.length + "](", ", ", ")") + " -> " + (if (next ne null) next.toString else "") | |
| [warn] ^ | |
| [warn] scala/collection/parallel/ParIterableLike.scala:750: [wartremover:Recursion] Unmarked recursion | |
| [warn] val parseqspan = toSeq.takeWhile(pred) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/ParIterableLike.scala:775: [wartremover:Recursion] Unmarked recursion | |
| [warn] val (xs, ys) = toSeq.span(pred) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/ParIterableLike.scala:1378: [wartremover:Recursion] Unmarked recursion | |
| [warn] ScanNode(mergeTrees(trees, from, half), mergeTrees(trees, from + half, howmany - half)) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/ParIterableLike.scala:1378: [wartremover:Recursion] Unmarked recursion | |
| [warn] ScanNode(mergeTrees(trees, from, half), mergeTrees(trees, from + half, howmany - half)) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/ParIterableLike.scala:1404: [wartremover:Recursion] Unmarked recursion | |
| [warn] iterate(left, cb) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/ParIterableLike.scala:1405: [wartremover:Recursion] Unmarked recursion | |
| [warn] iterate(right, cb) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/ParMapLike.scala:65: [wartremover:Recursion] Unmarked recursion | |
| [warn] val ss = iter.split.map(keysIterator(_)) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/ParMapLike.scala:70: [wartremover:Recursion] Unmarked recursion | |
| [warn] def dup = keysIterator(iter.dup) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/ParMapLike.scala:82: [wartremover:Recursion] Unmarked recursion | |
| [warn] val ss = iter.split.map(valuesIterator(_)) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/ParMapLike.scala:87: [wartremover:Recursion] Unmarked recursion | |
| [warn] def dup = valuesIterator(iter.dup) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/Tasks.scala:482: [wartremover:Recursion] Unmarked recursion | |
| [warn] val subfutures = for (subtask <- subtasks.iterator) yield compute(subtask, depth + 1) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/immutable/ParHashMap.scala:315: [wartremover:Recursion] Unmarked recursion | |
| [warn] htm.elems(i) = evaluateCombiners(htm.elems(i)).asInstanceOf[HashMap[k, v]] | |
| [warn] ^ | |
| [warn] scala/collection/parallel/mutable/ParArray.scala:616: [wartremover:Recursion] Unmarked recursion | |
| [warn] iterate(left) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/mutable/ParArray.scala:617: [wartremover:Recursion] Unmarked recursion | |
| [warn] iterate(right) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/mutable/ParHashMap.scala:128: [wartremover:Recursion] Unmarked recursion | |
| [warn] def count(e: HashEntry[K, DefaultEntry[K, V]]): Int = if (e eq null) 0 else 1 + count(e.next) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/mutable/ParHashMap.scala:139: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (index(elemHashCode(e.key)) == i) check(e.next) | |
| [warn] ^ | |
| [warn] scala/collection/parallel/mutable/ParHashMap.scala:140: [wartremover:Recursion] Unmarked recursion | |
| [warn] else ("Element " + e.key + " at " + i + " with " + elemHashCode(e.key) + " maps to " + index(elemHashCode(e.key))) :: check(e.next) | |
| [warn] ^ | |
| [warn] scala/concurrent/BatchingExecutor.scala:75: [wartremover:Recursion] Unmarked recursion | |
| [warn] processBatch(_tasksLocal.get) // since head.run() can add entries, always do _tasksLocal.get here | |
| [warn] ^ | |
| [warn] scala/concurrent/Future.scala:730: [wartremover:Recursion] Unmarked recursion | |
| [warn] case other => searchNext(i) | |
| [warn] ^ | |
| [warn] scala/concurrent/Future.scala:759: [wartremover:Recursion] Unmarked recursion | |
| [warn] else i.next().flatMap { value => foldNext(i, op(prevValue, value), op) } | |
| [warn] ^ | |
| [warn] scala/concurrent/duration/Duration.scala:712: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (length % divider == 0) loop(length / divider, coarser) | |
| [warn] ^ | |
| [warn] scala/concurrent/impl/ExecutionContextImpl.scala:41: [wartremover:Recursion] Unmarked recursion | |
| [warn] case other => currentNumberOfThreads.compareAndSet(other, other + 1) || reserveThread() | |
| [warn] ^ | |
| [warn] scala/concurrent/impl/ExecutionContextImpl.scala:46: [wartremover:Recursion] Unmarked recursion | |
| [warn] case other => currentNumberOfThreads.compareAndSet(other, other - 1) || deregisterThread() | |
| [warn] ^ | |
| [warn] scala/concurrent/impl/Promise.scala:212: [wartremover:Recursion] Unmarked recursion | |
| [warn] case newLinked: DefaultPromise[_] => compressedRoot(newLinked) | |
| [warn] ^ | |
| [warn] scala/concurrent/impl/Promise.scala:225: [wartremover:Recursion] Unmarked recursion | |
| [warn] case linked: DefaultPromise[_] => linked.asInstanceOf[DefaultPromise[T]].root | |
| [warn] ^ | |
| [warn] scala/concurrent/impl/Promise.scala:266: [wartremover:Recursion] Unmarked recursion | |
| [warn] case dp: DefaultPromise[_] => compressedRoot(dp).value0 | |
| [warn] ^ | |
| [warn] scala/concurrent/impl/Promise.scala:275: [wartremover:Recursion] Unmarked recursion | |
| [warn] case dp: DefaultPromise[_] => compressedRoot(dp).isCompleted0 | |
| [warn] ^ | |
| [warn] scala/concurrent/impl/Promise.scala:296: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (compareAndSet(cur, v)) cur else tryCompleteAndGetListeners(v) | |
| [warn] ^ | |
| [warn] scala/concurrent/impl/Promise.scala:297: [wartremover:Recursion] Unmarked recursion | |
| [warn] case dp: DefaultPromise[_] => compressedRoot(dp).tryCompleteAndGetListeners(v) | |
| [warn] ^ | |
| [warn] scala/concurrent/impl/Promise.scala:313: [wartremover:Recursion] Unmarked recursion | |
| [warn] case dp: DefaultPromise[_] => compressedRoot(dp).dispatchOrAddCallback(runnable) | |
| [warn] ^ | |
| [warn] scala/concurrent/impl/Promise.scala:315: [wartremover:Recursion] Unmarked recursion | |
| [warn] else dispatchOrAddCallback(runnable) | |
| [warn] ^ | |
| [warn] scala/concurrent/impl/Promise.scala:340: [wartremover:Recursion] Unmarked recursion | |
| [warn] compressedRoot(dp).link(target) | |
| [warn] ^ | |
| [warn] scala/concurrent/impl/Promise.scala:345: [wartremover:Recursion] Unmarked recursion | |
| [warn] link(target) | |
| [warn] ^ | |
| [warn] scala/io/Source.scala:36: [wartremover:Recursion] Unmarked recursion | |
| [warn] } withReset(() => fromIterable(iterable)) | |
| [warn] ^ | |
| [warn] scala/io/Source.scala:96: [wartremover:Recursion] Unmarked recursion | |
| [warn] () => fromFile(file, bufferSize)(codec), | |
| [warn] ^ | |
| [warn] scala/io/Source.scala:160: [wartremover:Recursion] Unmarked recursion | |
| [warn] val resetFn = if (reset == null) () => createBufferedSource(inputStream, bufferSize, reset, close)(codec) else reset | |
| [warn] ^ | |
| [warn] scala/io/Source.scala:169: [wartremover:Recursion] Unmarked recursion | |
| [warn] createBufferedSource(is, reset = () => fromInputStream(is)(codec), close = () => is.close())(codec) | |
| [warn] ^ | |
| [warn] scala/reflect/ClassManifestDeprecatedApis.scala:30: [wartremover:Recursion] Unmarked recursion | |
| [warn] loop(xs - next, seen + next) | |
| [warn] ^ | |
| [warn] scala/reflect/ClassTag.scala:92: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (clazz.isArray) s"Array[${prettyprint(clazz.getComponentType)}]" else | |
| [warn] ^ | |
| [warn] scala/runtime/MethodCache.scala:69: [wartremover:Recursion] Unmarked recursion | |
| [warn] case x: PolyMethodCache => x findInternal forReceiver | |
| [warn] ^ | |
| [warn] scala/runtime/ScalaRunTime.scala:30: [wartremover:Recursion] Unmarked recursion | |
| [warn] clazz.isArray && (atLevel == 1 || isArrayClass(clazz.getComponentType, atLevel - 1)) | |
| [warn] ^ | |
| [warn] scala/runtime/ScalaRunTime.scala:246: [wartremover:Recursion] Unmarked recursion | |
| [warn] case x: GenIterable[_] => x.iterator take maxElements map inner mkString (x.stringPrefix + "(", ", ", ")") | |
| [warn] ^ | |
| [warn] scala/runtime/ScalaRunTime.scala:247: [wartremover:Recursion] Unmarked recursion | |
| [warn] case x: Traversable[_] => x take maxElements map inner mkString (x.stringPrefix + "(", ", ", ")") | |
| [warn] ^ | |
| [warn] scala/runtime/ScalaRunTime.scala:248: [wartremover:Recursion] Unmarked recursion | |
| [warn] case x: Product1[_] if isTuple(x) => "(" + inner(x._1) + ",)" // that special trailing comma | |
| [warn] ^ | |
| [warn] scala/runtime/ScalaRunTime.scala:249: [wartremover:Recursion] Unmarked recursion | |
| [warn] case x: Product if isTuple(x) => x.productIterator map inner mkString ("(", ",", ")") | |
| [warn] ^ | |
| [warn] scala/sys/process/BasicIO.scala:50: [wartremover:Recursion] Unmarked recursion | |
| [warn] case Right(s) => Stream.cons(s, next()) | |
| [warn] ^ | |
| [warn] scala/sys/process/BasicIO.scala:185: [wartremover:Recursion] Unmarked recursion | |
| [warn] readFully() | |
| [warn] ^ | |
| [warn] scala/sys/process/BasicIO.scala:239: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (available) loop() | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:53: [wartremover:Recursion] Unmarked recursion | |
| [warn] fits(w, z) | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:55: [wartremover:Recursion] Unmarked recursion | |
| [warn] fits(w, (i,b,h) :: (i,b,t) :: z) | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:57: [wartremover:Recursion] Unmarked recursion | |
| [warn] fits(w - t.length(), z) | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:59: [wartremover:Recursion] Unmarked recursion | |
| [warn] fits(w, (i + ii, b, d) :: z) | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:61: [wartremover:Recursion] Unmarked recursion | |
| [warn] fits(w - 1, z) | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:65: [wartremover:Recursion] Unmarked recursion | |
| [warn] fits(w, (i, false, d) :: z) | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:80: [wartremover:Recursion] Unmarked recursion | |
| [warn] fmt(k, z) | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:82: [wartremover:Recursion] Unmarked recursion | |
| [warn] fmt(k, (i, b, h) :: (i, b, t) :: z) | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:85: [wartremover:Recursion] Unmarked recursion | |
| [warn] fmt(k + t.length(), z) | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:87: [wartremover:Recursion] Unmarked recursion | |
| [warn] fmt(k, (i + ii, b, d) :: z) | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:91: [wartremover:Recursion] Unmarked recursion | |
| [warn] fmt(i, z) | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:94: [wartremover:Recursion] Unmarked recursion | |
| [warn] fmt(k + 1, z) | |
| [warn] ^ | |
| [warn] scala/text/Document.scala:97: [wartremover:Recursion] Unmarked recursion | |
| [warn] fmt(k, (i, !fitsFlat, d) :: z) | |
| [warn] ^ | |
| [warn] scala/util/Properties.scala:198: [wartremover:Recursion] Unmarked recursion | |
| [warn] val (v, r) = versionOf(r0, 1) | |
| [warn] ^ | |
| [warn] scala/util/Properties.scala:217: [wartremover:Recursion] Unmarked recursion | |
| [warn] else compareVersions(srest, vrest, depth + 1) | |
| [warn] ^ | |
| [warn] scala/util/Sorting.scala:132: [wartremover:Recursion] Unmarked recursion | |
| [warn] inner(a, i0, iA, ord) // True recursion | |
| [warn] ^ | |
| [warn] scala/util/Sorting.scala:133: [wartremover:Recursion] Unmarked recursion | |
| [warn] inner(a, iB, iN, ord) // Should be tail recursion | |
| [warn] ^ | |
| [warn] scala/util/Sorting.scala:136: [wartremover:Recursion] Unmarked recursion | |
| [warn] inner(a, iB, iN, ord) // True recursion | |
| [warn] ^ | |
| [warn] scala/util/Sorting.scala:137: [wartremover:Recursion] Unmarked recursion | |
| [warn] inner(a, i0, iA, ord) // Should be tail recursion | |
| [warn] ^ | |
| [warn] scala/util/Sorting.scala:186: [wartremover:Recursion] Unmarked recursion | |
| [warn] mergeSort(a, i0, iK, ord, sc) | |
| [warn] ^ | |
| [warn] scala/util/Sorting.scala:187: [wartremover:Recursion] Unmarked recursion | |
| [warn] mergeSort(a, iK, iN, ord, sc) | |
| [warn] ^ | |
| [warn] scala/util/control/Exception.scala:359: [wartremover:Recursion] Unmarked recursion | |
| [warn] if (wouldMatch(x, exceptions) && x.getCause != null) unwrap(x.getCause) | |
| [warn] ^ | |
| [warn] scala/util/control/TailCalls.scala:58: [wartremover:Recursion] Unmarked recursion | |
| [warn] case c: Cont[a1, b1] => Cont(c.a, (x: a1) => c.f(x) flatMap f) | |
| [warn] ^ | |
| [warn] scala/util/control/TailCalls.scala:67: [wartremover:Recursion] Unmarked recursion | |
| [warn] case Done(v) => f(v).resume | |
| [warn] ^ | |
| [warn] scala/util/control/TailCalls.scala:69: [wartremover:Recursion] Unmarked recursion | |
| [warn] case Cont(b, g) => b.flatMap(x => g(x) flatMap f).resume | |
| [warn] ^ | |
| [warn] scala/util/control/TailCalls.scala:77: [wartremover:Recursion] Unmarked recursion | |
| [warn] case Call(t) => t().result | |
| [warn] ^ | |
| [warn] scala/util/control/TailCalls.scala:79: [wartremover:Recursion] Unmarked recursion | |
| [warn] case Done(v) => f(v).result | |
| [warn] ^ | |
| [warn] scala/util/control/TailCalls.scala:80: [wartremover:Recursion] Unmarked recursion | |
| [warn] case Call(t) => t().flatMap(f).result | |
| [warn] ^ | |
| [warn] scala/util/control/TailCalls.scala:81: [wartremover:Recursion] Unmarked recursion | |
| [warn] case Cont(b, g) => b.flatMap(x => g(x) flatMap f).result | |
| [warn] ^ | |
| [warn] scala/util/matching/Regex.scala:787: [wartremover:Recursion] Unmarked recursion | |
| [warn] case 2 => nextSeen = 0 ; hasNext | |
| [warn] ^ | |
| [warn] scala/util/matching/Regex.scala:798: [wartremover:Recursion] Unmarked recursion | |
| [warn] case 0 => if (!hasNext) throw new NoSuchElementException ; next() | |
| [warn] ^ | |
| [warn] scala/util/matching/Regex.scala:800: [wartremover:Recursion] Unmarked recursion | |
| [warn] case 2 => nextSeen = 0 ; next() | |
| [warn] ^ |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
And now condensed with links to source...
scala/Responder.scala:44:
for (_ <- r; y <- loop(r)) yield yscala/Responder.scala:47:
if (cond) for (_ <- r; y <- loopWhile(cond)(r)) yield yscala/StringContext.scala:240:
loop(idx, str.indexOf('\\', idx))scala/collection/IndexedSeqOptimized.scala:56:
else foldl(start + 1, end, op(z, this(start)), op)scala/collection/IndexedSeqOptimized.scala:61:
else foldr(start, end - 1, op(this(end - 1), z), op)scala/collection/Iterator.scala:189:
} else advance()scala/collection/Iterator.scala:204:
merge()scala/collection/Iterator.scala:724:
case 1 => store(hd) ; status = 0 ; finish()scala/collection/Iterator.scala:1403:
if (self.hasNext) Stream.cons(self.next(), self.toStream)scala/collection/LinearSeqLike.scala:67:
else that.nonEmpty && p(head, that.head) && (tail corresponds that.tail)(p)scala/collection/LinearSeqOptimized.scala:131:
else op(head, tail.foldRight(z)(op))scala/collection/LinearSeqOptimized.scala:142:
else op(head, tail.reduceRight(op))scala/collection/LinearSeqOptimized.scala:272:
loop(i + 1, xs.tail)scala/collection/Searching.scala:94:
case -1 => binarySearch(elem, from, idx)(ord)scala/collection/Searching.scala:95:
case 1 => binarySearch(elem, idx + 1, to)(ord)scala/collection/SeqViewLike.scala:80:
if (idx < index(mid)) findRow(idx, lo, mid - 1)scala/collection/SeqViewLike.scala:81:
else if (idx >= index(mid + 1)) findRow(idx, mid + 1, hi)scala/collection/SortedMapLike.scala:78:
override def rangeImpl(from : Option[A], until : Option[A]): SortedMap[A, B] = self.rangeImpl(from, until).filterKeys(p)scala/collection/SortedMapLike.scala:86:
override def rangeImpl(from : Option[A], until : Option[A]): SortedMap[A, C] = self.rangeImpl(from, until).mapValues(f)scala/collection/TraversableOnce.scala:289:
else toBuffer.toArrayscala/collection/TraversableOnce.scala:464:
def hasNext: Boolean = it.hasNext || its.hasNext && { it = its.next().toIterator; hasNext }scala/collection/concurrent/TrieMap.scala:50:
else GCAS_Complete(/*READ*/mainnode, ct)scala/collection/concurrent/TrieMap.scala:63:
else GCAS_Complete(m, ct)scala/collection/concurrent/TrieMap.scala:67:
GCAS_Complete(/*READ*/mainnode, ct)scala/collection/concurrent/TrieMap.scala:113:
if (startgen eq in.gen) in.rec_insert(k, v, hc, lev + 5, this, startgen, ct)scala/collection/concurrent/TrieMap.scala:115:
if (GCAS(cn, cn.renewed(startgen, ct), ct)) rec_insert(k, v, hc, lev, parent, startgen, ct)scala/collection/concurrent/TrieMap.scala:159:
if (startgen eq in.gen) in.rec_insertif(k, v, hc, cond, lev + 5, this, startgen, ct)scala/collection/concurrent/TrieMap.scala:161:
if (GCAS(cn, cn.renewed(startgen, ct), ct)) rec_insertif(k, v, hc, cond, lev, parent, startgen, ct)scala/collection/concurrent/TrieMap.scala:249:
if (ct.isReadOnly || (startgen eq in.gen)) in.rec_lookup(k, hc, lev + 5, this, startgen, ct)scala/collection/concurrent/TrieMap.scala:251:
if (GCAS(cn, cn.renewed(startgen, ct), ct)) rec_lookup(k, hc, lev, parent, startgen, ct)scala/collection/concurrent/TrieMap.scala:292:
if (startgen eq in.gen) in.rec_remove(k, v, hc, lev + 5, this, startgen, ct)scala/collection/concurrent/TrieMap.scala:294:
if (GCAS(cn, cn.renewed(startgen, ct), ct)) rec_remove(k, v, hc, lev, parent, startgen, ct)scala/collection/concurrent/TrieMap.scala:321:
if (ct.readRoot().gen == startgen) cleanParent(nonlive)scala/collection/concurrent/TrieMap.scala:575:
case cn: CNode[K, V] => cn.collectElemsscala/collection/concurrent/TrieMap.scala:599:
subinode.mainnode = dual(x, xhc, y, yhc, lev + 5, gen)scala/collection/concurrent/TrieMap.scala:710:
else RDCSS_Complete(abort)scala/collection/concurrent/TrieMap.scala:717:
} else RDCSS_Complete(abort)scala/collection/concurrent/TrieMap.scala:720:
else RDCSS_Complete(abort)scala/collection/concurrent/TrieMap.scala:736:
if (!r.rec_insert(k, v, hc, 0, null, r.gen, this)) inserthc(k, hc, v)scala/collection/concurrent/TrieMap.scala:743:
if (ret eq null) insertifhc(k, hc, v, cond)scala/collection/concurrent/TrieMap.scala:750:
if (res eq INodeBase.RESTART) lookuphc(k, hc)scala/collection/concurrent/TrieMap.scala:771:
else removehc(k, v, hc)scala/collection/concurrent/TrieMap.scala:801:
else snapshot()scala/collection/concurrent/TrieMap.scala:820:
else readOnlySnapshot()scala/collection/concurrent/TrieMap.scala:825:
if (!RDCSS_ROOT(r, r.gcasRead(this), INode.newRootNode[K, V])) clear()scala/collection/concurrent/TrieMap.scala:1052:
advance()scala/collection/generic/Growable.scala:54:
loop(xs.tail)scala/collection/immutable/FilteredTraversableInternal.scala:39:
noneIn(t)scala/collection/immutable/FilteredTraversableInternal.scala:51:
allIn(start, remaining.tail)scala/collection/immutable/HashMap.scala:186:
elems(0) = makeHashTrieMap(hash0, elem0, hash1, elem1, level + 5, size)scala/collection/immutable/HashSet.scala:241:
val child = makeHashTrieSet(hash0, elem0, hash1, elem1, level + 5)scala/collection/immutable/HashSet.scala:838:
else removeAll(s.removed0(r.head, that.hash, level), r.tail)scala/collection/immutable/IntMap.scala:125:
nextscala/collection/immutable/IntMap.scala:188:
case IntMap.Bin(_, _, left, right) => { left.foreach(f); right.foreach(f) }scala/collection/immutable/IntMap.scala:188:
case IntMap.Bin(_, _, left, right) => { left.foreach(f); right.foreach(f) }scala/collection/immutable/IntMap.scala:205:
case IntMap.Bin(_, _, left, right) => { left.foreachKey(f); right.foreachKey(f) }scala/collection/immutable/IntMap.scala:205:
case IntMap.Bin(_, _, left, right) => { left.foreachKey(f); right.foreachKey(f) }scala/collection/immutable/IntMap.scala:222:
case IntMap.Bin(_, _, left, right) => { left.foreachValue(f); right.foreachValue(f) }scala/collection/immutable/IntMap.scala:222:
case IntMap.Bin(_, _, left, right) => { left.foreachValue(f); right.foreachValue(f) }scala/collection/immutable/IntMap.scala:233:
val (newleft, newright) = (left.filter(f), right.filter(f))scala/collection/immutable/IntMap.scala:233:
val (newleft, newright) = (left.filter(f), right.filter(f))scala/collection/immutable/IntMap.scala:244:
case [email protected](prefix, mask, left, right) => b.bin(left.transform(f), right.transform(f))scala/collection/immutable/IntMap.scala:244:
case [email protected](prefix, mask, left, right) => b.bin(left.transform(f), right.transform(f))scala/collection/immutable/IntMap.scala:252:
case IntMap.Bin(_, _, left, right) => left.size + right.sizescala/collection/immutable/IntMap.scala:252:
case IntMap.Bin(_, _, left, right) => left.size + right.sizescala/collection/immutable/IntMap.scala:256:
case IntMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left.get(key) else right.get(key)scala/collection/immutable/IntMap.scala:256:
case IntMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left.get(key) else right.get(key)scala/collection/immutable/IntMap.scala:265:
if (zero(key, mask)) left.getOrElse(key, default) else right.getOrElse(key, default)scala/collection/immutable/IntMap.scala:265:
if (zero(key, mask)) left.getOrElse(key, default) else right.getOrElse(key, default)scala/collection/immutable/IntMap.scala:269:
case IntMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left(key) else right(key)scala/collection/immutable/IntMap.scala:269:
case IntMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left(key) else right(key)scala/collection/immutable/IntMap.scala:279:
else if (zero(key, mask)) IntMap.Bin(prefix, mask, left.updated(key, value), right)scala/collection/immutable/IntMap.scala:280:
else IntMap.Bin(prefix, mask, left, right.updated(key, value))scala/collection/immutable/IntMap.scala:307:
else if (zero(key, mask)) IntMap.Bin(prefix, mask, left.updateWith(key, value, f), right)scala/collection/immutable/IntMap.scala:308:
else IntMap.Bin(prefix, mask, left, right.updateWith(key, value, f))scala/collection/immutable/IntMap.scala:318:
else if (zero(key, mask)) bin(prefix, mask, left - key, right)scala/collection/immutable/IntMap.scala:319:
else bin(prefix, mask, left, right - key)scala/collection/immutable/IntMap.scala:337:
val newleft = left.modifyOrRemove(f)scala/collection/immutable/IntMap.scala:338:
val newright = right.modifyOrRemove(f)scala/collection/immutable/IntMap.scala:365:
else if (zero(p2, m1)) IntMap.Bin(p1, m1, l1.unionWith(that, f), r1)scala/collection/immutable/IntMap.scala:366:
else IntMap.Bin(p1, m1, l1, r1.unionWith(that, f))scala/collection/immutable/IntMap.scala:369:
else if (zero(p1, m2)) IntMap.Bin(p2, m2, this.unionWith(l2, f), r2)scala/collection/immutable/IntMap.scala:370:
else IntMap.Bin(p2, m2, l2, this.unionWith(r2, f))scala/collection/immutable/IntMap.scala:373:
if (p1 == p2) IntMap.Bin(p1, m1, l1.unionWith(l2,f), r1.unionWith(r2, f))scala/collection/immutable/IntMap.scala:373:
if (p1 == p2) IntMap.Bin(p1, m1, l1.unionWith(l2,f), r1.unionWith(r2, f))scala/collection/immutable/IntMap.scala:397:
else if (zero(p2, m1)) l1.intersectionWith(that, f)scala/collection/immutable/IntMap.scala:398:
else r1.intersectionWith(that, f)scala/collection/immutable/IntMap.scala:399:
} else if (m1 == m2) bin(p1, m1, l1.intersectionWith(l2, f), r1.intersectionWith(r2, f))scala/collection/immutable/IntMap.scala:399:
} else if (m1 == m2) bin(p1, m1, l1.intersectionWith(l2, f), r1.intersectionWith(r2, f))scala/collection/immutable/IntMap.scala:402:
else if (zero(p1, m2)) this.intersectionWith(l2, f)scala/collection/immutable/IntMap.scala:403:
else this.intersectionWith(r2, f)scala/collection/immutable/IntMap.scala:435:
case Bin(_, _, l, r) => l.firstKeyscala/collection/immutable/IntMap.scala:445:
case Bin(_, _, l, r) => r.lastKeyscala/collection/immutable/List.scala:180:
loop(mappedHead, mappedLast, unchanged, pending.tail)scala/collection/immutable/List.scala:197:
loop(mappedHead1, mappedLast1, tail0, tail0)scala/collection/immutable/List.scala:262:
case _ :: tail => loop(tail, lag.tail)scala/collection/immutable/List.scala:370:
else loop(xs.tail)scala/collection/immutable/List.scala:412:
else new Stream.Cons(head, tail.toStream)scala/collection/immutable/ListMap.scala:119:
else sizeInternal(cur.next, acc + 1)scala/collection/immutable/ListMap.scala:128:
else applyInternal(cur.next, k)scala/collection/immutable/ListMap.scala:135:
else getInternal(cur.next, k)scala/collection/immutable/ListMap.scala:142:
else containsInternal(cur.next, k)scala/collection/immutable/ListMap.scala:159:
else removeInternal(k, cur.next, cur :: acc)scala/collection/immutable/ListSet.scala:113:
else sizeInternal(n.next, acc + 1)scala/collection/immutable/ListSet.scala:120:
!n.isEmpty && (n.elem == e || containsInternal(n.next, e))scala/collection/immutable/ListSet.scala:129:
else removeInternal(k, cur.next, cur :: acc)scala/collection/immutable/LongMap.scala:117:
nextscala/collection/immutable/LongMap.scala:180:
case LongMap.Bin(_, _, left, right) => { left.foreach(f); right.foreach(f) }scala/collection/immutable/LongMap.scala:180:
case LongMap.Bin(_, _, left, right) => { left.foreach(f); right.foreach(f) }scala/collection/immutable/LongMap.scala:197:
case LongMap.Bin(_, _, left, right) => { left.foreachKey(f); right.foreachKey(f) }scala/collection/immutable/LongMap.scala:197:
case LongMap.Bin(_, _, left, right) => { left.foreachKey(f); right.foreachKey(f) }scala/collection/immutable/LongMap.scala:214:
case LongMap.Bin(_, _, left, right) => { left.foreachValue(f); right.foreachValue(f) }scala/collection/immutable/LongMap.scala:214:
case LongMap.Bin(_, _, left, right) => { left.foreachValue(f); right.foreachValue(f) }scala/collection/immutable/LongMap.scala:225:
val (newleft, newright) = (left.filter(f), right.filter(f))scala/collection/immutable/LongMap.scala:225:
val (newleft, newright) = (left.filter(f), right.filter(f))scala/collection/immutable/LongMap.scala:236:
case [email protected](prefix, mask, left, right) => b.bin(left.transform(f), right.transform(f))scala/collection/immutable/LongMap.scala:236:
case [email protected](prefix, mask, left, right) => b.bin(left.transform(f), right.transform(f))scala/collection/immutable/LongMap.scala:244:
case LongMap.Bin(_, _, left, right) => left.size + right.sizescala/collection/immutable/LongMap.scala:244:
case LongMap.Bin(_, _, left, right) => left.size + right.sizescala/collection/immutable/LongMap.scala:248:
case LongMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left.get(key) else right.get(key)scala/collection/immutable/LongMap.scala:248:
case LongMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left.get(key) else right.get(key)scala/collection/immutable/LongMap.scala:257:
if (zero(key, mask)) left.getOrElse(key, default) else right.getOrElse(key, default)scala/collection/immutable/LongMap.scala:257:
if (zero(key, mask)) left.getOrElse(key, default) else right.getOrElse(key, default)scala/collection/immutable/LongMap.scala:261:
case LongMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left(key) else right(key)scala/collection/immutable/LongMap.scala:261:
case LongMap.Bin(prefix, mask, left, right) => if (zero(key, mask)) left(key) else right(key)scala/collection/immutable/LongMap.scala:271:
else if (zero(key, mask)) LongMap.Bin(prefix, mask, left.updated(key, value), right)scala/collection/immutable/LongMap.scala:272:
else LongMap.Bin(prefix, mask, left, right.updated(key, value))scala/collection/immutable/LongMap.scala:299:
else if (zero(key, mask)) LongMap.Bin(prefix, mask, left.updateWith(key, value, f), right)scala/collection/immutable/LongMap.scala:300:
else LongMap.Bin(prefix, mask, left, right.updateWith(key, value, f))scala/collection/immutable/LongMap.scala:310:
else if (zero(key, mask)) bin(prefix, mask, left - key, right)scala/collection/immutable/LongMap.scala:311:
else bin(prefix, mask, left, right - key)scala/collection/immutable/LongMap.scala:329:
val newleft = left.modifyOrRemove(f)scala/collection/immutable/LongMap.scala:330:
val newright = right.modifyOrRemove(f)scala/collection/immutable/LongMap.scala:356:
else if (zero(p2, m1)) LongMap.Bin(p1, m1, l1.unionWith(that, f), r1)scala/collection/immutable/LongMap.scala:357:
else LongMap.Bin(p1, m1, l1, r1.unionWith(that, f))scala/collection/immutable/LongMap.scala:360:
else if (zero(p1, m2)) LongMap.Bin(p2, m2, this.unionWith(l2, f), r2)scala/collection/immutable/LongMap.scala:361:
else LongMap.Bin(p2, m2, l2, this.unionWith(r2, f))scala/collection/immutable/LongMap.scala:364:
if (p1 == p2) LongMap.Bin(p1, m1, l1.unionWith(l2,f), r1.unionWith(r2, f))scala/collection/immutable/LongMap.scala:364:
if (p1 == p2) LongMap.Bin(p1, m1, l1.unionWith(l2,f), r1.unionWith(r2, f))scala/collection/immutable/LongMap.scala:388:
else if (zero(p2, m1)) l1.intersectionWith(that, f)scala/collection/immutable/LongMap.scala:389:
else r1.intersectionWith(that, f)scala/collection/immutable/LongMap.scala:390:
} else if (m1 == m2) bin(p1, m1, l1.intersectionWith(l2, f), r1.intersectionWith(r2, f))scala/collection/immutable/LongMap.scala:390:
} else if (m1 == m2) bin(p1, m1, l1.intersectionWith(l2, f), r1.intersectionWith(r2, f))scala/collection/immutable/LongMap.scala:393:
else if (zero(p1, m2)) this.intersectionWith(l2, f)scala/collection/immutable/LongMap.scala:394:
else this.intersectionWith(r2, f)scala/collection/immutable/LongMap.scala:423:
case LongMap.Bin(_, _, l, r) => l.firstKeyscala/collection/immutable/LongMap.scala:430:
case LongMap.Bin(_, _, l, r) => r.lastKeyscala/collection/immutable/PagedSeq.scala:53:
else (more(data, start + cnt, len - cnt) max 0) + cntscala/collection/immutable/PagedSeq.scala:56:
more(data, start, len)scala/collection/immutable/PagedSeq.scala:248:
if (later.next != null) later = later.next.latestscala/collection/immutable/PagedSeq.scala:265:
next.addMore(more)scala/collection/immutable/RedBlackTree.scala:41:
if (cmp < 0) lookup(tree.left, x)scala/collection/immutable/RedBlackTree.scala:42:
else if (cmp > 0) lookup(tree.right, x)scala/collection/immutable/RedBlackTree.scala:57:
case (Some(lb), _) if ordering.lt(tree.key, lb) => countInRange(tree.right, from, to)scala/collection/immutable/RedBlackTree.scala:59:
case (_, Some(ub)) if ordering.gteq(tree.key, ub) => countInRange(tree.left, from, to)scala/collection/immutable/RedBlackTree.scala:63:
case _ => 1 + countInRange(tree.left, from, None) + countInRange(tree.right, None, to)scala/collection/immutable/RedBlackTree.scala:63:
case _ => 1 + countInRange(tree.left, from, None) + countInRange(tree.right, None, to)scala/collection/immutable/RedBlackTree.scala:100:
if (tree.left ne null) _foreach(tree.left, f)scala/collection/immutable/RedBlackTree.scala:102:
if (tree.right ne null) _foreach(tree.right, f)scala/collection/immutable/RedBlackTree.scala:108:
if (tree.left ne null) _foreachKey(tree.left, f)scala/collection/immutable/RedBlackTree.scala:110:
if (tree.right ne null) _foreachKey(tree.right, f)scala/collection/immutable/RedBlackTree.scala:120:
if (n < count) nth(tree.left, n)scala/collection/immutable/RedBlackTree.scala:121:
else if (n > count) nth(tree.right, n - count - 1)scala/collection/immutable/RedBlackTree.scala:155:
if (cmp < 0) balanceLeft(isBlackTree(tree), tree.key, tree.value, upd(tree.left, k, v, overwrite), tree.right)scala/collection/immutable/RedBlackTree.scala:156:
else if (cmp > 0) balanceRight(isBlackTree(tree), tree.key, tree.value, tree.left, upd(tree.right, k, v, overwrite))scala/collection/immutable/RedBlackTree.scala:164:
if (idx < rank) balanceLeft(isBlackTree(tree), tree.key, tree.value, updNth(tree.left, idx, k, v, overwrite), tree.right)scala/collection/immutable/RedBlackTree.scala:165:
else if (idx > rank) balanceRight(isBlackTree(tree), tree.key, tree.value, tree.left, updNth(tree.right, idx - rank, k, v, overwrite))scala/collection/immutable/RedBlackTree.scala:217:
def delLeft = if (isBlackTree(tree.left)) balLeft(tree.key, tree.value, del(tree.left, k), tree.right) else RedTree(tree.key, tree.value, del(tree.left, k), tree.right)scala/collection/immutable/RedBlackTree.scala:217:
def delLeft = if (isBlackTree(tree.left)) balLeft(tree.key, tree.value, del(tree.left, k), tree.right) else RedTree(tree.key, tree.value, del(tree.left, k), tree.right)scala/collection/immutable/RedBlackTree.scala:218:
def delRight = if (isBlackTree(tree.right)) balRight(tree.key, tree.value, tree.left, del(tree.right, k)) else RedTree(tree.key, tree.value, tree.left, del(tree.right, k))scala/collection/immutable/RedBlackTree.scala:218:
def delRight = if (isBlackTree(tree.right)) balRight(tree.key, tree.value, tree.left, del(tree.right, k)) else RedTree(tree.key, tree.value, tree.left, del(tree.right, k))scala/collection/immutable/RedBlackTree.scala:224:
val bc = append(tl.right, tr.left)scala/collection/immutable/RedBlackTree.scala:231:
val bc = append(tl.right, tr.left)scala/collection/immutable/RedBlackTree.scala:238:
RedTree(tr.key, tr.value, append(tl, tr.left), tr.right)scala/collection/immutable/RedBlackTree.scala:240:
RedTree(tl.key, tl.value, tl.left, append(tl.right, tr))scala/collection/immutable/RedBlackTree.scala:253:
if (ordering.lt(tree.key, from)) return doFrom(tree.right, from)scala/collection/immutable/RedBlackTree.scala:254:
val newLeft = doFrom(tree.left, from)scala/collection/immutable/RedBlackTree.scala:261:
if (ordering.lt(to, tree.key)) return doTo(tree.left, to)scala/collection/immutable/RedBlackTree.scala:262:
val newRight = doTo(tree.right, to)scala/collection/immutable/RedBlackTree.scala:269:
if (ordering.lteq(until, tree.key)) return doUntil(tree.left, until)scala/collection/immutable/RedBlackTree.scala:270:
val newRight = doUntil(tree.right, until)scala/collection/immutable/RedBlackTree.scala:277:
if (ordering.lt(tree.key, from)) return doRange(tree.right, from, until)scala/collection/immutable/RedBlackTree.scala:278:
if (ordering.lteq(until, tree.key)) return doRange(tree.left, from, until)scala/collection/immutable/RedBlackTree.scala:291:
if (n > count) return doDrop(tree.right, n - count - 1)scala/collection/immutable/RedBlackTree.scala:292:
val newLeft = doDrop(tree.left, n)scala/collection/immutable/RedBlackTree.scala:301:
if (n <= count) return doTake(tree.left, n)scala/collection/immutable/RedBlackTree.scala:302:
val newRight = doTake(tree.right, n - count - 1)scala/collection/immutable/RedBlackTree.scala:310:
if (from > count) return doSlice(tree.right, from - count - 1, until - count - 1)scala/collection/immutable/RedBlackTree.scala:311:
if (until <= count) return doSlice(tree.left, from, until)scala/collection/immutable/RedBlackTree.scala:335:
else unzip(cons(next, zipper), leftMost)scala/collection/immutable/RedBlackTree.scala:346:
unzipBoth(left.right, right.left, cons(left, leftZipper), cons(right, rightZipper), smallerDepth + 1)scala/collection/immutable/RedBlackTree.scala:348:
unzipBoth(left.right, right.left, cons(left, leftZipper), cons(right, rightZipper), smallerDepth)scala/collection/immutable/RedBlackTree.scala:350:
unzipBoth(left, right.left, leftZipper, cons(right, rightZipper), smallerDepth)scala/collection/immutable/RedBlackTree.scala:352:
unzipBoth(left.right, right, cons(left, leftZipper), rightZipper, smallerDepth)scala/collection/immutable/RedBlackTree.scala:375:
if (depth == 1) zipper else findDepth(zipper.tail, depth - 1)scala/collection/immutable/RedBlackTree.scala:377:
findDepth(zipper.tail, depth)scala/collection/immutable/RedBlackTree.scala:486:
else findLeftMostOrPopOnEmpty(goLeft(tree))scala/collection/immutable/RedBlackTree.scala:504:
pushNext(tree)scala/collection/immutable/RedBlackTree.scala:537:
else find(scala/collection/immutable/SortedMap.scala:90:
override def rangeImpl(from : Option[A], until : Option[A]): SortedMap[A, B] = self.rangeImpl(from, until).filterKeys(p)scala/collection/immutable/SortedMap.scala:98:
override def rangeImpl(from : Option[A], until : Option[A]): SortedMap[A, C] = self.rangeImpl(from, until).mapValues(f)scala/collection/immutable/Stream.scala:252:
if (isEmpty) rest.toStream else cons(head, tail append rest)scala/collection/immutable/Stream.scala:290:
loop(these.tail, sep)scala/collection/immutable/Stream.scala:369:
else cons(head, asStream[A](tail ++ that))scala/collection/immutable/Stream.scala:394:
else cons(z, asStream[B](tail.scanLeft(op(z, head))(op)))scala/collection/immutable/Stream.scala:415:
else cons(f(head), asStream[B](tail map f))scala/collection/immutable/Stream.scala:494:
else prefix append asStream[B](nonEmptyPrefix.tail flatMap f)scala/collection/immutable/Stream.scala:531:
tail.foreach(f)scala/collection/immutable/Stream.scala:546:
else tail.foldLeft(op(z, head))(op)scala/collection/immutable/Stream.scala:624:
else cons((this.head, that.head), asStream[(A1, B)](this.tail zip that.tail))scala/collection/immutable/Stream.scala:789:
else cons(head, tail take n-1)scala/collection/immutable/Stream.scala:794:
else tail drop n-1scala/collection/immutable/Stream.scala:825:
else cons(head, tail.init)scala/collection/immutable/Stream.scala:857:
else if (stub0.isEmpty) advance(stub1.reverse, Nil, rest)scala/collection/immutable/Stream.scala:858:
else cons(stub0.head, advance(stub0.tail, rest.head :: stub1, rest.tail))scala/collection/immutable/Stream.scala:877:
if (!isEmpty && p(head)) cons(head, tail takeWhile p)scala/collection/immutable/Stream.scala:923:
else if (seen(rest.head)) loop(seen, rest.tail)scala/collection/immutable/Stream.scala:924:
else cons(rest.head, loop(seen + rest.head, rest.tail))scala/collection/immutable/Stream.scala:958:
else cons(these.head, loop(len - 1, these.tail))scala/collection/immutable/Stream.scala:1015:
return h.toStream #::: st.tail.flattenscala/collection/immutable/Stream.scala:1185:
case bt: Cons[_] => (at eq bt) || consEq(at, bt)scala/collection/immutable/Stream.scala:1205:
def iterate[A](start: A)(f: A => A): Stream[A] = cons(start, iterate(f(start))(f))scala/collection/immutable/Stream.scala:1219:
cons(start, from(start+step, step))scala/collection/immutable/Stream.scala:1236:
def continually[A](elem: => A): Stream[A] = cons(elem, continually(elem))scala/collection/immutable/Stream.scala:1239:
if (n <= 0) Empty else cons(elem, fill(n-1)(elem))scala/collection/immutable/Stream.scala:1243:
if (i >= n) Empty else cons(f(i), loop(i+1))scala/collection/immutable/Stream.scala:1252:
else cons(start, range(start + step, end, step))scala/collection/immutable/TrieIterator.scala:92:
splitArray(getElems(ad(0)))scala/collection/immutable/TrieIterator.scala:135:
next0(getElems(m), 0)scala/collection/mutable/ArrayLike.scala:43:
case x: AnyRef if x.getClass.isArray => WrappedArray.make(x).deepscala/collection/mutable/BufferLike.scala:207:
case s: Script[_] => s.iterator foreach <<scala/collection/mutable/DoubleLinkedListLike.scala:75:
next.append(that)scala/collection/mutable/LinkedListLike.scala:72:
if (elem.isEmpty) acc else length0(elem.next, acc + 1)scala/collection/mutable/LinkedListLike.scala:123:
else loop(x.next)scala/collection/mutable/ListBuffer.scala:181:
case x: AnyRef if x eq this => this ++= (this take size)scala/collection/mutable/ListBuffer.scala:187:
if (xs.asInstanceOf[AnyRef] eq this) ++=: (this take size) else super.++=:(xs)scala/collection/mutable/ListMap.scala:63:
else remove(key, elems.tail, elems.head :: acc)scala/collection/mutable/ObservableBuffer.scala:55:
def undo() { update(n, oldelement) }scala/collection/mutable/ObservableMap.scala:45:
def undo = +=((key, old))scala/collection/mutable/RedBlackTree.scala:57:
def size(node: Node[_, _]): Int = if (node eq null) 0 else 1 + size(node.left) + size(node.right)scala/collection/mutable/RedBlackTree.scala:57:
def size(node: Node[_, _]): Int = if (node eq null) 0 else 1 + size(node.left) + size(node.right)scala/collection/mutable/RedBlackTree.scala:73:
if (cmp < 0) getNode(node.left, key)scala/collection/mutable/RedBlackTree.scala:74:
else if (cmp > 0) getNode(node.right, key)scala/collection/mutable/RedBlackTree.scala:94:
if (node.left eq null) node else minNodeNonNull(node.left)scala/collection/mutable/RedBlackTree.scala:110:
if (node.right eq null) node else maxNodeNonNull(node.right)scala/collection/mutable/RedBlackTree.scala:431:
if (node.left ne null) foreachNodeNonNull(node.left, f)scala/collection/mutable/RedBlackTree.scala:433:
if (node.right ne null) foreachNodeNonNull(node.right, f)scala/collection/mutable/RedBlackTree.scala:442:
if (node.left ne null) foreachNodeKeyNonNull(node.left, f)scala/collection/mutable/RedBlackTree.scala:444:
if (node.right ne null) foreachNodeKeyNonNull(node.right, f)scala/collection/mutable/RedBlackTree.scala:453:
if (node.left ne null) transformNodeNonNull(node.left, f)scala/collection/mutable/RedBlackTree.scala:455:
if (node.right ne null) transformNodeNonNull(node.right, f)scala/collection/mutable/RedBlackTree.scala:534:
else hasProperParentRefs(node.left) && hasProperParentRefs(node.right)scala/collection/mutable/RedBlackTree.scala:534:
else hasProperParentRefs(node.left) && hasProperParentRefs(node.right)scala/collection/mutable/RedBlackTree.scala:550:
else isValidBST(node.left) && isValidBST(node.right)scala/collection/mutable/RedBlackTree.scala:550:
else isValidBST(node.left) && isValidBST(node.right)scala/collection/mutable/RedBlackTree.scala:563:
else noRedAfterRed(node.left) && noRedAfterRed(node.right)scala/collection/mutable/RedBlackTree.scala:563:
else noRedAfterRed(node.left) && noRedAfterRed(node.right)scala/collection/mutable/RedBlackTree.scala:569:
val lh = blackHeight(node.left)scala/collection/mutable/RedBlackTree.scala:570:
val rh = blackHeight(node.right)scala/collection/mutable/SetLike.scala:232:
case s: Script[_] => s.iterator foreach <<scala/collection/mutable/UnrolledBuffer.scala:228:
next append elemscala/collection/mutable/UnrolledBuffer.scala:246:
if (idx < size) array(idx) else next.apply(idx - size)scala/collection/mutable/UnrolledBuffer.scala:248:
if (idx < size) array(idx) = newelem else next.update(idx - size, newelem)scala/collection/mutable/UnrolledBuffer.scala:250:
if (idx < size) this else next.locate(idx - size)scala/collection/mutable/UnrolledBuffer.scala:284:
} else next.remove(idx - size, buffer)scala/collection/mutable/UnrolledBuffer.scala:329:
else next.insertAll(idx - size, t, buffer)scala/collection/mutable/UnrolledBuffer.scala:348:
override def toString = array.take(size).mkString("Unrolled@%08x".format(System.identityHashCode(this)) + "[" + size + "/" + array.length + "](", ", ", ")") + " -> " + (if (next ne null) next.toString else "")scala/collection/parallel/ParIterableLike.scala:750:
val parseqspan = toSeq.takeWhile(pred)scala/collection/parallel/ParIterableLike.scala:775:
val (xs, ys) = toSeq.span(pred)scala/collection/parallel/ParIterableLike.scala:1378:
ScanNode(mergeTrees(trees, from, half), mergeTrees(trees, from + half, howmany - half))scala/collection/parallel/ParIterableLike.scala:1378:
ScanNode(mergeTrees(trees, from, half), mergeTrees(trees, from + half, howmany - half))scala/collection/parallel/ParIterableLike.scala:1404:
iterate(left, cb)scala/collection/parallel/ParIterableLike.scala:1405:
iterate(right, cb)scala/collection/parallel/ParMapLike.scala:65:
val ss = iter.split.map(keysIterator(_))scala/collection/parallel/ParMapLike.scala:70:
def dup = keysIterator(iter.dup)scala/collection/parallel/ParMapLike.scala:82:
val ss = iter.split.map(valuesIterator(_))scala/collection/parallel/ParMapLike.scala:87:
def dup = valuesIterator(iter.dup)scala/collection/parallel/Tasks.scala:482:
val subfutures = for (subtask <- subtasks.iterator) yield compute(subtask, depth + 1)scala/collection/parallel/immutable/ParHashMap.scala:315:
htm.elems(i) = evaluateCombiners(htm.elems(i)).asInstanceOf[HashMap[k, v]]scala/collection/parallel/mutable/ParArray.scala:616:
iterate(left)scala/collection/parallel/mutable/ParArray.scala:617:
iterate(right)scala/collection/parallel/mutable/ParHashMap.scala:128:
def count(e: HashEntry[K, DefaultEntry[K, V]]): Int = if (e eq null) 0 else 1 + count(e.next)scala/collection/parallel/mutable/ParHashMap.scala:139:
if (index(elemHashCode(e.key)) == i) check(e.next)scala/collection/parallel/mutable/ParHashMap.scala:140:
else ("Element " + e.key + " at " + i + " with " + elemHashCode(e.key) + " maps to " + index(elemHashCode(e.key))) :: check(e.next)scala/concurrent/BatchingExecutor.scala:75:
processBatch(_tasksLocal.get) // since head.run() can add entries, always do _tasksLocal.get herescala/concurrent/Future.scala:730:
case other => searchNext(i)scala/concurrent/Future.scala:759:
else i.next().flatMap { value => foldNext(i, op(prevValue, value), op) }scala/concurrent/duration/Duration.scala:712:
if (length % divider == 0) loop(length / divider, coarser)scala/concurrent/impl/ExecutionContextImpl.scala:41:
case other => currentNumberOfThreads.compareAndSet(other, other + 1) || reserveThread()scala/concurrent/impl/ExecutionContextImpl.scala:46:
case other => currentNumberOfThreads.compareAndSet(other, other - 1) || deregisterThread()scala/concurrent/impl/Promise.scala:212:
case newLinked: DefaultPromise[_] => compressedRoot(newLinked)scala/concurrent/impl/Promise.scala:225:
case linked: DefaultPromise[_] => linked.asInstanceOf[DefaultPromise[T]].rootscala/concurrent/impl/Promise.scala:266:
case dp: DefaultPromise[_] => compressedRoot(dp).value0scala/concurrent/impl/Promise.scala:275:
case dp: DefaultPromise[_] => compressedRoot(dp).isCompleted0scala/concurrent/impl/Promise.scala:296:
if (compareAndSet(cur, v)) cur else tryCompleteAndGetListeners(v)scala/concurrent/impl/Promise.scala:297:
case dp: DefaultPromise[_] => compressedRoot(dp).tryCompleteAndGetListeners(v)scala/concurrent/impl/Promise.scala:313:
case dp: DefaultPromise[_] => compressedRoot(dp).dispatchOrAddCallback(runnable)scala/concurrent/impl/Promise.scala:315:
else dispatchOrAddCallback(runnable)scala/concurrent/impl/Promise.scala:340:
compressedRoot(dp).link(target)scala/concurrent/impl/Promise.scala:345:
link(target)scala/io/Source.scala:36:
} withReset(() => fromIterable(iterable))scala/io/Source.scala:96:
() => fromFile(file, bufferSize)(codec),scala/io/Source.scala:160:
val resetFn = if (reset == null) () => createBufferedSource(inputStream, bufferSize, reset, close)(codec) else resetscala/io/Source.scala:169:
createBufferedSource(is, reset = () => fromInputStream(is)(codec), close = () => is.close())(codec)scala/reflect/ClassManifestDeprecatedApis.scala:30:
loop(xs - next, seen + next)scala/reflect/ClassTag.scala:92: `if (clazz.isArray) s"Array[${prettyprint(c