var first [17]int
			rng := rand.New(rand.NewSource(0))
			var tmp [16]byte
			rng.Read(tmp[:])
			prefix := hex.EncodeToString(tmp[:])
			for range 10000 {
				rng.Read(tmp[:])

				y := hashOrder(fmt.Sprintf("%s/%x", prefix, hex.EncodeToString(tmp[:3])), x)
				first[y[0]]++
			}
			t.Log("first:", first[:x])
		})
	}

// along with this program.  If not, see <http://www.gnu.org/licenses/>.

package cmd

// isDirEmpty - returns true if there is no error and no object and prefix inside this directory
func isDirEmpty(dirname string, _ bool) bool {
	entries, err := readDirN(dirname, 1)
	if err != nil {
		return false
	}
	return len(entries) == 0

    public DuplicateMojoDescriptorException(
            String goalPrefix, String goal, String existingImplementation, String newImplementation) {
        super("Goal: " + goal + " already exists in the plugin descriptor for prefix: " + goalPrefix
                + System.lineSeparator() + "Existing implementation is: " + existingImplementation
                + System.lineSeparator() + "Conflicting implementation is: " + newImplementation);
    }

        // we can drill down to exactly the smallest nonempty spliterator
        while (true) {
          Spliterator<T> prefix = spliterator.trySplit();
          if (prefix == null || prefix.getExactSizeIfKnown() == 0) {
            break;
          } else if (spliterator.getExactSizeIfKnown() == 0) {
            spliterator = prefix;
            break;
          }
        }

        // spliterator is known to be nonempty now

    // Demonstrates observed equals() asymmetry when this is shorter than argument
    @Test
    @DisplayName("equals: this shorter but same prefix -> true (observed behavior)")
    void equals_thisShorterSamePrefix_true_dueToImplementation() {
        // Arrange: left shorter than right but with identical prefix
        SecurityBlob shorter = new SecurityBlob(new byte[] { 1, 2 });
        SecurityBlob longer = new SecurityBlob(new byte[] { 1, 2, 9 });

        readByte()
        // Consume space or tab.
      }

      else -> break@loop
    }
  }
  return commaFound
}

private fun Buffer.startsWith(prefix: Byte): Boolean = !exhausted() && this[0] == prefix

/**
 * Reads a double-quoted string, unescaping quoted pairs like `\"` to the 2nd character in each
 * sequence. Returns the unescaped string, or null if the buffer isn't prefixed with a

        CRAWLER("fess-crawler"), //
        /** Unknown/generic JAR files */
        UNKNOWN("jar");

        /** The ID prefix for this artifact type */
        private final String id;

        /**
         * Creates a new artifact type with the specified ID.
         *
         * @param id the ID prefix for this artifact type
         */
        ArtifactType(final String id) {
            this.id = id;
        }

	}

	testCases := []struct {
		volumeName     string
		prefix         string
		expectedResult []string
		expectErr      bool
	}{
		{"foo", "path", []string{"to/"}, false},
		// prefix not found error.
		{"foo", "nodir", nil, true},
	}

	for i, testCase := range testCases {
		result, err := storage.ListDir(t.Context(), "", testCase.volumeName, testCase.prefix, -1)
		expectErr := (err != nil)

func (ns NamingStrategy) UniqueName(table, column string) string {
	return ns.formatName("uni", table, ns.toDBName(column))
}

func (ns NamingStrategy) formatName(prefix, table, name string) string {
	formattedName := strings.ReplaceAll(strings.Join([]string{
		prefix, table, name,
	}, "_"), ".", "_")

	if ns.IdentifierMaxLength == 0 {
		ns.IdentifierMaxLength = 64
	}

        regQ(fuzzyQuery);
        return fuzzyQuery;
    }

    protected PrefixQueryBuilder regPrefixQ(String name, String prefix) {
        checkEsInvalidQuery(name, prefix);
        PrefixQueryBuilder prefixQuery = QueryBuilders.prefixQuery(name, prefix);
        regQ(prefixQuery);
        return prefixQuery;
    }

    protected RangeQueryBuilder regRangeQ(String name, ConditionKey ck, Object value) {