return 1;
      case 1:
        return n;
      default:
        if (n < factorials.length) {
          return factorials[n] / (factorials[k] * factorials[n - k]);
        } else if (k >= biggestBinomials.length || n > biggestBinomials[k]) {
          return Long.MAX_VALUE;
        } else if (k < biggestSimpleBinomials.length && n <= biggestSimpleBinomials[k]) {
          // guaranteed not to overflow
          long result = n--;

        this.sid = new SID(buf, bi);
        return size;
    }

    void appendCol(final StringBuffer sb, final String str, final int width) {
        sb.append(str);
        final int count = width - str.length();
        for (int i = 0; i < count; i++) {
            sb.append(' ');
        }
    }

    /**
     * Return a string represeting this ACE.
     * <p>

        // create a new empty range and decode
        LockingAndXRange decoded = new LockingAndXRange(false);
        int decodedSize = decoded.decode(dst, 0, dst.length);
        assertEquals(10, decodedSize, "Decode should return size 10");
        assertEquals(99, decoded.getPid());
        assertEquals(123456L, decoded.getByteOffset());

        LogStream.setInstance(testStream);

        final LogStream[] instances = new LogStream[10];
        Thread[] threads = new Thread[10];

        for (int i = 0; i < threads.length; i++) {
            final int index = i;
            threads[i] = new Thread(() -> {
                instances[index] = LogStream.getInstance();
            });
            threads[i].start();
        }

                assertEquals(testByte, buffer[i], "Byte at position " + i + " was modified");
            }

            // Check bytes after encoded area
            for (int i = startIndex + expectedSize; i < buffer.length; i++) {
                assertEquals(testByte, buffer[i], "Byte at position " + i + " was modified");
            }
        }

        @Test
        @DisplayName("Should encode at buffer boundary")

         */
        public String dfs_name;
        /**
         * Information level for enumeration
         */
        public int level;
        /**
         * Preferred maximum length of returned data
         */
        public int prefmaxlen;
        /**
         * DFS enumeration structure containing results
         */
        public DfsEnumStruct info;
        /**

                .thenAnswer(inv -> inv.getArgument(1));

        int n = handle.sendrecv(new byte[10], 0, 0, new byte[20], 100);
        assertEquals(0, n, "Default response length is 0 unless protocol fills it");
    }

    @Test
    @DisplayName("sendrecv uses CallNamedPipe when PIPE_TYPE_CALL is set")
    void sendrecv_call_branch() throws Exception {

      if (!urlString.endsWith(finalizerPath)) {
        throw new IOException("Unsupported path style: " + urlString);
      }
      urlString = urlString.substring(0, urlString.length() - finalizerPath.length());
      return new URL(finalizerUrl, urlString);
    }

    /** Creates a class loader with the given base URL as its classpath. */
    URLClassLoader newLoader(URL base) {

    }

    private static boolean isEmpty(Object value) {
      // Put types estimated to be the most frequent first.
      if (value instanceof CharSequence) {
        return ((CharSequence) value).length() == 0;
      } else if (value instanceof Collection) {
        return ((Collection<?>) value).isEmpty();
      } else if (value instanceof Map) {
        return ((Map<?, ?>) value).isEmpty();

   * exception.
   *
   * <p>When the underlying delegate throws an exception then this memoizing supplier will keep
   * delegating calls until it returns valid data.
   *
   * @param duration the length of time after a value is created that it should stop being returned
   *     by subsequent {@code get()} calls
   * @param unit the unit that {@code duration} is expressed in