- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 947 for addDep (0.07 sec)
-
test/typeparam/adder.go
Matthew Dempsky <******@****.***> 1646087539 -0800
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 01 19:45:34 UTC 2022 - 559 bytes - Viewed (0) -
test/fixedbugs/bug007.go
// license that can be found in the LICENSE file. package main type ( Point struct { x, y float64 } Polar Point ) func main() { } /* bug7.go:5: addtyp: renaming Point to Polar main.go.c:14: error: redefinition of typedef ‘_T_2’ main.go.c:13: error: previous declaration of ‘_T_2’ was here main.go.c:16: error: redefinition of ‘struct _T_2’
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 17 04:48:57 UTC 2012 - 481 bytes - Viewed (0) -
testing/performance/src/templates/native-dependents-resources/googleTest/libs/googleTest/1.7.0/include/gtest/internal/gtest-tuple.h.pump
// AddRef<T>::type is T if T is a reference; otherwise it's T&. This // is the same as tr1::add_reference<T>::type. template <typename T> struct AddRef { typedef T& type; }; // NOLINT template <typename T> struct AddRef<T&> { typedef T& type; }; // NOLINT // A handy wrapper for AddRef. #define GTEST_ADD_REF_(T) typename ::std::tr1::gtest_internal::AddRef<T>::type
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 9K bytes - Viewed (0) -
test/typeparam/setsimp.dir/a.go
func (s Set[Elem]) Copy() Set[Elem] { r := Set[Elem]{m: make(map[Elem]struct{}, len(s.m))} for v := range s.m { r.m[v] = struct{}{} } return r } // AddSet adds all the elements of s2 to s. func (s Set[Elem]) AddSet(s2 Set[Elem]) { for v := range s2.m { s.m[v] = struct{}{} } } // SubSet removes all elements in s2 from s. // Values in s2 that are not in s are ignored.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 26 21:39:54 UTC 2021 - 2.7K bytes - Viewed (0) -
src/cmd/internal/obj/data.go
// Allow 4-byte addresses for DWARF. if siz != ctxt.Arch.PtrSize && siz != 4 { ctxt.Diag("WriteAddr: bad address size %d in %s", siz, s.Name) } s.prepwrite(ctxt, off, siz) r := Addrel(s) r.Off = int32(off) if int64(r.Off) != off { ctxt.Diag("WriteAddr: off overflow %d in %s", off, s.Name) } r.Siz = uint8(siz) r.Sym = rsym r.Type = rtype r.Add = roff }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 24 14:38:53 UTC 2021 - 6.7K bytes - Viewed (0) -
hack/testdata/CRD/foo-added-subfield.yaml
Nikhita Raghunath <******@****.***> 1506872372 +0530
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Oct 01 15:43:24 UTC 2017 - 201 bytes - Viewed (0) -
src/cmd/link/internal/loong64/asm.go
// 0: 1a000004 pcalau12i $a0, 0 // 0: R_LARCH_PCALA_HI20 local.moduledata o(0x1a000004) rel, _ := initfunc.AddRel(objabi.R_LOONG64_ADDR_HI) rel.SetOff(0) rel.SetSiz(4) rel.SetSym(ctxt.Moduledata) // 4: 02c00084 addi.d $a0, $a0, 0 // 4: R_LARCH_PCALA_LO12 local.moduledata o(0x02c00084) rel2, _ := initfunc.AddRel(objabi.R_LOONG64_ADDR_LO) rel2.SetOff(4) rel2.SetSiz(4) rel2.SetSym(ctxt.Moduledata)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 27 17:26:07 UTC 2024 - 7.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/odml_converter/transforms/outline_composites.cc
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 17 17:58:54 UTC 2024 - 9.6K bytes - Viewed (0) -
src/cmd/link/internal/ld/seh.go
// The SEH unwind data can contain relocations, // make sure those are copied over. rels := ldr.Relocs(uw) for i := 0; i < rels.Count(); i++ { r := rels.At(i) rel, _ := xdata.AddRel(r.Type()) rel.SetOff(int32(off) + r.Off()) rel.SetSiz(r.Siz()) rel.SetSym(r.Sym()) rel.SetAdd(r.Add()) } } // Reference:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 09 19:01:27 UTC 2023 - 2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tfr/README.md
else: return res ``` Besides defining new ops, composition can be specified for an existing op for portability. The following code defines the semantics of `AddNOp`: ```python @Composite('AddNOp') def _my_op_c(ins): N = len(ins) if N == 1: return ins[0] sum = ins[0] for i in range(1, N): sum += ins[i] return sum ```
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 29 18:32:13 UTC 2022 - 6.2K bytes - Viewed (0)