Search Options

Results per page
Sort
Preferred Languages
Advance

Results 101 - 110 of 699 for ptwo (0.04 sec)

  1. guava/src/com/google/common/math/PairedStatsAccumulator.java

      public void add(double x, double y) {
        // We extend the recursive expression for the one-variable case at Art of Computer Programming
        // vol. 2, Knuth, 4.2.2, (16) to the two-variable case. We have two value series x_i and y_i.
        // We define the arithmetic means X_n = 1/n \sum_{i=1}^n x_i, and Y_n = 1/n \sum_{i=1}^n y_i.
        // We also define the sum of the products of the differences from the means
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri May 12 17:02:53 UTC 2023
    - 10.3K bytes
    - Viewed (0)
  2. android/guava-testlib/test/com/google/common/collect/testing/ReserializedSafeTreeMapMapInterfaceTest.java

        super(false, true, true, true, true);
      }
    
      @Override
      protected SortedMap<String, Integer> makePopulatedMap() {
        NavigableMap<String, Integer> map = new SafeTreeMap<>();
        map.put("one", 1);
        map.put("two", 2);
        map.put("three", 3);
        return SerializableTester.reserialize(map);
      }
    
      @Override
      protected SortedMap<String, Integer> makeEmptyMap() throws UnsupportedOperationException {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Mar 18 18:06:40 UTC 2022
    - 1.7K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/collect/UnmodifiableRowSortedTableRowTest.java

      }
    
      @Override
      protected Map<String, Integer> makePopulatedMap() {
        RowSortedTable<Character, String, Integer> table = TreeBasedTable.create();
        table.put('a', "one", 1);
        table.put('a', "two", 2);
        table.put('a', "three", 3);
        table.put('b', "four", 4);
        return unmodifiableRowSortedTable(table).row('a');
      }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 1.5K bytes
    - Viewed (0)
  4. android/guava-tests/test/com/google/common/io/LineBufferTest.java

        bufferHelper("\r\r", "\r", "\r");
        bufferHelper("\ra\r\n\n\r\r", "\r", "a\r\n", "\n", "\r", "\r");
        bufferHelper("no newlines at all", "no newlines at all");
        bufferHelper("two lines\nbut no newline at end", "two lines\n", "but no newline at end");
        bufferHelper(
            "\nempty first line\nno newline at end", "\n", "empty first line\n", "no newline at end");
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 4.8K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/io/LineBufferTest.java

        bufferHelper("\r\r", "\r", "\r");
        bufferHelper("\ra\r\n\n\r\r", "\r", "a\r\n", "\n", "\r", "\r");
        bufferHelper("no newlines at all", "no newlines at all");
        bufferHelper("two lines\nbut no newline at end", "two lines\n", "but no newline at end");
        bufferHelper(
            "\nempty first line\nno newline at end", "\n", "empty first line\n", "no newline at end");
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 4.8K bytes
    - Viewed (0)
  6. okhttp-android/src/main/kotlin/okhttp3/android/AndroidAsyncDns.kt

    import okhttp3.AsyncDns
    import okhttp3.ExperimentalOkHttpApi
    
    /**
     * DNS implementation based on android.net.DnsResolver, which submits a request for
     * A or AAAA records, and returns the addresses or exception.
     *
     * Two instances must be used to get all results for an address.
     *
     * @param network network to use, if not selects the default network.
     */
    @RequiresApi(Build.VERSION_CODES.Q)
    @ExperimentalOkHttpApi
    class AndroidAsyncDns(
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Apr 01 10:07:48 UTC 2024
    - 2.8K bytes
    - Viewed (0)
  7. architecture/standards/0003-avoid-introducing-Groovy-types-to-public-api.md

    To keep the Groovy DSL ergonomic, we generate methods as necessary from the non-Groovy equivalents.
    
    Doing this provides the following specific benefits:
    - **Reduce the API surface** - We no longer need to maintain two methods.
    - **Consistency** - All languages have consistent access to the same APIs and ergonomics in the DSL.
    Registered: Wed Nov 06 11:36:14 UTC 2024
    - Last Modified: Sun Mar 10 20:38:06 UTC 2024
    - 1.8K bytes
    - Viewed (0)
  8. build-logic-commons/gradle-plugin/src/main/kotlin/gradlebuild/AbstractBuildScanInfoCollectingService.kt

    import java.io.Serializable
    
    /**
     * A BuildService which monitors a few tasks (in both build-logic and main build) and collects information for build scan.
     * It's currently implemented by two use cases:
     * 1. Collect cache misses for compilation tasks and publish a `CACHE_MISS` tag for build scan.
    Registered: Wed Nov 06 11:36:14 UTC 2024
    - Last Modified: Thu Aug 11 07:01:27 UTC 2022
    - 2.3K bytes
    - Viewed (0)
  9. guava-testlib/test/com/google/common/testing/TearDownStackTest.java

        stack.addTearDown(tearDownTwo);
    
        assertEquals(false, tearDownOne.ran);
        assertEquals(false, tearDownTwo.ran);
    
        try {
          stack.runTearDown();
          fail("runTearDown should have thrown an exception");
        } catch (ClusterException expected) {
          assertThat(expected).hasCauseThat().hasMessageThat().isEqualTo("two");
        } catch (RuntimeException e) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Jun 21 10:19:29 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  10. guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

        // the whole array.
        int from = 0;
        int to = array.length - 1;
    
        while (true) {
          if (to <= from + 1) {
            // Two or less elements left.
            if (to == from + 1 && array[to] < array[from]) {
              // Exactly two elements left.
              swap(array, from, to);
            }
            return array[k];
          } else {
            int midIndex = (from + to) >>> 1;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Feb 01 16:30:37 UTC 2022
    - 7.1K bytes
    - Viewed (0)
Back to top