return queryHelper.build(SearchRequestType.SEARCH, query, context -> {
            context.skipRoleQuery();
        });
    }

    // Additional test methods for improved coverage

    public void test_getSortPrefix() {
        assertEquals("sort:", queryHelper.getSortPrefix());
    }

    public void test_setSortPrefix() {
        queryHelper.setSortPrefix("customSort:");

     * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
     * works well for hash tables since the bin lists tend to be short. (The average length is less
     * than two.)
     *
     * Read operations can thus proceed without locking, but rely on selected uses of volatiles to