Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 801 - 810 of 4,539 for Mode (0.02 seconds)

  1. cmd/admin-handlers_test.go

    	}
    
    	rec := httptest.NewRecorder()
    	adminTestBed.router.ServeHTTP(rec, req)
    
    	resp, _ := io.ReadAll(rec.Body)
    	if rec.Code != http.StatusOK {
    		t.Errorf("Expected to receive %d status code but received %d. Body (%s)",
    			http.StatusOK, rec.Code, string(resp))
    	}
    
    	result := &serviceResult{}
    	if err := json.Unmarshal(resp, result); err != nil {
    		t.Error(err)
    	}
    	_ = result
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 13.9K bytes
    - Click Count (1)
  2. docs/erasure/README.md

    # MinIO Erasure Code Quickstart Guide [![Slack](https://slack.min.io/slack?type=svg)](https://slack.min.io)
    
    MinIO protects data against hardware failures and silent data corruption using erasure code and checksums. With the highest level of redundancy, you may lose up to half (N/2) of the total drives and still be able to recover the data.
    
    ## What is Erasure Code?
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  3. android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixTrie.java

     *
     * <p>The trie data is stored in a {@link CharSequence} where each node takes 3 characters:
     *
     * <ol>
     *   <li>The offset of the label in the {@code stringPool}.
     *   <li>The index of the first child node in the {@code trieData}.
     *   <li>A bitfield containing:
     *       <ul>
     *         <li>Bits 0-10: Number of children.
     *         <li>Bit 11: Whether this node represents an exclusion (!rule).
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 21:21:59 GMT 2026
    - 9.1K bytes
    - Click Count (0)
  4. CONTRIBUTING.md

    The build cache has anonymous read access, so you don't need to authenticate in order to use it. You can use a different build cache node by specifying `-Ddevelocity.edge.discovery=false -DcacheNode=us` for a build cache node in the US or `-Ddevelocity.edge.discovery=false -DcacheNode=au` for a build cache node in Australia.
    
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Fri Mar 27 18:43:39 GMT 2026
    - 19.1K bytes
    - Click Count (0)
  5. api/maven-api-core/src/main/java/org/apache/maven/api/package-info.java

     * They are created when <dfn>resolving</dfn> a {@code DependencyCoordinates}.
     * Resolving is the process that clarifies the obligation (optional or mandatory),
     * selects a particular version, and downloads the artifact into the local repository.</p>
     *
     * <p>{@link org.apache.maven.api.Node} is the main output of the <dfn>dependency collection</dfn> process.
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Mon Dec 15 11:13:42 GMT 2025
    - 7.7K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/graph/GraphBuilder.java

     *         .build();
     * }
     *
     * @author James Sexton
     * @author Joshua O'Madadhain
     * @param <N> The most general node type this builder will support. This is normally {@code Object}
     *     unless it is constrained by using a method like {@link #nodeOrder}, or the builder is
     *     constructed based on an existing {@code Graph} using {@link #from(Graph)}.
     * @since 20.0
     */
    @DoNotMock
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Apr 02 14:49:41 GMT 2026
    - 7.2K bytes
    - Click Count (0)
  7. guava/src/com/google/common/collect/MinMaxPriorityQueue.java

            index = grandParentIndex;
          }
          queue[index] = x;
          return index;
        }
    
        /**
         * Returns the index of minimum value between {@code index} and {@code index + len}, or {@code
         * -1} if {@code index} is greater than {@code size}.
         */
        int findMin(int index, int len) {
          if (index >= size) {
            return -1;
          }
          checkState(index > 0);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  8. build-conventions/src/main/java/org/elasticsearch/gradle/internal/checkstyle/MissingJavadocTypeCheck.java

                if (textBlock == null) {
                    log(ast, MSG_JAVADOC_MISSING);
                }
            }
        }
    
        /**
         * Whether we should check this node.
         *
         * @param ast a given node.
         * @return whether we should check a given node.
         */
        private boolean shouldCheck(final DetailAST ast) {
            final Scope customScope;
    
            if (ScopeUtil.isInInterfaceOrAnnotationBlock(ast)) {
    Created: Wed Apr 08 16:19:15 GMT 2026
    - Last Modified: Thu Jun 10 23:06:44 GMT 2021
    - 5.5K bytes
    - Click Count (0)
  9. docs/pt/docs/deployment/server-workers.md

                 Importing from <font color="#75507B">/home/user/code/</font><font color="#AD7FA8">awesomeapp</font>
    
       <span style="background-color:#007166"><font color="#D3D7CF"> module </font></span>  🐍 main.py
    
         <span style="background-color:#007166"><font color="#D3D7CF"> code </font></span>  Importing the FastAPI app object from the module with the
                 following code:
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:20:43 GMT 2026
    - 8.5K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/graph/EndpointPairIterator.java

       * and updates {@link #successorIterator} to iterate through the successors of {@link #node}.
       */
      final boolean advance() {
        checkState(!successorIterator.hasNext());
        if (!nodeIterator.hasNext()) {
          return false;
        }
        node = nodeIterator.next();
        successorIterator = graph.successors(node).iterator();
        return true;
      }
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 4.9K bytes
    - Click Count (0)
Back to Top