* but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

        // Execute
        final InvalidQueryException exception = new InvalidQueryException(messageCode, message, middleCause);

        // Verify cause chain is preserved
        assertEquals(middleCause, exception.getCause());
        assertEquals(rootCause, exception.getCause().getCause());
    }

    public void test_emptyMessage() {
        // Setup

  /**
   * Returns the platform preferred map implementation that preserves insertion order when used only
   * for insertions.
   */
  static <K extends @Nullable Object, V extends @Nullable Object>
      Map<K, V> preservesInsertionOrderOnPutsMap() {
    return new LinkedHashMap<>();
  }

  /**
   * Returns the platform preferred map implementation that preserves insertion order when used only

			// Delete...
			h.QueuedBuckets = append(h.QueuedBuckets[:i], h.QueuedBuckets[i+1:]...)
		}
	}
}

// setQueuedBuckets will add buckets, but exclude any that is already in h.HealedBuckets.
// Order is preserved.
func (h *healingTracker) setQueuedBuckets(buckets []BucketInfo) {
	h.mu.Lock()
	defer h.mu.Unlock()

	s := set.CreateStringSet(h.HealedBuckets...)
	h.QueuedBuckets = make([]string, 0, len(buckets))

 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

        ServerMessageBlock resp = new SmbComOpenAndX("test.txt", 0, 0, null);
        resp.received = true;

        session.transport(); // initialise transport

        // Mock the sessionSetup behavior to avoid actual network calls
        // The sessionSetup method would normally send authentication messages
        // Only mark the sessionSetup response as received, not the actual request/response
        doAnswer(invocation -> {

                if (response == null || response.received) {
                    continue;
                }
                synchronized (response) {
                    response.readWireFormat(rcv_buf, 0);
                    response.received = true;

                    if (LogStream.level > 3) {
                        log.println(response);

    @Nested
    @DisplayName("Response State Tests")
    class ResponseStateTests {

        @Test
        @DisplayName("Should track received state")
        void testReceivedState() {
            assertFalse(echoResponse.isReceived());

            echoResponse.received();

            assertTrue(echoResponse.isReceived());
        }

        @Test
        @DisplayName("Should track error state")

  /** Ciphers in order we observed directly on the socket. */
  private lateinit var handshakeEnabledCipherSuites: List<String>

  /** Ciphers in order we observed on sslSocketFactory defaults. */
  private lateinit var defaultEnabledCipherSuites: List<String>

  /** Ciphers in order we observed on sslSocketFactory supported. */

   * table is internally partitioned to try to permit the indicated number of concurrent updates
   * without contention. Because assignment of entries to these partitions is not necessarily
   * uniform, the actual concurrency observed may vary. Ideally, you should choose a value to
   * accommodate as many threads as will ever concurrently modify the table. Using a significantly