* The priority length is the number of characters before any wildcard.
         *
         * @param pattern the path pattern
         * @return the priority length
         */
        private static int calculatePriorityLength(final String pattern) {
            // For priority, we count the pattern length, treating * as having length 0
            // and $ as having length 1
            int length = 0;

        if (target1 == null || target2 == null) {
            return false;
        }
        final int length1 = target1.length();
        final int length2 = target2.length();
        if (length1 < length2) {
            return false;
        }
        final String s1 = target1.substring(length1 - length2);
        return s1.equalsIgnoreCase(target2);
    }

    /**

        String[] titleValues = data.getValues("title");
        assertNotNull(titleValues);
        assertEquals(1, titleValues.length);
        assertEquals("Test Title", titleValues[0]);

        String[] authorValues = data.getValues("author");
        assertNotNull(authorValues);
        assertEquals(1, authorValues.length);
        assertEquals("John Doe", authorValues[0]);
    }

    public void test_putValues() {

            } else {
                // backward compatibility
                final int length = spaceStr.length();
                spaceChars = new int[length];
                for (int i = 0; i < length; i++) {
                    spaceChars[i] = spaceStr.codePointAt(i);
                }
            }
            propMap.put(key, spaceChars);
        }

        if (defaultWords == null) {
            updateDefaultBadwords();
        }
        final String[] concat = new String[defaultWords.length + badWords.length];
        System.arraycopy(badWords, 0, concat, 0, badWords.length);
        System.arraycopy(defaultWords, 0, concat, badWords.length, defaultWords.length);
        return concat;
    }

    /**
     * Add a bad word.
     * @param badWord Bad word
     */

                for (int i = 0; i < newLength; i++) {
                    values[oldValues.length + i] = Array.get(value, i);
                }
                dataMap.put(key, values);
            } else {
                final Object[] values = Arrays.copyOf(oldValues, oldValues.length + 1);
                values[values.length - 1] = value;

                    array.length, items.length - array.length);
        }

        try {
            final long start = System.currentTimeMillis();
            final SuggestWriterResult result = suggestWriter.write(client, settings, index, array, true);
            return new SuggestIndexResponse(items.length, items.length, result.getFailures(), System.currentTimeMillis() - start);

        }

        // Add rows to text
        for (final String[] row : rows) {
            if (headers != null && headers.length > 0) {
                // Associate values with column names
                final int minLength = Math.min(headers.length, row.length);
                for (int i = 0; i < minLength; i++) {
                    if (StringUtil.isNotBlank(row[i])) {

                            throw new MaxLengthExceededException("The content length (" + responseData.getContentLength()
                                    + " byte) is over " + maxLength + " byte. The url is " + filePath);
                        }
                    }

                    if (includeContent) {
                        if (file.length() < maxCachedContentSize) {

    public V[] toArray(final V[] proto) {
        @SuppressWarnings("unchecked")
        final V[] array = proto.length >= size ? proto : (V[]) Array.newInstance(proto.getClass().getComponentType(), size);
        for (int i = 0; i < array.length; i++) {
            array[i] = getAt(i);
        }
        if (array.length > size) {
            array[size] = null;
        }
        return array;
    }

    @Override