Step 2.
a) Choose the method(s) to be analyzed or Select All
Read methods 140 -- 64 -- 65 Read methods 140 -- 68 -- 69 Read methods 140 -- 70 -- 71 Read methods 140 -- 72 -- 69 Read methods 140 -- 73 -- 71 Read methods 140 -- 74 -- 75 Read methods 140 -- 76 -- 77 Read methods 140 -- 78 -- 79 Read methods 140 -- 80 -- 81 Read methods 140 -- 82 -- 83 Read methods 140 -- 84 -- 83 Read methods 140 -- 85 -- 86 Read methods 140 -- 87 -- 88 Read methods 140 -- 89 -- 92 Read methods 140 -- 93 -- 94 <init>()V
setNext(Lmemory/jolden/bh/Body;)V
getNext()Lmemory/jolden/bh/Body;
setProcNext(Lmemory/jolden/bh/Body;)V
getProcNext()Lmemory/jolden/bh/Body;
expandBox(Lmemory/jolden/bh/Tree;I)V
icTest(Lmemory/jolden/bh/Tree;)Z
loadTree(Lmemory/jolden/bh/Body;Lmemory/jolden/bh/MathVector;ILmemory/jolden/bh/Tree;)Lmemory/jolden/bh/Node;
hackcofm()D
elements()Ljava/util/Enumeration;
elementsRev()Ljava/util/Enumeration;
subindex(Lmemory/jolden/bh/Tree;I)I
hackGravity(DLmemory/jolden/bh/Node;)V
walkSubTree(DLmemory/jolden/bh/Node$HG;)Lmemory/jolden/bh/Node$HG;
toString()Ljava/lang/String;

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