- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 209 for nelem (0.07 sec)
-
test/fixedbugs/bug027.go
import "fmt" type Element interface { } type Vector struct { nelem int elem []Element } func New() *Vector { v := new(Vector) v.nelem = 0 v.elem = make([]Element, 10) return v } func (v *Vector) At(i int) Element { return v.elem[i] } func (v *Vector) Insert(e Element) { v.elem[v.nelem] = e v.nelem++ } func main() { type I struct{ val int } i0 := new(I)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 17 04:48:57 UTC 2012 - 1.2K bytes - Viewed (0) -
src/crypto/internal/boring/div_test.c
7, 8, 9, 10, 11, 31, 0xFFF, 0x1000, 0x1001, 0xF0F0F0, 0xFFFFFF, 0x1000000, 0xF0F0F0F0, 0xFFFFFFFF, }; int main(void) { for(int i=0; i<nelem(tests); i++) for(int j=0; j<nelem(tests); j++) { u32 n = tests[i]; u32 d = tests[j]; if(d == 0) continue; u32 r; u32 q = div(n, d, &r); if(q != n/d || r != n%d)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 18 21:28:09 UTC 2022 - 1.4K bytes - Viewed (0) -
test/cmplxdivide.c
printf(")\n"); printf("\n"); printf("var tests = []struct {\n"); printf("\tf, g complex128\n"); printf("\tout complex128\n"); printf("}{\n"); for(i=0; i<nelem(f); i++) for(j=0; j<nelem(f); j++) for(k=0; k<nelem(f); k++) for(l=0; l<nelem(f); l++) { n = f[i] + f[j]*I; d = f[k] + f[l]*I; q = n/d; printf("\t{complex(%s, %s), complex(%s, %s), complex(%s, %s)},\n", fmt(creal(n)), fmt(cimag(n)),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 15 22:45:17 UTC 2017 - 2.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/sys/plan9/mkerrors.sh
} int main(void) { int i, j, e; char buf[1024], *p; printf("\n\n// Error table\n"); printf("var errors = [...]string {\n"); qsort(errors, nelem(errors), sizeof errors[0], intcmp); for(i=0; i<nelem(errors); i++) { e = errors[i]; if(i > 0 && errors[i-1] == e) continue; strcpy(buf, strerror(e)); // lowercase first letter: Bad -> bad, but STREAM -> STREAM.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 26 00:11:50 UTC 2022 - 5.9K bytes - Viewed (0) -
src/runtime/cgo/libcgo.h
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. #include <stdint.h> #include <stdlib.h> #include <stdio.h> #undef nil #define nil ((void*)0) #define nelem(x) (sizeof(x)/sizeof((x)[0])) typedef uint32_t uint32; typedef uint64_t uint64; typedef uintptr_t uintptr; /* * The beginning of the per-goroutine structure, * as defined in ../pkg/runtime/runtime.h.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 13 20:50:04 UTC 2024 - 3.5K bytes - Viewed (0) -
src/cmd/compile/internal/staticdata/embed.go
// See the comment inside ../../../../embed/embed.go's Files struct for rationale. func embedFileLess(x, y string) bool { xdir, xelem, _ := embedFileNameSplit(x) ydir, yelem, _ := embedFileNameSplit(y) return xdir < ydir || xdir == ydir && xelem < yelem } // WriteEmbed emits the init data for a //go:embed variable, // which is either a string, a []byte, or an embed.FS. func WriteEmbed(v *ir.Name) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 10 18:22:02 UTC 2023 - 4.8K bytes - Viewed (0) -
src/internal/types/testdata/check/issues1.go
type Element2[TElem any] struct { next, prev *Element2[TElem] list *List2[TElem] Value TElem } type List2[TElem any] struct { root Element2[TElem] len int } func (l *List2[TElem]) Init() *List2[TElem] { l.root.next = &l.root l.root.prev = &l.root l.len = 0 return l } // Self-recursive instantiations must work correctly. type A[P any] struct { _ *A[P] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:56:37 UTC 2023 - 6K bytes - Viewed (0) -
src/testing/fstest/mapfs.go
for fname, f := range fsys { if strings.HasPrefix(fname, prefix) { felem := fname[len(prefix):] i := strings.Index(felem, "/") if i < 0 { list = append(list, mapFileInfo{felem, f}) } else { need[fname[len(prefix):len(prefix)+i]] = true } } } // If the directory name is not in the map, // and there are no children of the name in the map, // then the directory is treated as not existing.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 7.1K bytes - Viewed (0) -
test/typeparam/setsimp.dir/a.go
func Make[Elem comparable]() Set[Elem] { return Set[Elem]{m: make(map[Elem]struct{})} } // Add adds an element to a set. func (s Set[Elem]) Add(v Elem) { s.m[v] = struct{}{} } // Delete removes an element from a set. If the element is not present // in the set, this does nothing. func (s Set[Elem]) Delete(v Elem) { delete(s.m, v) } // Contains reports whether v is in the set.
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/go/parser/testdata/set.go2
package set type Set[Elem comparable] map[Elem]struct{} func Make[Elem comparable]() Set[Elem] { return make(Set(Elem)) } func (s Set[Elem]) Add(v Elem) { s[v] = struct{}{} } func (s Set[Elem]) Delete(v Elem) { delete(s, v) } func (s Set[Elem]) Contains(v Elem) bool { _, ok := s[v] return ok } func (s Set[Elem]) Len() int { return len(s) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 24 19:44:06 UTC 2020 - 474 bytes - Viewed (0)