private static BigInteger oldSlowFactorial(int n1, int n2) {
    assert n1 <= n2;
    if (IntMath.log2(n2, CEILING) * (n2 - n1) < Long.SIZE - 1) {
      // the result will definitely fit into a long
      long result = 1;
      for (int i = n1 + 1; i <= n2; i++) {
        result *= i;
      }
      return BigInteger.valueOf(result);
    }

    /*

public class TarExtractor extends AbstractExtractor {
    private static final Logger logger = LoggerFactory.getLogger(TarExtractor.class);

    @Resource
    protected ArchiveStreamFactory archiveStreamFactory;

    protected long maxContentSize = -1;

    @Override
    public ExtractData getText(final InputStream in, final Map<String, String> params) {
        if (in == null) {
            throw new CrawlerSystemException("The inputstream is null.");

`and why it is you hate--C and D,' she added in a whisper, half
afraid that it would be offended again.

  `Mine is a long and a sad tale!' said the Mouse, turning to
Alice, and sighing.

  `It IS a long tail, certainly,' said Alice, looking down with
wonder at the Mouse's tail; `but why do you call it sad?'  And
she kept on puzzling about it while the Mouse was speaking, so

 *
 * @author Louis Wasserman
 */
@GwtCompatible
@ElementTypesAreNonnullByDefault
interface LongAddable {
  void increment();

  void add(long x);

  long sum();

/**
 * @author shinsuke
 */
public class EditForm extends CreateForm {

    public String id;

    @ValidateTypeFailure
    public Long seqNo;

    @ValidateTypeFailure
    public Long primaryTerm;

import java.util.Map;

import org.codelibs.fess.entity.DataStoreParams;

public interface IndexUpdateCallback {

    void store(DataStoreParams paramMap, Map<String, Object> dataMap);

    long getDocumentSize();

    long getExecuteTime();

    void commit();

    // need a long enough string for the buffer to hit 0 remaining before the copy completes
    String string = Strings.repeat("0123456789", 100);
    StringBuilder b = new StringBuilder();
    // the main assertion of this test is here... the copy will fail if the buffer size goes down
    // each time it is not filled completely

    // need a long enough string for the buffer to hit 0 remaining before the copy completes
    String string = Strings.repeat("0123456789", 100);
    StringBuilder b = new StringBuilder();
    // the main assertion of this test is here... the copy will fail if the buffer size goes down
    // each time it is not filled completely

        }

        minioClient.setTimeout(getInitParameter("connectTimeout", (long) 10000, Long.class),
                getInitParameter("writeTimeout", (long) 10000, Long.class), getInitParameter("readTimeout", (long) 10000, Long.class));
    }

    protected boolean bucketExists(final String name) {
        try {

      doubleInLongRange[i] = randomDouble(Long.SIZE - 2);
      positiveDoubles[i] = randomPositiveDouble();
    }
  }

  @Benchmark
  int roundToInt(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += DoubleMath.roundToInt(doubleInIntRange[j], mode);
    }
    return tmp;
  }

  @Benchmark
  long roundToLong(int reps) {
    long tmp = 0;