Search Options

Results per page
Sort
Preferred Languages
Advance

Results 221 - 230 of 459 for nodes (0.01 sec)

  1. src/main/java/jcifs/smb/DosError.java

     */
    
    package jcifs.smb;
    
    /**
     * Interface defining DOS error codes and their mappings to NT status codes.
     * Provides lookup tables for converting between DOS and NT error representations.
     */
    public interface DosError {
    
        /**
         * Mapping table from DOS error codes to NT status codes.
         * Each entry contains a pair of [DOS error code, NT status code].
         */
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 4.8K bytes
    - Viewed (0)
  2. src/main/java/jcifs/dcerpc/rpc.java

                final int _nodes = 6;
                final int _nodei = _src.index;
                _src.advance(1 * _nodes);
    
                if (this.node == null) {
                    if (_nodes < 0 || _nodes > 0xFFFF) {
                        throw new NdrException(NdrException.INVALID_CONFORMANCE);
                    }
                    this.node = new byte[_nodes];
                }
                _src = _src.derive(_nodei);
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 11.3K bytes
    - Viewed (0)
  3. src/main/java/jcifs/smb1/smb1/DosError.java

     */
    
    package jcifs.smb1.smb1;
    
    /**
     * Interface defining DOS error codes and their mappings to NT status codes for SMB1 protocol.
     * Provides lookup tables for converting between DOS and NT error representations.
     */
    public interface DosError {
    
        /**
         * Mapping table from DOS error codes to NT status codes.
         * Each entry contains a pair of [DOS error code, NT status code].
         */
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 4.7K bytes
    - Viewed (0)
  4. docs/metrics/prometheus/grafana/replication/minio-replication-node.json

          "5m",
          "15m",
          "1h",
          "6h",
          "12h",
          "24h",
          "2d",
          "7d",
          "30d"
        ]
      },
      "timezone": "",
      "title": "MinIO Node Replication Dashboard",
      "uid": "gmTJnqnnk3",
      "version": 1,
      "weekStart": ""
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Mon Aug 04 01:46:49 UTC 2025
    - 57.5K bytes
    - Viewed (0)
  5. docs/en/docs/tutorial/response-status-code.md

    /// note
    
    Some response codes (see the next section) indicate that the response does not have a body.
    
    FastAPI knows this, and will produce OpenAPI docs that state there is no response body.
    
    ///
    
    ## About HTTP status codes { #about-http-status-codes }
    
    /// note
    
    If you already know what HTTP status codes are, skip to the next section.
    
    ///
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 4K bytes
    - Viewed (0)
  6. fess-crawler/src/main/java/org/codelibs/fess/crawler/processor/impl/DefaultResponseProcessor.java

        }
    
        /**
         * Gets the successful HTTP codes.
         *
         * @return the successful HTTP codes
         */
        public int[] getSuccessfulHttpCodes() {
            return successfulHttpCodes;
        }
    
        /**
         * Sets the successful HTTP codes.
         *
         * @param successfulHttpCodes the successful HTTP codes to set
         */
    Registered: Sun Sep 21 03:50:09 UTC 2025
    - Last Modified: Thu Aug 07 02:55:08 UTC 2025
    - 12.5K bytes
    - Viewed (0)
  7. src/test/java/jcifs/smb/WinErrorTest.java

        // Helper to lookup a message by code using the production arrays
        private static Optional<String> lookupMessage(int code) {
            int[] codes = WinError.WINERR_CODES;
            String[] msgs = WinError.WINERR_MESSAGES;
            for (int i = 0; i < codes.length; i++) {
                if (codes[i] == code) {
                    return Optional.of(msgs[i]);
                }
            }
            return Optional.empty();
        }
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 8.4K bytes
    - Viewed (0)
  8. src/test/java/jcifs/dcerpc/DcerpcErrorTest.java

            faultCodes.add(DcerpcError.DCERPC_FAULT_PROTO_ERROR);
    
            // Verify all 9 codes are unique
            assertEquals(9, faultCodes.size(), "All fault codes should be unique");
        }
    
        @Test
        @DisplayName("Should verify fault code value ranges and patterns")
        void testFaultCodeValueRanges() {
            // Standard fault codes (0x00000000 - 0x0000FFFF range)
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 7K bytes
    - Viewed (0)
  9. src/test/java/jcifs/smb/NtStatusTest.java

            }
        }
    
        @Test
        @DisplayName("Should have status codes array")
        void testStatusCodesArray() {
            // When
            int[] codes = NtStatus.NT_STATUS_CODES;
    
            // Then
            assertNotNull(codes);
            assertTrue(codes.length > 0);
            // First code should be success
            assertEquals(NtStatus.NT_STATUS_SUCCESS, codes[0]);
        }
    
        @Test
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 5.6K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/hash/Hashing.java

      }
    
      /**
       * Returns a hash code, having the same bit length as each of the input hash codes, that combines
       * the information of these hash codes in an ordered fashion. That is, whenever two equal hash
       * codes are produced by two calls to this method, it is <i>as likely as possible</i> that each
       * was computed from the <i>same</i> input hash codes in the <i>same</i> order.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 29.8K bytes
    - Viewed (0)
Back to top