Search Options

Results per page
Sort
Preferred Languages
Advance

Results 391 - 400 of 536 for mult (0.25 sec)

  1. internal/store/queuestore.go

    	if len(eventData) == 0 {
    		return item, os.ErrNotExist
    	}
    
    	if err = json.Unmarshal(eventData, &item); err != nil {
    		return item, err
    	}
    
    	return item, nil
    }
    
    // GetMultiple will read the multi payload file and fetch the items
    func (store *QueueStore[I]) GetMultiple(key Key) (items []I, err error) {
    	store.RLock()
    
    	defer func(store *QueueStore[I]) {
    		store.RUnlock()
    Registered: Sun Oct 27 19:28:09 UTC 2024
    - Last Modified: Fri Sep 06 23:06:30 UTC 2024
    - 8.6K bytes
    - Viewed (0)
  2. tensorflow/c/eager/custom_device_testutil.cc

      LoggingDevice* dev = reinterpret_cast<LoggingDevice*>(device_info);
      if (dev->strict_scope_placement && *requested_placement == '\0') {
        TF_SetStatus(s, TF_INTERNAL,
                     "Ops must be placed on the device explicitly, or their inputs "
                     "first copied to other devices.");
        return;
      }
      TFE_Context* context = TFE_OpGetContext(original_op, s);
      if (TF_GetCode(s) != TF_OK) return;
    Registered: Tue Oct 29 12:39:09 UTC 2024
    - Last Modified: Wed Mar 03 20:47:31 UTC 2021
    - 8.3K bytes
    - Viewed (0)
  3. src/archive/zip/reader.go

    	baseOffset int64
    
    	// fileList is a list of files sorted by ename,
    	// for use by the Open method.
    	fileListOnce sync.Once
    	fileList     []fileListEntry
    }
    
    // A ReadCloser is a [Reader] that must be closed when no longer needed.
    type ReadCloser struct {
    	f *os.File
    	Reader
    }
    
    // A File is a single file in a ZIP archive.
    // The file information is in the embedded [FileHeader].
    Registered: Tue Oct 29 11:13:09 UTC 2024
    - Last Modified: Sat Aug 03 01:05:29 UTC 2024
    - 28.1K bytes
    - Viewed (0)
  4. cmd/data-usage_test.go

    			size: 200,
    		},
    	}
    	createUsageTestFiles(t, base, bucket, files)
    	err = os.RemoveAll(filepath.Join(base, bucket, "dir1/dira/dirasub/dcfile"))
    	if err != nil {
    		t.Fatal(err)
    	}
    	// Changed dir must be picked up in this many cycles.
    	for i := 0; i < dataUsageUpdateDirCycles; i++ {
    		got, err = scanDataFolder(context.Background(), nil, &xls, got, getSize, 0, weSleep)
    		got.Info.NextCycle++
    		if err != nil {
    Registered: Sun Oct 27 19:28:09 UTC 2024
    - Last Modified: Fri Oct 04 22:23:33 UTC 2024
    - 14.7K bytes
    - Viewed (0)
  5. src/main/java/org/codelibs/fess/es/config/cbean/cq/bs/BsFailureUrlCQ.java

            bool((must, should, mustNot, filter) -> {
                filteredLambda.callback(must, filter);
            }, opLambda);
        }
    
        public void not(OperatorCall<FailureUrlCQ> notLambda) {
            not(notLambda, null);
        }
    
        public void not(final OperatorCall<FailureUrlCQ> notLambda, final ConditionOptionCall<BoolQueryBuilder> opLambda) {
    Registered: Mon Oct 28 08:04:08 UTC 2024
    - Last Modified: Thu Feb 22 01:37:57 UTC 2024
    - 57.4K bytes
    - Viewed (0)
  6. internal/grid/muxserver.go

    		return pongMsg{Err: &err}
    	default:
    		atomic.StoreInt64(&m.LastPing, time.Now().Unix())
    		return pongMsg{}
    	}
    }
    
    // disconnect will disconnect the mux.
    // m.recvMu must be locked when calling this function.
    func (m *muxServer) disconnect(msg string, locked bool) {
    	if debugPrint {
    		fmt.Println("Mux", m.ID, "disconnecting. Reason:", msg)
    	}
    	if msg != "" {
    Registered: Sun Oct 27 19:28:09 UTC 2024
    - Last Modified: Fri Jun 07 15:51:52 UTC 2024
    - 9.7K bytes
    - Viewed (0)
  7. docs/en/docs/tutorial/background-tasks.md

    * Processing data:
        * For example, let's say you receive a file that must go through a slow process, you can return a response of "Accepted" (HTTP 202) and process the file in the background.
    
    ## Using `BackgroundTasks`
    
    Registered: Sun Oct 27 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 5.5K bytes
    - Viewed (0)
  8. cmd/os-instrumented.go

    var globalOSMetrics osMetrics
    
    func init() {
    	// Inject metrics.
    	ioutilx.OsOpenFile = OpenFile
    	ioutilx.OpenFileDirectIO = OpenFileDirectIO
    	ioutilx.OsOpen = Open
    }
    
    type osMetrics struct {
    	// All fields must be accessed atomically and aligned.
    	operations [osMetricLast]uint64
    	latency    [osMetricLast]lockedLastMinuteLatency
    }
    
    // time an os action.
    func (o *osMetrics) time(s osMetric) func() {
    	startTime := time.Now()
    Registered: Sun Oct 27 19:28:09 UTC 2024
    - Last Modified: Thu Feb 15 01:09:38 UTC 2024
    - 6.3K bytes
    - Viewed (0)
  9. internal/kms/context.go

    )
    
    // Context is a set of key-value pairs that
    // are associated with a generate data encryption
    // key (DEK).
    //
    // A KMS implementation may bind the context to the
    // generated DEK such that the same context must be
    // provided when decrypting an encrypted DEK.
    type Context map[string]string
    
    // MarshalText returns a canonical text representation of
    // the Context.
    
    // MarshalText sorts the context keys and writes the sorted
    Registered: Sun Oct 27 19:28:09 UTC 2024
    - Last Modified: Sun Jan 02 17:15:06 UTC 2022
    - 6K bytes
    - Viewed (0)
  10. internal/config/lambda/target/webhook.go

    		return nil
    	}
    	if w.Endpoint.IsEmpty() {
    		return errors.New("endpoint empty")
    	}
    	if w.ClientCert != "" && w.ClientKey == "" || w.ClientCert == "" && w.ClientKey != "" {
    		return errors.New("cert and key must be specified as a pair")
    	}
    	return nil
    }
    
    // WebhookTarget - Webhook target.
    type WebhookTarget struct {
    	activeRequests int64
    	totalRequests  int64
    	failedRequests int64
    
    	lazyInit lazyInit
    
    Registered: Sun Oct 27 19:28:09 UTC 2024
    - Last Modified: Mon Jul 08 21:39:49 UTC 2024
    - 6.7K bytes
    - Viewed (0)
Back to top