* @author Geoff Pike
 */
@NullUnmarked
public class FarmHashFingerprint64Test extends TestCase {

  private static final HashFunction HASH_FN = Hashing.farmHashFingerprint64();

  // If this test fails, all bets are off
  @SuppressWarnings("InlineMeInliner") // String.repeat unavailable under Java 8
  public void testReallySimpleFingerprints() {
    assertEquals(8581389452482819506L, fingerprint("test".getBytes(UTF_8)));

Remember how our app/file structure looks like:

<img src="/img/tutorial/bigger-applications/package.drawio.svg">

---

The two dots `..`, like in:

```Python
from ..dependencies import get_token_header
```

mean:

* Starting in the same package that this module (the file `app/routers/items.py`) lives in (the directory `app/routers/`)...

   * which the superconstructor calls.
   */

  /**
   * Contains the link pointers corresponding with the entries, in the range of [0, size()). The
   * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer
   * (pointing to the nextEntry entry in the linked list). The pointers in [size(), entries.length)
   * are all "null" (UNSET).
   *

 * located in).
 * - share + uncpath within it: This is the relevant information for most SMB requests. Both are adjusted by DFS
 * referrals. Nested resources will inherit the information already resolved by the parent resource.
 *
 * Invariant:
 * A directory resource must have a trailing slash/backslash for both URL and UNC path at all times.
 *
 * @author mbechler
 *
 */

        ace.flags = ACE.FLAGS_OBJECT_INHERIT | ACE.FLAGS_INHERITED;
        assertEquals("This folder and files", ace.getApplyToText());

        // Test with high bits set (should mask to relevant bits)
        ace.flags = 0xF0 | ACE.FLAGS_CONTAINER_INHERIT;
        assertEquals("This folder and subfolders", ace.getApplyToText());
    }

    @Test

  // array. The top bits of this value are the remaining bits of the hash value that were not used
  // in the short hash. We saw that a mask of 0x7f would keep the 7-bit value 0x6f from a full
  // hashcode of 0x89abcdef. The imaginary `hash` value would then be the remaining top 25 bits,
  // 0x89abcd80. To this is added (or'd) the `next` value, which is an index within `entries`

                | NtlmFlags.NTLMSSP_NEGOTIATE_SIGN | NtlmFlags.NTLMSSP_NEGOTIATE_ALWAYS_SIGN | NtlmFlags.NTLMSSP_NEGOTIATE_KEY_EXCH;
        // Verify exactly the expected bits are set
        assertEquals(expectedFlags, context.ntlmsspFlags);
    }

    @Test
    void testConstructor_withoutSigning() {
        // Test constructor when signing is disabled

          // yes, that's a lot of sinks!
          sinks.add(new Sink(chunkSize, bufferSize));
          // For convenience, testing only with big endianness, to match DataOutputStream.
          // I regard highly unlikely that both the little endianness tests above and this one
          // passes, and there is still a little endianness bug lurking around.
        }
      }

      Control control = new Control();

errors.failed_to_download_protwords_file = Échec du téléchargement d'un fichier de mots de protection.
errors.failed_to_upload_protwords_file = Échec du téléversement d'un fichier de mots de protection.
errors.failed_to_download_stopwords_file = Échec du téléchargement d'un fichier de mots vides.
errors.failed_to_upload_stopwords_file = Échec du téléversement d'un fichier de mots vides.

     * deal with the cases where rounding towards 0 is wrong, which typically depends on the sign of
     * p / q.
     *
     * signum is 1 if p and q are both nonnegative or both negative, and -1 otherwise.
     */
    int signum = 1 | (int) ((p ^ q) >> (Long.SIZE - 1));
    boolean increment;
    switch (mode) {
      case UNNECESSARY:
        checkRoundingUnnecessary(rem == 0);