Search Options

Results per page
Sort
Preferred Languages
Advance

Results 211 - 220 of 529 for fetches (0.04 sec)

  1. internal/crypto/header_test.go

    )
    
    func TestIsRequested(t *testing.T) {
    	for i, test := range kmsIsRequestedTests {
    		_, got := IsRequested(test.Header)
    		if Requested(test.Header) != got {
    			// Test if result matches.
    			t.Errorf("Requested mismatch, want %v, got %v", Requested(test.Header), got)
    		}
    		got = got && S3KMS.IsRequested(test.Header)
    		if got != test.Expected {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Wed Jul 13 14:52:15 UTC 2022
    - 21.4K bytes
    - Viewed (0)
  2. src/test/java/jcifs/smb1/smb1/SmbExceptionTest.java

        }
    
        /**
         * Verify that {@link #toString()} with no root cause equals the default
         * {@code IOException#toString()}.
         */
        @Test
        @DisplayName("toString without root cause matches IOException#toString")
        void testToStringWithoutRootCause() {
            SmbException ex = new SmbException(0, false);
            assertEquals("jcifs.smb1.smb1.SmbException: NT_STATUS_SUCCESS", ex.toString());
        }
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 4.5K bytes
    - Viewed (0)
  3. impl/maven-core/src/test/java/org/apache/maven/session/scope/SessionScopeProxyTest.java

            ComponentLookupException e =
                    assertThrows(ComponentLookupException.class, () -> container.lookup(MySingletonBean2.class));
            assertTrue(e.getMessage().matches("[\\s\\S]*: Can not set .* field .* to [\\s\\S]*"));
    
            MySingletonBean bean = container.lookup(MySingletonBean.class);
            assertNotNull(bean);
            assertNotNull(bean.anotherBean);
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Fri Jun 06 14:28:57 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  4. okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/BasicDerAdapter.kt

      private val typeHint: Boolean = false,
    ) : DerAdapter<T> {
      init {
        require(tagClass >= 0)
        require(tag >= 0)
      }
    
      override fun matches(header: DerHeader): Boolean = header.tagClass == tagClass && header.tag == tag
    
      override fun fromDer(reader: DerReader): T {
        val peekedHeader = reader.peekHeader()
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 4.4K bytes
    - Viewed (0)
  5. fess-crawler/src/main/java/org/codelibs/fess/crawler/util/XPathAPI.java

        /**
         * Use an XPath string to select a single node.
         *
         * @param contextNode The node to start searching from.
         * @param expression A valid XPath string.
         * @return The first node found that matches the XPath, or null.
         *
         * @throws XPathExpressionException if an XPath expression error occurs.
         */
    Registered: Sat Dec 20 11:21:39 UTC 2025
    - Last Modified: Sun Jul 06 02:13:03 UTC 2025
    - 4.6K bytes
    - Viewed (0)
  6. MIGRATION.md

    - Validate JSON syntax with `jq`:
      ```bash
      cat documents.ndjson | jq empty
      ```
    
    #### Issue: GSA XML import creates no configurations
    
    **Solution**:
    - Verify XML structure matches GSA export format
    - Check Fess logs: `logs/fess.log`
    - Look for `GsaConfigException` errors
    - Ensure collections have valid URL patterns
    
    #### Issue: Imported documents not appearing in search
    
    **Solution**:
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Thu Nov 06 12:40:11 UTC 2025
    - 23.2K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/Multisets.java

       * of each element is the <i>maximum</i> of its counts in the two backing multisets. The iteration
       * order of the returned multiset matches that of the element set of {@code multiset1} followed by
       * the members of the element set of {@code multiset2} that are not contained in {@code
       * multiset1}, with repeated occurrences of the same element appearing consecutively.
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Sep 22 18:35:44 UTC 2025
    - 41.3K bytes
    - Viewed (0)
  8. guava/src/com/google/common/collect/Multisets.java

       * of each element is the <i>maximum</i> of its counts in the two backing multisets. The iteration
       * order of the returned multiset matches that of the element set of {@code multiset1} followed by
       * the members of the element set of {@code multiset2} that are not contained in {@code
       * multiset1}, with repeated occurrences of the same element appearing consecutively.
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Sep 22 18:35:44 UTC 2025
    - 41.2K bytes
    - Viewed (0)
  9. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RealConnection.kt

        // If the non-host fields of the address don't overlap, we're done.
        if (!this.route.address.equalsNonHost(address)) return false
    
        // If the host exactly matches, we're done: this connection can carry the address.
        if (address.url.host ==
          this
            .route()
            .address.url.host
        ) {
          return true // This connection is a perfect match.
        }
    
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Tue Oct 07 21:55:03 UTC 2025
    - 14.6K bytes
    - Viewed (0)
  10. build-logic/documentation/src/main/groovy/gradlebuild/docs/FindBrokenInternalLinks.java

                MatchResult xrefMatcher = matcher.toMatchResult();
                String link = xrefMatcher.group(1);
                Matcher linkMatcher = samplesLinkWithHashPattern.matcher(link);
                if (linkMatcher.matches()) {
                    MatchResult result = linkMatcher.toMatchResult();
                    String fileName = getFileName(result.group(1), sourceFile);
    Registered: Wed Dec 31 11:36:14 UTC 2025
    - Last Modified: Tue May 27 09:07:14 UTC 2025
    - 18.1K bytes
    - Viewed (0)
Back to top