Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 269 for costs (0.04 sec)

  1. .github/ISSUE_TEMPLATE/11-language-change.yml

        validations:
          required: false
    
      - type: input
        id: perf-costs
        attributes:
          label: Performance Costs
          description: "What is the compile time cost? What is the run time cost? "
        validations:
          required: false
    
      - type: textarea
        id: prototype
        attributes:
          label: "Prototype"
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Nov 22 20:49:24 UTC 2023
    - 4.7K bytes
    - Viewed (0)
  2. ci/official/utilities/setup_docker.sh

    if [[ "$TFCI_DOCKER_PULL_ENABLE" == 1 ]]; then
      # Simple retry logic for docker-pull errors. Sleeps if a pull fails.
      # Pulling an already-pulled container image will finish instantly, so
      # repeating the command costs nothing.
      docker pull "$TFCI_DOCKER_IMAGE" || sleep 15
      docker pull "$TFCI_DOCKER_IMAGE" || sleep 30
      docker pull "$TFCI_DOCKER_IMAGE" || sleep 60
      docker pull "$TFCI_DOCKER_IMAGE"
    fi 
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu May 16 18:22:06 UTC 2024
    - 1.9K bytes
    - Viewed (0)
  3. src/sync/oncefunc.go

    // If f panics, the returned function will panic with the same value on every call.
    func OnceFunc(f func()) func() {
    	var (
    		once  Once
    		valid bool
    		p     any
    	)
    	// Construct the inner closure just once to reduce costs on the fast path.
    	g := func() {
    		defer func() {
    			p = recover()
    			if !valid {
    				// Re-panic immediately so on the first call the user gets a
    				// complete stack trace into f.
    				panic(p)
    			}
    		}()
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Nov 21 17:31:33 UTC 2023
    - 2K bytes
    - Viewed (0)
  4. tensorflow/compiler/mlir/lite/experimental/tac/transforms/cost_model.cc

      MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(GetOpCostPass)
    
      llvm::StringRef getArgument() const final { return "tfl-get-op-cost"; }
      llvm::StringRef getDescription() const final {
        return "Get cost for every op";
      }
      void runOnOperation() override;
    };
    
    void GetOpCostPass::runOnOperation() {
      auto func = getOperation();
      OpBuilder builder(func);
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Apr 25 16:01:03 UTC 2024
    - 7.3K bytes
    - Viewed (0)
  5. tensorflow/compiler/mlir/lite/experimental/tac/execution_metadata_exporter.cc

        auto cost_attr = device_costs_attr.getNamed(kv.first);
        if (!cost_attr.has_value()) return std::nullopt;
        float cost = mlir::dyn_cast_or_null<mlir::FloatAttr>(cost_attr->getValue())
                         .getValueAsDouble();
        device_costs[kv.second] = cost;
      }
      return device_costs;
    }
    
    flatbuffers::Offset<SubgraphMetadata> CreateSubgraphMetadata(
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Jun 11 06:11:34 UTC 2024
    - 7.5K bytes
    - Viewed (0)
  6. pkg/kube/kubetypes/types.go

    	// This is a *client side* filter. This means CPU/memory costs are still present for filtered objects.
    	// Use LabelSelector or FieldSelector instead, if possible.
    	ObjectFilter DynamicObjectFilter
    	// ObjectTransform allows arbitrarily modifying objects stored in the underlying cache.
    	// If unset, a default transform is provided to remove ManagedFields (high cost, low value)
    	ObjectTransform func(obj any) (any, error)
    }
    
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Wed Feb 28 16:41:38 UTC 2024
    - 6.1K bytes
    - Viewed (0)
  7. docs/bucket/lifecycle/README.md

    clusters via the ILM transition feature. This will allow transitioning of older objects to a different cluster or the public cloud by setting up transition rules in the bucket lifecycle configuration. This feature enables applications to optimize storage costs by moving less frequently accessed data to a cheaper storage without compromising accessibility of data.
    
    To transition objects in a bucket to a destination bucket on a different cluster, applications need to specify a transition tier defined...
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Sat Aug 26 07:33:25 UTC 2023
    - 9K bytes
    - Viewed (0)
  8. src/net/hosts.go

    			}
    		}
    	}
    	// Update the data cache.
    	hosts.expire = now.Add(cacheMaxAge)
    	hosts.path = hp
    	hosts.byName = hs
    	hosts.byAddr = is
    	hosts.mtime = mtime
    	hosts.size = size
    }
    
    // lookupStaticHost looks up the addresses and the canonical name for the given host from /etc/hosts.
    func lookupStaticHost(host string) ([]string, string) {
    	hosts.Lock()
    	defer hosts.Unlock()
    	readHosts()
    	if len(hosts.byName) != 0 {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Sep 04 07:21:38 UTC 2023
    - 3.5K bytes
    - Viewed (0)
  9. internal/grid/connection_test.go

    				t.Errorf("shouldConnect(%q, %q) != shouldConnect(%q, %q)", hosts[x], hosts[y], hosts[y], hosts[x])
    			}
    			if c.shouldConnect() {
    				should++
    			}
    		}
    		if should < 10 {
    			t.Errorf("host %q only connects to %d hosts", hosts[x], should)
    		}
    		t.Logf("host %q should connect to %d hosts", hosts[x], should)
    	}
    }
    
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Tue Nov 21 01:09:35 UTC 2023
    - 6K bytes
    - Viewed (0)
  10. src/net/hosts_test.go

    	testStaticAddr(t, hostsFilePath, ent)
    	// Modify the hosts return by lookupStaticAddr.
    	hosts := lookupStaticAddr(ent.in)
    	for i := range hosts {
    		hosts[i] += "junk"
    	}
    	testStaticAddr(t, hostsFilePath, ent)
    }
    
    var lookupStaticHostAliasesTest = []struct {
    	lookup, res string
    }{
    	// 127.0.0.1
    	{"test", "test"},
    	// 127.0.0.2
    	{"test2.example.com", "test2.example.com"},
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Sep 04 07:21:38 UTC 2023
    - 5.6K bytes
    - Viewed (0)
Back to top