Search Options

Results per page
Sort
Preferred Languages
Advance

Results 111 - 120 of 238 for sequences (0.1 sec)

  1. src/test/java/jcifs/spnego/NegTokenInitTest.java

                assertEquals(0, top.getTagNo(), "Top-level tag number should be 0");
                assertTrue(top.getBaseObject() instanceof ASN1Sequence, "Base object should be a sequence");
                ASN1Sequence seq = (ASN1Sequence) top.getBaseObject();
                assertEquals(2, seq.size(), "Sequence should contain OID and [0] NegTokenInit");
                assertTrue(seq.getObjectAt(0) instanceof ASN1ObjectIdentifier, "First element should be OID");
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 21K bytes
    - Viewed (0)
  2. src/README.vendor

    Go from source and use that 'go' binary to update its source tree.
    
    Requirements may be added, updated, and removed with 'go get'.
    The vendor directory may be updated with 'go mod vendor'.
    A typical sequence might be:
    
        cd src  # or src/cmd
        go get golang.org/x/net@master
        go mod tidy
        go mod vendor
    
    Use caution when passing '-u' to 'go get'. The '-u' flag updates
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Sep 30 19:15:39 UTC 2024
    - 2.4K bytes
    - Viewed (0)
  3. docs/bucket/notifications/README.md

    ```
    
    ## Publish MinIO events MQTT
    
    Install an MQTT Broker from [here](https://mosquitto.org/).
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 84.2K bytes
    - Viewed (0)
  4. src/test/java/jcifs/EncodableTest.java

                    Arguments.of(makeSeq(16), 7, 3, 0), // small slice from middle
                    Arguments.of(makeSeq(16), 0, 0, 5) // zero-length with non-zero dst index
            );
        }
    
        // Creates a deterministic byte sequence [0,1,2,...,n-1]
        private static byte[] makeSeq(int n) {
            byte[] a = new byte[n];
            for (int i = 0; i < n; i++) {
                a[i] = (byte) i;
            }
            return a;
        }
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 4.6K bytes
    - Viewed (0)
  5. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http/DateFormatting.kt

            isLenient = false
            timeZone = UTC
          }
        }
      }
    
    /** If we fail to parse a date in a non-standard format, try each of these formats in sequence. */
    private val BROWSER_COMPATIBLE_DATE_FORMAT_STRINGS =
      arrayOf(
        // HTTP formats required by RFC2616 but with any timezone:
        // RFC 822, updated by RFC 1123 with any TZ.
        "EEE, dd MMM yyyy HH:mm:ss zzz",
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Fri Dec 27 13:39:56 UTC 2024
    - 4.1K bytes
    - Viewed (0)
  6. src/cmd/asm/internal/lex/lex.go

    	Line() int
    	// Col reports the source column number of the token.
    	Col() int
    	// Close does any teardown required.
    	Close()
    }
    
    // A Token is a scan token plus its string value.
    // A macro is stored as a sequence of Tokens with spaces stripped.
    type Token struct {
    	ScanToken
    	text string
    }
    
    // Make returns a Token with the given rune (ScanToken) and text representation.
    func Make(token ScanToken, text string) Token {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue Aug 29 18:31:05 UTC 2023
    - 4.1K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/graph/Graphs.java

      private Graphs() {}
    
      // Graph query methods
    
      /**
       * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
       * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
       * and ending with the same node.
       *
       * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
       */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  8. guava/src/com/google/common/graph/Graphs.java

      private Graphs() {}
    
      // Graph query methods
    
      /**
       * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
       * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
       * and ending with the same node.
       *
       * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
       */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
  9. docs/pt/docs/tutorial/security/simple-oauth2.md

    #### Hashing de senha
    
    "Hashing" significa: converter algum conteúdo (uma senha neste caso) em uma sequência de bytes (apenas uma string) que parece algo sem sentido.
    
    Sempre que você passa exatamente o mesmo conteúdo (exatamente a mesma senha), você obtém exatamente a mesma sequência aleatória de caracteres.
    
    Mas você não pode converter a sequência aleatória de caracteres de volta para a senha.
    
    ##### Porque usar hashing de senha
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 10K bytes
    - Viewed (0)
  10. src/main/java/jcifs/internal/smb2/io/Smb2WriteRequest.java

            this.data = data;
            this.dataOffset = offset;
            this.dataLength = length;
        }
    
        /**
         * Sets the number of bytes remaining to be written in a sequence of write operations.
         *
         * @param remainingBytes the remainingBytes to set
         */
        public void setRemainingBytes(final int remainingBytes) {
            this.remainingBytes = remainingBytes;
        }
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 23 05:11:12 UTC 2025
    - 7.1K bytes
    - Viewed (0)
Back to top