return read(new StringReader(xml));
    }

    /**
     * Converts the given content to an XML string.
     *
     * @param content the object to convert
     * @return the xml string representation
     * @throws XmlWriterException if an error occurs during the transformation
     * @see #fromXmlString(String)
     */
    @Nonnull
    default String toXmlString(@Nonnull T content) throws XmlWriterException {

// making zero values useful and gmp's decision not to.
func (z *Int) doinit() {
	if z.init {
		return
	}
	z.init = true
	C.mpz_init(&z.i[0])
}

// Bytes returns z's representation as a big-endian byte array.
func (z *Int) Bytes() []byte {
	b := make([]byte, (z.Len()+7)/8)
	n := C.size_t(len(b))
	C.mpz_export(unsafe.Pointer(&b[0]), &n, 1, 1, 1, 0, &z.i[0])
	return b[0:n]
}

   * as a {@link LinkedHashSet}. All list tests and sorted-collection tests automatically specify
   * this feature.
   */
  KNOWN_ORDER,

  /**
   * Indicates that a collection has a different {@link Object#toString} representation than most
   * collections. If not specified, the collection tests will examine the value returned by {@link
   * Object#toString}.
   */
  NON_STANDARD_TOSTRING,

  /**

          switch (mode) {
            case HALF_EVEN:
              // roundFloorAsDouble and roundCeilingAsDouble are neighbors, so precisely
              // one of them should have an even long representation
              return ((Double.doubleToRawLongBits(roundFloorAsDouble) & 1L) == 0)
                  ? roundFloorAsDouble
                  : roundCeilingAsDouble;
            case HALF_DOWN:

 *
 * Given an algorithm, for example:
 *
 * {@snippet :
 * public <N> someGraphAlgorithm(N startNode, SuccessorsFunction<N> successorsFunction);
 * }
 *
 * you will invoke it depending on the graph representation you're using.
 *
 * <p>If you have an instance of one of the primary {@code common.graph} types ({@link Graph},
 * {@link ValueGraph}, and {@link Network}):
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, graph);

        ByteBuffer bb2 = ByteBuffer.wrap(bytes, 8, 8).order(java.nio.ByteOrder.BIG_ENDIAN);
        long data4 = bb2.getLong();

        // Construct UUID from components - Java UUID expects big-endian representation
        long mostSig = ((long) data1 << 32) | ((long) (data2 & 0xFFFF) << 16) | (data3 & 0xFFFF);
        long leastSig = data4;

        this.guid = new UUID(mostSig, leastSig);
    }

    /**

            when(dc.toString()).thenReturn("LARGEDC");

            NtlmChallenge nc = new NtlmChallenge(challenge, dc);
            String result = nc.toString();

            // Should contain hex representation of 0-15
            assertTrue(result.contains("0x"));
            assertTrue(result.contains("dc=LARGEDC"));
            // The hex string should be 32 chars long (16 bytes * 2)

        assertEquals(0, close.writeBytesWireFormat(new byte[10], 0));
        assertEquals(6, close.writeParameterWordsWireFormat(new byte[10], 0));
    }

    /**
     * The toString representation should include the class name and both
     * fields.  This provides visibility into the debug output of the SMB
     * packet.
     */
    @Test
    @DisplayName("happy: toString contains class info and field values")

@GwtCompatible
final class TrieParser {

  private static final Joiner DIRECT_JOINER = Joiner.on("");

  /**
   * Parses a serialized trie representation of a map of reversed public suffixes into an immutable
   * map of public suffixes. The encoded trie string may be broken into multiple chunks to avoid the

   * as a {@link LinkedHashSet}. All list tests and sorted-collection tests automatically specify
   * this feature.
   */
  KNOWN_ORDER,

  /**
   * Indicates that a collection has a different {@link Object#toString} representation than most
   * collections. If not specified, the collection tests will examine the value returned by {@link
   * Object#toString}.
   */
  NON_STANDARD_TOSTRING,

  /**