Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 893 for Night (0.05 sec)

  1. tensorflow/c/eager/immediate_execution_context.h

    enum ContextDevicePlacementPolicy {
      // Running operations with input tensors on the wrong device will fail.
      DEVICE_PLACEMENT_EXPLICIT = 0,
      // Copy the tensor to the right device but log a warning.
      DEVICE_PLACEMENT_WARN = 1,
      // Silently copy the tensor, which has a performance cost since the operation
      // will be blocked till the copy completes. This is the default policy.
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 12.3K bytes
    - Viewed (0)
  2. src/main/webapp/css/admin/plugins/timepicker/bootstrap-timepicker.min.css

     */.bootstrap-timepicker{position:relative}.bootstrap-timepicker.pull-right .bootstrap-timepicker-widget.dropdown-menu{left:auto;right:0}.bootstrap-timepicker.pull-right .bootstrap-timepicker-widget.dropdown-menu:before{left:auto;right:12px}.bootstrap-timepicker.pull-right .bootstrap-timepicker-widget.dropdown-menu:after{left:auto;right:13px}.bootstrap-timepicker .input-group-addon{cursor:pointer}.bootstrap-timepicker .input-group-addon i{display:inl...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Feb 13 04:21:06 UTC 2020
    - 3K bytes
    - Viewed (0)
  3. internal/s3select/sql/value_contrib.go

    import "time"
    
    func timestampCompare(op string, left, right time.Time) bool {
    	switch op {
    	case opLt:
    		return left.Before(right)
    	case opLte:
    		return left.Before(right) || left.Equal(right)
    	case opGt:
    		return left.After(right)
    	case opGte:
    		return left.After(right) || left.Equal(right)
    	case opEq:
    		return left.Equal(right)
    	case opIneq:
    		return !left.Equal(right)
    	}
    	// This case does not happen
    	return false
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Jun 01 21:59:40 UTC 2021
    - 1K bytes
    - Viewed (0)
  4. guava/src/com/google/common/collect/Queues.java

         */
        long deadline = System.nanoTime() + unit.toNanos(timeout);
        int added = 0;
        while (added < numElements) {
          // we could rely solely on #poll, but #drainTo might be more efficient when there are multiple
          // elements already available (e.g. LinkedBlockingQueue#drainTo locks only once)
          added += q.drainTo(buffer, numElements - added);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 26 14:11:14 UTC 2024
    - 18.2K bytes
    - Viewed (0)
  5. guava/src/com/google/common/net/InetAddresses.java

       * a qualifying run is found, its hextets are replaced by the sentinel value -1.
       *
       * @param hextets {@code int[]} mutable array of eight 16-bit hextets
       */
      private static void compressLongestRunOfZeroes(int[] hextets) {
        int bestRunStart = -1;
        int bestRunLength = -1;
        int runStart = -1;
        for (int i = 0; i < hextets.length + 1; i++) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 47.1K bytes
    - Viewed (0)
  6. src/main/webapp/WEB-INF/view/admin/general/admin_general.jsp

                                    <h4><la:message key="labels.general_menu_system"/></h4>
                                    <div class="form-group row">
                                        <span class="font-weight-bold col-sm-3 text-sm-right col-form-label"><la:message
                                                key="labels.web_api_json_enabled"/></span>
                                        <div class="form-inline col-sm-9">
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Mon Jan 16 12:54:35 UTC 2023
    - 39.4K bytes
    - Viewed (0)
  7. docs/metrics/prometheus/grafana/bucket/minio-bucket.json

                  "options": "S3 Errors"
                },
                "properties": [
                  {
                    "id": "color",
                    "value": {
                      "fixedColor": "light-red",
                      "mode": "fixed"
                    }
                  }
                ]
              },
              {
                "matcher": {
                  "id": "byName",
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri May 24 11:11:51 UTC 2024
    - 101.8K bytes
    - Viewed (0)
  8. src/main/webapp/WEB-INF/view/admin/searchlist/admin_searchlist_edit.jsp

                                            <label class="col-sm-3 text-sm-right col-form-label">_id</label>
                                            <div class="col-sm-9">${f:h(id)}</div>
                                        </div>
                                        <div class="form-group row">
                                            <label for="doc.doc_id" class="col-sm-3 text-sm-right col-form-label">doc_id</label>
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Feb 13 07:47:04 UTC 2020
    - 24.9K bytes
    - Viewed (0)
  9. src/main/webapp/WEB-INF/view/admin/fileconfig/admin_fileconfig_edit.jsp

                                    </div>
                                    <div class="form-group row">
                                        <label for="name" class="col-sm-3 text-sm-right col-form-label"><la:message
                                                key="labels.name"/></label>
                                        <div class="col-sm-9">
                                            <la:errors property="name"/>
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Feb 13 07:47:04 UTC 2020
    - 15.3K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/TreeMultiset.java

          successor(pred(), succ());
          if (left == null) {
            return right;
          } else if (right == null) {
            return left;
          } else if (left.height >= right.height) {
            AvlNode<E> newTop = pred();
            // newTop is the maximum node in my left subtree
            newTop.left = left.removeMax(newTop);
            newTop.right = right;
            newTop.distinctElements = distinctElements - 1;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 34.1K bytes
    - Viewed (0)
Back to top