/*
 * Copyright 2012-2025 CodeLibs Project and the Others.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,

```properties
indexer.language.fields=content,important_content,title
```

## Optional: Search Analysis Support

If your language requires special text analysis (stemming, stop words, etc.), you may need to configure OpenSearch analyzers.

### 1. Update OpenSearch Index Template

Edit `src/main/resources/fess_indices/fess.json` to add language-specific analyzers.

**Example for Swedish:**
```json
{

# Witness
jcifs.smb.client.useWitness=true
jcifs.smb.client.witnessNotificationTimeout=5000
```

## Risk Assessment

### Technical Risks
1. **RDMA Complexity**: Limited Java RDMA support may require JNI
2. **Multi-Channel Synchronization**: Complex thread synchronization required
3. **Persistent Handle State**: Requires reliable state persistence mechanism

        String stringRep = transformHeader.toString();

        // Then
        assertNotNull(stringRep);
        assertTrue(stringRep.contains("Smb2TransformHeader"));
        // toString() implementation may vary, just check it's not null and not empty
        assertFalse(stringRep.isEmpty());
    }

    @Test
    @DisplayName("Should generate correct associated data for AEAD")
    void testGetAssociatedData() {

	for i := range r2b {
		r2b[i] = i
	}
	bufs := make([][]byte, len(readers))
	shardSize := int(e.ShardSize())
	var b []byte

	// We should always have enough capacity, but older objects may be bigger
	// we do not need stashbuffer for them.
	if globalBytePoolCap.Load().WidthCap() >= len(readers)*shardSize {
		// Fill buffers
		b = globalBytePoolCap.Load().Get()
		// Seed the buffers.
		for i := range bufs {

			if pctUsed := int(disk.Used * 100 / disk.Total); pctUsed > maxUsedPct {
				maxUsedPct = pctUsed
			}
		}

		// Since we are comparing pools that may have a different number of sets
		// we multiply by the number of sets in the pool.
		// This will compensate for differences in set sizes
		// when choosing destination pool.

/*
 * Copyright 2012-2025 CodeLibs Project and the Others.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,

/*
 * Copyright 2012-2025 CodeLibs Project and the Others.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,

 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,

                    "Initial state should be DISCONNECTED or CONNECTING");

            // Test connection properties
            // Note: Local address may be null for TCP fallback provider
            InetSocketAddress localAddr = connection.getLocalAddress();
            if (localAddr != null) {
                System.out.println("Local address: " + localAddr);
            }