- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 820 for chains (0.12 sec)
-
tensorflow/compiler/mlir/tensorflow/transforms/fused_kernel_matcher.cc
// function. // i.e., this class also supports the following fusion: // <Contraction> + BiasAdd -> <FusedContraction> // // TODO(b/158266331): Support fusing activation chains of arbitrary length. template <typename SrcOpT, typename FusedOpT> class FuseContractionWithBiasAdd : public OpRewritePattern<SrcOpT> { public: using OpRewritePattern<SrcOpT>::OpRewritePattern;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 14.9K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/dsl/dsl.xml
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 15:00:02 UTC 2024 - 34.7K bytes - Viewed (2) -
pilot/pkg/networking/core/tls.go
}) // If at this point there is a filter chain generated with the same CIDR match as the // one that may be generated for the service as the default route, do not generate it. // Otherwise, Envoy will complain about having filter chains with identical matches // and will reject the config. sort.Strings(virtualServiceDestinationSubnets)
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Mar 28 17:09:02 UTC 2024 - 14.7K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/api/internal/provider/ProviderInternal.java
* The provider returned by this method may or not be the same instance as this provider. Generally, it is better to simplify any provider chains to replace calculations with fixed values and to remove * intermediate steps. */ ExecutionTimeValue<? extends T> calculateExecutionTimeValue(); @Override
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jan 26 14:58:23 UTC 2024 - 11.2K bytes - Viewed (0) -
src/runtime/alg.go
if eq == nil { panic(errorString("comparing uncomparable type " + toRType(t).string())) } if isDirectIface(t) { // Direct interface types are ptr, chan, map, func, and single-element structs/arrays thereof. // Maps and funcs are not comparable, so they can't reach here. // Ptrs, chans, and single-element items can be compared directly using ==. return x == y } return eq(x, y) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// this has 2 benefits // 1. for long chains of futures strung together with setFuture we consume less stack // 2. we avoid allocating Cancellation objects at every level of the cancellation // chain // We can only do this for TrustedFuture, because TrustedFuture.cancel is final and
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 63.1K bytes - Viewed (1) -
guava/src/com/google/common/util/concurrent/AbstractFuture.java
// this has 2 benefits // 1. for long chains of futures strung together with setFuture we consume less stack // 2. we avoid allocating Cancellation objects at every level of the cancellation // chain // We can only do this for TrustedFuture, because TrustedFuture.cancel is final and
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 62.8K bytes - Viewed (1) -
src/crypto/tls/common.go
x509Cert := c.Leaf // Parse the certificate if this isn't the leaf node, or if // chain.Leaf was nil. if j != 0 || x509Cert == nil { var err error if x509Cert, err = x509.ParseCertificate(cert); err != nil { return fmt.Errorf("failed to parse certificate #%d in the chain: %w", j, err) } } for _, ca := range cri.AcceptableCAs {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:10:12 UTC 2024 - 59.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/sccp.go
uses []*Value // re-visiting set visited map[Edge]bool // visited edges latticeCells map[*Value]lattice // constant lattices defUse map[*Value][]*Value // def-use chains for some values defBlock map[*Value][]*Block // use blocks of def visitedBlock []bool // visited block } // sccp stands for sparse conditional constant propagation, it propagates constants
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 16:54:50 UTC 2024 - 17.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/schedule.go
continue } for _, a := range v.Args { if a.Block == b { edges = append(edges, edge{a, v}) } } } // Find store chain for block. // Store chains for different blocks overwrite each other, so // the calculated store chain is good only for this block. for _, v := range b.Values { if v.Op != OpPhi && v.Op != OpInitMem && v.Type.IsMemory() { nextMem[v.MemoryArg().ID] = v }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 15:53:17 UTC 2024 - 16.4K bytes - Viewed (0)