Search Options

Results per page
Sort
Preferred Languages
Advance

Results 141 - 150 of 325 for Routing (0.05 sec)

  1. src/main/java/jcifs/internal/smb1/com/SmbComNTCreateAndX.java

        protected int writeParameterWordsWireFormat(final byte[] dst, int dstIndex) {
            final int start = dstIndex;
    
            dst[dstIndex] = (byte) 0x00;
            dstIndex++;
            // name length without counting null termination
            this.namelen_index = dstIndex;
            dstIndex += 2;
            SMBUtil.writeInt4(this.flags0, dst, dstIndex);
            dstIndex += 4;
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 8.6K bytes
    - Viewed (0)
  2. src/main/java/jcifs/SmbResourceLocator.java

         * Returns the original URL object used to create this SMB resource.
         *
         * @return the original URL
         */
        URL getURL();
    
        /**
         * Returns the resolved network address of the server hosting this SMB resource.
         *
         * @return resolved server address
         * @throws CIFSException if the address cannot be resolved
         */
        Address getAddress() throws CIFSException;
    
        /**
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 6.4K bytes
    - Viewed (0)
  3. docs/distributed/README.md

    ### High availability
    
    A stand-alone MinIO server would go down if the server hosting the drives goes offline. In contrast, a distributed MinIO setup with _m_ servers and _n_ drives will have your data safe as long as _m/2_ servers or _m*n_/2 or more drives are online.
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 8.9K bytes
    - Viewed (0)
  4. cmd/storage-rest-client.go

    }
    
    // Wrapper to restClient.CallWithMethod to handle network errors, in case of network error the connection is disconnected
    // and a healthcheck routine gets invoked that would reconnect.
    func (client *storageRESTClient) callGet(ctx context.Context, rpcMethod string, values url.Values, body io.Reader, length int64) (io.ReadCloser, error) {
    	if values == nil {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 08 02:38:41 UTC 2025
    - 30.4K bytes
    - Viewed (0)
  5. docs/tls/README.md

    state = "Example"
    
    # The country of the subject. Two letter code.
    country = "EX"
    
    # The common name of the certificate owner.
    cn = "Sally Certowner"
    
    # In how many days, counting from today, this certificate will expire.
    expiration_days = 365
    
    # X.509 v3 extensions
    
    # DNS name(s) of the server
    dns_name = "localhost"
    
    # (Optional) Server IP address
    ip_address = "127.0.0.1"
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 8.6K bytes
    - Viewed (0)
  6. cmd/xl-storage-format-v2.go

    // using a delete-marker and MetaSys entries. It's used to track tiered content of a
    // deleted/overwritten version. This version is visible _only_to the scanner routine, for subsequent deletion.
    // This kind of tracking is necessary since a version's tiered content is deleted asynchronously.
    
    // Backend directory tree structure:
    // disk1/
    // └── bucket
    //     └── object
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 65.6K bytes
    - Viewed (1)
  7. src/main/java/org/codelibs/core/collection/CollectionsUtil.java

         *
         * @param <K> the key type of {@link ConcurrentSkipListMap}
         * @param <V> the value type of {@link ConcurrentSkipListMap}
         * @param c the comparator for sorting the map
         * @return a new instance of {@link ConcurrentSkipListMap}
         * @see ConcurrentSkipListMap#ConcurrentSkipListMap(Comparator)
         */
    Registered: Sat Dec 20 08:55:33 UTC 2025
    - Last Modified: Thu Jul 31 08:16:49 UTC 2025
    - 49.9K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/collect/CompactLinkedHashSet.java

        this.successor = null;
        return result;
      }
    
      /*
       * For discussion of the safety of the following methods for operating on predecessors and
       * successors, see the comments near the end of CompactHashMap, noting that the methods here call
       * requirePredecessors() and requireSuccessors(), which are defined at the end of this file.
       */
    
      private int getPredecessor(int entry) {
        return requirePredecessors()[entry] - 1;
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Wed Aug 06 14:59:07 UTC 2025
    - 9.4K bytes
    - Viewed (0)
  9. guava/src/com/google/common/collect/CompactLinkedHashSet.java

        this.successor = null;
        return result;
      }
    
      /*
       * For discussion of the safety of the following methods for operating on predecessors and
       * successors, see the comments near the end of CompactHashMap, noting that the methods here call
       * requirePredecessors() and requireSuccessors(), which are defined at the end of this file.
       */
    
      private int getPredecessor(int entry) {
        return requirePredecessors()[entry] - 1;
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Wed Aug 06 14:59:07 UTC 2025
    - 9.6K bytes
    - Viewed (0)
  10. compat/maven-artifact/src/test/java/org/apache/maven/artifact/versioning/ComparableVersionTest.java

        /**
         * Test <a href="https://issues.apache.org/jira/browse/MNG-5568">MNG-5568</a> edge case
         * which was showing transitive inconsistency: since A &gt; B and B &gt; C then we should have A &gt; C
         * otherwise sorting a list of ComparableVersions() will in some cases throw runtime exception;
         * see Netbeans issues <a href="https://netbeans.org/bugzilla/show_bug.cgi?id=240845">240845</a> and
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Fri Mar 21 04:56:21 UTC 2025
    - 17.8K bytes
    - Viewed (0)
Back to top