String result = purgeThumbnailJob.execute();

        assertEquals("Deleted 0 thumbnail files.", result);
        assertEquals(30L * 24 * 60 * 60 * 1000L, thumbnailManager.getPurgeExpiry());
    }

    // Test execute with successful purge (single file deleted)
    @Test
    public void test_execute_singleFileDeleted() {
        thumbnailManager.setPurgeCallCount(1);

        String result = purgeThumbnailJob.execute();

        final ObjectMapper objectMapper = new YAMLMapper();
        try {
            @SuppressWarnings("unchecked")
            final List<Map<?, ?>> result = objectMapper.readValue(content, List.class);
            if (result != null) {
                return result.stream()
                        .map(o -> new Artifact((String) o.get("name"), (String) o.get("version"), (String) o.get("url")))

                    parent--;
                }
                parent = result.lastIndexOf('/', parent);
                if (parent < 0) {
                    result = result.substring(idx + 4);
                } else {
                    result = result.substring(0, parent) + result.substring(idx + 3);
                }
            }
        }

        return result;
    }

  // Avoid Long.hashCode(long) which isn't available on Android 5.
  override fun hashCode(): Int {
    var result = 0
    result = 31 * result + tagClass
    result = 31 * result + tag.toInt()
    result = 31 * result + (if (constructed) 0 else 1)
    result = 31 * result + length.toInt()
    result = 31 * result + bytes.hashCode()
    return result
  }

 *   <li>Finally, natural ordering is used (i.e. the result of {@code Bar.compareTo(Bar)} is
 *       returned)
 * </ol>
 *
 * <p>Alas, {@link #reverse} is a little different. As you read backwards through a chain and
 * encounter a call to {@code reverse}, continue working backwards until a result is determined, and
 * then reverse that result.
 *
 * <h3>Additional notes</h3>
 *

    BigInteger result;
    do {
      result = randomNonNegativeBigInteger(numBits);
    } while (result.signum() == 0);
    return result;
  }

  /**
   * Generates a number in [0, 2^numBits) with an exponential distribution. The floor of the log2 of
   * the result is chosen uniformly at random in [0, numBits), and then the result is chosen in that

        // When
        String result = smbComTreeDisconnect.toString();

        // Then
        assertTrue(result.startsWith("SmbComTreeDisconnect["), "toString should start with 'SmbComTreeDisconnect['");
        assertTrue(result.endsWith("]"), "toString should end with ']'");
    }

    }

    /**
     * Sets the maximum number of session IDs to include in session ID lists.
     * This controls the size limit for aggregation results when retrieving session lists.
     *
     * @param maxSessionIdsInList the maximum number of session IDs to include in lists
     */
    public void setMaxSessionIdsInList(final int maxSessionIdsInList) {

        int result = response.readSetupWireFormat(buffer, 0, 100);
        assertEquals(0, result);

        // Test with different parameters
        result = response.readSetupWireFormat(buffer, 10, 50);
        assertEquals(0, result);

        // Test with zero length
        result = response.readSetupWireFormat(buffer, 0, 0);
        assertEquals(0, result);
    }

    @Test

		}

		for p := range latestMeta.Parts {
			if verifyErr != nil {
				dataErrsByPart[p][i] = convPartErrToInt(verifyErr)
			} else {
				dataErrsByPart[p][i] = verifyResp.Results[p]
			}
		}
	}

	// Build dataErrs by disk from dataErrs by part
	for part, disks := range dataErrsByPart {
		for disk := range disks {
			dataErrsByDisk[disk][part] = dataErrsByPart[part][disk]
		}