- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 49 for newD (0.03 sec)
-
src/runtime/iface.go
newN := n * 2 // make it at most 50% full newN = 1 << sys.Len64(uint64(newN-1)) // round up to a power of 2 // Allocate the new table. newSize := unsafe.Sizeof(abi.TypeAssertCache{}) + uintptr(newN-1)*unsafe.Sizeof(abi.TypeAssertCacheEntry{}) newC := (*abi.TypeAssertCache)(mallocgc(newSize, nil, true)) newC.Mask = uintptr(newN - 1)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 22.5K bytes - Viewed (0) -
tests/hooks_test.go
DB.Model(&product).Updates(map[string]interface{}{"Name": "Product New"}) if product.Name != "Product New" || product.Price != 160 || product.Code != "L1212" { t.Errorf("invalid data after update, got %+v", product) } // Code changed, but not selected, price should not change DB.Model(&product).Select("Name", "Price").Updates(map[string]interface{}{"Name": "Product New2", "code": "L1213"})
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Sat Feb 18 01:20:29 UTC 2023 - 15.9K bytes - Viewed (0) -
internal/grid/types.go
ePool sync.Pool // Elements } // NewArrayOf returns a new ArrayOf. // You must provide a function that returns a new instance of T. func NewArrayOf[T RoundTripper](newFn func() T) *ArrayOf[T] { return &ArrayOf[T]{ ePool: sync.Pool{New: func() any { return newFn() }}, } } // New returns a new empty Array. func (p *ArrayOf[T]) New() *Array[T] { return &Array[T]{ p: p, } }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Apr 01 23:42:09 UTC 2024 - 15.4K bytes - Viewed (0) -
pkg/test/framework/components/echo/config.go
} // DeepCopy creates a clone of IstioEndpoint. func (c Config) DeepCopy() Config { newc := c newc.Cluster = nil newc = copyInternal(newc).(Config) newc.Cluster = c.Cluster newc.Namespace = c.Namespace return newc } func (c Config) IsExternal() bool { return c.HostHeader() != c.ClusterLocalFQDN() } const ( defaultService = "echo"
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu May 09 12:26:52 UTC 2024 - 18.2K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/telemetry/internal/counter/file.go
if v, _, _, _ := current.lookup(name); v != nil { return v, nop } v, newM, err := current.newCounter(name) if err != nil { debugPrintf("newCounter %s: %v\n", name, err) return nil, nop } cleanup = nop if newM != nil { f.current.Store(newM) cleanup = f.invalidateCounters } return v, cleanup } // Open associates counting with the defaultFile.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 18.2K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/sumdb/tlog/tile.go
for level := uint(0); newTreeSize>>(H*level) > 0; level++ { oldN := oldTreeSize >> (H * level) newN := newTreeSize >> (H * level) if oldN == newN { continue } for n := oldN >> H; n < newN>>H; n++ { tiles = append(tiles, Tile{H: h, L: int(level), N: n, W: 1 << H}) } n := newN >> H if w := int(newN - n<<H); w > 0 { tiles = append(tiles, Tile{H: h, L: int(level), N: n, W: w}) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 13K bytes - Viewed (0) -
src/fmt/print.go
func parsenum(s string, start, end int) (num int, isnum bool, newi int) { if start >= end { return 0, false, end } for newi = start; newi < end && '0' <= s[newi] && s[newi] <= '9'; newi++ { if tooLarge(num) { return 0, false, end // Overflow; crazy long number most likely. } num = num*10 + int(s[newi]-'0') isnum = true } return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:22:43 UTC 2024 - 31.8K bytes - Viewed (0) -
src/runtime/mgcwork.go
} // Record the new span in the busy list. lock(&work.wbufSpans.lock) work.wbufSpans.busy.insert(s) unlock(&work.wbufSpans.lock) } // Slice up the span into new workbufs. Return one and // put the rest on the empty list. for i := uintptr(0); i+_WorkbufSize <= workbufAlloc; i += _WorkbufSize { newb := (*workbuf)(unsafe.Pointer(s.base() + i)) newb.nobj = 0 lfnodeValidate(&newb.node)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 12.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/RegularImmutableMap.java
* @param newN the expected number of entries once duplicates are removed * @param duplicates a map of canonical {@link Entry} objects for each duplicate key. This map * will be updated by the method, setting each value to false as soon as the {@link Entry} has * been included in the new entry array. * @return an array of {@code newN} entries where no key appears more than once. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 16.2K bytes - Viewed (0) -
src/go/doc/reader.go
// copy existing receiver field list and set new receiver field newFieldList := *f.Decl.Recv newFieldList.List = []*ast.Field{&newField} // copy existing function declaration and set new receiver field list newFuncDecl := *f.Decl newFuncDecl.Recv = &newFieldList // copy existing function documentation and set new declaration newF := *f newF.Decl = &newFuncDecl newF.Recv = recvString(typ)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 27.5K bytes - Viewed (0)