accessModes: [ {{ $accessMode | quote }} ] {{- if $storageClass }} storageClassName: {{ $storageClass }} {{- end }} resources: requests: storage: {{ $psize }} {{- end }} {{- else }} - metadata: name: export spec: accessModes: [ {{ $accessMode | quote }} ] {{- if $storageClass }} storageClassName: {{ $storageClass }} {{- end }} resources: requests: storage: {{ $psize }} {{- end }} {{- end }} {{- end }} minio/.helmignore # Patterns to ignore when building packages. # This supports shell glob matching, relative...

accessModes: [ {{ $accessMode | quote }} ] {{- if $storageClass }} storageClassName: {{ $storageClass }} {{- end }} resources: requests: storage: {{ $psize }} {{- end }} {{- else }} - metadata: name: export spec: accessModes: [ {{ $accessMode | quote }} ] {{- if $storageClass }} storageClassName: {{ $storageClass }} {{- end }} resources: requests: storage: {{ $psize }} {{- end }} {{- end }} {{- end }} minio/.helmignore # Patterns to ignore when building packages. # This supports shell glob matching, relative...

    assertEquals(1, partition(list, Integer.MAX_VALUE).size());
    assertEquals(1, partition(list, Integer.MAX_VALUE - 1).size());
  }

  @GwtIncompatible // cannot do such a big explicit copy
  @J2ktIncompatible // too slow
  public void testPartitionSize_2() {
    assertEquals(2, partition(nCopies(0x40000001, 1), 0x40000000).size());
  }

    /**
     * Test getInitialSize() returns the correct size.
     */
    @Test
    void testGetInitialSize() {
        long expectedSize = 1024L;
        when(smbFileHandle.getInitialSize()).thenReturn(expectedSize);
        long actualSize = smbFileHandle.getInitialSize();
        assertEquals(expectedSize, actualSize, "getInitialSize should return the correct initial file size.");
        verify(smbFileHandle, times(1)).getInitialSize();

    multiset.add("bar");
    assertEquals(3, multiset.size());
    assertEquals(2, multiset.count("foo"));
    assertEquals("[foo x 2, bar]", multiset.toString());
  }

  public void testCreateWithSize() {
    Multiset<String> multiset = LinkedHashMultiset.create(50);
    multiset.add("foo", 2);
    multiset.add("bar");
    assertEquals(3, multiset.size());
    assertEquals(2, multiset.count("foo"));

                createDefaultReadingConverter(), createDefaultReadingConverter(), createDefaultNormalizer(), analyzer);

        assertNotNull(items);
        assertTrue(items.size() > 0);
        for (SuggestItem item : items) {
            assertEquals(SuggestItem.Kind.DOCUMENT, item.getKinds()[0]);
            assertEquals(1, item.getDocFreq());
        }
    }

    @Test

        } catch (ChildUrlsException e) {
            // Expected exception
            Set<RequestData> childUrls = e.getChildUrlList();
            assertNotNull(childUrls);
            assertEquals(1, childUrls.size());

            RequestData requestData = childUrls.iterator().next();
            assertEquals("https://example.com/page1", requestData.getUrl());
        }
    }

    assertEquals(
        "Modifying the builder should not have changed any already built sets",
        216,
        webSafeColors.size());
    assertEquals("the new array should be one bigger than webSafeColors", 217, addedColor.size());
    Integer[] appendColorArray = addedColor.toArray(new Integer[addedColor.size()]);
    assertEquals(0x00BFFF, (int) appendColorArray[216]);
  }

  public void testBuilderAddHandlesNullsCorrectly() {

                        : targetName.toUpperCase().getBytes(getOEMEncoding());
                size += targetBytes.length;
            } else {
                flags &= 0xffffffff ^ NTLMSSP_REQUEST_TARGET;
            }
        }

        if (targetInformationBytes != null) {
            size += targetInformationBytes.length;
            flags |= NTLMSSP_NEGOTIATE_TARGET_INFO;
        }

          List<? extends E> list,
          int foundIndex) {
        // Of course, we have to use binary search to find the precise
        // breakpoint...
        int lower = foundIndex;
        int upper = list.size() - 1;
        // Everything between lower and upper inclusive compares at >= 0.
        while (lower < upper) {
          int middle = (lower + upper + 1) >>> 1;
          int c = comparator.compare(list.get(middle), key);