fun run() {
          val progressListener = object : ProgressListener {
            private var firstUpdate = true

            override fun update(bytesWritten: Long, contentLength: Long, done: Boolean) {
              if (done) {
                println("completed")
              } else {
                if (firstUpdate) {
                  firstUpdate = false
                  if (contentLength == -1L) {

        // No results in current page, not done, and fetchMore will throw
        FileEntry initial = entry("one");
        TestIterator it =
                TestIterator.create(tree, parent, "*", null, 0, initial, List.of(new FileEntry[][] { new FileEntry[0] })).throwOnFetch();

        // Act
        assertTrue(it.hasNext());
        assertEquals("one", it.next().getName()); // consume initial

       *   setFuture called on it: Neither of those can happen until we've finished processing all
       *   the completed inputs. And we're still processing at least one input, the one that
       *   triggered handleException.)
       *
       * TODO(cpovirk): Think about whether we could/should use Verify to check the return value of
       * addCausalChain.
       */

   *
   * <p>Duplicate elements are considered equal. For example, the list [1, 1] will have only one
   * permutation, instead of two. This is why the elements have to implement {@link Comparable}.
   *
   * <p>An empty iterable has only one permutation, which is an empty list.
   *
   * <p>This method is equivalent to {@code Collections2.orderedPermutations(list,
   * Ordering.natural())}.

     */
    @Deprecated
    public String decryptoText(final String text) {
        return decryptText(text);
    }

    /**
     * Polls an encryption cipher from the queue, creating a new one if none are available.
     *
     * @return an encryption cipher
     */
    protected Cipher pollEncryptoCipher() {
        Cipher cipher = encryptoQueue.poll();
        if (cipher == null) {
            try {

            DcerpcHandle handle = mock(DcerpcHandle.class);
            LsaPolicyHandle policy = mock(LsaPolicyHandle.class);
            jcifs.SID[] none = new jcifs.SID[0];

            cache.resolveSids(handle, policy, none);
            verify(handle, times(1)).sendrecv(any(jcifs.dcerpc.msrpc.MsrpcLookupSids.class));
        }
    }

        crawlerContext.setStatus(CrawlerStatus.RUNNING);
        assertEquals(CrawlerStatus.RUNNING, crawlerContext.getStatus());

        crawlerContext.setStatus(CrawlerStatus.DONE);
        assertEquals(CrawlerStatus.DONE, crawlerContext.getStatus());

        crawlerContext.setStatus(null);
        assertNull(crawlerContext.getStatus());
    }

    /**
     * Test urlFilter getter and setter
     */

  if expr "$link" : '/.*' > /dev/null; then
    SCRIPT="$link"
  else
    SCRIPT=`dirname "$SCRIPT"`/"$link"
  fi
done

# determine fess home
FESS_HOME=`dirname "$SCRIPT"`/..

# make FESS_HOME absolute
FESS_HOME=`cd "$FESS_HOME"; pwd`


# If an include wasn't specified in the environment, then search for one...
if [ "x$FESS_INCLUDE" = "x" ]; then
    # Locations (in order) to use when searching for an include file.

re(e,t){for(var n,r,i,o,a,s,u,l=[],c=0,f=e.length;c<f;c++)(r=e[c]).style&&(n=r.style.display,t?("none"===n&&(l[c]=_.get(r,"display")||null,l[c]||(r.style.display="")),""===r.style.display&&ee(r)&&(l[c]=(u=a=o=void 0,a=(i=r).ownerDocument,s=i.nodeName,(u=ne[s])||(o=a.body.appendChild(a.createElement(s)),u=ce.css(o,"display"),o.parentNode.removeChild(o),"none"===u&&(u="block"),ne[s]=u)))):"none"!==n&&(l[c]="none",_.set(r,"display",n)));for(c=0;c<f;c++)null!=l[c]&&(e[c].style.display=l[c]);return e}ce.f...

     * MEECAQAwEwYHKoZIzj0CAQYIKoZIzj0DAQcEJzAlAgEBBCA7ODT0xhGSNn4ESj6J
     * lu/GJQZoU9lDrCPeUcQ28tzOWw==
     * -----END PRIVATE KEY-----
     * ```
     *
     * The string should contain exactly one certificate and one private key in [PKCS #8][rfc_5208]
     * format. It should not contain any other PEM-encoded blocks, but it may contain other text
     * which will be ignored.
     *