Class: Dict

Dict(framenon-null, leq)

new Dict(framenon-null, leq)

A list of edges crossing the sweep line, sorted from top to bottom. Implementation is a doubly-linked list, sorted by the injected edgeLeq comparator function. Here it is a simple ordering, but see libtess.sweep for the list of invariants on the edge dictionary this ordering creates.
Parameters:
Name Type Description
frame libtess.GluTesselator
leq function
Source:

Methods

deleteNode(node)

Remove node from the list.
Parameters:
Name Type Description
node libtess.DictNode
Source:

getMax() → (non-null) {libtess.DictNode}

Returns the node with the greatest key.
Source:
Returns:
Type
libtess.DictNode

getMin() → (non-null) {libtess.DictNode}

Return the node with the smallest key.
Source:
Returns:
Type
libtess.DictNode

insert(keynon-null) → (non-null) {libtess.DictNode}

Insert key into the dict and return the new node that contains it.
Parameters:
Name Type Description
key libtess.ActiveRegion
Source:
Returns:
Type
libtess.DictNode

insertBefore(node, keynon-null) → (non-null) {libtess.DictNode}

Insert the supplied key into the edge list and return its new node.
Parameters:
Name Type Description
node libtess.DictNode
key libtess.ActiveRegion
Source:
Returns:
Type
libtess.DictNode
Search returns the node with the smallest key greater than or equal to the given key. If there is no such key, returns a node whose key is null. Similarly, max(d).getSuccessor() has a null key, etc.
Parameters:
Name Type Description
key libtess.ActiveRegion
Source:
Returns:
Type
libtess.DictNode