if (result == 0) {
          return count(getElement());
        } else {
          return result;
        }
      }
    };
  }

  /** Returns the first node in the tree that is in range. */
  private @Nullable AvlNode<E> firstNode() {
    AvlNode<E> root = rootReference.get();
    if (root == null) {
      return null;
    }
    AvlNode<E> node;

// sortIPs - sort ips based on higher octets.
// The logic to sort by last octet is implemented to
// prefer CIDRs with higher octets, this in-turn skips the
// localhost/loopback address to be not preferred as the
// first ip on the list. Subsequently this list helps us print
// a user friendly message with appropriate values.
func sortIPs(ipList []string) []string {
	if len(ipList) == 1 {
		return ipList
	}

	var ipV4s []net.IP

    class IntegrationTests {

        @Test
        @DisplayName("Should maintain state after multiple decodes")
        void testMultipleDecodes() throws SMBProtocolDecodingException {
            // First decode
            byte[] buffer1 = createValidCopyChunkResponse(1, 1024, 1024);
            response.decode(buffer1, 0, buffer1.length);
            assertEquals(1, response.getChunksWritten());

				return send(meta)
			}
			// Skip all other files.
		}

		// Process in sort order.
		sort.Strings(entries)
		dirStack := make([]string, 0, 5)
		prefix = "" // Remove prefix after first level as we have already filtered the list.
		if len(forward) > 0 {
			// Conservative forwarding. Entries may be either objects or prefixes.
			for i, entry := range entries {

	{"a\xe0\x80cd", not(isValidRune), 1, 2},
}

func TestIndexFunc(t *testing.T) {
	for _, tc := range indexFuncTests {
		first := IndexFunc([]byte(tc.in), tc.f.f)
		if first != tc.first {
			t.Errorf("IndexFunc(%q, %s) = %d; want %d", tc.in, tc.f.name, first, tc.first)
		}
		last := LastIndexFunc([]byte(tc.in), tc.f.f)
		if last != tc.last {

     */
    public int getActiveRegistrationCount() {
        return registrations.size();
    }

    @Override
    public void close() {
        // Stop all async notification tasks first
        List<CompletableFuture<Void>> taskFutures = new ArrayList<>(asyncNotifyTasks.values());
        for (CompletableFuture<Void> task : taskFutures) {
            task.cancel(true);
        }

        history.add(LlmMessage.user("First question"));

        final LlmChatRequest request = client.testBuildIntentRequest("Follow-up", history);
        final List<LlmMessage> messages = request.getMessages();

        // system + 1 history + user = 3 messages
        assertEquals(3, messages.size());
        assertEquals("First question", messages.get(1).getContent());

> The AGPLv3 license provides no warranties nor liabilities for any such usage.

## Build Docker Image

You can use the `docker build .` command to build a Docker image on your local host machine.
You must first [build MinIO](#install-from-source) and ensure the `minio` binary exists in the project root.

            accessResult.setStatus(200);
            accessResult.setUrl("http://www.example.com/page" + i);

            dataService.store(accessResult);
        }

        // Get first page (5 items)
        final List<OpenSearchAccessResult> page1 = dataService.getAccessResultList(builder -> {
            builder.setQuery(QueryBuilders.termQuery("sessionId", sessionId));
            builder.setFrom(0);

   * implement shutdown and termination behavior.
   *
   * <p>The implementation deviates from the {@code ExecutorService} specification with regards to
   * the {@code shutdownNow} method. First, "best-effort" with regards to canceling running tasks is
   * implemented as "no-effort". No interrupts or other attempts are made to stop threads executing