facebookresearch / asynchronousratchetingtree
Conditional Complexity

The distribution of complexity of units (measured with McCabe index).

Intro
  • Conditional complexity (also called cyclomatic complexity) is a term used to measure the complexity of software. The term refers to the number of possible paths through a program function. A higher value ofter means higher maintenance and testing costs (infosecinstitute.com).
  • Conditional complexity is calculated by counting all conditions in the program that can affect the execution path (e.g. if statement, loops, switches, and/or operators, try and catch blocks...).
  • Conditional complexity is measured at the unit level (methods, functions...).
  • Units are classified in four categories based on the measured McCabe index: 1-5 (simple units), 6-10 (medium complex units), 11-25 (complex units), 26+ (very complex units).
Learn more...
Conditional Complexity Overall
  • There are 447 units with 3,812 lines of code in units (73.2% of code).
    • 0 very complex units (0 lines of code)
    • 1 complex units (47 lines of code)
    • 14 medium complex units (595 lines of code)
    • 28 simple units (846 lines of code)
    • 404 very simple units (2,324 lines of code)
0% | 1% | 15% | 22% | 60%
Legend:
51+
26-50
11-25
6-10
1-5
Alternative Visuals
Conditional Complexity per Extension
51+
26-50
11-25
6-10
1-5
java0% | 1% | 15% | 22% | 60%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
asynchronousratchetingtree/art/message/thrift0% | 2% | 18% | 26% | 52%
asynchronousratchetingtree/dhratchet/message/thrift0% | 0% | 17% | 24% | 57%
asynchronousratchetingtree0% | 0% | 26% | 12% | 60%
asynchronousratchetingtree/art0% | 0% | 0% | 14% | 85%
asynchronousratchetingtree/dhratchet0% | 0% | 0% | 23% | 76%
asynchronousratchetingtree/art/message0% | 0% | 0% | 0% | 100%
asynchronousratchetingtree/art/tree0% | 0% | 0% | 0% | 100%
asynchronousratchetingtree/crypto0% | 0% | 0% | 0% | 100%
asynchronousratchetingtree/dhratchet/message0% | 0% | 0% | 0% | 100%
Most Complex Units
Top 20 most complex units
Unit# linesMcCabe index# params
public boolean equals()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/SetupMessageStruct.java
 47 36 1
private static TestResult testRun()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/Main.java
 93 25 5
public boolean equals()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/NodeStruct.java
 31 24 1
public boolean equals()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/dhratchet/message/thrift/DHRatchetSetupMessageStruct.java
 31 22 1
public boolean equals()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/dhratchet/message/thrift/DHRatchetMessageStruct.java
 31 22 1
public int compareTo()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/SetupMessageStruct.java
 57 17 1
public boolean equals()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/CiphertextMessageStruct.java
 23 17 1
public boolean equals()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/AuthenticatedMessageStruct.java
 23 17 1
public void read()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/SetupMessageStruct.java
 81 15 2
public boolean equals()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/UpdateMessageStruct.java
 23 15 1
public void write()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/SetupMessageStruct.java
 48 13 2
public void setFieldValue()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/SetupMessageStruct.java
 43 12 2
public int compareTo()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/NodeStruct.java
 37 11 1
public int compareTo()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/dhratchet/message/thrift/DHRatchetSetupMessageStruct.java
 37 11 1
public int compareTo()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/dhratchet/message/thrift/DHRatchetMessageStruct.java
 37 11 1
public int hashCode()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/SetupMessageStruct.java
 17 9 0
public void read()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/art/message/thrift/NodeStruct.java
 44 9 2
public void setFieldValue()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/dhratchet/message/thrift/DHRatchetSetupMessageStruct.java
 33 9 2
public void read()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/dhratchet/message/thrift/DHRatchetSetupMessageStruct.java
 42 9 2
public void setFieldValue()
in AsynchronousRatchetingTree/src/main/java/com/facebook/research/asynchronousratchetingtree/dhratchet/message/thrift/DHRatchetMessageStruct.java
 33 9 2