### Other (Cleanup or Flake)

- Allow using lower and upper case feature flag value, the name has to match still ([#121441](https://github.com/kubernetes/kubernetes/pull/121441), [@soltysh](https://github.com/soltysh)) [SIG CLI]

			} else if nextReg != int(reg) {
				p.errorf("incontiguous register in ARM64 register list: %s", name)
			}
			regCnt++
			nextReg = (nextReg + 1) % 32
		case sys.ARM:
			// Parse the upper and lower bounds.
			lo := p.registerNumber(tok.String())
			hi := lo
			if p.peek() == '-' {
				p.next()
				hi = p.registerNumber(p.next().String())
			}
			if hi < lo {
				lo, hi = hi, lo
			}

  abstract ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive);

  /**
   * @since 12.0
   */
  @GwtIncompatible // NavigableSet
  @Override
  public @Nullable E lower(E e) {
    return Iterators.<@Nullable E>getNext(headSet(e, false).descendingIterator(), null);
  }

  /**
   * @since 12.0
   */
  @Override
  public @Nullable E floor(E e) {

   * accommodate as many threads as will ever concurrently modify the table. Using a significantly
   * higher value than you need can waste space and time, and a significantly lower value can lead
   * to thread contention. But overestimates and underestimates within an order of magnitude do not
   * usually have much noticeable impact. A value of one permits only one thread to modify the cache

        return new ArrayDeque<>(c);
    }

    /**
     * Creates and returns a new instance of {@link ArrayDeque}.
     *
     * @param <E> the element type of {@link ArrayDeque}
     * @param numElements the lower bound of the initial capacity range for the deque
     * @return a new instance of {@link ArrayDeque}
     * @see ArrayDeque#ArrayDeque(int)
     */
    public static <E> ArrayDeque<E> newArrayDeque(final int numElements) {

labels.elevate_word_button_upload=Prześlij
labels.elevate_word_list_suggest_word=Słowo
labels.elevate_word_suggest_word=Słowo
labels.elevate_word_reading=Odczyt
labels.elevate_word_permissions=Uprawnienia
labels.elevate_word_boost=Wartość wzmocnienia
labels.elevate_word_file=Plik słów podniesionych
labels.bad_word_configuration=Słowo zakazane
labels.bad_word_title_details=Słowo zakazane
labels.bad_word_link_list=Lista

   */
  @Deprecated
  public static CharMatcher javaUpperCase() {
    return JavaUpperCase.INSTANCE;
  }

  /**
   * Determines whether a BMP character is lower case according to {@linkplain
   * Character#isLowerCase(char) Java's definition}.
   *
   * @deprecated Some lowercase characters are supplementary characters; see the class
   *     documentation.

   */
  @Deprecated
  public static CharMatcher javaUpperCase() {
    return JavaUpperCase.INSTANCE;
  }

  /**
   * Determines whether a BMP character is lower case according to {@linkplain
   * Character#isLowerCase(char) Java's definition}.
   *
   * @deprecated Some lowercase characters are supplementary characters; see the class
   *     documentation.

      // meant that sometimes a too-large threshold is calculated. However, this new threshold is
      // independent of the initial capacity, except that it won't be lower than the threshold
      // computed from that capacity. Because the internal table is only allocated on the first
      // write, we won't see copying because of the new threshold. So it is always OK to use the

      // meant that sometimes a too-large threshold is calculated. However, this new threshold is
      // independent of the initial capacity, except that it won't be lower than the threshold
      // computed from that capacity. Because the internal table is only allocated on the first
      // write, we won't see copying because of the new threshold. So it is always OK to use the