assertThat(table.rowKeySet().toString()).isEqualTo("[bar, foo]");
  }

  public void testValuesToString_ordered() {
    table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c');
    assertThat(table.values().toString()).isEqualTo("[b, a, c]");
  }

  @SuppressWarnings({"deprecation", "InlineMeInliner"}) // test of a deprecated method
  public void testRowComparator() {
    sortedTable = TreeBasedTable.create();

  // description talks about `keys`, `values`, and `entries`; here the `keys` and `values` arrays
  // are replaced by a single `elements` array but everything else works similarly.

  /**
   * The hashtable object. This can be either:
   *
   * <ul>
   *   <li>a byte[], short[], or int[], with size a power of two, created by
   *       CompactHashing.createTable, whose values are either
   *       <ul>

    public String designFileName;

    /**
     * Default constructor for UploadForm.
     * Creates a new instance with default values.
     */
    public UploadForm() {
        // Default constructor
    }

     */
    @Required
    public MultipartFormFile protwordsFile;

    /**
     * Default constructor for UploadForm.
     * Creates a new instance with default values.
     */
    public UploadForm() {
        // Default constructor
    }

     */
    @Required
    public MultipartFormFile file;

    /**
     * Default constructor for UploadForm.
     * Creates a new instance with default values.
     */
    public UploadForm() {
        // Default constructor
    }

  /**
   * Returns an early guess of the next response, used for policy on how an incoming request should
   * be received. The default implementation returns an empty response. Mischievous implementations
   * can return other values to test HTTP edge cases, such as unhappy socket policies or throttled
   * request bodies.
   */
  public open fun peek(): MockResponse = MockResponse()

  /**

/**
 * CompactLinkedHashMap is an implementation of a Map with insertion or LRU iteration order,
 * maintained with a doubly linked list through the entries. All optional operations (put and
 * remove) are supported. Null keys and values are supported.
 *
 * <p>{@code containsKey(k)}, {@code put(k, v)} and {@code remove(k)} are all (expected and
 * amortized) constant time operations. Expected in the hashtable sense (depends on the hash

            if (result1[i] != result2[i]) {
                different = true;
                break;
            }
        }
        assertEquals(true, different, "Different keys should produce different HMAC values");
    }

    @Test
    void testDifferentDataProducesDifferentResults() {
        // Test that different data produces different results
        byte[] data1 = "data1".getBytes();

    'full_name': None,
}
```

#### Unpacking a `dict` { #unpacking-a-dict }

If we take a `dict` like `user_dict` and pass it to a function (or class) with `**user_dict`, Python will "unpack" it. It will pass the keys and values of the `user_dict` directly as key-value arguments.

So, continuing with the `user_dict` from above, writing:

```Python
UserInDB(**user_dict)
```

would result in something equivalent to:

```Python

            searchPaging(data, form);
        });
    }

    /**
     * Sets up pagination data and restores search form values from the pager.
     *
     * @param data the render data to populate with failure URL items
     * @param form the search form to restore values into
     */
    protected void searchPaging(final RenderData data, final SearchForm form) {