Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 76 for react (0.17 sec)

  1. common-protos/k8s.io/api/networking/v1beta1/generated.proto

    // or '#'.
    message HTTPIngressRuleValue {
      // paths is a collection of paths that map requests to backends.
      repeated HTTPIngressPath paths = 1;
    }
    
    // Ingress is a collection of rules that allow inbound connections to reach the
    // endpoints defined by a backend. An Ingress can be configured to give services
    // externally-reachable urls, load balance traffic, terminate SSL, offer name
    // based virtual hosting etc.
    message Ingress {
    Plain Text
    - Registered: Wed May 01 22:53:12 GMT 2024
    - Last Modified: Mon Mar 11 18:43:24 GMT 2024
    - 14.9K bytes
    - Viewed (0)
  2. docs/en/docs/advanced/behind-a-proxy.md

    But then, when you open the integrated docs UI (the frontend), it would expect to get the OpenAPI schema at `/openapi.json`, instead of `/api/v1/openapi.json`.
    
    So, the frontend (that runs in the browser) would try to reach `/openapi.json` and wouldn't be able to get the OpenAPI schema.
    
    Because we have a proxy with a path prefix of `/api/v1` for our app, the frontend needs to fetch the OpenAPI schema at `/api/v1/openapi.json`.
    
    ```mermaid
    Plain Text
    - Registered: Sun Apr 28 07:19:10 GMT 2024
    - Last Modified: Thu Apr 18 19:53:19 GMT 2024
    - 11.6K bytes
    - Viewed (2)
  3. android/guava/src/com/google/common/graph/Graphs.java

          return true;
        }
        return hasCycle(network.asGraph());
      }
    
      /**
       * Performs a traversal of the nodes reachable from {@code node}. If we ever reach a node we've
       * already visited (following only outgoing edges and without reusing edges), we know there's a
       * cycle in the graph.
       */
      private static <N> boolean subgraphHasCycle(
          Graph<N> graph,
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Apr 01 16:15:01 GMT 2024
    - 21.2K bytes
    - Viewed (0)
  4. cmd/erasure-multipart.go

    	return evalDisks(disks, errs), reduceWriteQuorumErrs(ctx, errs, objectOpIgnoredErrs, writeQuorum)
    }
    
    // writeAllDisks - writes 'b' to all provided disks.
    // If write cannot reach quorum, the files will be deleted from all disks.
    func writeAllDisks(ctx context.Context, disks []StorageAPI, dstBucket, dstEntry string, b []byte, writeQuorum int) ([]StorageAPI, error) {
    	g := errgroup.WithNErrs(len(disks))
    
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Sun Apr 28 17:53:50 GMT 2024
    - 43K bytes
    - Viewed (0)
  5. guava/src/com/google/common/base/Predicates.java

        @Override
        public boolean apply(CharSequence t) {
          return pattern.matcher(t).find();
        }
    
        @Override
        public int hashCode() {
          // Pattern uses Object.hashCode, so we have to reach
          // inside to build a hashCode consistent with equals.
    
          return Objects.hashCode(pattern.pattern(), pattern.flags());
        }
    
        @Override
        public boolean equals(@CheckForNull Object obj) {
    Java
    - Registered: Fri Apr 05 12:43:09 GMT 2024
    - Last Modified: Fri Feb 09 15:49:48 GMT 2024
    - 23.1K bytes
    - Viewed (0)
  6. okhttp/src/test/java/okhttp3/KotlinSourceModernTest.kt

        val queryParameterValue: String? = httpUrl.queryParameterValue(0)
        val encodedFragment: String? = httpUrl.encodedFragment
        val fragment: String? = httpUrl.fragment
        val redact: String = httpUrl.redact()
        var builder: HttpUrl.Builder = httpUrl.newBuilder()
        var resolveBuilder: HttpUrl.Builder? = httpUrl.newBuilder("")
        val topPrivateDomain: String? = httpUrl.topPrivateDomain()
    Plain Text
    - Registered: Fri May 03 11:42:14 GMT 2024
    - Last Modified: Mon Apr 01 14:21:25 GMT 2024
    - 46.5K bytes
    - Viewed (4)
  7. android/guava/src/com/google/common/hash/Striped64.java

       * than CPUs, supposing that each thread were bound to a CPU,
       * there would exist a perfect hash function mapping threads to
       * slots that eliminates collisions. When we reach capacity, we
       * search for this mapping by randomly varying the hash codes of
       * colliding threads.  Because search is random, and collisions
       * only become known via CAS failures, convergence can be slow,
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Thu Feb 22 17:40:56 GMT 2024
    - 11.5K bytes
    - Viewed (0)
  8. CONTRIBUTING.md

    ### Follow the Code of Conduct
    
    Contributors must follow the Code of Conduct outlined at [https://gradle.org/conduct/](https://gradle.org/conduct/).
    
    ### Additional help
    
    If you run into any trouble, please reach out to us on the issue you are working on.
    There is a `#contributing` channel on the community Slack which you can use
    to ask any questions.
    
    ## Setting up your development environment
    
    Plain Text
    - Registered: Wed May 01 11:36:15 GMT 2024
    - Last Modified: Fri Feb 09 15:30:53 GMT 2024
    - 15.6K bytes
    - Viewed (0)
  9. architecture/ambient/ztunnel.md

    If it is allowed, we will forward to the target destination.
    
    #### Hairpin
    
    In the case that the destination has a waypoint, that waypoint must have been bypassed to reach the inbound passthrough codepath.
    How we handle this is [under discussion](https://docs.google.com/document/d/1uM1c3zzoehiijh1ZpZuJ1-SzuVVupenv8r5yuCaFshs/edit#heading=h.dwbqvwmg6ud3).
    
    ### Inbound
    
    Plain Text
    - Registered: Wed May 01 22:53:12 GMT 2024
    - Last Modified: Thu Apr 25 22:35:16 GMT 2024
    - 16.6K bytes
    - Viewed (0)
  10. guava/src/com/google/common/cache/Striped64.java

       * than CPUs, supposing that each thread were bound to a CPU,
       * there would exist a perfect hash function mapping threads to
       * slots that eliminates collisions. When we reach capacity, we
       * search for this mapping by randomly varying the hash codes of
       * colliding threads.  Because search is random, and collisions
       * only become known via CAS failures, convergence can be slow,
    Java
    - Registered: Fri Apr 05 12:43:09 GMT 2024
    - Last Modified: Thu Feb 22 17:40:56 GMT 2024
    - 11.5K bytes
    - Viewed (0)
Back to top