Step 2.
a) Choose the method(s) to be analyzed or Select All
Read methods 95 -- 59 -- 60 Read methods 95 -- 59 -- 63 Read methods 95 -- 64 -- 65 Read methods 95 -- 66 -- 65 Read methods 95 -- 67 -- 68 Read methods 95 -- 69 -- 68 Read methods 95 -- 70 -- 71 Read methods 95 -- 72 -- 73 Read methods 95 -- 74 -- 75 Read methods 95 -- 76 -- 60 Read methods 95 -- 77 -- 68 Read methods 95 -- 78 -- 79 Read methods 95 -- 80 -- 81 Read methods 95 -- 82 -- 83 Read methods 95 -- 84 -- 83 Read methods 95 -- 85 -- 86 Read methods 95 -- 87 -- 88 <init>()V
<init>(DD)V
setLeft(Lmemory/jolden/voronoi/Vertex;)V
setRight(Lmemory/jolden/voronoi/Vertex;)V
getLeft()Lmemory/jolden/voronoi/Vertex;
getRight()Lmemory/jolden/voronoi/Vertex;
createPoints(ILmemory/jolden/voronoi/MyDouble;I)Lmemory/jolden/voronoi/Vertex;
buildDelaunayTriangulation(Lmemory/jolden/voronoi/Vertex;)Lmemory/jolden/voronoi/Edge;
buildDelaunay(Lmemory/jolden/voronoi/Vertex;)Lmemory/jolden/voronoi/EdgePair;
print()V
getLow()Lmemory/jolden/voronoi/Vertex;
incircle(Lmemory/jolden/voronoi/Vertex;Lmemory/jolden/voronoi/Vertex;Lmemory/jolden/voronoi/Vertex;)Z
ccw(Lmemory/jolden/voronoi/Vertex;Lmemory/jolden/voronoi/Vertex;)Z
mult(II)I
skiprand(II)I
random(I)I
drand()D

Context Info (Classes)

b) Cost Model
Number of instructions
Termination
Memory + Garbage Collector NoneScopedReachabilityLiveness
Number of calls to the method in the class

c) Provide an upper bound to check it? No Yes
e.g. [x]=2*x

d) Compute the asymptotic upper bound? No Normal Lazy

e) Select the user interface Automatic Manual