- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,366 for rend (0.04 sec)
-
tensorflow/c/experimental/ops/gen/cpp/renderers/namespace_renderer.cc
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Mar 28 05:51:40 UTC 2024 - 1.5K bytes - Viewed (0) -
src/cmd/internal/obj/ppc64/asm_test.go
// REG_Vx & 63 == x + 32 func TestRegValueAlignment(t *testing.T) { tstFunc := func(rstart, rend, msk, rout int) { for i := rstart; i <= rend; i++ { if i&msk != rout { t.Errorf("%v is not aligned to 0x%X (expected %d, got %d)\n", rconv(i), msk, rout, rstart&msk) } rout++ } } var testType = []struct { rstart int rend int msk int rout int }{ {REG_VS0, REG_VS63, 63, 0},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 09 22:14:57 UTC 2024 - 17.3K bytes - Viewed (0) -
docs/fr/docs/tutorial/query-params-str-validations.md
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu Jul 27 18:53:21 UTC 2023 - 9.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/region_control_flow_to_functional.cc
if (!llvm::hasSingleElement(region)) return std::nullopt; Block& block = region.front(); auto it = block.rbegin(); YieldOp yield = dyn_cast<YieldOp>(*it++); if (it == block.rend()) return std::nullopt; // Operation which is expected to consume all the call results. Operation* call_consumer = yield; // Allow a single ToBoolOp between the call and the yield (valid only
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 28.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/update_control_dependencies.cc
ClearControlInputs(op, num_control_inputs_removed); llvm::SmallVector<Operation*, 8> preds_in_reverse_program_order( control_deps.begin(), control_deps.end()); std::sort(preds_in_reverse_program_order.begin(), preds_in_reverse_program_order.end(), IsAfterInBlock()); SetControlInputs(op, preds_in_reverse_program_order, num_control_inputs_added); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jan 30 07:53:51 UTC 2024 - 8.4K bytes - Viewed (0) -
docs/fr/docs/async.md
### Autres formes de code asynchrone L'utilisation d'`async` et `await` est relativement nouvelle dans ce langage. Mais cela rend la programmation asynchrone bien plus simple. Cette même syntaxe (ou presque) était aussi incluse dans les versions modernes de Javascript (dans les versions navigateur et NodeJS).
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sun Mar 31 23:52:53 UTC 2024 - 24K bytes - Viewed (0) -
src/cmd/internal/obj/s390x/asmz.go
zRS(op_STM, uint32(rstart), uint32(rend), uint32(reg), uint32(offset), asm) } else { zRSY(op_STMY, uint32(rstart), uint32(rend), uint32(reg), uint32(offset), asm) } case ASTMG: zRSY(op_STMG, uint32(rstart), uint32(rend), uint32(reg), uint32(offset), asm) } case 98: // load multiple rstart := p.Reg rend := p.To.Reg offset := c.regoff(&p.From) reg := p.From.Reg
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 16 17:46:09 UTC 2024 - 176.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/utils/xla_sharding_util.cc
} for (auto it = dimension_to_splits_map->rbegin(); it != dimension_to_splits_map->rend(); ++it) { int concat_dimension = it->first; int num_splits = it->second; llvm::SmallVector<mlir::Value, 4> new_outputs; new_outputs.reserve(num_splits); for (int i = 0, end = outputs_to_merge.size(); i < end; i = i + num_splits) { mlir::TF::ConcatOp concat_op =
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 22 21:28:13 UTC 2024 - 34K bytes - Viewed (0) -
docs/fr/docs/alternatives.md
Pydantic est une bibliothèque permettant de définir la validation, la sérialisation et la documentation des données (à l'aide de JSON Schema) en se basant sur les Python type hints. Cela le rend extrêmement intuitif. Il est comparable à Marshmallow. Bien qu'il soit plus rapide que Marshmallow dans les benchmarks. Et comme il est basé sur les mêmes type hints Python, le support de l'éditeur est grand.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Fri Mar 22 01:42:11 UTC 2024 - 27.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/optimize.cc
if (!tail_type || !full_type || !tail_type.hasRank() || !full_type.hasRank() || tail_type.getRank() > full_type.getRank()) return false; auto i1 = tail_type.getShape().rbegin(), e1 = tail_type.getShape().rend(); auto i2 = full_type.getShape().rbegin(); return std::equal(i1, e1, i2); } // This function removes explicit broadcasting on type1 and returns whether if
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Apr 30 00:40:15 UTC 2024 - 102.3K bytes - Viewed (0)