Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 97 for satisfy (0.05 sec)

  1. docs/features/calls.md

    If the response issues an authorization challenge, OkHttp will ask the [`Authenticator`](https://square.github.io/okhttp/4.x/okhttp/okhttp3/-authenticator/) (if one is configured) to satisfy the challenge. If the authenticator supplies a credential, the request is retried with that credential included.
    
    ## Retrying Requests
    
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sun Feb 06 02:19:09 UTC 2022
    - 3.9K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/collect/Multisets.java

       * by {@code unfiltered} are supported by the returned multiset. When given an element that
       * doesn't satisfy the predicate, the multiset's {@code add()} and {@code addAll()} methods throw
       * an {@link IllegalArgumentException}. When methods such as {@code removeAll()} and {@code
       * clear()} are called on the filtered multiset, only elements that satisfy the filter will be
       * removed from the underlying multiset.
       *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 41.7K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/Multisets.java

       * by {@code unfiltered} are supported by the returned multiset. When given an element that
       * doesn't satisfy the predicate, the multiset's {@code add()} and {@code addAll()} methods throw
       * an {@link IllegalArgumentException}. When methods such as {@code removeAll()} and {@code
       * clear()} are called on the filtered multiset, only elements that satisfy the filter will be
       * removed from the underlying multiset.
       *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 41.5K bytes
    - Viewed (0)
  4. internal/bucket/replication/filter.go

    		if !f.Tag.IsEmpty() {
    			return errInvalidFilter
    		}
    	}
    	if !f.Tag.IsEmpty() {
    		if err := f.Tag.Validate(); err != nil {
    			return err
    		}
    	}
    	return nil
    }
    
    // TestTags tests if the object tags satisfy the Filter tags requirement,
    // it returns true if there is no tags in the underlying Filter.
    func (f *Filter) TestTags(userTags string) bool {
    	if f.cachedTags == nil {
    		cached := make(map[string]string)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Sep 28 18:25:46 UTC 2022
    - 3.5K bytes
    - Viewed (0)
  5. okhttp/src/test/java/okhttp3/osgi/OsgiTest.kt

          REQUIRED_BUNDLES.joinToString(separator = ",") {
            "osgi.identity;filter:='(osgi.identity=$it)'"
          }
    
        val bndEditModel =
          BndEditModel(workspace).apply {
            // Temporary project to satisfy bnd API.
            project = Project(workspace, workspaceDir.toFile())
          }
    
        return Bndrun(bndEditModel).apply {
          setRunfw(RESOLVE_OSGI_FRAMEWORK)
          runee = RESOLVE_JAVA_VERSION
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 4.9K bytes
    - Viewed (0)
  6. okhttp/src/main/kotlin/okhttp3/ConnectionPool.kt

       */
      class AddressPolicy(
        /**
         * How many concurrent calls should be possible to make at any time.
         * The pool will routinely try to pre-emptively open connections to satisfy this minimum.
         * Connections will still be closed if they idle beyond the keep-alive but will be replaced.
         */
        @JvmField val minimumConcurrentCalls: Int = 0,
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Wed Apr 03 20:39:41 UTC 2024
    - 5.6K bytes
    - Viewed (0)
  7. docs/hotfixes.md

    - A working knowledge of MinIO codebase and its various components.
    - A working knowledge of AWS S3 API behaviors and corner cases.
    
    ## Pre-requisite for backporting any fixes
    
    Fixes that are allowed a backport must satisfy any of the following criteria's:
    
    - A fix must not be a feature, for example.
    
    ```
    commit faf013ec84051b92ae0f420a658b8d35bb7bb000
    Author: Klaus Post <******@****.***>
    Date:   Thu Nov 18 12:15:22 2021 -0800
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Feb 14 21:36:02 UTC 2024
    - 5K bytes
    - Viewed (0)
  8. docs/contribute/code_of_conduct.md

    the letter.
    
    Diversity Statement
    -------------------
    
    We encourage everyone to participate and are committed to building a community for all. Although we
    may not be able to satisfy everyone, we all agree that everyone is equal.
    
    Whenever a participant has made a mistake, we expect them to take responsibility for it. If someone
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sun Feb 06 02:19:09 UTC 2022
    - 5.1K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/collect/RegularImmutableTable.java

            existingValue == null,
            "Duplicate key: (row=%s, column=%s), values: [%s, %s].",
            rowKey,
            columnKey,
            newValue,
            existingValue);
      }
    
      // redeclare to satisfy our test for b/310253115
      @Override
      @J2ktIncompatible // serialization
      @GwtIncompatible // serialization
      abstract Object writeReplace();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 7.1K bytes
    - Viewed (0)
  10. src/bytes/bytes.go

    // all leading UTF-8-encoded code points c that satisfy f(c).
    func TrimLeftFunc(s []byte, f func(r rune) bool) []byte {
    	i := indexFunc(s, f, false)
    	if i == -1 {
    		return nil
    	}
    	return s[i:]
    }
    
    // TrimRightFunc returns a subslice of s by slicing off all trailing
    // UTF-8-encoded code points c that satisfy f(c).
    func TrimRightFunc(s []byte, f func(r rune) bool) []byte {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Sep 03 20:55:15 UTC 2024
    - 35.6K bytes
    - Viewed (0)
Back to top