Search Options

Results per page
Sort
Preferred Languages
Advance

Results 181 - 190 of 377 for love (0.04 sec)

  1. compat/maven-plugin-api/src/main/java/org/apache/maven/plugin/descriptor/PluginDescriptor.java

        }
    
        public static String getDefaultPluginGroupId() {
            return "org.apache.maven.plugins";
        }
    
        /**
         * Parse maven-...-plugin.
         *
         * TODO move to plugin-tools-api as a default only
         */
        public static String getGoalPrefixFromArtifactId(String artifactId) {
            if ("maven-plugin-plugin".equals(artifactId)) {
                return "plugin";
            } else {
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 16.2K bytes
    - Viewed (0)
  2. okhttp/src/main/kotlin/okhttp3/internal/-HostnamesCommon.kt

        address[b++] = (value.ushr(8) and 0xff).toByte()
        address[b++] = (value and 0xff).toByte()
      }
    
      // All done. If compression happened, we need to move bytes to the right place in the
      // address. Here's a sample:
      //
      //      input: "1111:2222:3333::7777:8888"
      //     before: { 11, 11, 22, 22, 33, 33, 00, 00, 77, 77, 88, 88, 00, 00, 00, 00  }
      //   compress: 6
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 11.2K bytes
    - Viewed (0)
  3. cmd/erasure-decode.go

    	p.readers = tmp
    	// next is the next non-preferred index.
    	next := 0
    	for i, ok := range prefer {
    		if !ok || p.readers[i] == nil {
    			continue
    		}
    		if i == next {
    			next++
    			continue
    		}
    		// Move reader with index i to index next.
    		// Do this by swapping next and i
    		p.readers[next], p.readers[i] = p.readers[i], p.readers[next]
    		p.readerToBuf[next] = i
    		p.readerToBuf[i] = next
    		next++
    	}
    }
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 29 01:40:52 UTC 2024
    - 9.5K bytes
    - Viewed (0)
  4. tensorflow/c/eager/dlpack.cc

        return nullptr;
      }
      TF_DataType dtype;
      absl::Status s = TfDataTypeFormDlDataType(dl_tensor->dtype, &dtype);
      if (!s.ok()) {
        status->status = std::move(s);
        return nullptr;
      }
      int num_dims = dl_tensor->ndim;
      const int64_t* dims = dl_tensor->shape;
      void* data = dl_tensor->data;
    
      if (dl_tensor->byte_offset != 0) {
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 12.9K bytes
    - Viewed (0)
  5. cmd/erasure-metadata-utils.go

    			continue
    		}
    		if meta.XLV1 != fi.XLV1 {
    			inconsistent++
    			continue
    		}
    		// check if erasure distribution order matches the index
    		// position if this is not correct we discard the disk
    		// and move to collect others
    		if distribution[i] != meta.Erasure.Index {
    			inconsistent++ // keep track of inconsistent entries
    			continue
    		}
    		shuffledDisks[meta.Erasure.Index-1] = disks[i]
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri May 24 23:05:23 UTC 2024
    - 11.7K bytes
    - Viewed (0)
  6. cmd/local-locker.go

    					modified = false
    					break
    				}
    				modified = true
    				// Remove the appropriate lock.
    				lris = append(lris[:i], lris[i+1:]...)
    				// Check same i
    			} else {
    				// Move to next
    				i++
    			}
    		}
    		if modified {
    			l.lockMap[k] = lris
    		}
    	}
    }
    
    func newLocker() *localLocker {
    	return &localLocker{
    		lockMap: make(map[string][]lockRequesterInfo, 1000),
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Jul 24 10:24:01 UTC 2024
    - 10.7K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/primitives/UnsignedLongs.java

              new NumberFormatException("Error parsing value: " + stringValue);
          decodeException.initCause(e);
          throw decodeException;
        }
      }
    
      /*
       * We move the static constants into this class so ProGuard can inline UnsignedLongs entirely
       * unless the user is actually calling a parse method.
       */
      private static final class ParseOverflowDetection {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 12 21:04:48 UTC 2024
    - 17.6K bytes
    - Viewed (0)
  8. docs/en/docs/tutorial/first-steps.md

    # First Steps
    
    The simplest FastAPI file could look like this:
    
    {* ../../docs_src/first_steps/tutorial001.py *}
    
    Copy that to a file `main.py`.
    
    Run the live server:
    
    <div class="termy">
    
    ```console
    $ <font color="#4E9A06">fastapi</font> dev <u style="text-decoration-style:single">main.py</u>
    <font color="#3465A4">INFO    </font> Using path <font color="#3465A4">main.py</font>
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sat Oct 26 11:48:16 UTC 2024
    - 11.8K bytes
    - Viewed (0)
  9. tensorflow/c/eager/c_api_unified_experimental_graph.cc

                                       graph_outputs.size(), graph_outputs.data(),
                                       nullptr, nullptr, name_.data(), s);
        *f = new GraphFunction(std::move(func->record->fdef()));
        TF_DeleteFunction(func);
        TF_RETURN_IF_ERROR(StatusFromTF_Status(s));
        TF_DeleteStatus(s);
        return absl::OkStatus();
      }
    
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 15.7K bytes
    - Viewed (0)
  10. guava/src/com/google/common/cache/LocalCache.java

         * comments.
         */
    
        @Weak final LocalCache<K, V> map;
    
        /** The number of live elements in this segment's region. */
        volatile int count;
    
        /** The weight of the live elements in this segment's region. */
        @GuardedBy("this")
        long totalWeight;
    
        /**
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 19:07:49 UTC 2024
    - 149.2K bytes
    - Viewed (0)
Back to top