===========================================================
                                      .___ __  __   
          _________________  __ __  __| _/|__|/  |_ 
         / ___\_` __ \__  \ |  |  \/ __ | | \\_  __\
        / /_/  >  | \// __ \|  |  / /_/ | |  ||  |  
        \___  /|__|  (____  /____/\____ | |__||__|  
       /_____/            \/           \/           
              grep rough audit - static analysis tool
                  v2.8 written by @Wireghoul
=================================[justanotherhacker.com]===
r-cran-bit-4.0.4+dfsg/vignettes/bit-usage.Rmd-53-
r-cran-bit-4.0.4+dfsg/vignettes/bit-usage.Rmd:54:- length is limited to `.Machine$integer.max`
r-cran-bit-4.0.4+dfsg/vignettes/bit-usage.Rmd-55-- currently only `vector` methods are supported, not `matrix` or `array`
##############################################
r-cran-bit-4.0.4+dfsg/vignettes/bit-usage.Rmd-621-
r-cran-bit-4.0.4+dfsg/vignettes/bit-usage.Rmd:622:For `N` consecutive permuted integers this is by an order of magnitude faster than *quicksort*. For a *density* $d=N/(max-min) \ge 1$ this sort beats quicksort, but for $d << 1$ the bit vector becomes too large relative to `N` and hence quicksort is faster. `bit_sort_unique` implements a hybrid algorithm automatically choosing the faster of both, hence for integers the following gives identical results
r-cran-bit-4.0.4+dfsg/vignettes/bit-usage.Rmd-623-
##############################################
r-cran-bit-4.0.4+dfsg/inst/doc/bit-usage.Rmd-53-
r-cran-bit-4.0.4+dfsg/inst/doc/bit-usage.Rmd:54:- length is limited to `.Machine$integer.max`
r-cran-bit-4.0.4+dfsg/inst/doc/bit-usage.Rmd-55-- currently only `vector` methods are supported, not `matrix` or `array`
##############################################
r-cran-bit-4.0.4+dfsg/inst/doc/bit-usage.Rmd-621-
r-cran-bit-4.0.4+dfsg/inst/doc/bit-usage.Rmd:622:For `N` consecutive permuted integers this is by an order of magnitude faster than *quicksort*. For a *density* $d=N/(max-min) \ge 1$ this sort beats quicksort, but for $d << 1$ the bit vector becomes too large relative to `N` and hence quicksort is faster. `bit_sort_unique` implements a hybrid algorithm automatically choosing the faster of both, hence for integers the following gives identical results
r-cran-bit-4.0.4+dfsg/inst/doc/bit-usage.Rmd-623-