*
   * <p><b>Note:</b> if {@code K} is an {@code enum} type, use {@link #newEnumMap} instead.
   *
   * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated. Instead,
   * use the {@code HashMap} constructor directly, taking advantage of <a

   *
   * <p><b>Note:</b> if {@code K} is an {@code enum} type, use {@link #newEnumMap} instead.
   *
   * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated. Instead,
   * use the {@code HashMap} constructor directly, taking advantage of <a

     *     case of weak keys. If we create a new entry with a key that is null at construction time,
     *     we're not sure if entry will necessarily ever be garbage collected.
     * @param newNext entry in the same bucket
     * @param key the key to copy from the original entry to the new one. Use this in preference to
     *     {@code original.getKey()}.
     */

refRect.bottom < bound.top ||\n    refRect.left > bound.right ||\n    refRect.top > bound.bottom ||\n    refRect.right < bound.left\n  ) {\n    // Avoid unnecessary DOM access if visibility hasn't changed\n    if (data.hide === true) {\n      return data;\n    }\n\n    data.hide = true;\n    data.attributes['x-out-of-boundaries'] = '';\n  } else {\n    // Avoid unnecessary DOM access if visibility hasn't changed\n    if (data.hide === false) {\n      return data;\n    }\n\n    data.hide = false;\n    data.att...

* etcd3: use PrevKV to remove additional get ([#34246](https://github.com/kubernetes/kubernetes/pull/34246), [@hongchaodeng](https://github.com/hongchaodeng))
* etcd3: avoid unnecessary decoding in etcd3 client  ([#34435](https://github.com/kubernetes/kubernetes/pull/34435), [@wojtek-t](https://github.com/wojtek-t))

* Replica set conditions API ([#33905](https://github.com/kubernetes/kubernetes/pull/33905), [@kargakis](https://github.com/kargakis))
* etcd3: avoid unnecessary decoding in etcd3 client  ([#34435](https://github.com/kubernetes/kubernetes/pull/34435), [@wojtek-t](https://github.com/wojtek-t))

     *     case of weak keys. If we create a new entry with a key that is null at construction time,
     *     we're not sure if entry will necessarily ever be garbage collected.
     * @param newNext entry in the same bucket
     * @param key the key to copy from the original entry to the new one. Use this in preference to
     *     {@code original.getKey()}.
     */

        segment.expand();
      }
      assertThat(segment.table.length()).isEqualTo(i);
      assertThat(countLiveEntries(map, 0)).isEqualTo(liveCount);
      // expansion cleanup is sloppy, with a goal of avoiding unnecessary copies
      assertThat(segment.count).isAtLeast(liveCount);
      assertThat(segment.count).isAtMost(originalCount);
      assertThat(ImmutableMap.copyOf(map)).isEqualTo(originalMap);
    }
  }

        segment.expand();
      }
      assertThat(segment.table.length()).isEqualTo(i);
      assertThat(countLiveEntries(map, 0)).isEqualTo(liveCount);
      // expansion cleanup is sloppy, with a goal of avoiding unnecessary copies
      assertThat(segment.count).isAtLeast(liveCount);
      assertThat(segment.count).isAtMost(originalCount);
      assertThat(ImmutableMap.copyOf(map)).isEqualTo(originalMap);
    }
  }

                    if (this.fileLocator.getType() == TYPE_SHARE) {
                        // For share root, tree connection success indicates existence
                        // This avoids unnecessary queryPath calls
                        log.trace("Share root existence verified through tree connection");
                    } else {
                        // Use more efficient query for file existence