Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1121 - 1130 of 1,837 for some (0.02 sec)

  1. compat/maven-compat/src/test/java/org/apache/maven/ProjectDependenciesResolverTest.java

        @Test
        void testSystemScopeDependencyIsPresentInTheCompileClasspathElements() throws Exception {
            File pom = getProject("it0063");
    
            Properties eps = new Properties();
            eps.setProperty("jre.home", new File(pom.getParentFile(), "jdk/jre").getPath());
    
            MavenSession session = createMavenSession(pom, eps);
            MavenProject project = session.getCurrentProject();
    
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Fri Jun 06 14:28:57 UTC 2025
    - 3.2K bytes
    - Viewed (0)
  2. .github/ISSUE_TEMPLATE/30_contributor_regression.yml

      - type: textarea
        id: context
        attributes:
          label: Context (optional)
          description: |
            How has this issue affected you? What are you trying to accomplish?
            Providing context helps us come up with a solution that is most useful in the real world
        validations:
          required: false
      - type: textarea
        id: steps-to-reproduce
        attributes:
          label: Self-contained Reproducer Project
    Registered: Wed Sep 10 11:36:15 UTC 2025
    - Last Modified: Mon Sep 09 14:48:49 UTC 2024
    - 2.7K bytes
    - Viewed (0)
  3. cmd/metacache-entries.go

    				// In that case we will drop the directory entry.
    				// This should however not be confused with an object with a trailing slash.
    				dirMatches := best.isDir() == other.isDir()
    				suffixMatches := strings.HasSuffix(best.name, slashSeparator) == strings.HasSuffix(other.name, slashSeparator)
    
    				// Simple case. Both are same type with same suffix.
    				if dirMatches && suffixMatches {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Thu Aug 08 15:29:58 UTC 2024
    - 24.1K bytes
    - Viewed (0)
  4. docs/multi-user/README.md

    ```
    {
      "Version": "2012-10-17",
      "Statement": [
    	{
    	  "Action": ["s3:ListBucket"],
    	  "Effect": "Allow",
    	  "Resource": ["arn:aws:s3:::mybucket"],
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 8.2K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java

      public void testConstructor2NPE() {
        double[] a = null;
        assertThrows(NullPointerException.class, () -> new AtomicDoubleArray(a));
      }
    
      /** constructor with array is of same size and has all elements */
      public void testConstructor2() {
        AtomicDoubleArray aa = new AtomicDoubleArray(VALUES);
        assertEquals(VALUES.length, aa.length());
        for (int i = 0; i < VALUES.length; i++) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 14.6K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/reflect/TypeResolver.java

          return capture(type);
        }
      }
    
      /**
       * Wraps around {@code TypeVariable<?>} to ensure that any two type variables are equal as long as
       * they are declared by the same {@link java.lang.reflect.GenericDeclaration} and have the same
       * name, even if their bounds differ.
       *
       * <p>While resolving a type variable from a {@code var -> type} map, we don't care whether the
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Sep 03 14:03:14 UTC 2025
    - 24.2K bytes
    - Viewed (0)
  7. android/guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java

         *
         * <p>This method is used when testing iterators without a known ordering. We poll the target
         * iterator's next element and pass it to the reference iterator through this method so it can
         * return the same element. This enables the assertion to pass and the reference iterator to
         * properly update its state.
         */
        void promoteToNext(E e) {
          if (nextElements.remove(e)) {
            nextElements.push(e);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed May 14 19:40:47 UTC 2025
    - 20.8K bytes
    - Viewed (0)
  8. docs/ja/docs/tutorial/path-params.md

    したがって、以下の様に使用できます:
    
    {* ../../docs_src/path_params/tutorial004.py hl[6] *}
    
    /// tip | 豆知識
    
    最初のスラッシュ (`/`)が付いている `/home/johndoe/myfile.txt` をパラメータが含んでいる必要があります。
    
    この場合、URLは `files` と `home` の間にダブルスラッシュ (`//`) のある、 `/files//home/johndoe/myfile.txt` になります。
    
    ///
    
    ## まとめ
    
    簡潔で、本質的で、標準的なPythonの型宣言を使用することで、**FastAPI**は以下を行います:
    
    * エディターサポート: エラーチェック、自動補完、など
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 10.4K bytes
    - Viewed (0)
  9. cmd/endpoint_test.go

    		{[]string{"https://localhost:9000/d1", "https://localhost:9001/d2", "https://localhost:9002/d3", "https://localhost:9003/d4"}, nil},
    		// // It is valid WRT endpoint list that same path is expected with different port on same server.
    		{[]string{"https://127.0.0.1:9000/d1", "https://127.0.0.1:9001/d1", "https://127.0.0.1:9002/d1", "https://127.0.0.1:9003/d1"}, nil},
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 18.9K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/graph/Graphs.java

      /**
       * 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).
       */
      public static <N> boolean hasCycle(Graph<N> graph) {
        int numEdges = graph.edges().size();
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
Back to top