- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for copyModel (0.24 sec)
-
maven-compat/src/main/java/org/apache/maven/project/inheritance/ModelInheritanceAssembler.java
void assembleModelInheritance(Model child, Model parent); void assembleBuildInheritance(Build childBuild, Build parentBuild, boolean handleAsInheritance); void copyModel(Model dest, Model source);
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Sep 06 08:39:32 UTC 2023 - 1.3K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/project/inheritance/DefaultModelInheritanceAssembler.java
@Override public void assembleBuildInheritance(Build childBuild, Build parentBuild, boolean handleAsInheritance) { throw new UnsupportedOperationException(); } @Override public void copyModel(Model dest, Model source) { throw new UnsupportedOperationException(); }
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Sep 06 11:28:54 UTC 2023 - 1.7K bytes - Viewed (0) -
tools/istio-iptables/pkg/log/nflog.go
if !TraceLoggingEnabled { return } iptablesTrace.Infof("starting nftable log") // We expect to read logs from rules like: // `-j NFLOG --nflog-group 1337` config := nflog.Config{ Group: 1337, Copymode: nflog.CopyPacket, Logger: iptablesTrace, } nf, err := nflog.Open(&config) if err != nil { log.Errorf("could not open nflog socket: %v", err) return } defer nf.Close()
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jun 06 15:59:40 UTC 2024 - 2.8K bytes - Viewed (0) -
tensorflow/compiler/jit/encapsulate_subgraphs_pass.cc
if (device_.empty()) { device_ = node->assigned_device_name().empty() ? node->requested_device() : node->assigned_device_name(); } return graph_->CopyNode(node); } Graph* Encapsulator::Subgraph::GetGraph() const { return graph_.get(); } Status Encapsulator::Subgraph::RecordArg( const Edge* edge,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 08:47:20 UTC 2024 - 51K bytes - Viewed (0) -
tensorflow/compiler/jit/extract_outside_compilation_pass.cc
while (!stack.empty()) { Visit& curr = stack.back(); if (curr.is_exiting) { if (node_map.find(curr.n) == node_map.end()) { Node* copy = g->CopyNode(curr.n); if (curr.n != start_node) { for (const Edge* e : curr.n->in_edges()) { auto node_iter = node_map.find(e->src()); if (node_iter == node_map.end()) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 104.7K bytes - Viewed (0)