===========================================================
                                      .___ __  __   
          _________________  __ __  __| _/|__|/  |_ 
         / ___\_` __ \__  \ |  |  \/ __ | | \\_  __\
        / /_/  >  | \// __ \|  |  / /_/ | |  ||  |  
        \___  /|__|  (____  /____/\____ | |__||__|  
       /_____/            \/           \/           
              grep rough audit - static analysis tool
                  v2.8 written by @Wireghoul
=================================[justanotherhacker.com]===
libalgorithm-combinatorics-perl-0.27/README-134-
libalgorithm-combinatorics-perl-0.27/README:135:    The variations of length `$k' of `@data' are all the tuples of length
libalgorithm-combinatorics-perl-0.27/README:136:    `$k' consisting of elements of `@data'. For example, for `@data = (1, 2,
libalgorithm-combinatorics-perl-0.27/README-137-    3)' and `$k = 2':
##############################################
libalgorithm-combinatorics-perl-0.27/README-163-
libalgorithm-combinatorics-perl-0.27/README:164:    The variations with repetition of length `$k' of `@data' are all the
libalgorithm-combinatorics-perl-0.27/README:165:    tuples of length `$k' consisting of elements of `@data', including
libalgorithm-combinatorics-perl-0.27/README-166-    repetitions. For example, for `@data = (1, 2, 3)' and `$k = 2':
##############################################
libalgorithm-combinatorics-perl-0.27/README-177-
libalgorithm-combinatorics-perl-0.27/README:178:    Note that `$k' can be greater than the length of `@data'. For example,
libalgorithm-combinatorics-perl-0.27/README-179-    for `@data = (1, 2)' and `$k = 3':
##############################################
libalgorithm-combinatorics-perl-0.27/README-204-
libalgorithm-combinatorics-perl-0.27/README:205:    The combinations of length `$k' of `@data' are all the sets of size `$k'
libalgorithm-combinatorics-perl-0.27/README-206-    consisting of elements of `@data'. For example, for `@data = (1, 2, 3,
##############################################
libalgorithm-combinatorics-perl-0.27/README-223-
libalgorithm-combinatorics-perl-0.27/README:224:    The combinations of length `$k' of an array `@data' are all the bags of
libalgorithm-combinatorics-perl-0.27/README:225:    size `$k' consisting of elements of `@data', with repetitions. For
libalgorithm-combinatorics-perl-0.27/README-226-    example, for `@data = (1, 2, 3)' and `$k = 2':
##############################################
libalgorithm-combinatorics-perl-0.27/README-234-
libalgorithm-combinatorics-perl-0.27/README:235:    Note that `$k' can be greater than the length of `@data'. For example,
libalgorithm-combinatorics-perl-0.27/README-236-    for `@data = (1, 2, 3)' and `$k = 4':
##############################################
libalgorithm-combinatorics-perl-0.27/README-330-
libalgorithm-combinatorics-perl-0.27/README:331:    *   If `$k' is greater than the size of `@data', and we are calling a
libalgorithm-combinatorics-perl-0.27/README-332-        subroutine that does not generate tuples with repetitions, no tuple