feat(scripts): add lint-diskio-complexities

[wenkokke]

This PR adds a script to dump the disk I/O complexities from the table in the package description.

[wenkokke]

@jeltsch This script should work well with the sed scripts that you've written for checking the complexities.

[jeltsch]

@jeltsch This script should work well with the sed scripts that you've written for checking the complexities.

Cool! I just had a quick look at its source code and will have a closer look tomorrow.

[wenkokke]

The lint-diskio-complexities script finds the following inconsistencies:

Comparing Database.LSMTree.Simple to Database.LSMTree:
Database.LSMTree.Simple closeCursor           LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree        closeCursor           *             O(T\log_T\frac{n}{B})            
Database.LSMTree.Simple deleteSnapshot        LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree        deleteSnapshot        *             O(T\log_T\frac{n}{B})            
Database.LSMTree.Simple duplicate             *             O(1)                             
Database.LSMTree        duplicate             *             O(0)                             
Database.LSMTree.Simple lookups               LazyLevelling O(b T\log_T\frac{n}{B})          
Database.LSMTree        lookups               LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree.Simple members               LazyLevelling O(b T\log_T\frac{n}{B})          
Database.LSMTree        members               LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree.Simple newCursor             LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree        newCursor             *             O(T\log_T\frac{n}{B})            
Database.LSMTree.Simple next                  *             O(\frac{1}{P})                   
Database.LSMTree        next                  *             O(1)                             
Database.LSMTree.Simple openTableFromSnapshot *             O(\frac{n}{P})                   
Database.LSMTree        openTableFromSnapshot *             O(n)                             
Database.LSMTree.Simple rangeLookup           *             O(T\log_T\frac{n}{B}+\frac{b}{P})
Database.LSMTree        rangeLookup           *             O(T\log_T\frac{n}{B}+b)          
Database.LSMTree.Simple remainingUnionDebt    *             O(0)                             
Database.LSMTree        remainingUnionDebt    *             O(1)                             
Database.LSMTree.Simple saveSnapshot          LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree        saveSnapshot          *             O(T\log_T\frac{n}{B})            
Database.LSMTree.Simple supplyUnionCredits    *             O(\frac{b}{P})                   
Database.LSMTree        supplyUnionCredits    *             O(b)                             
Database.LSMTree.Simple take                  *             O(\frac{b}{P})                   
Database.LSMTree        take                  *             O(b)                             
Database.LSMTree.Simple takeWhile             *             O(\frac{b}{P})                   
Database.LSMTree        takeWhile             *             O(b)                             
Database.LSMTree.Simple union                 *             O(\frac{n}{P})                   
Database.LSMTree        union                 *             O(n)                             
Database.LSMTree.Simple withCursor            LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree        withCursor            *             O(T\log_T\frac{n}{B})            
Database.LSMTree.Simple withDuplicate         LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree        withDuplicate         *             O(0)                             
Database.LSMTree.Simple withIncrementalUnion  LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree        withIncrementalUnion  *             O(1)                             
Database.LSMTree.Simple withIncrementalUnions LazyLevelling O(T\log_T\frac{n}{B}+b)          
Database.LSMTree        withIncrementalUnions *             O(b)                             
Database.LSMTree.Simple withTableFromSnapshot *             O(\frac{n}{P})                   
Database.LSMTree        withTableFromSnapshot *             O(n)                             
Database.LSMTree.Simple withUnion             *             O(\frac{n}{P})                   
Database.LSMTree        withUnion             *             O(n)                             

Comparing lsm-tree.cabal to Database.LSMTree:
lsm-tree.cabal   closeCursor    LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree closeCursor    *             O(T\log_T\frac{n}{B})            
lsm-tree.cabal   deleteSnapshot LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree deleteSnapshot *             O(T\log_T\frac{n}{B})            
lsm-tree.cabal   newCursor      LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree newCursor      *             O(T\log_T\frac{n}{B})            
lsm-tree.cabal   next           *             O(\frac{1}{P})                   
Database.LSMTree next           *             O(1)                             
lsm-tree.cabal   openSnapshot   *             O(\frac{n}{P})                   
lsm-tree.cabal   rangeLookup    LazyLevelling O(T\log_T\frac{n}{B}+\frac{b}{P})
Database.LSMTree rangeLookup    *             O(T\log_T\frac{n}{B}+b)          
lsm-tree.cabal   saveSnapshot   LazyLevelling O(T\log_T\frac{n}{B})            
Database.LSMTree saveSnapshot   *             O(T\log_T\frac{n}{B})            
lsm-tree.cabal   union          *             O(\frac{n}{P})                   
Database.LSMTree union          *             O(n) 

[wenkokke]

The above mismatches are addressed by #741.

[jorisdral]

Was this accidentally added?

[jeltsch]

At least, I didn’t add it. 😉 To me, it also looks like being accidentally added. @wenkokke, do you think that it should be removed from the repository?