Rory Hunter <******@****.***> 1630477529 +0100

  /**
   * Returns the {@code long} value present at the given index.
   *
   * @throws IndexOutOfBoundsException if {@code index} is negative, or greater than or equal to
   *     {@link #length}
   */
  public long get(int index) {
    Preconditions.checkElementIndex(index, length());
    return array[start + index];
  }

  /**
   * Returns the smallest index for which {@link #get} returns {@code target}, or {@code -1} if no

        SuggestUtil.getAsList(123);
    }

    @Test
    public void testDeleteByQuery() {
        // Create test data
        client.prepareIndex().setIndex(TEST_INDEX).setId("1").setSource("field", "value1").execute().actionGet();
        client.prepareIndex().setIndex(TEST_INDEX).setId("2").setSource("field", "value2").execute().actionGet();
        client.admin().indices().prepareRefresh(TEST_INDEX).execute().actionGet();

        storeAnalyzerSettings();
    }

    private static void storeAnalyzerSettings() throws Exception {
        // Store analyzer mappings
        client.prepareIndex()
                .setIndex(SUGGEST_INDEX)
                .setId("analyzer_settings")
                .setSource(XContentFactory.jsonBuilder()
                        .startObject()
                        .startObject("analyzer")

            // index from the end of the list. tail points to the first
            // entry in the reusable list.
            E tail = head;
            int tailIndex = headIndex;
            for (E e = next; e != null; e = e.getNext()) {
              int newIndex = e.getHash() & newMask;
              if (newIndex != tailIndex) {
                // The index changed. We'll need to copy the previous entry.

        // The index name should be {id}.suggest
        assertEquals("Should return correct index name", getIndexName(), suggester.getIndex());
    }

    @Test
    public void test_getAllWordsNum_onEmptyIndex() throws Exception {
        Suggester suggester = createSuggester();
        suggester.createIndexIfNothing();

        assertEquals("Empty index should have 0 words", 0, suggester.getAllWordsNum());

        public void refresh() {
            // Mock implementation
        }

        public void createIndexIfNothing() {
            // Mock implementation
        }

        public String getIndex() {
            return "fess.suggest";
        }

        public long getAllWordsNum() {
            return 100L;
        }

        public long getDocumentWordsNum() {
            return 50L;

            }
        }
    }
    
    private void establishChannel(int index) throws IOException {
        // Select interfaces for this channel
        NetworkInterfaceInfo localIf = selectLocalInterface(index);
        NetworkInterfaceInfo remoteIf = selectRemoteInterface(index);
        
        // Create transport for this channel

     */
    public int getIndex() {
        return this.index;
    }

    /**
     * Sets the current index position in the buffer.
     *
     * @param index the new index position
     */
    public void setIndex(final int index) {
        this.index = index;
    }

    /**
     * Returns the capacity of the buffer.
     *
     * @return the buffer capacity
     */

            // index from the end of the list. tail points to the first
            // entry in the reusable list.
            E tail = head;
            int tailIndex = headIndex;
            for (E e = next; e != null; e = e.getNext()) {
              int newIndex = e.getHash() & newMask;
              if (newIndex != tailIndex) {
                // The index changed. We'll need to copy the previous entry.