Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 101 - 110 of 782 for chile (0.02 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. android/guava/src/com/google/common/base/internal/Finalizer.java

    import java.util.logging.Logger;
    import org.jspecify.annotations.Nullable;
    
    /**
     * Thread that finalizes referents. All references should implement {@code
     * com.google.common.base.FinalizableReference}.
     *
     * <p>While this class is public, we consider it to be *internal* and not part of our published API.
     * It is public so we can access it reflectively across class loaders in secure environments.
     *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 9.3K bytes
    - Click Count (0)
  2. impl/maven-core/src/main/java/org/apache/maven/project/DefaultProjectDependenciesResolver.java

            }
    
            depRequest.setRoot(node);
    
            if (logger.isWarnEnabled()) {
                for (DependencyNode child : node.getChildren()) {
                    if (!child.getRelocations().isEmpty()) {
                        org.eclipse.aether.artifact.Artifact artifact =
                                child.getDependency().getArtifact();
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Wed Jul 23 10:13:56 GMT 2025
    - 9.2K bytes
    - Click Count (0)
  3. guava/src/com/google/common/collect/Queues.java

       * @param numElements the number of elements to be waited for
       * @param timeout how long to wait before giving up
       * @return the number of elements transferred
       * @throws InterruptedException if interrupted while waiting
       * @since 28.0 (but only since 33.4.0 in the Android flavor)
       */
      @CanIgnoreReturnValue
      @J2ktIncompatible
      @GwtIncompatible // BlockingQueue
      public static <E> int drain(
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Nov 04 17:24:58 GMT 2025
    - 18K bytes
    - Click Count (0)
  4. docs/en/docs/async.md

    <img src="/img/async/concurrent-burgers/concurrent-burgers-04.png" class="illustration">
    
    While you are waiting, you go with your crush and pick a table, you sit and talk with your crush for a long time (as your burgers are very fancy and take some time to prepare).
    
    As you are sitting at the table with your crush, while you wait for the burgers, you can spend that time admiring how awesome, cute and smart your crush is ✨😍✨.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sun Aug 31 09:56:21 GMT 2025
    - 24K bytes
    - Click Count (0)
  5. okhttp-testing-support/src/main/kotlin/okhttp3/internal/concurrent/TaskFaker.kt

     * deterministic.
     *
     * This class ensures that at most one thread is running at a time. This is initially the JUnit test
     * thread, which yields its execution privilege while calling [runTasks], [runNextTask], or
     * [advanceUntil]. These functions don't return until the task threads are all idle.
     *
     * Task threads release their execution privilege in these ways:
     *
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Wed May 28 23:28:25 GMT 2025
    - 11.9K bytes
    - Click Count (0)
  6. guava/src/com/google/common/collect/Iterators.java

        long count = 0L;
        while (iterator.hasNext()) {
          iterator.next();
          count++;
        }
        return Ints.saturatedCast(count);
      }
    
      /** Returns {@code true} if {@code iterator} contains {@code element}. */
      public static boolean contains(Iterator<?> iterator, @Nullable Object element) {
        if (element == null) {
          while (iterator.hasNext()) {
            if (iterator.next() == null) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Sep 16 12:42:11 GMT 2025
    - 51.4K bytes
    - Click Count (0)
  7. guava/src/com/google/common/io/ByteStreams.java

            position += copied;
            sourceChannel.position(position);
          } while (copied > 0 || position < sourceChannel.size());
          return position - oldPosition;
        }
    
        ByteBuffer buf = ByteBuffer.wrap(createBuffer());
        long total = 0;
        while (from.read(buf) != -1) {
          Java8Compatibility.flip(buf);
          while (buf.hasRemaining()) {
            total += to.write(buf);
          }
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Jul 17 15:26:41 GMT 2025
    - 31.1K bytes
    - Click Count (0)
  8. buildscripts/verify-healing-with-root-disks.sh

    	done
    
    	for i in $(seq 1 4); do
    		"${MINIO[@]}" --address ":$((start_port + i))" ${args[@]} 2>&1 >"${WORK_DIR}/server$i.log" &
    	done
    
    	# Wait until all nodes return 403
    	for i in $(seq 1 4); do
    		while [ "$(curl -m 1 -s -o /dev/null -w "%{http_code}" http://localhost:$((start_port + i)))" -ne "403" ]; do
    			echo -n "."
    			sleep 1
    		done
    	done
    
    }
    
    # Prepare fake disks with losetup
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri May 26 05:07:25 GMT 2023
    - 2.2K bytes
    - Click Count (0)
  9. buildscripts/verify-healing-empty-erasure-set.sh

    	while [ $(/tmp/mc admin info --json myminio | jq '.info.servers[].drives[].state | select(. != "ok")' | wc -l) -gt 0 ]; do sleep 1; done
    	# Wait for all drives to be healed
    	while [ $(/tmp/mc admin info --json myminio | jq '.info.servers[].drives[].healing | select(. != null) | select(. == true)' | wc -l) -gt 0 ]; do sleep 1; done
    
    	# Wait for Status: in MinIO output
    	while true; do
    		rv=$(check_online)
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Jul 12 20:51:54 GMT 2024
    - 3.7K bytes
    - Click Count (0)
  10. android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

            double partition = array[from + 1]; // Choose partitioning element.
            while (true) {
              // Skip the elements smaller than the partition.
              do {
                low++;
              } while (array[low] < partition);
    
              // Skip the elements larger than the partition.
              do {
                high--;
              } while (array[high] > partition);
              if (high < low) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 7.1K bytes
    - Click Count (0)
Back to Top