### Suggest solutions { #suggest-solutions }

* After being able to understand the question, you can give them a possible **answer**.

				</ul></li></c:if>

			<c:if test="${fe:permission('admin-suggest-view') or fe:permission('admin-elevateword-view') or fe:permission('admin-badword-view')}">

			<li class="nav-item has-treeview <c:if test="${param.menuCategoryType=='suggest'}">menu-open</c:if>">
				<a href="#" class="nav-link <c:if test="${param.menuCategoryType=='suggest'}">active</c:if>">
					<em class='nav-icon fa fa-list'>
					<p>

## Dependencies for a group of *path operations* { #dependencies-for-a-group-of-path-operations }

Later, when reading about how to structure bigger applications ([Bigger Applications - Multiple Files](../../tutorial/bigger-applications.md){.internal-link target=_blank}), possibly with multiple files, you will learn how to declare a single `dependencies` parameter for a group of *path operations*.

 * while {@link #escapeUnsafe} is overridden to handle general escaping of the form {@code \\uxxxx}.
 *
 * <p>The size of the data structure used by {@link ArrayBasedCharEscaper} is proportional to the
 * highest valued character that requires escaping. For example a replacement map containing the
 * single character '{@code \}{@code u1000}' will require approximately 16K of memory. If you need

 */

package jcifs.smb1.util;

import java.security.MessageDigest;

/**
 * Implements the MD4 message digest algorithm in Java.
 * <p>
 * <b>References:</b>
 * <ol>
 *   <li> Ronald L. Rivest,
 *        "<a href="http://www.roxen.com/rfc/rfc1320.html">
 *        The MD4 Message-Digest Algorithm</a>",
 *        IETF RFC-1320 (informational).
 * </ol>
 *
 * <p><b>$Revision: 1.2 $</b>
 * @author  Raif S. Naffah

            }

            // SMB 3.1.1 spec: Hash = Hash(PreviousHash || Message)
            digest.update(previousHash);
            digest.update(messageData);

            return digest.digest();
        } catch (NoSuchAlgorithmException e) {
            throw new CIFSException("Hash algorithm not available: " + hashAlgorithm, e);
        }
    }

    /**
     * Gets the name of a hash algorithm.
     *

 * {@link #escapeUnsafe} is overridden to handle general escaping of the form {@code &#NNNNN;}.
 *
 * <p>The size of the data structure used by {@link ArrayBasedUnicodeEscaper} is proportional to the
 * highest valued code point that requires escaping. For example a replacement map containing the
 * single character '{@code \}{@code u1000}' will require approximately 16K of memory. If you need

        return getVersions().isEmpty()
                ? Optional.empty()
                : Optional.of(getVersions().get(0));
    }

    /**
     * Gets the highest version matching the requested range.
     *
     * @return An Optional containing the highest matching version, or empty Optional if no versions
     *         matched the requested range
     */
    @Nonnull
    default Optional<Version> getHighestVersion() {

---
name: Feature request
about: Suggest an idea for this project
title: ''
labels: ''
assignees: ''

---

## Dependências para conjuntos de *operações de rota*