Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 491 - 500 of 824 for BOTH (0.02 seconds)

  1. src/main/java/org/codelibs/fess/crawler/transformer/FessTransformer.java

                } else {
                    oldValues = new Object[] { oldValue };
                }
                if (value.getClass().isArray()) {
                    // Handle both Object[] and primitive arrays safely
                    final int newLength = Array.getLength(value);
                    final Object[] values = Arrays.copyOf(oldValues, oldValues.length + newLength);
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Dec 11 09:47:03 GMT 2025
    - 14.1K bytes
    - Click Count (0)
  2. docs/en/docs/tutorial/security/simple-oauth2.md

    We want to get the `current_user` *only* if this user is active.
    
    So, we create an additional dependency `get_current_active_user` that in turn uses `get_current_user` as a dependency.
    
    Both of these dependencies will just return an HTTP error if the user doesn't exist, or if is inactive.
    
    So, in our endpoint, we will only get a user if the user exists, was correctly authenticated, and is active:
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 9.4K bytes
    - Click Count (0)
  3. internal/dsync/dsync_test.go

    		t.Errorf("expected at least %v time have passed, however %v passed", expect, elapsed)
    	}
    	t.Logf("expected at least %v time have passed, %v passed", expect, elapsed)
    }
    
    // Test two locks for different resources, both succeed
    func TestTwoSimultaneousLocksForDifferentResources(t *testing.T) {
    	dm1 := NewDRWMutex(ds, "aap")
    	dm2 := NewDRWMutex(ds, "noot")
    
    	dm1.Lock(id, source)
    	dm2.Lock(id, source)
    	dm1.Unlock(t.Context())
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 10.8K bytes
    - Click Count (0)
  4. android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java

        assertThat(graph.hasEdgeConnecting(EndpointPair.unordered(N2, N1))).isFalse();
      }
    
      @Test
      public void hasEdgeConnecting_missingNode() {
        // both nodes missing
        assertThat(graph.hasEdgeConnecting(EndpointPair.ordered(NODE_NOT_IN_GRAPH, NODE_NOT_IN_GRAPH)))
            .isFalse();
    
        // one node present, the other missing
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Oct 06 20:14:55 GMT 2025
    - 14.4K bytes
    - Click Count (0)
  5. docs/distributed/README.md

    ### Consistency Guarantees
    
    MinIO follows strict **read-after-write** and **list-after-write** consistency model for all i/o operations both in distributed and standalone modes. This consistency model is only guaranteed if you use disk filesystems such as xfs, zfs or btrfs etc.. for distributed setup.
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 8.9K bytes
    - Click Count (0)
  6. src/main/java/org/codelibs/fess/suggest/converter/KatakanaToAlphabetConverter.java

     * Katakana string into a list of possible Alphabet readings. It uses a predefined mapping of Katakana
     * characters to their Alphabet equivalents, handling both single and double Katakana character combinations.
     * </p>
     *
     * <p>
     * The conversion process involves iterating through the input string, identifying Katakana characters,
    Created: Fri Apr 17 09:08:13 GMT 2026
    - Last Modified: Mon Nov 17 14:28:21 GMT 2025
    - 11.4K bytes
    - Click Count (0)
  7. fess-crawler/src/main/java/org/codelibs/fess/crawler/client/http/form/Hc4FormScheme.java

     * form-based authentication for HTTP clients. It handles the process of
     * obtaining a token and logging in using the provided credentials.
     *
     * <p>This class supports both GET and POST methods for token and login
     * requests. It also allows for the replacement of placeholders in URLs and
     * parameters with actual credentials.
     *
     * <p>Usage example:
     * <pre>
     * {@code
    Created: Sun Apr 12 03:50:13 GMT 2026
    - Last Modified: Thu Jan 08 14:22:26 GMT 2026
    - 14.3K bytes
    - Click Count (0)
  8. scripts/docs.py

                if package_root in used_package_dirs:
                    continue
            # Check if the _an counterpart (or non-_an counterpart) is referenced.
            # If either variant is included, keep both.
            # Handle both file-level _an (tutorial001_an.py) and directory-level _an
            # (app_an/main.py)
            counterpart_found = False
            full_path_str = str(py_file)
            if "_an" in py_file.stem:
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 17:46:10 GMT 2026
    - 25.4K bytes
    - Click Count (0)
  9. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/-UtilCommon.kt

          }
        }
      }
      return result.toTypedArray()
    }
    
    /**
     * Returns true if there is an element in this array that is also in [other]. This method terminates
     * if any intersection is found. The sizes of both arguments are assumed to be so small, and the
     * likelihood of an intersection so great, that it is not worth the CPU cost of sorting or the
     * memory cost of hashing.
     */
    internal fun Array<String>.hasIntersection(
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Mon May 05 16:01:00 GMT 2025
    - 10.1K bytes
    - Click Count (0)
  10. cmd/net.go

    		// If empty host means it is localhost
    		addr2Local = true
    	} else if addr2Local, err = isLocalHost(host2, port2, port2); err != nil {
    		// Host not empty, check if it is local
    		return false, err
    	}
    
    	// If both of addresses point to the same machine, check if
    	// have the same port
    	if addr1Local && addr2Local {
    		if port1 == port2 {
    			return true, nil
    		}
    	}
    	return false, nil
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 9.6K bytes
    - Click Count (1)
Back to Top