---
name: Feature request
about: Suggest an idea for this project
title: ''
labels: ''
assignees: ''

---

import java.net.InetSocketAddress
import java.net.ServerSocket
import java.security.PrivateKey
import java.util.concurrent.ExecutorService
import java.util.concurrent.Executors
import java.util.concurrent.Future
import javax.net.ServerSocketFactory
import javax.net.SocketFactory
import javax.net.ssl.SSLSocket
import okhttp3.Handshake
import okhttp3.Handshake.Companion.handshake
import okhttp3.TestUtil.threadFactory

/**
 * @author George van den Driessche
 */
public class FeatureUtilTest extends TestCase {
  enum ExampleFeature implements Feature<Object> {
    FOO,
    IMPLIES_FOO,
    IMPLIES_IMPLIES_FOO,
    BAR,
    IMPLIES_BAR,
    IMPLIES_IMPLIES_FOO_AND_IMPLIES_BAR;

    @Override
    public ImmutableSet<Feature<? super Object>> getImpliedFeatures() {
      switch (this) {
        case IMPLIES_FOO:
          return ImmutableSet.of(FOO);

We welcome contributions to Fess Crawler! Please follow these guidelines:

1. **Fork** the repository
2. **Create** a feature branch (`git checkout -b feature/amazing-feature`)
3. **Commit** your changes (`git commit -m 'Add amazing feature'`)
4. **Push** to the branch (`git push origin feature/amazing-feature`)
5. **Open** a Pull Request

### Development Setup

```bash
# Clone the repository

/**
 * Create integer sets for testing collections that are sorted by natural ordering.
 *
 * @author Chris Povirk
 * @author Jared Levy
 */
@GwtCompatible
@NullMarked
public abstract class TestIntegerSortedSetGenerator extends TestIntegerSetGenerator {
  @Override
  protected abstract SortedSet<Integer> create(Integer[] elements);

  /** Sorts the elements by their natural ordering. */
  /*

     *
     * @return remote key
     */
    protected abstract int generateRemoteKey();

    /**
     * Get native memory address of the buffer
     *
     * @param buffer buffer to get address for
     * @return native memory address
     */
    protected abstract long getBufferAddress(ByteBuffer buffer);

    @Override
    public void close() {
        invalidate();

                    errors.incrementAndGet();
                }
            }));
        }

        startLatch.countDown();
        for (final Future<?> future : futures) {
            future.get();
        }

        executor.shutdown();
        assertEquals(0, errors.get());
        engine.close();
    }

    /**

    about: Community support via Slack - for questions and discussions
  - name: MinIO Enterprise Support (SUBNET)
    url: https://min.io/pricing

        ArgumentCaptor<Integer> rnCap = ArgumentCaptor.forClass(Integer.class);

        verify(transport).getDfsReferrals(eq(ctx), nameCap.capture(), hostCap.capture(), domCap.capture(), rnCap.capture());
        assertEquals(name, nameCap.getValue());
        assertEquals(host, hostCap.getValue());
        assertEquals(domain, domCap.getValue());
        assertEquals(rn, rnCap.getValue());

                  }

                  @Override
                  public List<String> order(List<String> insertionOrder) {
                    return Ordering.natural().sortedCopy(insertionOrder);
                  }
                })
            .named("ImmutableSortedMultiset")
            .withFeatures(
                CollectionSize.ANY,