extends ScheduledExecutorService, ListeningExecutorService {

  /**
   * @since 15.0 (previously returned ScheduledFuture)
   */
  @Override
  ListenableScheduledFuture<?> schedule(Runnable command, long delay, TimeUnit unit);

  /**
   * Duration-based overload of {@link #schedule(Runnable, long, TimeUnit)}.
   *
   * @since 29.0
   */
  @J2ktIncompatible

    // flags

    static final int FLAGS_CLOSE_AFTER_THIS_REQUEST = 0x01;
    static final int FLAGS_CLOSE_IF_END_REACHED = 0x02;
    static final int FLAGS_RETURN_RESUME_KEYS = 0x04;
    static final int FLAGS_RESUME_FROM_PREVIOUS_END = 0x08;
    static final int FLAGS_FIND_WITH_BACKUP_INTENT = 0x10;

    private final int searchAttributes;
    private final int tflags;
    private final int informationLevel;

     */
    int RPC_PT_FAULT = 0x03;
    /**
     * Bind packet type - establishes context
     */
    int RPC_PT_BIND = 0x0B;
    /**
     * Bind acknowledgment packet type
     */
    int RPC_PT_BIND_ACK = 0x0C;
    /**
     * Bind negative acknowledgment packet type
     */
    int RPC_PT_BIND_NAK = 0x0D;
    /**
     * Alter context packet type
     */
    int RPC_PT_ALTER_CONTEXT = 0x0E;
    /**

    class Referral {
        private int version;
        private int size;
        private int serverType;
        private int flags;
        private int proximity;
        private int pathOffset;
        private int altPathOffset;
        private int nodeOffset;
        private String altPath;

        int ttl;
        String path = null;
        String node = null;

   *
   * @param dividend the dividend (numerator)
   * @param divisor the divisor (denominator)
   * @throws ArithmeticException if divisor is 0
   */
  public static int remainder(int dividend, int divisor) {
    return (int) (toLong(dividend) % toLong(divisor));
  }

  /**
   * Returns the unsigned {@code int} value represented by the given string.
   *

    /** Context ID for compression capabilities */
    public static final int NEGO_CTX_COMPRESSION_TYPE = 0x3;

    // SMB3 Compression Algorithms
    /** No compression */
    public static final int COMPRESSION_NONE = 0x0;
    /** LZ77 compression */
    public static final int COMPRESSION_LZ77 = 0x1;
    /** LZ77 + Huffman compression */
    public static final int COMPRESSION_LZ77_HUFFMAN = 0x2;
    /** LZNT1 compression (Windows standard) */

      int x = xInts[j];
      int y = yInts[j];
      int z = constant[j];
      tmp += z + IntMath.lessThanBranchFree(x, y);
    }
    return tmp;
  }

  @Benchmark
  int ternaryLtIntAddOutsideTernary(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & SAMPLE_MASK;
      int x = xInts[j];
      int y = yInts[j];
      int z = constant[j];

            _src.align(4);
            final int _netnamep = _src.dec_ndr_long();
            this.type = _src.dec_ndr_long();
            final int _remarkp = _src.dec_ndr_long();
            this.permissions = _src.dec_ndr_long();
            this.max_uses = _src.dec_ndr_long();
            this.current_uses = _src.dec_ndr_long();
            final int _pathp = _src.dec_ndr_long();
            final int _passwordp = _src.dec_ndr_long();

  static void checkAvalanche(HashFunction function, int trials, double epsilon) {
    Random rand = new Random(0);
    int keyBits = 32;
    int hashBits = function.bits();
    for (int i = 0; i < keyBits; i++) {
      int[] same = new int[hashBits];
      int[] diff = new int[hashBits];
      // go through trials to compute probability
      for (int j = 0; j < trials; j++) {
        int key1 = rand.nextInt();

        void testEncodeWithDifferentHashAlgoCounts(int count) {
            int[] hashAlgos = new int[count];
            for (int i = 0; i < count; i++) {
                hashAlgos[i] = i + 1;
            }
            byte[] salt = new byte[16];

            context = new PreauthIntegrityNegotiateContext(mockConfig, hashAlgos, salt);
            int encoded = context.encode(buffer, 0);