ssInsertionSort() — netty Function Reference
Architecture documentation for the ssInsertionSort() function in Bzip2DivSufSort.java from the netty codebase.
Entity Profile
Dependency Diagram
graph TD b61e4a7c_22ee_fad9_f021_387b63f20ea1["ssInsertionSort()"] 5a60cb70_bf06_95bf_9c73_ed3a4dc24eba["Bzip2DivSufSort"] b61e4a7c_22ee_fad9_f021_387b63f20ea1 -->|defined in| 5a60cb70_bf06_95bf_9c73_ed3a4dc24eba 1e0c07d3_ab29_8c77_bb12_13a34e73c315["ssMultiKeyIntroSort()"] 1e0c07d3_ab29_8c77_bb12_13a34e73c315 -->|calls| b61e4a7c_22ee_fad9_f021_387b63f20ea1 4de771c8_37be_d30e_9a72_bab498988da7["ssCompare()"] b61e4a7c_22ee_fad9_f021_387b63f20ea1 -->|calls| 4de771c8_37be_d30e_9a72_bab498988da7 style b61e4a7c_22ee_fad9_f021_387b63f20ea1 fill:#6366f1,stroke:#818cf8,color:#fff
Relationship Graph
Source Code
codec-compression/src/main/java/io/netty/handler/codec/compression/Bzip2DivSufSort.java lines 119–140
private void ssInsertionSort(int pa, int first, int last, int depth) {
final int[] SA = this.SA;
int i, j; // pointer within SA
int t;
int r;
for (i = last - 2; first <= i; --i) {
for (t = SA[i], j = i + 1; 0 < (r = ssCompare(pa + t, pa + SA[j], depth));) {
do {
SA[j - 1] = SA[j];
} while (++j < last && SA[j] < 0);
if (last <= j) {
break;
}
}
if (r == 0) {
SA[j] = ~SA[j];
}
SA[j - 1] = t;
}
}
Domain
Subdomains
Calls
Called By
Source
Frequently Asked Questions
What does ssInsertionSort() do?
ssInsertionSort() is a function in the netty codebase, defined in codec-compression/src/main/java/io/netty/handler/codec/compression/Bzip2DivSufSort.java.
Where is ssInsertionSort() defined?
ssInsertionSort() is defined in codec-compression/src/main/java/io/netty/handler/codec/compression/Bzip2DivSufSort.java at line 119.
What does ssInsertionSort() call?
ssInsertionSort() calls 1 function(s): ssCompare.
What calls ssInsertionSort()?
ssInsertionSort() is called by 1 function(s): ssMultiKeyIntroSort.
Analyze Your Own Codebase
Get architecture documentation, dependency graphs, and domain analysis for your codebase in minutes.
Try Supermodel Free