|| message.contains("not supported") || message.contains("capability")) {
                return true;
            }
        }

        // If we've had many errors, consider fallback
        double errorRate = statistics.getErrorRate();
        if (errorRate > 0.1) { // More than 10% error rate
            log.warn("High RDMA error rate ({:.1f}%), TCP fallback recommended", errorRate * 100);
            return true;

errors.app.db.already.updated = Başka bir işlem tarafından güncellenmiş olabilir. Lütfen tekrar deneyin.
errors.app.db.already.exists = Veri zaten mevcut. Lütfen tekrar deneyin.
errors.app.double.submit.request = Bu istekten önce işlenmiş olabilir. Lütfen tekrar deneyin.
# _/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/
# you can define your messages here:
# e.g.
# errors.xxx = ...

  static final RegularImmutableBiMap<Object, Object> EMPTY =
      new RegularImmutableBiMap<>(
          null, null, (Entry<Object, Object>[]) ImmutableMap.EMPTY_ENTRY_ARRAY, 0, 0);

  static final double MAX_LOAD_FACTOR = 1.2;

  private final transient @Nullable ImmutableMapEntry<K, V> @Nullable [] keyTable;
  private final transient @Nullable ImmutableMapEntry<K, V> @Nullable [] valueTable;

   * efficiency by inlining the implementation of {@link #nextEscapeIndex(CharSequence, int, int)}
   * directly. Doing this for {@link com.google.common.net.PercentEscaper} more than doubled the
   * performance for unescaped strings (as measured by {@code CharEscapersBenchmark}).
   *
   * @param string the literal string to be escaped
   * @return the escaped form of {@code string}

errors.login.failure = 登录失败。
errors.app.illegal.transition = 非法转换，请重试。
errors.app.db.already.deleted = 可能已被其他进程删除。请重试。
errors.app.db.already.updated = 可能已被其他进程更新。请重试。
errors.app.db.already.exists = 数据已存在。请重试。
errors.app.double.submit.request = 此请求可能已在之前处理。请重试。
# _/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/
# you can define your messages here:
# e.g.
# errors.xxx = ...
# info.xxx = ...

     */
    public long dec_ndr_hyper() {
        align(8);
        final long val = Encdec.dec_uint64le(buf, index);
        advance(8);
        return val;
    }

    /* float */
    /* double */
    /**
     * Encodes a string in NDR format.
     *
     * @param s the string to encode
     */
    public void enc_ndr_string(final String s) {
        align(4);
        int i = index;

     */
    public QueryStringBuilder() {
        // Default constructor
    }

    /**
     * Quotes a string value if it contains spaces.
     * Multi-word values are wrapped in double quotes with internal quotes replaced by spaces.
     *
     * @param value the string value to quote
     * @return the quoted string if it contains spaces, otherwise the original value
     */

    LockFreeBitArray(long bits) {
      checkArgument(bits > 0, "data length is zero!");
      // Avoid delegating to this(long[]), since AtomicLongArray(long[]) will clone its input and
      // thus double memory usage.
      this.data =
          new AtomicLongArray(Ints.checkedCast(LongMath.divide(bits, 64, RoundingMode.CEILING)));
      this.bitCount = new LongAdder();
    }

    // Used by serialization

import java.util.LinkedHashMap;
import java.util.Map;
import org.jspecify.annotations.Nullable;

/**
 * CompactLinkedHashMap is an implementation of a Map with insertion or LRU iteration order,
 * maintained with a doubly linked list through the entries. All optional operations (put and
 * remove) are supported. Null keys and values are supported.
 *
 * <p>{@code containsKey(k)}, {@code put(k, v)} and {@code remove(k)} are all (expected and

     */
    public long dec_ndr_hyper() {
        align(8);
        final long val = Encdec.dec_uint64le(this.buf, this.index);
        advance(8);
        return val;
    }

    /* float */
    /* double */
    /**
     * Encodes a string in NDR format.
     *
     * @param s the string to encode
     */
    public void enc_ndr_string(final String s) {
        align(4);
        int i = this.index;