m.Set(replicationMaxActiveWorkers, float64(qa.Max))

	if len(qs.XferStats) > 0 {
		tots := qs.XferStats[Total]
		m.Set(replicationAverageDataTransferRate, tots.Avg)
		m.Set(replicationCurrentDataTransferRate, tots.Curr)
		m.Set(replicationMaxDataTransferRate, tots.Peak)
	}
	m.Set(replicationRecentBacklogCount, float64(qs.MRFStats.LastFailedCount))

	return nil

    }

    /**
     * Registers a data store instance with the factory using the specified name.
     * The data store will be accessible by both the provided name and its class simple name,
     * both converted to lowercase for case-insensitive lookup.
     *
     * @param name the name to register the data store under, must not be null

implementation must:
</p>

<ul>
	<li>Represent integer constants with at least 256 bits.</li>

	<li>Represent floating-point constants, including the parts of
	    a complex constant, with a mantissa of at least 256 bits
	    and a signed binary exponent of at least 16 bits.</li>

	<li>Give an error if unable to represent an integer constant
	    precisely.</li>

 	goto no_more_room;
diff --git a/string/bits/string2.h b/string/bits/string2.h
index c9bf593..f461fc1 100644
--- a/string/bits/string2.h
+++ b/string/bits/string2.h
@@ -47,29 +47,7 @@
 #endif
 
 #if _STRING_ARCH_unaligned
-/* If we can do unaligned memory accesses we must know the endianess.  */
-# include <endian.h>
 # include <bits/types.h>
-
-# if __BYTE_ORDER == __LITTLE_ENDIAN

        value = "${spaces}";
        assertEquals("   ", ResourceUtil.resolve(value));

        // Test long property name
        System.setProperty("very.long.property.name.with.many.dots", "long");
        value = "${very.long.property.name.with.many.dots}";
        assertEquals("long", ResourceUtil.resolve(value));

        // Test multiple occurrences of same variable
        System.setProperty("repeat", "X");

  // TODO(user): when the shortcuts are implemented, update BloomFilterStrategies
  private final int seed;

  Murmur3_128HashFunction(int seed) {
    this.seed = seed;
  }

  @Override
  public int bits() {
    return 128;
  }

  @Override
  public Hasher newHasher() {
    return new Murmur3_128Hasher(seed);
  }

  @Override
  public String toString() {
    return "Hashing.murmur3_128(" + seed + ")";

     * </ul>
     * <p>
     * The implementation must handle:
     * <ul>
     *   <li>Both forward and back slashes as path separators</li>
     *   <li>Parent directory references (..)</li>
     *   <li>Both file and directory targets</li>
     * </ul>
     *
     * @param relative path to resolve relative to this source

# limitations under the License.
# ==============================================================================
source "${BASH_SOURCE%/*}/utilities/setup.sh"

    for (int bits = 10; bits < 63; bits++) {
      for (int i = 0; i < 100; i++) {
        long p = BigInteger.probablePrime(bits, rand).longValue();
        assertTrue(LongMath.isPrime(p));
      }
    }
  }

  @GwtIncompatible // isPrime is GWT-incompatible
  public void testIsPrimeOnRandomComposites() {
    Random rand = new Random(1);
    for (int bits = 5; bits < 32; bits++) {

    public void testConstructorWithMessageAndCause() {
        // Create exception with both message and cause
        String message = "Transport error occurred";
        IllegalStateException rootCause = new IllegalStateException("State error");
        TransportException exception = new TransportException(message, rootCause);

        // Verify both message and cause are set correctly