Docjar: A Java Source and Docuemnt Enginecom.*    java.*    javax.*    org.*    all    new    plug-in

Quick Search    Search Deep

com.port80.graph.dot.impl
Class ShortestPath.Dequeue  view ShortestPath.Dequeue download ShortestPath.Dequeue.java

java.lang.Object
  extended bycom.port80.graph.dot.impl.ShortestPath.Dequeue
Enclosing class:
ShortestPath

static class ShortestPath.Dequeue
extends java.lang.Object


Field Summary
(package private)  int first
           
(package private)  int last
           
(package private)  int pivot
           
(package private)  ShortestPath.PointLink[] pts
           
 
Constructor Summary
ShortestPath.Dequeue()
           
ShortestPath.Dequeue(int n)
           
 
Method Summary
 void append(ShortestPath.PointLink pt)
          Add a point to the back.
 void grow(int n)
          Grow pts array by size 'n'.
 void growTo(int n)
          Grow pts array to size 'n'.
 void prepend(ShortestPath.PointLink pt)
          Add a point to the front.
 void removeAfter(int index)
           
 void removeBefore(int index)
           
 int size()
           
 int splitIndexOf(ShortestPath.PointLink pt)
           
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

pts

ShortestPath.PointLink[] pts

first

int first

last

int last

pivot

int pivot
Constructor Detail

ShortestPath.Dequeue

public ShortestPath.Dequeue()

ShortestPath.Dequeue

public ShortestPath.Dequeue(int n)
Method Detail

grow

public void grow(int n)
Grow pts array by size 'n'.


growTo

public void growTo(int n)
Grow pts array to size 'n'.


size

public int size()

prepend

public void prepend(ShortestPath.PointLink pt)
Add a point to the front.


append

public void append(ShortestPath.PointLink pt)
Add a point to the back.


removeAfter

public void removeAfter(int index)

removeBefore

public void removeBefore(int index)

splitIndexOf

public int splitIndexOf(ShortestPath.PointLink pt)