Search Options

Results per page
Sort
Preferred Languages
Advance

Results 141 - 150 of 208 for rete (0.04 sec)

  1. guava-tests/test/com/google/common/math/QuantilesTest.java

    import java.util.Random;
    import junit.framework.TestCase;
    import org.jspecify.annotations.NullUnmarked;
    import org.jspecify.annotations.Nullable;
    
    /**
     * Tests for {@link Quantiles}.
     *
     * @author Pete Gillin
     */
    @NullUnmarked
    public class QuantilesTest extends TestCase {
    
      /*
       * Since Quantiles provides a fluent-style API, each test covers a chain of methods resulting in
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 29.8K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt

    solid glass; there was nothing on it except a tiny golden key,
    and Alice's first thought was that it might belong to one of the
    doors of the hall; but, alas! either the locks were too large, or
    the key was too small, but at any rate it would not open any of
    them.  However, on the second time round, she came upon a low
    curtain she had not noticed before, and behind it was a little
    door about fifteen inches high:  she tried the little golden key
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Apr 21 02:27:51 UTC 2017
    - 145.2K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/math/StatsAccumulator.java

    /**
     * A mutable object which accumulates double values and tracks some basic statistics over all the
     * values added so far. The values may be added singly or in groups. This class is not thread safe.
     *
     * @author Pete Gillin
     * @author Kevin Bourrillion
     * @since 20.0
     */
    @J2ktIncompatible
    @GwtIncompatible
    public final class StatsAccumulator {
      /** Creates a new accumulator. */
      public StatsAccumulator() {}
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Apr 14 16:36:11 UTC 2025
    - 15.8K bytes
    - Viewed (0)
  4. docs/pt/docs/tutorial/dependencies/dependencies-with-yield.md

    Ainda assim, como isso exigiria esperar que a resposta navegasse pela rede enquanto mantia ativo um recurso desnecessário na dependência com yield (por exemplo, uma conexão com banco de dados), isso mudou na versão 0.106.0 do FastAPI.
    
    /// tip | Dica
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 14.8K bytes
    - Viewed (0)
  5. src/cmd/asm/internal/asm/testdata/arm64enc.s

    	//TODO PRFM (R27)(R30.SXTW<<3), PLDL2STRM  // 63dbbff8
    	//TODO PRFUM 22(R16), PSTL1KEEP            // 106281f8
    	RBITW R9, R22                              // 3601c05a
    	RBIT R11, R4                               // 6401c0da
    	RET                                        // c0035fd6
    	REVW R8, R10                               // 0a09c05a
    	REV R1, R2                                 // 220cc0da
    	REV16W R21, R19                            // b306c05a
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Jul 24 01:11:41 UTC 2023
    - 43.9K bytes
    - Viewed (0)
  6. docs/de/docs/tutorial/dependencies/dependencies-with-yield.md

    Nur der Code vor und einschließlich der `yield`-Anweisung wird ausgeführt, bevor eine Response erzeugt wird:
    
    {* ../../docs_src/dependencies/tutorial007.py hl[2:4] *}
    
    Der ge`yield`ete Wert ist das, was in *Pfadoperationen* und andere Abhängigkeiten eingefügt wird:
    
    {* ../../docs_src/dependencies/tutorial007.py hl[4] *}
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 12.2K bytes
    - Viewed (0)
  7. src/cmd/asm/internal/asm/testdata/arm.s

    //
    // PLD
    //
    //	LTYPEPLD oreg
    //	{
    //		outcode($1, Always, &$2, 0, &nullgen);
    //	}
    	PLD	(R1)
    	PLD	4(R1)
    
    //
    // RET
    //
    //	LTYPEA cond
    //	{
    //		outcode($1, $2, &nullgen, 0, &nullgen);
    //	}
    	BEQ	2(PC)
    	RET
    
    // More B/BL cases, and canonical names JMP, CALL.
    
    	BEQ	2(PC)
    	B	foo(SB) // JMP foo(SB)
    	BL	foo(SB) // CALL foo(SB)
    	BEQ	2(PC)
    	JMP	foo(SB)
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Dec 15 20:51:01 UTC 2023
    - 69K bytes
    - Viewed (0)
  8. CHANGELOG/CHANGELOG-1.2.md

    * update expose command description to add deployment ([#23246](https://github.com/kubernetes/kubernetes/pull/23246), [@AdoHe](https://github.com/AdoHe))
    * Add a rate limiter to the GCE cloudprovider ([#23019](https://github.com/kubernetes/kubernetes/pull/23019), [@alex-mohr](https://github.com/alex-mohr))
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Fri Dec 04 06:36:19 UTC 2020
    - 41.4K bytes
    - Viewed (0)
  9. guava-tests/test/com/google/common/hash/HashTestUtils.java

              assertThat(prob).isWithin(epsilon).of(0.50d);
            }
          }
        }
      }
    
      /**
       * Checks that a Hasher returns the same HashCode when given the same input, and also that the
       * collision rate looks sane.
       */
      static void assertInvariants(HashFunction hashFunction) {
        int objects = 100;
        Set<HashCode> hashcodes = Sets.newHashSetWithExpectedSize(objects);
        Random random = new Random(314159);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 25.6K bytes
    - Viewed (0)
  10. cmd/object-api-errors.go

    }
    
    // SlowDown  too many file descriptors open or backend busy .
    type SlowDown struct{}
    
    func (e SlowDown) Error() string {
    	return "Please reduce your request rate"
    }
    
    // RQErrType reason for read quorum error.
    type RQErrType int
    
    const (
    	// RQInsufficientOnlineDrives - not enough online drives.
    	RQInsufficientOnlineDrives RQErrType = 1 << iota
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 09 02:05:14 UTC 2024
    - 22.1K bytes
    - Viewed (0)
Back to top