* Exception.)
       */
      throw new UncheckedExecutionException(wrapper.getCause());
    }
  }

  /*
   * Arguably we don't need a timed getUnchecked because any operation slow enough to require a
   * timeout is heavyweight enough to throw a checked exception and therefore be inappropriate to
   * use with getUnchecked. Further, it's not clear that converting the checked TimeoutException to

def set_windows_build_flags(environ_cp):
  """Set Windows specific build options."""

  # First available in VS 16.4. Speeds up Windows compile times by a lot. See
  # https://groups.google.com/a/tensorflow.org/d/topic/build/SsW98Eo7l3o/discussion
  # pylint: disable=line-too-long
  write_to_bazelrc(

labels.storage_secret_key	=	Clef secrète
labels.storage_bucket	=	Bucket
labels.send_testmail	=	Envoyer un email de test
labels.backup_configuration	=	Sauvegarde
labels.backup_name	=	Nom
labels.backup_bulk_file	=	Fichier en lot
labels.backup_button_upload	=	Télécharger
labels.process_time_is_exceeded	=	La limite d'un temps de recherche a été dépassée. Le résultat partiel peut être affiché.
labels.user_given_name	=	Prénom
labels.givenName	=	Prénom

.bind("focus.help",function(){var b=c.parent().find("."+e);0===b.length&&(b=a("<span />").addClass(e).addClass("help").addClass("help-block").text(f).hide(),c.after(b)),b.fadeIn()}).bind("blur.help",function(){a(this).parent().find("."+e).fadeOut("slow")})}),this},a.fn.validate=function(b,c,d){var e=a.extend({},a.formUtils.LANG,d||{});this.each(function(){var d=a(this),f=d.closest("form").get(0)||{},g=f.validationConfig||a.formUtils.defaultConfig();d.one("validation",function(a,c){"function"==typeof...

    }

    private @Nullable Object[] lastEntryForEachKey(
        @Nullable Object[] localAlternatingKeysAndValues, int size) {
      Set<Object> seenKeys = new HashSet<>();
      BitSet dups = new BitSet(); // slots that are overridden by a later duplicate key
      for (int i = size - 1; i >= 0; i--) {
        Object key = requireNonNull(localAlternatingKeysAndValues[2 * i]);
        if (!seenKeys.add(key)) {
          dups.set(i);

				"text/vnd.dmclientscript",
				"text/vnd.esmertec.theme-descriptor",
				"text/vnd.fly",
				"text/vnd.fmi.flexstor",
				"text/vnd.graphviz",
				"text/vnd.in3d.3dml",
				"text/vnd.in3d.spot",
				"text/vnd.iptc.anpa",
				"text/vnd.iptc.newsml",
				"text/vnd.iptc.nitf",
				"text/vnd.latex-z",
				"text/vnd.motorola.reflex",
				"text/vnd.ms-mediapackage",

     */
    @CheckForNull
    private static <K, V> Entry<K, V>[] lastEntryForEachKey(Entry<K, V>[] entries, int size) {
      Set<K> seen = new HashSet<>();
      BitSet dups = new BitSet(); // slots that are overridden by a later duplicate key
      for (int i = size - 1; i >= 0; i--) {
        if (!seen.add(entries[i].getKey())) {
          dups.set(i);
        }
      }
      if (dups.isEmpty()) {

         * and increasing the threshold to 2^32 doesn't pay for itself, and adding another enum
         * constant hurts performance further -- I suspect because bimorphic implementation is a
         * sweet spot for the JVM.
         */
        return (a * b) % m;
      }

      @Override
      long squareMod(long a, long m) {
        return (a * a) % m;
      }
    },

    /** Gets the key for this entry. */
    K getKey();

    /** Gets the value for the entry. */
    V getValue();
  }

  /*
   * Note: the following classes have a lot of duplicate code. It sucks, but it saves a lot of
   * memory. If only Java had mixins!
   */

  /** Base class for {@link InternalEntry} implementations for strong keys. */

         * and increasing the threshold to 2^32 doesn't pay for itself, and adding another enum
         * constant hurts performance further -- I suspect because bimorphic implementation is a
         * sweet spot for the JVM.
         */
        return (a * b) % m;
      }

      @Override
      long squareMod(long a, long m) {
        return (a * a) % m;
      }
    },