- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 89 for GETs (0.06 sec)
-
cmd/iam.go
if err != nil { return UserIdentity{}, nil, err } } return tmpAcc, embeddedPolicy, nil } // getAccountWithClaims - gets information about an account with claims func (sys *IAMSys) getAccountWithClaims(ctx context.Context, accessKey string) (UserIdentity, *jwt.MapClaims, error) { if !sys.Initialized() {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Jun 13 22:26:38 UTC 2024 - 71.9K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/cacher/cacher_whitebox_test.go
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 10:12:02 UTC 2024 - 82.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/flatbuffer_import.cc
bool IsBasicLSTMOp(tflite::BuiltinOptionsUnion op_union) { if (const auto* op = op_union.AsLSTMOptions()) { return op->kernel_type == tflite::LSTMKernelType_BASIC; } else { return false; } } // Gets the MLIR op name with the dialect name for the flatbuffer operator. std::string GetMlirOpName(const tflite::OperatorT& op, const tflite::OperatorCodeT& op_code) { if (IsBasicLSTMOp(op.builtin_options)) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 21 18:21:50 UTC 2024 - 66.8K bytes - Viewed (0) -
src/cmd/link/internal/loader/loader.go
// loader stores symbol payloads in loader.payloads using SymbolBuilder. // // - Each symbol gets a unique global index. For duplicated and // overwriting/overwritten symbols, the second (or later) appearance // of the symbol gets the same global index as the first appearance. type Loader struct { objs []*oReader
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 20:26:10 UTC 2024 - 81.5K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/cacher/cacher.go
} return result, true } func (c *Cacher) processEvent(event *watchCacheEvent) { if curLen := int64(len(c.incoming)); c.incomingHWM.Update(curLen) { // Monitor if this gets backed up, and how much. klog.V(1).Infof("cacher (%v): %v objects queued in incoming channel.", c.groupResource.String(), curLen) } c.incoming <- *event } func (c *Cacher) dispatchEvents() {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 10:12:02 UTC 2024 - 51.8K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/testing/watcher_tests.go
testWatch(ctx, t, store, false) testWatch(ctx, t, store, true) } // It tests that // - first occurrence of objects should notify Add event // - update should trigger Modified event // - update that gets filtered should trigger Deleted event func testWatch(ctx context.Context, t *testing.T, store storage.Interface, recursive bool) { basePod := &example.Pod{ ObjectMeta: metav1.ObjectMeta{Name: "foo"},
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 18:25:29 UTC 2024 - 63.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Futures.java
* * <p>If the combiner throws an {@code ExecutionException}, the cause of the thrown {@code * ExecutionException} will be extracted and returned as the cause of the new {@code * ExecutionException} that gets thrown by the returned combined future. * * <p>Canceling this future will attempt to cancel all the component futures. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 59.6K bytes - Viewed (0) -
src/runtime/mgcmark.go
print("scanning async preempted goroutine ", gp.goid, " stack [", hex(gp.stack.lo), ",", hex(gp.stack.hi), ")\n") } // Scan the saved context register. This is effectively a live // register that gets moved back and forth between the // register and sched.ctxt without a write barrier. if gp.sched.ctxt != nil { scanblock(uintptr(unsafe.Pointer(&gp.sched.ctxt)), goarch.PtrSize, &oneptrmask[0], gcw, &state) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 21:25:11 UTC 2024 - 52.5K bytes - Viewed (0) -
src/index/suffixarray/sais2.go
// When deeper recursions come back to recurse_64, now oldTmp is // the saTmp from the top-most recursion, it is typically larger than // the current saTmp (because the current sa gets smaller and smaller // as the recursion gets deeper), and we keep reusing that top-most // large saTmp instead of the offered smaller ones. // // Why is the subproblem length so often just under len(sa)/3?
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 52.3K bytes - Viewed (0) -
cmd/iam-store.go
err = nil } if err != nil { return err } } delete(cache.iamPolicyDocsMap, policy) cache.updatedAt = time.Now() return nil } // GetPolicy - gets the policy definition. Allows specifying multiple comma // separated policies - returns a combined policy. func (store *IAMStoreSys) GetPolicy(name string) (policy.Policy, error) { if name == "" {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Jun 13 22:26:38 UTC 2024 - 75.8K bytes - Viewed (0)