diff options
| author | Jason Zaugg <jzaugg@gmail.com> | 2014-02-18 17:37:31 +0100 |
|---|---|---|
| committer | Adriaan Moors <adriaan.moors@typesafe.com> | 2014-02-18 15:41:26 -0800 |
| commit | bba01661ea629ff636a538226ad267a67d9dbfa7 (patch) | |
| tree | c5e3b82bcc6bc28bbdc012825bb219334ed2b6f0 /test/scaladoc/run | |
| parent | 3dbcb1b9d4daa5cba98747bbc66f898ba0f864fd (diff) | |
| download | scala-bba01661ea629ff636a538226ad267a67d9dbfa7.tar.gz scala-bba01661ea629ff636a538226ad267a67d9dbfa7.tar.bz2 scala-bba01661ea629ff636a538226ad267a67d9dbfa7.zip | |
SI-8229 Source compatible name for implicit any2stringadd
To support the established pattern for disabling it for
an compilation unit.
Update scaladoc's knowledge of our "typeclasses".
Leave a `private[scala]` version of `StringAdd` (public in bytecode)
to ensure binary compatibility with 2.11.0-M8 for partest.
Diffstat (limited to 'test/scaladoc/run')
| -rw-r--r-- | test/scaladoc/run/diagrams-base.scala | 2 | ||||
| -rw-r--r-- | test/scaladoc/run/diagrams-filtering.scala | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/test/scaladoc/run/diagrams-base.scala b/test/scaladoc/run/diagrams-base.scala index b7aeed51d2..1e83a78b38 100644 --- a/test/scaladoc/run/diagrams-base.scala +++ b/test/scaladoc/run/diagrams-base.scala @@ -46,7 +46,7 @@ object Test extends ScaladocModelTest { val (incoming, outgoing) = diag.edges.partition(!_._1.isThisNode) assert(incoming.length == 5) - assert(outgoing.head._2.length == 4) + assert(outgoing.head._2.length == 4, s"${outgoing.head._2} has length ${outgoing.head._2.length}, expecting 4") val (outgoingSuperclass, outgoingImplicit) = outgoing.head._2.partition(_.isNormalNode) assert(outgoingSuperclass.length == 3) diff --git a/test/scaladoc/run/diagrams-filtering.scala b/test/scaladoc/run/diagrams-filtering.scala index 54e3e9ac63..12b5f4caba 100644 --- a/test/scaladoc/run/diagrams-filtering.scala +++ b/test/scaladoc/run/diagrams-filtering.scala @@ -57,7 +57,7 @@ object Test extends ScaladocModelTest { // Assert we have just 3 nodes and 2 edges val A = base._trait("A") val ADiag = A.inheritanceDiagram.get - assert(ADiag.nodes.length == 3) + assert(ADiag.nodes.length == 3, s"${ADiag.nodes} has length ${ADiag.nodes.length}, expected 3") assert(ADiag.edges.map(_._2.length).sum == 2) // trait C |