labels.search=Pesquisar
labels.similar_doc_result_status=Mostrando resultados semelhantes.
labels.search_result_status=Resultados da pesquisa para <b>{0}</b><span class="br-phone"></span> <b>{2}</b> - <b>{3}</b> de <b>{1}</b>
labels.search_result_status_over=Resultados da pesquisa para <b>{0}</b><span class="br-phone"></span> <b>{2}</b> - <b>{3}</b> de mais de <b>{1}</b>
labels.search_result_time=({0} segundos)
labels.prev_page=Anterior
labels.next_page=Próximo

 * prefix for SMB URLs based on the configured server and port.
 * </p>
 *
 * <p>
 * The path prefix is in the format "smb://server:port/", where the port is
 * included only if it's greater than 0. If the server is not set, the path
 * prefix will be "smb://".
 * </p>
 */
public class SmbAuthentication {
    private String server;

    private int port;

    private String username;

        assertFalse(registration.isExpired(60000));

        // Wait a bit to ensure some time has passed
        Thread.sleep(50);
        // Should be expired with very short timeout (shorter than sleep time)
        assertTrue(registration.isExpired(10));
    }

    @Test
    void testStateTransitions() {
        assertEquals(WitnessRegistrationState.REGISTERING, registration.getState());

/**
 * This is an implementation of the HMACT64 keyed hashing algorithm.
 * HMACT64 is defined by Luke Leighton as a modified HMAC-MD5 (RFC 2104)
 * in which the key is truncated at 64 bytes (rather than being hashed
 * via MD5).
 */
public class HMACT64 extends MessageDigest implements Cloneable {

    private static final int BLOCK_LENGTH = 64;

    private static final byte IPAD = (byte) 0x36;

/**
 * This is an implementation of the HMACT64 keyed hashing algorithm.
 * HMACT64 is defined by Luke Leighton as a modified HMAC-MD5 (RFC 2104)
 * in which the key is truncated at 64 bytes (rather than being hashed
 * via MD5).
 */
class HMACT64 extends MessageDigest implements Cloneable {

    private static final int BLOCK_LENGTH = 64;

    private static final byte IPAD = (byte) 0x36;

   * instead.
   *
   * <p><b>Note:</b> If {@code elements} is a {@code SortedSet} with an explicit comparator, this
   * method has different behavior than {@link TreeSet#TreeSet(SortedSet)}, which returns a {@code
   * TreeSet} with that comparator.
   *
   * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated. Instead,

   * natural ordering. The sorted multisets use {@link Ordering#natural()} as the comparator. This
   * method provides more type-safety than {@link #builder}, as it can be called only for classes
   * that implement {@link Comparable}.
   *
   * <p>Note: the type parameter {@code E} extends {@code Comparable<?>} rather than {@code
   * Comparable<? super E>} in order to accommodate users of obsolete javac versions affected by <a

        // Any PACDecodingException is acceptable for this test
        assertNotNull(e.getMessage());
    }

    @Test
    void testTooSmallPac() {
        // Test that PAC smaller than 8 bytes is rejected
        byte[] smallData = new byte[4];

        PACDecodingException e = assertThrows(PACDecodingException.class, () -> new Pac(smallData, keys));

 *
 * This class implements the TRANS_TRANSACT_NAMED_PIPE transaction which
 * combines writing data to a pipe and reading the response in a single operation.
 * This is more efficient than separate write and read operations.
 */
public class TransTransactNamedPipe extends SmbComTransaction {

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

   * on the fields of TimeoutFuture. This field is slightly different from the fields discussed
   * there: cancel() never reads this field, only writes to it. That makes the race here completely
   * harmless, rather than just 99.99% harmless.
   */
  @LazyInit private @Nullable List<@Nullable Present<V>> values;

  @SuppressWarnings("EmptyList") // ImmutableList doesn't support nullable element types
  CollectionFuture(