* @param length length of data to send
     * @throws IOException if an I/O error occurs
     */
    void send(byte[] buf, int off, int length) throws IOException;

    /**
     * Performs a transaction on the pipe.
     *
     * @param buf the buffer containing the transaction data
     * @param off the offset in the buffer
     * @param length the length of data to send

    //                                                                              Method
    //                                                                      ==============

    /**
     * Performs a search operation and populates the search render data with results.
     *
     * This method handles the complete search workflow including parameter processing,

 * {@link Multiset#entrySet()}, as do many methods acting on the set returned by {@link
 * #elementSet()}. Override those methods for better performance.
 *
 * @author Kevin Bourrillion
 * @author Louis Wasserman
 */
@GwtCompatible
abstract class AbstractMultiset<E extends @Nullable Object> extends AbstractCollection<E>
    implements Multiset<E> {

# Security
jcifs.smb.client.signingPreferred=false
jcifs.smb.client.signingEnforced=false
jcifs.smb.client.encryptionEnforced=false
jcifs.smb.client.disablePlainTextPasswords=true

# Performance
jcifs.smb.client.useBatching=true
jcifs.smb.client.useUnicode=true
jcifs.smb.client.maxMpxCount=10
```

### Usage with Properties

```java
Properties props = new Properties();

 * synchronization primitives. The strategies are all implemented as subtypes of AtomicHelper and
 * the strategy is selected in the static initializer of AggregateFutureState. This is convenient
 * and performant but introduces some testing difficulties. This test exercises the two fallback
 * strategies.
 *
 * <ul>
 *   <li>SafeAtomicHelper: uses Atomic FieldsUpdaters to implement synchronization

    }

    public MaxCodePoint(String userFriendly) {
      value = decode(userFriendly);
    }
  }

  /**
   * The default values of maxCodePoint below provide pretty good performance models of different
   * kinds of common human text.
   *
   * @see MaxCodePoint#decode
   */
  @Param({"0x80", "0x90", "0x100", "0x800", "0x10000", "0x10ffff"})
  MaxCodePoint maxCodePoint;

  @Param({"16384"})

   * method falls back to {@code getStackTrace}. Callers that require the special implementation can
   * check its availability with {@link #lazyStackTraceIsLazy()}.
   *
   * <p>The expected (but not guaranteed) performance of the special implementation differs from
   * {@code getStackTrace} in one main way: The {@code lazyStackTrace} call itself returns quickly
   * by delaying the per-stack-frame work until each element is accessed. Roughly speaking:

   * that will perform holdsLock assertions:
   *
   * - For iterator(), we can accomplish that by not overriding iterator() at all. That way, we
   *   inherit an implementation that forwards to the delegate collection, which performs no
   *   holdsLock assertions.
   *
   * - For stream() and spliterator(), we have to forward to the delegate ourselves because
   *   ForwardingSet does not forward `default` methods, as discussed in its Javadoc.

            }
        }
    }

    @Nested
    @DisplayName("Performance Tests")
    class PerformanceTests {

        @Test
        @DisplayName("Should handle repeated encoding efficiently")
        void testRepeatedEncoding() {
            TestCreateContextRequest request = new TestCreateContextRequest("PERFORMANCE".getBytes(StandardCharsets.UTF_8));
            byte[] buffer = new byte[256];

   * 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}