org.apache.spark.util.collection.SortDataFormat Scala Examples
The following examples show how to use org.apache.spark.util.collection.SortDataFormat.
You can vote up the ones you like or vote down the ones you don't like,
and go to the original project or source file by following the links above each example.
Example 1
Source File: Edge.scala From drizzle-spark with Apache License 2.0 | 5 votes |
package org.apache.spark.graphx import org.apache.spark.util.collection.SortDataFormat def relativeDirection(vid: VertexId): EdgeDirection = if (vid == srcId) EdgeDirection.Out else { assert(vid == dstId); EdgeDirection.In } } object Edge { private[graphx] def lexicographicOrdering[ED] = new Ordering[Edge[ED]] { override def compare(a: Edge[ED], b: Edge[ED]): Int = { if (a.srcId == b.srcId) { if (a.dstId == b.dstId) 0 else if (a.dstId < b.dstId) -1 else 1 } else if (a.srcId < b.srcId) -1 else 1 } } private[graphx] def edgeArraySortDataFormat[ED] = new SortDataFormat[Edge[ED], Array[Edge[ED]]] { override def getKey(data: Array[Edge[ED]], pos: Int): Edge[ED] = { data(pos) } override def swap(data: Array[Edge[ED]], pos0: Int, pos1: Int): Unit = { val tmp = data(pos0) data(pos0) = data(pos1) data(pos1) = tmp } override def copyElement( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int) { dst(dstPos) = src(srcPos) } override def copyRange( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int, length: Int) { System.arraycopy(src, srcPos, dst, dstPos, length) } override def allocate(length: Int): Array[Edge[ED]] = { new Array[Edge[ED]](length) } } }
Example 2
Source File: Edge.scala From graphx-algorithm with GNU General Public License v2.0 | 5 votes |
package org.apache.spark.graphx import org.apache.spark.util.collection.SortDataFormat def relativeDirection(vid: VertexId): EdgeDirection = if (vid == srcId) EdgeDirection.Out else { assert(vid == dstId); EdgeDirection.In } } object Edge { private[graphx] def lexicographicOrdering[ED] = new Ordering[Edge[ED]] { override def compare(a: Edge[ED], b: Edge[ED]): Int = { if (a.srcId == b.srcId) { if (a.dstId == b.dstId) 0 else if (a.dstId < b.dstId) -1 else 1 } else if (a.srcId < b.srcId) -1 else 1 } } private[graphx] def edgeArraySortDataFormat[ED] = new SortDataFormat[Edge[ED], Array[Edge[ED]]] { override def getKey(data: Array[Edge[ED]], pos: Int): Edge[ED] = { data(pos) } override def swap(data: Array[Edge[ED]], pos0: Int, pos1: Int): Unit = { val tmp = data(pos0) data(pos0) = data(pos1) data(pos1) = tmp } override def copyElement( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int) { dst(dstPos) = src(srcPos) } override def copyRange( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int, length: Int) { System.arraycopy(src, srcPos, dst, dstPos, length) } override def allocate(length: Int): Array[Edge[ED]] = { new Array[Edge[ED]](length) } } }
Example 3
Source File: Edge.scala From sparkoscope with Apache License 2.0 | 5 votes |
package org.apache.spark.graphx import org.apache.spark.util.collection.SortDataFormat def relativeDirection(vid: VertexId): EdgeDirection = if (vid == srcId) EdgeDirection.Out else { assert(vid == dstId); EdgeDirection.In } } object Edge { private[graphx] def lexicographicOrdering[ED] = new Ordering[Edge[ED]] { override def compare(a: Edge[ED], b: Edge[ED]): Int = { if (a.srcId == b.srcId) { if (a.dstId == b.dstId) 0 else if (a.dstId < b.dstId) -1 else 1 } else if (a.srcId < b.srcId) -1 else 1 } } private[graphx] def edgeArraySortDataFormat[ED] = new SortDataFormat[Edge[ED], Array[Edge[ED]]] { override def getKey(data: Array[Edge[ED]], pos: Int): Edge[ED] = { data(pos) } override def swap(data: Array[Edge[ED]], pos0: Int, pos1: Int): Unit = { val tmp = data(pos0) data(pos0) = data(pos1) data(pos1) = tmp } override def copyElement( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int) { dst(dstPos) = src(srcPos) } override def copyRange( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int, length: Int) { System.arraycopy(src, srcPos, dst, dstPos, length) } override def allocate(length: Int): Array[Edge[ED]] = { new Array[Edge[ED]](length) } } }
Example 4
Source File: Edge.scala From multi-tenancy-spark with Apache License 2.0 | 5 votes |
package org.apache.spark.graphx import org.apache.spark.util.collection.SortDataFormat def relativeDirection(vid: VertexId): EdgeDirection = if (vid == srcId) EdgeDirection.Out else { assert(vid == dstId); EdgeDirection.In } } object Edge { private[graphx] def lexicographicOrdering[ED] = new Ordering[Edge[ED]] { override def compare(a: Edge[ED], b: Edge[ED]): Int = { if (a.srcId == b.srcId) { if (a.dstId == b.dstId) 0 else if (a.dstId < b.dstId) -1 else 1 } else if (a.srcId < b.srcId) -1 else 1 } } private[graphx] def edgeArraySortDataFormat[ED] = new SortDataFormat[Edge[ED], Array[Edge[ED]]] { override def getKey(data: Array[Edge[ED]], pos: Int): Edge[ED] = { data(pos) } override def swap(data: Array[Edge[ED]], pos0: Int, pos1: Int): Unit = { val tmp = data(pos0) data(pos0) = data(pos1) data(pos1) = tmp } override def copyElement( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int) { dst(dstPos) = src(srcPos) } override def copyRange( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int, length: Int) { System.arraycopy(src, srcPos, dst, dstPos, length) } override def allocate(length: Int): Array[Edge[ED]] = { new Array[Edge[ED]](length) } } }
Example 5
Source File: Edge.scala From iolap with Apache License 2.0 | 5 votes |
package org.apache.spark.graphx import org.apache.spark.util.collection.SortDataFormat def relativeDirection(vid: VertexId): EdgeDirection = if (vid == srcId) EdgeDirection.Out else { assert(vid == dstId); EdgeDirection.In } } object Edge { private[graphx] def lexicographicOrdering[ED] = new Ordering[Edge[ED]] { override def compare(a: Edge[ED], b: Edge[ED]): Int = { if (a.srcId == b.srcId) { if (a.dstId == b.dstId) 0 else if (a.dstId < b.dstId) -1 else 1 } else if (a.srcId < b.srcId) -1 else 1 } } private[graphx] def edgeArraySortDataFormat[ED] = new SortDataFormat[Edge[ED], Array[Edge[ED]]] { override def getKey(data: Array[Edge[ED]], pos: Int): Edge[ED] = { data(pos) } override def swap(data: Array[Edge[ED]], pos0: Int, pos1: Int): Unit = { val tmp = data(pos0) data(pos0) = data(pos1) data(pos1) = tmp } override def copyElement( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int) { dst(dstPos) = src(srcPos) } override def copyRange( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int, length: Int) { System.arraycopy(src, srcPos, dst, dstPos, length) } override def allocate(length: Int): Array[Edge[ED]] = { new Array[Edge[ED]](length) } } }
Example 6
Source File: Edge.scala From spark1.52 with Apache License 2.0 | 5 votes |
package org.apache.spark.graphx import org.apache.spark.util.collection.SortDataFormat def relativeDirection(vid: VertexId): EdgeDirection = if (vid == srcId) EdgeDirection.Out else { assert(vid == dstId); EdgeDirection.In } } object Edge { private[graphx] def lexicographicOrdering[ED] = new Ordering[Edge[ED]] { override def compare(a: Edge[ED], b: Edge[ED]): Int = { if (a.srcId == b.srcId) { if (a.dstId == b.dstId) 0 else if (a.dstId < b.dstId) -1 else 1 } else if (a.srcId < b.srcId) -1 else 1 } } private[graphx] def edgeArraySortDataFormat[ED] = new SortDataFormat[Edge[ED], Array[Edge[ED]]] { override def getKey(data: Array[Edge[ED]], pos: Int): Edge[ED] = { data(pos) } override def swap(data: Array[Edge[ED]], pos0: Int, pos1: Int): Unit = { val tmp = data(pos0) data(pos0) = data(pos1) data(pos1) = tmp } override def copyElement( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int) { dst(dstPos) = src(srcPos) } override def copyRange( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int, length: Int) { System.arraycopy(src, srcPos, dst, dstPos, length) } override def allocate(length: Int): Array[Edge[ED]] = { new Array[Edge[ED]](length) } } }
Example 7
Source File: Edge.scala From Spark-2.3.1 with Apache License 2.0 | 5 votes |
package org.apache.spark.graphx import org.apache.spark.util.collection.SortDataFormat def relativeDirection(vid: VertexId): EdgeDirection = if (vid == srcId) EdgeDirection.Out else { assert(vid == dstId); EdgeDirection.In } } object Edge { private[graphx] def lexicographicOrdering[ED] = new Ordering[Edge[ED]] { override def compare(a: Edge[ED], b: Edge[ED]): Int = { if (a.srcId == b.srcId) { if (a.dstId == b.dstId) 0 else if (a.dstId < b.dstId) -1 else 1 } else if (a.srcId < b.srcId) -1 else 1 } } private[graphx] def edgeArraySortDataFormat[ED] = new SortDataFormat[Edge[ED], Array[Edge[ED]]] { override def getKey(data: Array[Edge[ED]], pos: Int): Edge[ED] = { data(pos) } override def swap(data: Array[Edge[ED]], pos0: Int, pos1: Int): Unit = { val tmp = data(pos0) data(pos0) = data(pos1) data(pos1) = tmp } override def copyElement( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int) { dst(dstPos) = src(srcPos) } override def copyRange( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int, length: Int) { System.arraycopy(src, srcPos, dst, dstPos, length) } override def allocate(length: Int): Array[Edge[ED]] = { new Array[Edge[ED]](length) } } }
Example 8
Source File: Edge.scala From BigDatalog with Apache License 2.0 | 5 votes |
package org.apache.spark.graphx import org.apache.spark.util.collection.SortDataFormat def relativeDirection(vid: VertexId): EdgeDirection = if (vid == srcId) EdgeDirection.Out else { assert(vid == dstId); EdgeDirection.In } } object Edge { private[graphx] def lexicographicOrdering[ED] = new Ordering[Edge[ED]] { override def compare(a: Edge[ED], b: Edge[ED]): Int = { if (a.srcId == b.srcId) { if (a.dstId == b.dstId) 0 else if (a.dstId < b.dstId) -1 else 1 } else if (a.srcId < b.srcId) -1 else 1 } } private[graphx] def edgeArraySortDataFormat[ED] = new SortDataFormat[Edge[ED], Array[Edge[ED]]] { override def getKey(data: Array[Edge[ED]], pos: Int): Edge[ED] = { data(pos) } override def swap(data: Array[Edge[ED]], pos0: Int, pos1: Int): Unit = { val tmp = data(pos0) data(pos0) = data(pos1) data(pos1) = tmp } override def copyElement( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int) { dst(dstPos) = src(srcPos) } override def copyRange( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int, length: Int) { System.arraycopy(src, srcPos, dst, dstPos, length) } override def allocate(length: Int): Array[Edge[ED]] = { new Array[Edge[ED]](length) } } }
Example 9
Source File: Edge.scala From zen with Apache License 2.0 | 5 votes |
package org.apache.spark.graphx2 import org.apache.spark.util.collection.SortDataFormat def relativeDirection(vid: VertexId): EdgeDirection = if (vid == srcId) EdgeDirection.Out else { assert(vid == dstId); EdgeDirection.In } } object Edge { // scalastyle:off def lexicographicOrdering[ED] = new Ordering[Edge[ED]] { override def compare(a: Edge[ED], b: Edge[ED]): Int = { if (a.srcId == b.srcId) { if (a.dstId == b.dstId) 0 else if (a.dstId < b.dstId) -1 else 1 } else if (a.srcId < b.srcId) -1 else 1 } } def edgeArraySortDataFormat[ED] = new SortDataFormat[Edge[ED], Array[Edge[ED]]] { override def getKey(data: Array[Edge[ED]], pos: Int): Edge[ED] = { data(pos) } override def swap(data: Array[Edge[ED]], pos0: Int, pos1: Int): Unit = { val tmp = data(pos0) data(pos0) = data(pos1) data(pos1) = tmp } override def copyElement( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int) { dst(dstPos) = src(srcPos) } override def copyRange( src: Array[Edge[ED]], srcPos: Int, dst: Array[Edge[ED]], dstPos: Int, length: Int) { System.arraycopy(src, srcPos, dst, dstPos, length) } override def allocate(length: Int): Array[Edge[ED]] = { new Array[Edge[ED]](length) } } }