diff options
author | Ankur Dave <ankurdave@gmail.com> | 2014-01-10 18:36:42 -0800 |
---|---|---|
committer | Ankur Dave <ankurdave@gmail.com> | 2014-01-10 18:36:42 -0800 |
commit | c4fb6a87d386cfd0d8b9d8733e75b8bd8cc0359e (patch) | |
tree | c93de9e675e2b3d2cd4b5c367012af97331f8ef7 /graphx | |
parent | 0ca18b8b0787d1b467bc6de3e72ed9a52bdf63fc (diff) | |
download | spark-c4fb6a87d386cfd0d8b9d8733e75b8bd8cc0359e.tar.gz spark-c4fb6a87d386cfd0d8b9d8733e75b8bd8cc0359e.tar.bz2 spark-c4fb6a87d386cfd0d8b9d8733e75b8bd8cc0359e.zip |
Fix scaladoc warnings
Diffstat (limited to 'graphx')
-rw-r--r-- | graphx/src/main/scala/org/apache/spark/graphx/Graph.scala | 8 | ||||
-rw-r--r-- | graphx/src/main/scala/org/apache/spark/graphx/VertexRDD.scala | 4 |
2 files changed, 6 insertions, 6 deletions
diff --git a/graphx/src/main/scala/org/apache/spark/graphx/Graph.scala b/graphx/src/main/scala/org/apache/spark/graphx/Graph.scala index a188de5537..64d44c3e06 100644 --- a/graphx/src/main/scala/org/apache/spark/graphx/Graph.scala +++ b/graphx/src/main/scala/org/apache/spark/graphx/Graph.scala @@ -125,7 +125,7 @@ abstract class Graph[VD: ClassTag, ED: ClassTag] { /** * Transforms each edge attribute in the graph using the map function. The map function is not * passed the vertex value for the vertices adjacent to the edge. If vertex values are desired, - * use [[mapTriplets]]. + * use `mapTriplets`. * * @note This graph is not changed and that the new graph has the * same structure. As a consequence the underlying index structures @@ -148,7 +148,7 @@ abstract class Graph[VD: ClassTag, ED: ClassTag] { * time. The map function is given an iterator over edges within a logical partition as well as * the partition's ID, and it should return a new iterator over the new values of each edge. The * new iterator's elements must correspond one-to-one with the old iterator's elements. If - * adjacent vertex values are desired, use [[mapTriplets]]. + * adjacent vertex values are desired, use `mapTriplets`. * * @note This does not change the structure of the * graph or modify the values of this graph. As a consequence @@ -166,7 +166,7 @@ abstract class Graph[VD: ClassTag, ED: ClassTag] { /** * Transforms each edge attribute using the map function, passing it the adjacent vertex attributes - * as well. If adjacent vertex values are not required, consider using [[mapEdges]] instead. + * as well. If adjacent vertex values are not required, consider using `mapEdges` instead. * * @note This does not change the structure of the * graph or modify the values of this graph. As a consequence @@ -194,7 +194,7 @@ abstract class Graph[VD: ClassTag, ED: ClassTag] { * adjacent vertex attributes as well. The map function is given an iterator over edge triplets * within a logical partition and should yield a new iterator over the new values of each edge in * the order in which they are provided. If adjacent vertex values are not required, consider - * using [[mapEdges]] instead. + * using `mapEdges` instead. * * @note This does not change the structure of the * graph or modify the values of this graph. As a consequence diff --git a/graphx/src/main/scala/org/apache/spark/graphx/VertexRDD.scala b/graphx/src/main/scala/org/apache/spark/graphx/VertexRDD.scala index 3ef4fec405..d20745d0d4 100644 --- a/graphx/src/main/scala/org/apache/spark/graphx/VertexRDD.scala +++ b/graphx/src/main/scala/org/apache/spark/graphx/VertexRDD.scala @@ -101,9 +101,9 @@ class VertexRDD[@specialized VD: ClassTag]( } /** - * Applies a function to each [[impl.VertexPartition]] of this RDD and returns a new VertexRDD. + * Applies a function to each `VertexPartition` of this RDD and returns a new VertexRDD. */ - def mapVertexPartitions[VD2: ClassTag](f: VertexPartition[VD] => VertexPartition[VD2]) + private[graphx] def mapVertexPartitions[VD2: ClassTag](f: VertexPartition[VD] => VertexPartition[VD2]) : VertexRDD[VD2] = { val newPartitionsRDD = partitionsRDD.mapPartitions(_.map(f), preservesPartitioning = true) new VertexRDD(newPartitionsRDD) |