* Do not instantiate.
     */
    protected GenericsUtil() {
    }

    /**
     * Returns <code>true</code> if the raw type of <code>type</code> can be assigned to <code>clazz</code>,
     * <code>false</code> otherwise.
     *
     * @param type
     *            the type to check. Cannot be null.
     * @param clazz
     *            the class to check against. Cannot be null.

    return WRAPPER_TO_PRIMITIVE_TYPE.containsKey(checkNotNull(type));
  }

  /**
   * Returns the corresponding wrapper type of {@code type} if it is a primitive type; otherwise
   * returns {@code type} itself. Idempotent.
   *
   * <pre>
   *     wrap(int.class) == Integer.class
   *     wrap(Integer.class) == Integer.class
   *     wrap(String.class) == String.class
   * </pre>

			text, ok = dropRune(text)
			if !ok {
				return false, nil
			}
			s = []rune{}

		case escape:
			if i == patLen-1 {
				return false, errMalformedEscapeSequence
			}
			// Otherwise do nothing.

		default:
			s = append(s, r)
		}
	}
	if hasLeadingPercent {
		return strings.HasSuffix(text, string(s)), nil
	}
	return string(s) == text, nil
}

     */
    public RdmaMemoryRegion getMemoryRegion() {
        return memoryRegion;
    }

    /**
     * Check if request is completed
     *
     * @return true if completed, false otherwise
     */
    public boolean isCompleted() {
        return completed;
    }

    /**
     * Mark request as completed
     */
    public void markCompleted() {
        this.completed = true;
    }

   * a value for that edge to {@code value} (overwriting the existing value, if any).
   *
   * <p>If the graph is directed, the resultant edge will be directed; otherwise, it will be
   * undirected.
   *
   * <p>Values do not have to be unique. However, values must be non-null.
   *
   * <p>If {@code nodeU} and {@code nodeV} are not already present in this graph, this method will

        this.allPageCount = allPageCount;
    }

    /**
     * Checks if a previous page exists.
     *
     * @return True if a previous page exists, false otherwise
     */
    public boolean isExistPrePage() {
        return existPrePage;
    }

    /**
     * Sets whether a previous page exists.
     *
     * @param existPrePage True if a previous page exists

     *
     * @param path the file path to create a dictionary file for
     * @param timestamp the timestamp of the dictionary file
     * @return a DictionaryFile instance if the path matches, null otherwise
     */
    public DictionaryFile<? extends DictionaryItem> create(final String path, final Date timestamp) {
        if (!isTarget(path)) {
            return null;
        }

 *   <li>values automatically wrapped in {@linkplain WeakReference weak} or {@linkplain
 *       SoftReference soft} references
 *   <li>notification of evicted (or otherwise removed) entries
 *   <li>accumulation of cache access statistics
 * </ul>
 *
 * <p>These features are all optional; caches can be created using all or none of them. By default,

     *
     * @return true if the item has been updated, false otherwise.
     */
    public boolean isUpdated() {
        return newInput != null;
    }

    /**
     * Checks if the item has been marked for deletion.
     *
     * @return true if the item is marked for deletion, false otherwise.
     */
    public boolean isDeleted() {
        return isUpdated() && newInput.length() == 0;

	}

	// There are two possibilities:
	// - We use a KMS -> There must be non-empty key ID and a KMS data key.
	// - We use a K/V -> There must be no key ID and no KMS data key.
	// Otherwise, the caller has passed an invalid argument combination.
	if keyID == "" && len(kmsKey) != 0 {
		logger.CriticalIf(context.Background(), errors.New("The key ID must not be empty if a KMS data key is present"))
	}