func TestGetPartSizeFromIdx(t *testing.T) {
	// Create test cases
	testCases := []struct {
		totalSize    int64
		partSize     int64
		partIndex    int
		expectedSize int64
	}{
		// Total size is zero
		{0, 10, 1, 0},
		// part size 2MiB, total size 4MiB
		{4 * humanize.MiByte, 2 * humanize.MiByte, 1, 2 * humanize.MiByte},
		{4 * humanize.MiByte, 2 * humanize.MiByte, 2, 2 * humanize.MiByte},

		"Enable verbose output")
	analysisCmd.PersistentFlags().Var(&failureThreshold, "failure-threshold",
		fmt.Sprintf("The severity level of analysis at which to set a non-zero exit code. Valid values: %v", diag.GetAllLevelStrings()))
	analysisCmd.PersistentFlags().Var(&outputThreshold, "output-threshold",

     * CRC(A000A000A000...), CRC(0B000B000B...), CRC(00C000C000C...), CRC(000D000D000D...)
     * and then to XOR them together.  The STRIDE_TABLE enables us to hash an int followed by 12
     * zero bytes (3 ints), while the BYTE_TABLE is for advancing one byte at a time.
     * This algorithm is due to the paper "Everything we know about CRC but [are] afraid to forget"
     * by Kadatch and Jenkins, 2010.
     */

labels.searchlog_log_type_favorite=Favorite Log
labels.searchlog_log_type_user_info=User Information
labels.searchlog_log_type_search_keyword=Keywords
labels.searchlog_log_type_search_zerohit=Zero Hits
labels.searchlog_log_type_search_zeroclick=Zero Clicks
labels.searchlog_log_type_search_count_hour=Keyword by Hour
labels.searchlog_log_type_search_count_day=Keyword by Day
labels.searchlog_log_type_search_user_hour=User by Hour

labels.searchlog_log_type_favorite	=	Journal favori
labels.searchlog_log_type_user_info	=	informations de l'utilisateur
labels.searchlog_log_type_search_keyword	=	Mots clés
labels.searchlog_log_type_search_zerohit	=	Zéro succès
labels.searchlog_log_type_search_zeroclick	=	Zéro clic
labels.searchlog_log_type_search_count_hour	=	Mot-clé par heure
labels.searchlog_log_type_search_count_day	=	Mot-clé par jour
labels.searchlog_log_type_search_user_hour	=	Utilisateur par heure

    checkNotNull(file1);
    checkNotNull(file2);
    if (file1 == file2 || file1.equals(file2)) {
      return true;
    }

    /*
     * Some operating systems may return zero as the length for files denoting system-dependent
     * entities such as devices or pipes, in which case we must fall back on comparing the bytes
     * directly.
     */
    long len1 = file1.length();

labels.searchlog_log_type_favorite=Favorite Log
labels.searchlog_log_type_user_info=User Information
labels.searchlog_log_type_search_keyword=Keywords
labels.searchlog_log_type_search_zerohit=Zero Hits
labels.searchlog_log_type_search_zeroclick=Zero Clicks
labels.searchlog_log_type_search_count_hour=Keyword by Hour
labels.searchlog_log_type_search_count_day=Keyword by Day
labels.searchlog_log_type_search_user_hour=User by Hour

    checkNotNull(path1);
    checkNotNull(path2);
    if (Files.isSameFile(path1, path2)) {
      return true;
    }

    /*
     * Some operating systems may return zero as the length for files denoting system-dependent
     * entities such as devices or pipes, in which case we must fall back on comparing the bytes
     * directly.
     */
    ByteSource source1 = asByteSource(path1);

    checkNotNull(path1);
    checkNotNull(path2);
    if (Files.isSameFile(path1, path2)) {
      return true;
    }

    /*
     * Some operating systems may return zero as the length for files denoting system-dependent
     * entities such as devices or pipes, in which case we must fall back on comparing the bytes
     * directly.
     */
    ByteSource source1 = asByteSource(path1);

//   prefix: myprefix # (Optional) Prefix under which this job will expire objects matching the rules below.
//   rules:
//     - type: object  # regular objects with zero or more older versions
//       name: NAME # match object names that satisfy the wildcard expression.
//       olderThan: 70h # match objects older than this value