PTE

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. val APP_NAME: String

   

5. val EXEC_NAME: String

   

6. val VERSION: String

   

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. def availableMemoryBytes(gc: Boolean): Long

   

   get available memory size

   get available memory size

   gc

   if true, operate a system garbage collector

   returns

   available memory size

9. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. def enumType2(numColors: Short, partPath: Path, problems: Array[Long], colors: Array[Short], nodeSize_edgeSet: Int, fs: FileSystem): Iterator[(Long, Long, Long)]

    

    Find type-1 and type-2 triangles

    Find type-1 and type-2 triangles

    numColors

    the number of colors

    partPath

    partitioned file path

    problems

    to solve

    colors

    of the given subproblem

    nodeSize_edgeSet

    the maximum id number of a node.

    fs

    hadoop file system

    returns

    triangle iterator

11. def enumType3(numColors: Short, partPath: Path, colors: Array[Short], nodeSize_edgeSet: Int, fs: FileSystem): Iterator[(Long, Long, Long)]

    

    Find type-3 triangles

    Find type-3 triangles

    numColors

    the number of colors

    partPath

    partitioned file path

    colors

    of the given subproblem

    nodeSize_edgeSet

    the maximum id of a node.

    fs

    hadoop file system

    returns

    triangle iterator

12. def enumerateTriangles(partPath: String, numColors: Short, numNodes: Broadcast[Long], sc: SparkContext): RDD[(Long, Long, Long)]

    

    Find triangles.

    Find triangles.

    partPath

    partitioned file path

    numColors

    the number of colors

    numNodes

    the number of nodes in the input graph

    sc

    spark context

    returns

    an RDD containing triangles

13. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

14. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

15. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

16. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

17. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

18. def intersectIterator(uAdj: Array[Int], vAdj: Array[Int]): Iterator[Int]

    

    find intersection of two adj lists

    find intersection of two adj lists

    uAdj

    an adj list

    vAdj

    another adj list

    returns

    intersection of two adj lists

19. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

20. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

21. final def notify(): Unit

    

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

23. def partitionGraph(inputPath: String, partPath: String, numColors: Short, sc: SparkContext): Unit

    

    partition the input graph.

    partition the input graph. The partitioned graph are stored in partPath A partition with colors i and j is stored in partPath/edgeset-{i*numColors + j} as a binary file whose format is as follows: node1 #out-neighbors-of-node1 out-neighbor1 out-neighbor2 ... node2 #out-neighbors-of-node2 out-neighbor1 ...

    inputPath

    input file path

    partPath

    partition file path

    numColors

    the number of colors

    sc

    spark context

24. def printGC(): Unit

    

    print gc type

25. def run(inputPath: String, numColors: Short, sc: SparkContext): RDD[(Long, Long, Long)]

    

    submit the spark job.

    submit the spark job.

    inputPath

    input file path.

    numColors

    the number of colors

    sc

    spark context.

    returns

    an RDD containing triangles

26. def runByCLI(args: Array[String]): Unit

    

    run by command line interface

27. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

28. def toString(): String

    

    Definition Classes

    AnyRef → Any

29. def triangleIterator(ij: Array[Array[Int]], ik: Array[Array[Int]], jk: Array[Array[Int]], i: Short, j: Short, k: Short, numColors: Short): Iterator[(Long, Long, Long)]

    

    find triangles whose pivot edge is in 'ij', port edge is in 'ik', and starboard edge is in 'jk'

    find triangles whose pivot edge is in 'ij', port edge is in 'ik', and starboard edge is in 'jk'

    ij

    pivot edge set

    ik

    port edge set

    jk

    starboard edge set

    i

    the first color

    j

    the second color

    k

    the last color

    numColors

    the number of colors

    returns

    triangles whose pivot edge is in 'ij', port edge is in 'ik', and starboard edge is in 'jk'

30. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

31. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

32. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )