Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 152 for Boundaries (0.15 sec)

  1. tensorflow/compiler/mlir/lite/tests/flatbuffer2mlir/bucketize.mlir

    func.func @main(%arg0: tensor<3x2xf32>) -> tensor<3x2xi32> {
      // CHECK-LABEL: @main
      // CHECK: "tfl.bucketize"(%arg0) <{boundaries = [0.000000e+00 : f32, 1.000000e+01 : f32, 1.000000e+02 : f32]}> : (tensor<3x2xf32>) -> tensor<3x2xi32>
      %0 = "tfl.bucketize"(%arg0) {boundaries = [0.0 : f32, 10.0 : f32, 100.0 : f32]} : (tensor<3x2xf32>) -> tensor<3x2xi32>
      func.return %0 : tensor<3x2xi32>
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu May 02 09:41:17 UTC 2024
    - 571 bytes
    - Viewed (0)
  2. src/cmd/vendor/golang.org/x/tools/cover/profile.go

    	for si, bi := 0, 0; si < len(src) && bi < len(p.Blocks); {
    		b := p.Blocks[bi]
    		if b.StartLine == line && b.StartCol == col {
    			boundaries = append(boundaries, boundary(si, true, b.Count))
    		}
    		if b.EndLine == line && b.EndCol == col || line > b.EndLine {
    			boundaries = append(boundaries, boundary(si, false, 0))
    			bi++
    			continue // Don't advance through src; maybe the next block starts here.
    		}
    		if src[si] == '\n' {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Oct 11 17:02:03 UTC 2021
    - 7.5K bytes
    - Viewed (0)
  3. src/runtime/metrics/histogram.go

    	Counts []uint64
    
    	// Buckets contains the boundaries of the histogram buckets, in increasing order.
    	//
    	// Buckets[0] is the inclusive lower bound of the minimum bucket while
    	// Buckets[len(Buckets)-1] is the exclusive upper bound of the maximum bucket.
    	// Hence, there are len(Buckets)-1 counts. Furthermore, len(Buckets) != 1, always,
    	// since at least two boundaries are required to describe one bucket (and 0
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jan 08 03:43:44 UTC 2021
    - 1.3K bytes
    - Viewed (0)
  4. src/cmd/cover/html.go

    // source code, and tokens, and writes it to the given Writer.
    func htmlGen(w io.Writer, src []byte, boundaries []cover.Boundary) error {
    	dst := bufio.NewWriter(w)
    	for i := range src {
    		for len(boundaries) > 0 && boundaries[0].Offset == i {
    			b := boundaries[0]
    			if b.Start {
    				n := 0
    				if b.Count > 0 {
    					n = int(math.Floor(b.Norm*9)) + 1
    				}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Sep 08 14:33:36 UTC 2022
    - 6.8K bytes
    - Viewed (0)
  5. tensorflow/compiler/mlir/lite/tests/mlir2flatbuffer/bucketize.mlir

      // CHECK-NEXT:         inputs: [ 1 ],
      // CHECK-NEXT:         outputs: [ 2 ],
      // CHECK-NEXT:         builtin_options_type: BucketizeOptions,
      // CHECK-NEXT:         builtin_options: {
      // CHECK-NEXT:           boundaries: [ 0.0, 10.0, 100.0 ]
      // CHECK-NEXT:         }
      // CHECK-NEXT:       } ],
      // CHECK-NEXT:       name: "main"
      // CHECK-NEXT:     } ],
      // CHECK-NEXT:     description: "MLIR Converted.",
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Jul 14 16:41:28 UTC 2022
    - 2.8K bytes
    - Viewed (0)
  6. platforms/documentation/docs/src/samples/build-organization/cross-project-output-sharing/README.adoc

    This is one way you can share information across project boundaries. (Another way is to use extension objects.)
    
    [NOTE]
    ====
    This demonstrates the <<../userguide/cross_project_publications.adoc#simple-sharing-artifacts-between-projects, simple version>> of sharing information across project boundaries, by explicitly specifying which producer project's _consumable configuration_ to use for a locally available artifact.
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Thu Dec 07 01:37:51 UTC 2023
    - 2.3K bytes
    - Viewed (0)
  7. src/main/webapp/js/admin/popper.min.js.map

    o') === -1) {\n    return placement;\n  }\n\n  const boundaries = getBoundaries(\n    popper,\n    reference,\n    padding,\n    boundariesElement\n  );\n\n  const rects = {\n    top: {\n      width: boundaries.width,\n      height: refRect.top - boundaries.top,\n    },\n    right: {\n      width: boundaries.right - refRect.right,\n      height: boundaries.height,\n    },\n    bottom: {\n      width: boundaries.width,\n      height: boundaries.bottom - refRect.bottom,\n    },\n    left: {\n     ...
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Fri Feb 07 10:28:50 UTC 2020
    - 121K bytes
    - Viewed (0)
  8. test/ddd2.go

    // rundir
    
    // Copyright 2010 The Go Authors. All rights reserved.
    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    // Test that variadic functions work across package boundaries.
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 02 13:43:18 UTC 2016
    - 252 bytes
    - Viewed (0)
  9. platforms/documentation/docs/src/samples/build-organization/structuring-software-projects/groovy/build.gradle

    // This is an example of a lifecycle task that crosses build boundaries defined in the umbrella build.
    tasks.register('checkFeatures') {
        group = 'verification'
        description = 'Run all feature tests'
        dependsOn(gradle.includedBuild('admin-feature').task(':config:check'))
        dependsOn(gradle.includedBuild('user-feature').task(':data:check'))
        dependsOn(gradle.includedBuild('user-feature').task(':table:check'))
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Mon Nov 27 17:53:42 UTC 2023
    - 428 bytes
    - Viewed (0)
  10. platforms/core-configuration/kotlin-dsl/doc/c4/lib/C4_Container.puml

    !define Container(e_alias, e_label, e_techn, e_descr) rectangle "==e_label\n//<size:TECHN_FONT_SIZE>[e_techn]</size>//\n\n e_descr" <<container>> as e_alias
    
    ' Boundaries
    ' ##################################
    
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Wed Aug 02 08:06:49 UTC 2023
    - 1.5K bytes
    - Viewed (0)
Back to top