- Sort Score
- Result 10 results
- Languages All
Results 1 - 8 of 8 for pattern1 (0.18 sec)
-
prow/config/calico.yaml
debugMemoryProfilePath: type: string debugSimulateCalcGraphHangAfter: pattern: ^([0-9]+(\\.[0-9]+)?(ms|s|m|h))*$ type: string debugSimulateDataplaneHangAfter: pattern: ^([0-9]+(\\.[0-9]+)?(ms|s|m|h))*$ type: string defaultEndpointToHostAction:
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 21 18:32:01 UTC 2024 - 246.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/transforms/legalize_tf.cc
// to CHLO and it is missing legalization to MHLO. Once that is done, this // pattern's benefit can be changed back to one as well as the fallback // lowering pattern for the op can be removed. // // Set benefit of this pattern to zero to prefer the fallback pattern when // available and applicable. That pattern avoids broadcast on operands and is // therefore faster. //
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 20:00:43 UTC 2024 - 291.8K bytes - Viewed (0) -
samples/bookinfo/src/productpage/static/tailwind/tailwind.css
sh(...o.negative.map(u=>nh(u,!0)));let s=[...n,...a];return s=MC(i,s),s=s.flatMap(BC),s=s.map(RC),s}function nh(i,e){let t={original:i,base:i,ignore:e,pattern:i,glob:null};return Qd(i)&&Object.assign(t,th(i)),t}function RC(i){let e=yo(i.base);return e=En.escapePath(e),i.pattern=i.glob?`${e}/${i.glob}`:e,i.pattern=i.ignore?`!${i.pattern}`:i.pattern,i}function MC(i,e){let t=[];return i.userConfigPath&&i.tailwindConfig.content.relative&&(t=[Z.dirname(i.userConfigPath)]),e.map(r=>(r.base=Z.resolve(....
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 28 14:48:01 UTC 2024 - 357.1K bytes - Viewed (1) -
pkg/proxy/iptables/proxier_test.go
return -1 } return int(numRulesFloat) } // findAllMatches takes an array of lines and a pattern with one parenthesized group, and // returns a sorted array of all of the unique matches of the parenthesized group. func findAllMatches(lines []string, pattern string) []string { regex := regexp.MustCompile(pattern) allMatches := sets.New[string]() for _, line := range lines { match := regex.FindStringSubmatch(line)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 21 14:39:54 UTC 2024 - 249.9K bytes - Viewed (1) -
tensorflow/compiler/mlir/lite/tests/optimize.mlir
// CHECK: return %2 : tensor<5x4x1x8192xf32> } // CHECK-LABEL: @FuseReshapeAroundBMMNagativeTest2 // Checks that the pattern matcher FuseReshapesAroundBatchMatMulLHS does not get // applied for this case that does not pass the constraint around input rank. func.func @FuseReshapeAroundBMMNagativeTest2(%arg0: tensor<2x1536xf32>) -> tensor<2x768xf32> {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 16 20:31:41 UTC 2024 - 284.1K bytes - Viewed (0) -
api/openapi-spec/v3/apis__batch__v1_openapi.json
}, "onPodConditions": { "description": "Represents the requirement on the pod conditions. The requirement is represented as a list of pod condition patterns. The requirement is satisfied if at least one pattern matches an actual pod condition. At most 20 elements are allowed.", "items": { "allOf": [ {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 05 18:37:07 UTC 2024 - 485.4K bytes - Viewed (0) -
docs/en/docs/release-notes.md
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Fri Jun 14 15:07:37 UTC 2024 - 395.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/ssa.go
aux := c.Aux.(*ssa.AuxCall) pa := aux.ParamAssignmentForResult(which) // TODO(register args) determine if in-memory TypeOK is better loaded early from SelectNAddr or later when SelectN is expanded. // SelectN is better for pattern-matching and possible call-aware analysis we might want to do in the future. if len(pa.Registers) == 0 && !ssa.CanSSA(t) { addr := s.newValue1I(ssa.OpSelectNAddr, types.NewPtr(t), which, c) return s.rawLoad(t, addr)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 284.9K bytes - Viewed (0)