LexicalizedPathType

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. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def cacheVertexInformation(vertex: Vertex, hopNum: Int): Nothing

   

   Definition Classes

   LexicalizedPathType → PathType

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. val edgeTypes: Array[Int]

   

8. def encodeAsHumanReadableString(graph: Graph, edgeMap: Map[Int, String] = Map()): String

   

   Creates a human-digestable representation of the PathType.

   Creates a human-digestable representation of the PathType. To make it human readable, we need to convert the integers that show up in the path type into their string representations, using the provided dictionaries.

   Definition Classes

   LexicalizedPathType → PathType

9. def encodeAsHumanReadableStringWithoutNodes(graph: Graph, edgeMap: Map[Int, String] = Map()): String

   

10. def encodeAsString(): String

    

    Creates a machine-parseable representation of the PathType.

    Creates a machine-parseable representation of the PathType. This must match the ObjectParser[PathType] implementation in the PathTypeFactory. Edges types, node types, and whatever else, are encoded as integers.

    Definition Classes

    LexicalizedPathType → PathType

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

    

    Definition Classes

    AnyRef

12. def equals(other: Any): Boolean

    

    Definition Classes

    LexicalizedPathType → AnyRef → Any

13. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

14. implicit val formats: DefaultFormats.type

    

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

    

    Definition Classes

    AnyRef → Any

16. def hashCode(): Int

    

    Definition Classes

    LexicalizedPathType → AnyRef → Any

17. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

18. def isLastHop(hopNum: Int): Nothing

    

    Is this the last hop? This determines whether the walk gets sent to the companion for tracking statistics.

    Is this the last hop? This determines whether the walk gets sent to the companion for tracking statistics.

    Definition Classes

    LexicalizedPathType → PathType

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

    

    Definition Classes

    AnyRef

20. def nextHop(hopNum: Int, sourceVertex: Int, currentVertex: Vertex, random: Random, edgeExcluder: EdgeExcluder, cache: PathTypeVertexCache): Nothing

    

    Given the hop number and information about the current vertex, pick an edge to follow.

    Given the hop number and information about the current vertex, pick an edge to follow.

    The EdgeExcluder is an object that uses some global or external information to determine if the walk is not allowed, generally because it's using an edge from the test data, or an edge that we're trying to learn.

    It is advisable, if at all possible, to do whatever you can to avoid looping over all of the edges in this method. This is in the inner loop of the PathFollower, and so it will get run a _lot_. Even worse, the processing is distributed across threads by vertex, and if you loop over all of the edges, you make the amount of computation done by each thread more uneven, because vertices that have lots of edges tend to get more walks at them. So, really, try hard to avoid a loop over all of the edges. The cache parameter should be helpful for that.

    Definition Classes

    LexicalizedPathType → PathType

21. val nodes: Array[Int]

    

22. final def notify(): Unit

    

    Definition Classes

    AnyRef

23. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

24. val numHops: Int

    

25. val params: JValue

    

26. def recommendedIters(): Nothing

    

    How many iterations should we run if we want to be sure we complete the computation for this path type?

    How many iterations should we run if we want to be sure we complete the computation for this path type?

    Definition Classes

    LexicalizedPathType → PathType

27. val removeColon: String

    

28. val removeColonErrorMessage: String

    

29. val reverse: Array[Boolean]

    

30. def stringDescription(graph: Graph, edgeMap: Map[Int, String]): String

    

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

    

    Definition Classes

    AnyRef

32. def toString(): String

    

    Definition Classes

    LexicalizedPathType → AnyRef → Any

33. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )