grammarscope.allocator

Class AnchorAllocator<V extends IsIndexedVertex<E>,E extends Graph.IGraphEdge<V>>

java.lang.Object

grammarscope.allocator.AnchorAllocator<V,E>

public class AnchorAllocator<V extends IsIndexedVertex<E>,E extends Graph.IGraphEdge<V>>
extends java.lang.Object

Graph edge anchor allocator. Anchors are (float) shift value shifts from edge end center.

Author:

Bernard Bou

Field Summary

Fields

Modifier and Type	Field and Description
private java.util.Map<V,Triple<java.lang.Integer,java.lang.Integer,java.util.Map<E,java.lang.Integer>>>	anchors Cache of allocated anchors

Constructor Summary

Constructors

Constructor and Description
AnchorAllocator() Constructor

Method Summary

Modifier and Type	Method and Description
void	allocate(java.util.Collection<V> nodes, java.util.Comparator<E> leftComparator, java.util.Comparator<E> rightComparator) Allocate node slots
static float	center(int i, int left, int right) Center
float	getAnchor(V node, E edge) Get anchor
float	getLeftAnchor(E edge) Get edge's left anchor
private V	getLeftNode(Graph.IGraphEdge<V> edge) Get left node
float	getRightAnchor(E edge) Get edge's right anchor
private V	getRightNode(Graph.IGraphEdge<V> edge) Get right node
private boolean	isBackwards(Graph.IGraphEdge<V> edge) Is backwards
private boolean	isLeftIncident(Graph.IGraphEdge<V> edge, V node) Is left incident
private boolean	isRightIncident(Graph.IGraphEdge<V> edge, V node) Is right incident
java.lang.String	toString()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

anchors

private final java.util.Map<V extends IsIndexedVertex<E>,Triple<java.lang.Integer,java.lang.Integer,java.util.Map<E extends Graph.IGraphEdge<V>,java.lang.Integer>>> anchors

Cache of allocated anchors

Constructor Detail

AnchorAllocator

public AnchorAllocator()

Constructor

Method Detail

allocate

public void allocate(java.util.Collection<V> nodes,
                     java.util.Comparator<E> leftComparator,
                     java.util.Comparator<E> rightComparator)

Allocate node slots

Parameters:

nodes - collection of nodes

leftComparator - anchor allocation order

rightComparator - anchor allocation order

getAnchor

public float getAnchor(V node,
                       E edge)

Get anchor

Parameters:

node - node

edge - oncoming or outgoing edge

Returns:

anchor

getLeftAnchor

public float getLeftAnchor(E edge)

Get edge's left anchor

Parameters:

edge - edge

Returns:

left anchor

getRightAnchor

public float getRightAnchor(E edge)

Get edge's right anchor

Parameters:

edge - edge

Returns:

right anchor

center

public static float center(int i,
                           int left,
                           int right)

Center

Parameters:

i - index

left - leftmost index

right - rightmost index

Returns:

centering offset for node

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

isBackwards

private boolean isBackwards(Graph.IGraphEdge<V> edge)

Is backwards

Parameters:

edge - edge

Returns:

whether this edge is backwards

isRightIncident

private boolean isRightIncident(Graph.IGraphEdge<V> edge,
                                V node)

Is right incident

Parameters:

edge - edge

node - node

Returns:

whether this edge is right incident relative to this node

isLeftIncident

private boolean isLeftIncident(Graph.IGraphEdge<V> edge,
                               V node)

Is left incident

Parameters:

edge - edge

node - node

Returns:

whether this edge is left incident relative to this node

getLeftNode

private V getLeftNode(Graph.IGraphEdge<V> edge)

Get left node

Parameters:

edge - edge

Returns:

left node

getRightNode

private V getRightNode(Graph.IGraphEdge<V> edge)

Get right node

Parameters:

edge - edge

Returns:

right node