*/
    protected abstract int doReceiveFragment(byte[] buf) throws IOException;

    /**
     * Sends a DCERPC fragment and receives the response in a single operation
     * @param out the outgoing buffer containing the request
     * @param off the offset into the outgoing buffer
     * @param length the length of data to send
     * @param inB the buffer to receive the response

        assertNotNull(notifications);
        assertTrue(notifications.isEmpty());
        assertEquals(0, notifications.size());
    }

    @Test
    @DisplayName("Test NotifyResponse interface with single notification")
    void testNotifyResponseWithSingleNotification() {
        List<FileNotifyInformation> inputList = Collections.singletonList(mockNotifyInfo1);

 *
 * <p>To implement a multimap, a subclass must define the method {@link #createCollection()}, which
 * creates an empty collection of values for a key.
 *
 * <p>The multimap constructor takes a map that has a single entry for each distinct key. When you
 * insert a key-value pair with a key that isn't already in the multimap, {@code
 * AbstractMapBasedMultimap} calls {@link #createCollection()} to create the collection of values

    ) {
      assertLockNotHeld()

      sendBuffer.write(source, byteCount)
      while (sendBuffer.size >= EMIT_BUFFER_SIZE) {
        emitFrame(false)
      }
    }

    /**
     * Emit a single data frame to the connection. The frame's size be limited by this stream's
     * write window. This method will block until the write window is nonempty.
     */
    @Throws(IOException::class)

   */
  @CanIgnoreReturnValue // pushed down from class to method
  @Override
  public int remainingCapacity() {
    return Integer.MAX_VALUE;
  }

  /**
   * Removes a single instance of the specified element from this queue, if it is present. More
   * formally, removes an element {@code e} such that {@code o.equals(e)}, if this queue contains

   *       {@code MapJoiner} method that accepts entries as input, and receive output of the form
   *       {@code key1=A&key1=B&key2=C}.
   *   <li>To output a single entry for each key, pass {@code multimap.asMap()} to a {@code
   *       MapJoiner} method that accepts a map as input, and receive output of the form {@code
   *       key1=[A, B]&key2=C}.
   * </ul>
   *

  }

  /**
   * Returns the values from each provided array combined into a single array. For example, {@code
   * concat(new long[] {a, b}, new long[] {}, new long[] {c}} returns the array {@code {a, b, c}}.
   *
   * @param arrays zero or more {@code long} arrays
   * @return a single array containing all the values from the source arrays, in order

            ComponentUtil.getCrawlingConfigHelper().remove(sid);
        }

    }

    /**
     * Inner thread class for executing data store crawling operations.
     * Each thread handles crawling for a single data configuration,
     * processing documents and updating the search index.
     *
     * <p>The thread manages:</p>
     * <ul>
     *   <li>Data store initialization and document processing</li>

import jcifs.util.Hexdump;

/**
 * Base class for SMB1 AndX (chained) command messages.
 * This class extends ServerMessageBlock to support SMB1 command chaining, where multiple
 * related commands can be batched together in a single message for improved efficiency.
 */
public abstract class AndXServerMessageBlock extends ServerMessageBlock {

    private static final Logger log = LoggerFactory.getLogger(AndXServerMessageBlock.class);

	return FromBool(matchResult), nil
}

func (e *ListExpr) evalNode(r Record, tableAlias string) (*Value, error) {
	res := make([]Value, len(e.Elements))
	if len(e.Elements) == 1 {
		// If length 1, treat as single value.
		return e.Elements[0].evalNode(r, tableAlias)
	}
	for i, elt := range e.Elements {
		v, err := elt.evalNode(r, tableAlias)
		if err != nil {
			return nil, err
		}
		res[i] = *v
	}