Search Options

Results per page
Sort
Preferred Languages
Advance

Results 51 - 60 of 202 for Combiner (0.11 sec)

  1. docs/es/docs/how-to/graphql.md

    # GraphQL
    
    Como **FastAPI** está basado en el estándar **ASGI**, es muy fácil integrar cualquier library **GraphQL** que sea compatible con ASGI.
    
    Puedes combinar *operaciones de path* regulares de la library de FastAPI con GraphQL en la misma aplicación.
    
    /// tip | Consejo
    
    **GraphQL** resuelve algunos casos de uso específicos.
    
    Tiene **ventajas** y **desventajas** cuando lo comparas con **APIs web** comunes.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  2. istioctl/pkg/admin/istiodconfig.go

    			if istiodReset && outputLogLevel != "" {
    				logCmd.Println(logCmd.UsageString())
    				return fmt.Errorf("--level cannot be combined with --reset")
    			}
    			if istiodReset && stackTraceLevel != "" {
    				logCmd.Println(logCmd.UsageString())
    				return fmt.Errorf("--stack-trace-level cannot be combined with --reset")
    			}
    			return nil
    		},
    		RunE: func(logCmd *cobra.Command, args []string) error {
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Sat Apr 13 05:23:38 UTC 2024
    - 13.5K bytes
    - Viewed (0)
  3. src/main/java/jcifs/internal/dfs/DfsReferralDataImpl.java

                }
            }
    
            return dr;
        }
    
    
        /**
         * {@inheritDoc}
         *
         * @see jcifs.internal.dfs.DfsReferralDataInternal#combine(jcifs.DfsReferralData)
         */
        @Override
        public DfsReferralDataInternal combine ( DfsReferralData n ) {
            DfsReferralDataImpl dr = new DfsReferralDataImpl();
            dr.server = n.getServer();
            dr.share = n.getShare();
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sat Nov 13 15:13:49 UTC 2021
    - 11K bytes
    - Viewed (0)
  4. istioctl/pkg/xds/google.go

    		return err
    	}
    	for k, v := range ret {
    		if !strings.EqualFold(k, "authorization") {
    			if _, ok := dst[k]; ok {
    				return fmt.Errorf("underlying %s credentials contain a %s header which is already present in the combined credentials", kind, k)
    			}
    			dst[k] = v
    		} else {
    			dst[dstHdr] = v
    		}
    	}
    	return nil
    }
    
    type hubMembership struct {
    	WorkloadIdentityPool string
    }
    
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Nov 14 20:23:34 UTC 2022
    - 3.4K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/hash/BloomFilter.java

            && this.funnel.equals(that.funnel);
      }
    
      /**
       * Combines this Bloom filter with another Bloom filter by performing a bitwise OR of the
       * underlying data. The mutations happen to <b>this</b> instance. Callers must ensure the Bloom
       * filters are appropriately sized to avoid saturating them.
       *
       * @param that The Bloom filter to combine this Bloom filter with. It is not mutated.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 23 16:45:30 UTC 2024
    - 26.6K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/hash/HashingOutputStream.java

       */
      // TODO(user): Evaluate whether it makes sense to always piggyback the computation of a
      // HashCode on an existing OutputStream, compared to creating a separate OutputStream that could
      // be (optionally) be combined with another if needed (with something like
      // MultiplexingOutputStream).
      public HashingOutputStream(HashFunction hashFunction, OutputStream out) {
        super(checkNotNull(out));
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 11 22:00:03 UTC 2024
    - 2.6K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/Iterables.java

       */
      @SafeVarargs
      public static <T extends @Nullable Object> Iterable<T> cycle(T... elements) {
        return cycle(Lists.newArrayList(elements));
      }
    
      /**
       * Combines two iterables into a single iterable. The returned iterable has an iterator that
       * traverses the elements in {@code a}, followed by the elements in {@code b}. The source
       * iterators are not polled until necessary.
       *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Apr 24 19:38:27 UTC 2024
    - 42.8K bytes
    - Viewed (0)
  8. internal/bucket/replication/and.go

    // along with this program.  If not, see <http://www.gnu.org/licenses/>.
    
    package replication
    
    import (
    	"encoding/xml"
    )
    
    // And - a tag to combine a prefix and multiple tags for replication configuration rule.
    type And struct {
    	XMLName xml.Name `xml:"And" json:"And"`
    	Prefix  string   `xml:"Prefix,omitempty" json:"Prefix,omitempty"`
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Jun 01 21:59:40 UTC 2021
    - 1.8K bytes
    - Viewed (0)
  9. samples/tlssurvey/src/main/kotlin/okhttp3/survey/RunSurvey.kt

      val survey = CipherSuiteSurvey(clients = clients, ianaSuites = ianaSuitesNew, orderBy = orderBy)
    
      survey.printGoogleSheet()
    }
    
    fun rest(clients: List<Client>): List<SuiteId> {
      // combine all ciphers to get these near the top
      return clients.flatMap { it.enabled }
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Wed Apr 10 19:46:48 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  10. docs/en/docs/how-to/graphql.md

    # GraphQL
    
    As **FastAPI** is based on the **ASGI** standard, it's very easy to integrate any **GraphQL** library also compatible with ASGI.
    
    You can combine normal FastAPI *path operations* with GraphQL on the same application.
    
    /// tip
    
    **GraphQL** solves some very specific use cases.
    
    It has **advantages** and **disadvantages** when compared to common **web APIs**.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 27 22:39:38 UTC 2024
    - 3.3K bytes
    - Viewed (0)
Back to top