- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 316 for pubs (0.05 sec)
-
test/fixedbugs/issue33355.go
queue []byte client *client } type outsie struct { ni map[string]struct{} sl *Sublist qsubs int } type Sublist struct { } type SublistResult struct { psubs []*subscription qsubs [][]*subscription } var subPool = &sync.Pool{} func (c *client) sendMsgToGateways(acc *Account, msg, subject, reply []byte, qgroups [][]byte) { var gws []*client gw := c.srv.gateway
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 01 02:15:18 UTC 2019 - 2.5K bytes - Viewed (0) -
tensorflow/cc/gradients/linalg_grad.cc
return scope.status(); } std::vector<absl::string_view> subs = absl::StrSplit(input_subs, ','); if (subs.size() != 2) { return errors::InvalidArgument("Only 2 inputs are supported"); } std::string x_subs(subs[0]); std::string y_subs(subs[1]); // Add ellipsis for broadcasted dimensions if any operand does not have it.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Mar 07 23:11:54 UTC 2022 - 20.4K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/endpoints/filters/mux_discovery_complete.go
muxAndDiscoveryCompleteProtectionKeyValue, _ := ctx.Value(muxAndDiscoveryIncompleteKey).(string) return len(muxAndDiscoveryCompleteProtectionKeyValue) == 0 } // WithMuxAndDiscoveryComplete puts the muxAndDiscoveryIncompleteKey in the context if a request has been made before muxAndDiscoveryCompleteSignal has been ready. // Putting the key protect us from returning a 404 response instead of a 503.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Oct 21 13:25:33 UTC 2021 - 2.8K bytes - Viewed (0) -
internal/store/queuestore.go
} } return nil } // Delete - Remove the store directory from disk func (store *QueueStore[_]) Delete() error { return os.Remove(store.directory) } // PutMultiple - puts an item to the store. func (store *QueueStore[I]) PutMultiple(item []I) error { store.Lock() defer store.Unlock() if uint64(len(store.entries)) >= store.entryLimit { return errLimitExceeded }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Mar 25 16:44:20 UTC 2024 - 7.1K bytes - Viewed (0) -
src/runtime/tracebuf.go
w = w.refill(traceNoExperiment) } return w, refill } // flush puts w.traceBuf on the queue of full buffers. func (w traceWriter) flush() traceWriter { systemstack(func() { lock(&trace.lock) if w.traceBuf != nil { traceBufFlush(w.traceBuf, w.gen) } unlock(&trace.lock) }) w.traceBuf = nil return w } // refill puts w.traceBuf on the queue of full buffers and refresh's w's buffer. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:47:01 UTC 2024 - 6.8K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/shift/dead.go
package shift // Simplified dead code detector. // Used for skipping shift checks on unreachable arch-specific code. import ( "go/ast" "go/constant" "go/types" ) // updateDead puts unreachable "if" and "case" nodes into dead. func updateDead(info *types.Info, dead map[ast.Node]bool, node ast.Node) { if dead[node] { // The node is already marked as dead. return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 06 18:23:38 UTC 2018 - 2.2K bytes - Viewed (0) -
test/stack.go
s := 0 for i := 0; i < len(t); i++ { s += t[i] } if s != len(t) { println("bad defer", s) panic("fail") } } func f0() { // likely to make a new stack for f0, // because the call to f1 puts 3000 bytes // in our frame. f1() } func f1() [3000]byte { // likely to make a new stack for f1, // because 3000 bytes were used by f0 // and we need 3000 more for the call
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 24 00:48:19 UTC 2012 - 1.7K bytes - Viewed (0) -
src/crypto/subtle/xor_arm64.s
VLD1.P 64(R2), [V4.B16, V5.B16, V6.B16, V7.B16] VEOR V0.B16, V4.B16, V4.B16 VEOR V1.B16, V5.B16, V5.B16 VEOR V2.B16, V6.B16, V6.B16 VEOR V3.B16, V7.B16, V7.B16 VST1.P [V4.B16, V5.B16, V6.B16, V7.B16], 64(R0) SUBS $64, R3 CMP $64, R3 BGE loop_64 tail: // quick end CBZ R3, end TBZ $5, R3, less_than32 VLD1.P 32(R1), [V0.B16, V1.B16] VLD1.P 32(R2), [V2.B16, V3.B16] VEOR V0.B16, V2.B16, V2.B16
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 17 18:47:33 UTC 2022 - 1.5K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/runtime/allocator.go
}, } // Allocator knows how to allocate memory // It exists to make the cost of object serialization cheaper. // In some cases, it allows for allocating memory only once and then reusing it. // This approach puts less load on GC and leads to less fragmented memory in general. type Allocator struct { buf []byte } var _ MemoryAllocator = &Allocator{}
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jul 27 03:17:50 UTC 2022 - 2.2K bytes - Viewed (0) -
docs/fr/docs/async.md
#### Burgers concurrents Vous amenez votre crush 😍 dans votre fast food 🍔 favori, et faites la queue pendant que le serveur 💁 prend les commandes des personnes devant vous. Puis vient votre tour, vous commandez alors 2 magnifiques burgers 🍔 pour votre crush 😍 et vous. Vous payez 💸.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sun Mar 31 23:52:53 UTC 2024 - 24K bytes - Viewed (0)