* allocated, the value of {@code metadata} combines the number of bits in the "short hash", in
   * its bottom {@value CompactHashing#HASH_TABLE_BITS_MAX_BITS} bits, with a modification count in
   * the remaining bits that is used to detect concurrent modification during iteration.
   */
  private transient int metadata;

  /** The number of elements contained in the set. */
  private transient int size;

         * Gets the size of this cached file in bytes
         * @return the file size
         */
        public long getSize() {
            return size;
        }

        /**
         * Gets the last modification timestamp of this cached item
         * @return the last modified time
         */
        public long getLastModified() {
            return lastModified;
        }

        /**

form, that is based on (or derived from) the Program and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship.

"Modified Works" shall mean any work in Source Code or other form that
results from an addition to, deletion from, or modification of the
contents of the Program, including, for purposes of clarity any new file

errors.could_not_find_backup_index=Impossible de trouver un index de sauvegarde.
errors.no_user_for_changing_password=Le mot de passe actuel n'est pas correct.
errors.failed_to_change_password=Échec de la modification de votre mot de passe.
errors.unknown_version_for_upgrade=Version inconnue pour la mise à niveau.
errors.failed_to_upgrade_from=Échec de la mise à niveau depuis {0}.

    /** Policy information level for server role. */
    public static final int POLICY_INFO_SERVER_ROLE = 6;
    /** Policy information class for modification. */
    /** Policy information level for modification details. */
    public static final int POLICY_INFO_MODIFICATION = 9;
    /** Policy information class for DNS domain. */
    /** Policy information level for DNS domain information. */

          as modifying the License.

      You may add Your own copyright statement to Your modifications and
      may provide additional or different license terms and conditions
      for use, reproduction, or distribution of Your modifications, or
      for any such Derivative Works as a whole, provided Your use,
      reproduction, and distribution of the Work otherwise complies with

   * #add(Range) add} any range not {@linkplain Range#encloses(Range) enclosed} by {@code view}.
   */
  RangeSet<C> subRangeSet(Range<C> view);

  // Modification

  /**
   * Adds the specified range to this {@code RangeSet} (optional operation). That is, for equal
   * range sets a and b, the result of {@code a.add(range)} is that {@code a} will be the minimal

       *   to iterate it to exhaustion. Then we can apply the logic above about an empty
       *   columnIterator. (This assumes no concurrent modification, but behavior under concurrent
       *   modification is undefined, anyway.)
       */
      requireNonNull(rowEntry);
      Entry<C, V> columnEntry = columnIterator.next();

        CharMappingItem item = result.get(0);
        assertArrayEquals(new String[] { "x", "y" }, item.getInputs());
        assertEquals("z", item.getOutput());
    }

    // Test concurrent modification
    public void test_concurrentModification() throws Exception {
        writeTestFile("a,b => c\nd,e => f\n");

        // Get an item
        OptionalEntity<CharMappingItem> item1 = charMappingFile.get(1L);

        assertTrue(greater + ".compareTo(" + t + ')', greater.compareTo(t) > 0);
        assertFalse(greater.equals(t));
      }
    }
  }

  /**
   * Returns a collection that simulates concurrent modification by having its size method return
   * incorrect values. This is useful for testing methods that must treat the return value from
   * size() as a hint only.
   *