Search Options

Results per page
Sort
Preferred Languages
Advance

Results 151 - 160 of 1,100 for reachable (0.17 sec)

  1. pilot/pkg/xds/endpoints/ep_filters_test.go

    			{Network: "network2", Address: "20.0.0.3"},
    		},
    
    		// network3 has no endpoints.
    
    		// network4 has a single endpoint, but not gateway so it will always
    		// be considered directly reachable.
    		{Cluster: "cluster4"}: {
    			{Network: "network4", Address: "40.0.0.1"},
    		},
    	}}
    	// apply common properties
    	for sk, shard := range shards.Shards {
    		for i, ep := range shard {
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Wed May 29 01:17:58 UTC 2024
    - 26.8K bytes
    - Viewed (0)
  2. tensorflow/compiler/mlir/tensorflow/transforms/executor_tpuv1_island_coarsening.cc

          if (!callee) continue;
          if (funcs_for_cluster->second.count(callee)) return true;
        }
        return false;
      };
    
      // Populates skip set with functions reachable from TPUPartionedCall ops.
      const auto functions_to_skip =
          FindTPUPartitionedCallReachableFunctions(getOperation());
      for (func::FuncOp func_op : getOperation().getOps<func::FuncOp>()) {
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Fri May 17 17:58:54 UTC 2024
    - 27.6K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/graph/Network.java

       *
       * <p>In an undirected network, this is equivalent to {@link #adjacentNodes(Object)}.
       *
       * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing
       * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}.
       *
       * <p>If {@code node} is removed from the network after this method is called, the {@code Set}
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Jan 22 17:29:38 UTC 2024
    - 21.1K bytes
    - Viewed (0)
  4. src/runtime/extern.go

    	never recycled.
    
    	gccheckmark: setting gccheckmark=1 enables verification of the
    	garbage collector's concurrent mark phase by performing a
    	second mark pass while the world is stopped.  If the second
    	pass finds a reachable object that was not found by concurrent
    	mark, the garbage collector will panic.
    
    	gcpacertrace: setting gcpacertrace=1 causes the garbage collector to
    	print information about the internal state of the concurrent pacer.
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 17:52:17 UTC 2024
    - 18.9K bytes
    - Viewed (0)
  5. cmd/kubeadm/app/phases/kubeconfig/kubeconfig.go

    	// to the built-in super-user group, this will pass. In all other cases an error will be returned.
    	// The poll here is required to ensure the API server is reachable during "kubeadm init" workflows.
    	err = wait.PollUntilContextTimeout(
    		ctx,
    		retryInterval,
    		retryTimeout,
    		true, func(ctx context.Context) (bool, error) {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Jun 07 17:04:18 UTC 2024
    - 27K bytes
    - Viewed (0)
  6. guava/src/com/google/common/graph/Network.java

       *
       * <p>In an undirected network, this is equivalent to {@link #adjacentNodes(Object)}.
       *
       * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing
       * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}.
       *
       * <p>If {@code node} is removed from the network after this method is called, the {@code Set}
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Jan 22 17:29:38 UTC 2024
    - 22.3K bytes
    - Viewed (0)
  7. src/syscall/syscall_linux_test.go

    		n, err := syscall.Read(int(rd.Fd()), data)
    		if !(n == 0 && err == nil) {
    			t.Errorf("expected read to return 0, got %d, %s", n, err)
    		}
    
    		// Clean up rd and also ensure rd stays reachable so
    		// it doesn't get closed by GC.
    		rd.Close()
    		wg.Done()
    	}()
    	<-ready
    
    	// Loop here to give the goroutine more time to block in read.
    	// Generally this will trigger on the first iteration anyway.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 23K bytes
    - Viewed (0)
  8. src/cmd/link/internal/loadpe/ldpe.go

    			}
    			if issehsect {
    				// .pdata and .xdata sections can contain records
    				// associated to functions that won't be used in
    				// the final binary, in which case the relocation
    				// target symbol won't be reachable.
    				rType |= objabi.R_WEAK
    			}
    
    			rel, _ := sb.AddRel(rType)
    			rel.SetOff(rOff)
    			rel.SetSiz(rSize)
    			rel.SetSym(rSym)
    			rel.SetAdd(rAdd)
    
    		}
    
    		sb.SortRelocs()
    	}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Dec 18 20:26:46 UTC 2023
    - 26.5K bytes
    - Viewed (0)
  9. src/internal/abi/type.go

    }
    
    // TypeOf returns the abi.Type of some value.
    func TypeOf(a any) *Type {
    	eface := *(*EmptyInterface)(unsafe.Pointer(&a))
    	// Types are either static (for compiler-created types) or
    	// heap-allocated but always reachable (for reflection-created
    	// types, held in the central map). So there is no need to
    	// escape types. noescape here help avoid unnecessary escape
    	// of v.
    	return (*Type)(NoEscape(unsafe.Pointer(eface.Type)))
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Apr 17 21:09:59 UTC 2024
    - 21.8K bytes
    - Viewed (0)
  10. src/runtime/runtime2.go

    // a word that is completely ignored by the GC than to have one for which
    // only a few updates are ignored.
    //
    // Gs and Ps are always reachable via true pointers in the
    // allgs and allp lists or (during allocation before they reach those lists)
    // from stack variables.
    //
    // Ms are always reachable via true pointers either from allm or
    // freem. Unlike Gs and Ps we do free Ms, so it's important that
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 17:57:37 UTC 2024
    - 47.9K bytes
    - Viewed (0)
Back to top