case SMB_COM_CREATE_DIRECTORY -> "SMB_COM_CREATE_DIRECTORY";
        case SMB_COM_NT_TRANSACT -> "SMB_COM_NT_TRANSACT";
        case SMB_COM_NT_TRANSACT_SECONDARY -> "SMB_COM_NT_TRANSACT_SECONDARY";
        default -> "UNKNOWN";
        };
        final String str = errorCode == 0 ? "0" : SmbException.getMessageByCode(errorCode);

      "Licensor" shall mean the copyright owner or entity authorized by
      the copyright owner that is granting the License.

      "Legal Entity" shall mean the union of the acting entity and all
      other entities that control, are controlled by, or are under common
      control with that entity. For the purposes of this definition,

   * href="https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp">32-bit murmur3
   * algorithm, x86 variant</a> (little-endian variant), using the given seed value, <b>with a known
   * bug</b> as described in the deprecation text.
   *
   * <p>The C++ equivalent is the MurmurHash3_x86_32 function (Murmur3A), which however does not
   * have the bug.
   *

   *   <li>{@code [2, 4)} and {@code [4, 6)} are connected, because both enclose the empty range
   *       {@code [4, 4)}
   * </ul>
   *
   * <p>Note that this range and {@code other} have a well-defined {@linkplain #span union} and
   * {@linkplain #intersection intersection} (as a single, possibly-empty range) if and only if this
   * method returns {@code true}.
   *

  /**
   * This decodes a value into its contents using a preceding member of the same SEQUENCE. For
   * example, extensions type IDs specify what types to use for the corresponding values.
   *
   * If the hint is unknown [chooser] should return null which will cause the value to be decoded as
   * an opaque byte string.
   *
   * This may optionally wrap the contents in a tag.
   */

            break;
        case WitnessNotificationMessage.WITNESS_IP_CHANGE:
            decodeIpChangeMessage(buf, message);
            break;
        default:
            // Skip unknown message types
            buf.advance(messageLength - 8); // Skip remaining data (minus type and length)
            break;
        }

        return message;
    }

    /**

- [v1.6.5](#v165)
  - [Known Issues for v1.6.5](#known-issues-for-v165)
  - [Downloads for v1.6.5](#downloads-for-v165)
    - [Client Binaries](#client-binaries-8)
    - [Server Binaries](#server-binaries-8)
    - [Node Binaries](#node-binaries-8)
  - [Changelog since v1.6.4](#changelog-since-v164)
    - [Other notable changes](#other-notable-changes-8)
- [v1.6.4](#v164)
  - [Known Issues for v1.6.4](#known-issues-for-v164)

                            roleList.add(id);
                        } else {
                            if (logger.isDebugEnabled()) {
                                logger.debug("Unknown @odata.type: {}", memberOf);
                            }
                            groupList.add(id);
                        }
                        processParentGroup(user, groupList, roleList, id);

  //
  // Element-level accessors
  //

  /**
   * Returns a live view of the nodes which have an incident edge in common with {@code node} in
   * this graph.
   *
   * <p>This is equal to the union of {@link #predecessors(Object)} and {@link #successors(Object)}.
   *
   * <p>If {@code node} is removed from the graph after this method is called, the {@code Set}

              } else {
                if (firstUpdate) {
                  firstUpdate = false
                  if (contentLength == -1L) {
                    println("content-length: unknown")
                  } else {
                    println("content-length: $contentLength")
                  }
                }
                println(bytesWritten)
                if (contentLength != -1L) {