lsSort() — netty Function Reference

Architecture documentation for the lsSort() function in Bzip2DivSufSort.java from the netty codebase.

Function java Buffer Allocators calls 1 called by 1

Entity Profile

Buffer→ Allocators→ lsSort() — netty Function Reference

Dependency Diagram

graph TD
  3d921cb0_f13e_75a1_dd66_01c31c095e3a["lsSort()"]
  5a60cb70_bf06_95bf_9c73_ed3a4dc24eba["Bzip2DivSufSort"]
  3d921cb0_f13e_75a1_dd66_01c31c095e3a -->|defined in| 5a60cb70_bf06_95bf_9c73_ed3a4dc24eba
  0800d61f_d4b4_d698_736e_dd03b4e4c519["trSort()"]
  0800d61f_d4b4_d698_736e_dd03b4e4c519 -->|calls| 3d921cb0_f13e_75a1_dd66_01c31c095e3a
  b1b8f883_b30c_f3e3_fb38_5b1b8977d8d5["lsIntroSort()"]
  3d921cb0_f13e_75a1_dd66_01c31c095e3a -->|calls| b1b8f883_b30c_f3e3_fb38_5b1b8977d8d5
  style 3d921cb0_f13e_75a1_dd66_01c31c095e3a fill:#6366f1,stroke:#818cf8,color:#fff

Relationship Graph

Source Code

codec-compression/src/main/java/io/netty/handler/codec/compression/Bzip2DivSufSort.java lines 1297–1340

    private void lsSort(final int isa, final int n, final int depth) {
        final int[] SA = this.SA;

        int isaD;
        int first, last, i;
        int t, skip;

        for (isaD = isa + depth; -n < SA[0]; isaD += isaD - isa) {
            first = 0;
            skip = 0;
            do {
                if ((t = SA[first]) < 0) {
                    first -= t;
                    skip += t;
                } else {
                    if (skip != 0) {
                        SA[first + skip] = skip;
                        skip = 0;
                    }
                    last = SA[isa + t] + 1;
                    lsIntroSort(isa, isaD, isa + n, first, last);
                    first = last;
                }
            } while (first < n);
            if (skip != 0) {
                SA[first + skip] = skip;
            }
            if (n < isaD - isa) {
                first = 0;
                do {
                    if ((t = SA[first]) < 0) {
                        first -= t;
                    } else {
                        last = SA[isa + t] + 1;
                        for (i = first; i < last; ++i) {
                            SA[isa + SA[i]] = i;
                        }
                        first = last;
                    }
                } while (first < n);
                break;
            }
        }
    }