@SuppressWarnings("all")
public class rpc {

    /**
     * Private constructor to prevent instantiation of utility class.
     */
    private rpc() {
        // Utility class
    }

    /**
     * UUID (Universally Unique Identifier) structure for DCE/RPC.
     * Represents a 128-bit UUID as defined by DCE/RPC specification.
     */
    public static class uuid_t extends NdrObject {

        /**

 */
public class rpc {

    /**
     * Private constructor to prevent instantiation of utility class.
     */
    private rpc() {
        // Utility class
    }

    /**
     * UUID (Universally Unique Identifier) structure for DCE/RPC.
     * Represents a 128-bit UUID as defined by DCE/RPC specification.
     */
    public static class uuid_t extends NdrObject {

        /**

  public String toString() {
    return "Hashing.crc32c()";
  }

  static final class Crc32cHasher extends AbstractStreamingHasher {

    /*
     * The striding algorithm works roughly as follows: it is universally the case that
     * CRC(x ^ y) == CRC(x) ^ CRC(y).  The approach we take is to break the message as follows,
     * with each letter representing a 4-byte word: ABCDABCDABCDABCD... and to calculate

 *
 * <p>If there are no removals, then {@link #iterator iteration} order is the same as insertion
 * order. Any removal invalidates any ordering guarantees.
 *
 * <p>This class should not be assumed to be universally superior to {@code java.util.HashSet}.
 * Generally speaking, this class reduces object allocation and memory consumption at the price of

 * {@link #values} views is the same as insertion order. Any removal invalidates any ordering
 * guarantees.
 *
 * <p>This class should not be assumed to be universally superior to {@code java.util.HashMap}.
 * Generally speaking, this class reduces object allocation and memory consumption at the price of

 * {@link #values} views is the same as insertion order. Any removal invalidates any ordering
 * guarantees.
 *
 * <p>This class should not be assumed to be universally superior to {@code java.util.HashMap}.
 * Generally speaking, this class reduces object allocation and memory consumption at the price of