doc.put(scoreField, Float.valueOf(rrfScore));
                        documentsByIdMap.put(id, doc);
                    }
                    // Track documents from main searcher (index 0) within window size
                    if (searcherIndex == 0 && docRank < windowSize / 2) {
                        mainSearcherIdSet.add(id);
                    }
                }
            }
        }

      Invokable<Object, ?> unsafe = (Invokable<Object, ?>) invokable;
      unsafe.invoke(instance, params);
      Assert.fail(
          "No exception thrown for parameter at index "
              + paramIndex
              + " from "
              + invokable
              + Arrays.toString(params)
              + " for "
              + testedClass);

      }
      int[] sortedCounts = new int[sortedElements.length];
      for (int i = 0; i < length; i++) {
        int index = Arrays.binarySearch(sortedElements, 0, uniques, elements[i], comparator);
        if (counts[i] >= 0) {
          sortedCounts[index] += counts[i];
        } else {
          sortedCounts[index] = ~counts[i];
        }
      }

        // Verify query flags
        assertEquals(Smb2QueryDirectoryRequest.SMB2_INDEX_SPECIFIED, buffer[Smb2Constants.SMB2_HEADER_LENGTH + 3]);

        // Verify file index
        int readFileIndex =
                (buffer[Smb2Constants.SMB2_HEADER_LENGTH + 4] & 0xFF) | ((buffer[Smb2Constants.SMB2_HEADER_LENGTH + 5] & 0xFF) << 8)

    }

    @Test
    public void test_isFacetSortValue() {
        // Test valid facet sort values
        assertTrue(queryFieldConfig.isFacetSortValue("count"));
        assertTrue(queryFieldConfig.isFacetSortValue("index"));

        // Test invalid facet sort values
        assertFalse(queryFieldConfig.isFacetSortValue("invalid"));
        assertFalse(queryFieldConfig.isFacetSortValue(""));

            }
        }
        return OptionalEntity.empty();
    }

    /**
     * Retrieves a paginated list of character mapping items.
     *
     * @param offset the starting index for pagination (0-based)
     * @param size the maximum number of items to return
     * @return a PagingList containing the requested subset of mapping items
     */
    @Override

          }
          collide = false;
          continue; // Retry with expanded table
        }
        h ^= h << 13; // Rehash
        h ^= h >>> 17;
        h ^= h << 5;
        hc[0] = h; // Record index for next time
      } else if (busy == 0 && cells == as && casBusy()) {
        boolean init = false;
        try { // Initialize table
          if (cells == as) {
            Cell[] rs = new Cell[2];

		{Name: "UpdatedAt", DBName: "updated_at", BindNames: []string{"Model", "UpdatedAt"}, DataType: schema.Time},
		{Name: "DeletedAt", DBName: "deleted_at", BindNames: []string{"Model", "DeletedAt"}, Tag: `gorm:"index"`, DataType: schema.Time},
		{Name: "Name", DBName: "name", BindNames: []string{"Name"}, DataType: schema.String},
		{Name: "Age", DBName: "age", BindNames: []string{"Age"}, DataType: schema.Uint, Size: 64},

    final CharMatcher trimmer;
    final boolean omitEmptyStrings;

    /**
     * Returns the first index in {@code toSplit} at or after {@code start} that contains the
     * separator.
     */
    abstract int separatorStart(int start);

    /**
     * Returns the first index in {@code toSplit} after {@code separatorPosition} that does not

// internal buffer only needs to be resliced.
// It returns the index where bytes should be written and whether it succeeded.
func (b *Buffer) tryGrowByReslice(n int) (int, bool) {
	if l := len(b.buf); n <= cap(b.buf)-l {
		b.buf = b.buf[:l+n]
		return l, true
	}
	return 0, false
}

// grow grows the buffer to guarantee space for n more bytes.
// It returns the index where bytes should be written.