Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 241 - 250 of 495 for matches (0.05 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. src/archive/tar/reader_test.go

    				"ctime":                         "1386065770.449252304",
    				"SCHILY.xattr.security.selinux": "unconfined_u:object_r:default_t:s0\x00",
    			},
    			Format: FormatPAX,
    		}},
    	}, {
    		// Matches the behavior of GNU, BSD, and STAR tar utilities.
    		file: "testdata/gnu-multi-hdrs.tar",
    		headers: []*Header{{
    			Name:     "GNU2/GNU2/long-path-name",
    			Linkname: "GNU4/GNU4/long-linkpath-name",
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Dec 30 15:28:53 GMT 2025
    - 47.5K bytes
    - Click Count (0)
  2. docs/changelogs/changelog_4x.md

     *  Fix: Don't reuse a connection on redirect if certs match but DNS does not. For better
        locality and performance OkHttp attempts to use the same pooled connection across redirects and
        follow-ups. It independently shares connections when the IP addresses and certificates match,
        even if the host names do not. In 4.4.0 we introduced a regression where we shared a connection
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Wed Apr 17 13:25:31 GMT 2024
    - 25.2K bytes
    - Click Count (0)
  3. cmd/bucket-handlers.go

    // - Check if a bucket has an entry in etcd backend
    // -- If no, make an entry
    // -- If yes, check if the entry matches local IP check if we
    //
    //	need to update the entry then proceed to update
    //
    // -- If yes, check if the IP of entry matches local IP.
    //
    //	This means entry is for this instance.
    //
    // -- If IP of the entry doesn't match, this means entry is
    //
    //	for another instance. Log an error to console.
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 63.9K bytes
    - Click Count (0)
  4. internal/grid/handlers.go

    func NewRemoteErrString(msg string) *RemoteErr {
    	r := RemoteErr(msg)
    	return &r
    }
    
    func (r RemoteErr) Error() string {
    	return string(r)
    }
    
    // Is returns if the string representation matches.
    func (r *RemoteErr) Is(other error) bool {
    	if r == nil || other == nil {
    		return r == other
    	}
    	var o RemoteErr
    	if errors.As(other, &o) {
    		return r == &o
    	}
    	return false
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Feb 18 16:25:55 GMT 2025
    - 27.7K bytes
    - Click Count (0)
  5. guava-tests/test/com/google/common/util/concurrent/GeneratedMonitorTest.java

       * methods that do not take an explicit timeout value, a single test case is generated only if the
       * implicit timeout of that method matches the given timeoutsToUse. For example, enter() is
       * treated like enter(MAX, MILLIS) and tryEnter() is treated like enter(0, MILLIS).
       */
      private static void addTests(
          TestSuite suite,
          Method method,
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 22:45:21 GMT 2026
    - 26.7K bytes
    - Click Count (0)
  6. guava/src/com/google/common/collect/Sets.java

      }
    
      /**
       * Creates an empty {@code Set} that uses identity to determine equality. It compares object
       * references, instead of calling {@code equals}, to determine whether a provided object matches
       * an element in the set. For example, {@code contains} returns {@code false} when passed an
       * object that equals a set member, but isn't the same instance. This behavior is similar to the
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 83K bytes
    - Click Count (0)
  7. cmd/metacache-set.go

    			if current.name == "" {
    				topEntries[i] = entry
    				current = entry
    				agree++
    				continue
    			}
    			// If exact match, we agree.
    			if _, ok := current.matches(&entry, true); ok {
    				topEntries[i] = entry
    				agree++
    				continue
    			}
    			// If only the name matches we didn't agree, but add it for resolution.
    			if entry.name == current.name {
    				topEntries[i] = entry
    				continue
    			}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 30.7K bytes
    - Click Count (0)
  8. api/maven-api-model/src/main/mdo/maven.mdo

                <li>{@code contains(string, substring)}: Checks if the string contains the substring.</li>
                <li>{@code matches(string, regex)}: Checks if the string matches the given regular expression.</li>
                <li>{@code not(condition)}: Negates the given condition.</li>
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Tue Feb 17 09:48:21 GMT 2026
    - 133.5K bytes
    - Click Count (0)
  9. src/bytes/bytes.go

    		t[i] = r
    		i++
    		s = s[l:]
    	}
    	return t
    }
    
    // Replace returns a copy of the slice s with the first n
    // non-overlapping instances of old replaced by new.
    // If old is empty, it matches at the beginning of the slice
    // and after each UTF-8 sequence, yielding up to k+1 replacements
    // for a k-rune slice.
    // If n < 0, there is no limit on the number of replacements.
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Mar 12 17:56:55 GMT 2026
    - 36.3K bytes
    - Click Count (0)
  10. impl/maven-core/src/main/java/org/apache/maven/artifact/resolver/filter/ExclusionArtifactFilter.java

            Predicate<Artifact> predGroupId = a -> groupId.matches(createPathProxy(a.getGroupId()));
            Predicate<Artifact> predArtifactId = a -> artifactId.matches(createPathProxy(a.getArtifactId()));
            return predGroupId.and(predArtifactId);
        }
    
        /**
         * In order to reuse the glob matcher from the filesystem, we need
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 3K bytes
    - Click Count (0)
Back to Top