Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 111 - 120 of 170 for Overflow (0.06 seconds)

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

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

        StatsAccumulator accumulator = new StatsAccumulator();
        accumulator.add(ONE_VALUE);
        for (int power = 1; power < Long.SIZE - 1; power++) {
          accumulator.addAll(accumulator.snapshot());
        }
        // Should overflow without throwing.
        accumulator.addAll(accumulator.snapshot());
        assertThat(accumulator.count()).isLessThan(0L);
      }
    
      public void testMean() {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 05:21:26 GMT 2026
    - 37.1K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/collect/ImmutableList.java

        int hashCode = 1;
        int n = size();
        for (int i = 0; i < n; i++) {
          hashCode = 31 * hashCode + get(i).hashCode();
    
          hashCode = ~~hashCode;
          // needed to deal with GWT integer overflow
        }
        return hashCode;
      }
    
      /*
       * Serializes ImmutableLists as their logical contents. This ensures that
       * implementation types do not leak into the serialized representation.
       */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 23 17:50:58 GMT 2025
    - 27.5K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

        i = 1 << 30;
        assertFalse(MinMaxPriorityQueue.isEvenLevel(i - 2));
        assertTrue(MinMaxPriorityQueue.isEvenLevel(i - 1));
        assertTrue(MinMaxPriorityQueue.isEvenLevel(i));
    
        // 1 << 31 is negative because of overflow, 1 << 31 - 1 is positive
        // since isEvenLevel adds 1, we need to do - 2.
        assertTrue(MinMaxPriorityQueue.isEvenLevel((1 << 31) - 2));
        assertTrue(MinMaxPriorityQueue.isEvenLevel(Integer.MAX_VALUE - 1));
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 36.2K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/collect/Multiset.java

       * 1}, this method has the identical effect to {@link #add(Object)}. This method is functionally
       * equivalent (except in the case of overflow) to the call {@code
       * addAll(Collections.nCopies(element, occurrences))}, which would presumably perform much more
       * poorly.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 19.5K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/util/concurrent/ExecutionSequencer.java

             */
            Runnable localTask = requireNonNull(task);
            task = null;
            localTask.run();
            return;
          }
          // Executor called reentrantly! Make sure that further calls don't overflow stack. Further
          // reentrant calls will see that their current thread is the same as the one set in
          // latestTaskQueue, and queue rather than calling execute() directly.
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 23 01:35:55 GMT 2025
    - 22.1K bytes
    - Click Count (0)
  6. okhttp/src/jvmTest/kotlin/okhttp3/internal/http2/Http2Test.kt

        }
    
      private fun gzip(data: ByteArray): Buffer {
        val buffer = Buffer()
        GzipSink(buffer).buffer().write(data).close()
        return buffer
      }
    
      /** Create a sufficiently large header set to overflow INITIAL_MAX_FRAME_SIZE bytes.  */
      private fun largeHeaders(): List<Header> {
        val nameValues = arrayOfNulls<String>(32)
        val chars = CharArray(512)
        var i = 0
        while (i < nameValues.size) {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Wed Mar 19 19:25:20 GMT 2025
    - 28.1K bytes
    - Click Count (0)
  7. guava/src/com/google/common/collect/Multiset.java

       * 1}, this method has the identical effect to {@link #add(Object)}. This method is functionally
       * equivalent (except in the case of overflow) to the call {@code
       * addAll(Collections.nCopies(element, occurrences))}, which would presumably perform much more
       * poorly.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 20.9K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java

      }
    
      /** There's no reason for the queueSize to ever be more than maxSize + 1 */
      private static int capAtMaximumSize(int queueSize, int maximumSize) {
        return min(queueSize - 1, maximumSize) + 1; // don't overflow
      }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  9. src/test/java/jcifs/internal/smb2/ServerMessageBlock2Test.java

            void testLargeMidValue() {
                long largeMid = Long.MAX_VALUE;
                testMessage.setMid(largeMid);
                assertEquals(largeMid, testMessage.getMid());
    
                // HashCode should handle overflow correctly
                int hash = testMessage.hashCode();
                assertEquals((int) largeMid, hash);
            }
    
            @Test
            @DisplayName("Should handle negative status codes")
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 39.5K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/collect/Sets.java

          int adjust = size() - 1;
          for (int i = 0; i < axes.size(); i++) {
            adjust *= 31;
            adjust = ~~adjust;
            // in GWT, we have to deal with integer overflow carefully
          }
          int hash = 1;
          for (Set<E> axis : axes) {
            hash = 31 * hash + (size() / axis.size() * axis.hashCode());
    
            hash = ~~hash;
          }
          hash += adjust;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 81.4K bytes
    - Click Count (0)
Back to Top