Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 40 of 2,281 for size (0.02 sec)

  1. compat/maven-settings-builder/src/test/java/org/apache/maven/settings/validation/DefaultSettingsValidatorTest.java

            validator.validate(model, problems);
            assertEquals(0, problems.messages.size());
    
            Repository repo = new Repository(org.apache.maven.api.settings.Repository.newInstance(false));
            prof.addRepository(repo);
            problems = new SimpleProblemCollector();
            validator.validate(model, problems);
            assertEquals(2, problems.messages.size());
    
            repo.setUrl("http://xxx.xxx.com");
    Registered: 2024-11-03 03:35
    - Last Modified: 2024-10-25 12:31
    - 8.6K bytes
    - Viewed (0)
  2. android/guava-tests/benchmark/com/google/common/base/StringsRepeatBenchmark.java

        final int len = string.length();
        final int size = len * count;
        final char[] array = new char[size];
        string.getChars(0, len, array, 0);
        int n;
        for (n = len; n < size - n; n <<= 1) {
          System.arraycopy(array, 0, array, n, n);
        }
        System.arraycopy(array, 0, array, n, size - n);
        return new String(array);
      }
    Registered: 2024-11-01 12:43
    - Last Modified: 2021-09-17 20:24
    - 3.3K bytes
    - Viewed (0)
  3. guava-tests/benchmark/com/google/common/collect/SortedCopyBenchmark.java

      @BeforeExperiment
      void setUp() {
        checkArgument(size > 0, "empty collection not supported");
        Set<Integer> set = new LinkedHashSet<>(size);
    
        Random random = new Random();
        while (set.size() < size) {
          set.add(random.nextInt());
        }
        List<Integer> list = new ArrayList<>(set);
        inputOrder.arrange(list);
        input = ImmutableList.copyOf(list);
      }
    
      @Benchmark
      int collections(int reps) {
    Registered: 2024-11-01 12:43
    - Last Modified: 2024-10-30 16:15
    - 3.5K bytes
    - Viewed (0)
  4. android/guava-tests/test/com/google/common/io/MoreFilesTest.java

          MoreFiles.asCharSink(fooCopy, UTF_8).write("boo");
          assertThat(MoreFiles.asByteSource(fooPath).size())
              .isEqualTo(MoreFiles.asByteSource(fooCopy).size());
          assertThat(MoreFiles.equal(fooPath, fooCopy)).isFalse();
    
          // should also assert that a Path that erroneously reports a size 0 can still be compared,
          // not sure how to do that with the Path API
        }
      }
    
    Registered: 2024-11-01 12:43
    - Last Modified: 2024-10-31 16:07
    - 26.5K bytes
    - Viewed (0)
  5. cmd/data-usage-cache.go

    		}
    		root.merge(e)
    	}
    	root.Children = nil
    	return root
    }
    
    // add a size to the histogram.
    func (h *sizeHistogram) add(size int64) {
    	// Fetch the histogram interval corresponding
    	// to the passed object size.
    	for i, interval := range ObjectsHistogramIntervals[:] {
    		if size >= interval.start && size <= interval.end {
    			h[i]++
    			break
    		}
    	}
    }
    
    Registered: 2024-11-03 19:28
    - Last Modified: 2024-10-22 15:30
    - 34.7K bytes
    - Viewed (0)
  6. android/guava-tests/benchmark/com/google/common/collect/MultisetIteratorBenchmark.java

      @Param({"0", "1", "16", "256", "4096", "65536"})
      int size;
    
      LinkedHashMultiset<Object> linkedHashMultiset;
      HashMultiset<Object> hashMultiset;
    
      // TreeMultiset requires a Comparable element.
      TreeMultiset<Integer> treeMultiset;
    
      @BeforeExperiment
      void setUp() {
        hashMultiset = HashMultiset.create(size);
        linkedHashMultiset = LinkedHashMultiset.create(size);
        treeMultiset = TreeMultiset.create();
    
    Registered: 2024-11-01 12:43
    - Last Modified: 2024-10-18 20:24
    - 2.7K bytes
    - Viewed (0)
  7. guava-tests/benchmark/com/google/common/collect/MultisetIteratorBenchmark.java

      @Param({"0", "1", "16", "256", "4096", "65536"})
      int size;
    
      LinkedHashMultiset<Object> linkedHashMultiset;
      HashMultiset<Object> hashMultiset;
    
      // TreeMultiset requires a Comparable element.
      TreeMultiset<Integer> treeMultiset;
    
      @BeforeExperiment
      void setUp() {
        hashMultiset = HashMultiset.create(size);
        linkedHashMultiset = LinkedHashMultiset.create(size);
        treeMultiset = TreeMultiset.create();
    
    Registered: 2024-11-01 12:43
    - Last Modified: 2024-10-18 20:24
    - 2.7K bytes
    - Viewed (0)
  8. fess-crawler/src/test/java/org/codelibs/fess/crawler/filter/impl/CustomUrlFilterImplTest.java

        public void test_include_processUrl() {
            assertEquals(0, includeFilter.cachedIncludeSet.size());
            assertEquals(0, includeFilter.cachedExcludeSet.size());
    
            includeFilter.processUrl("http://example.com/");
    
            assertEquals(1, includeFilter.cachedIncludeSet.size());
            assertEquals(0, includeFilter.cachedExcludeSet.size());
            assertEquals("http://example.com/.*", includeFilter.cachedIncludeSet.toArray()[0]);
    
    Registered: 2024-11-10 03:50
    - Last Modified: 2024-02-22 01:36
    - 4.3K bytes
    - Viewed (0)
  9. guava-tests/benchmark/com/google/common/collect/IteratorBenchmark.java

      @Param({"0", "1", "16", "256", "4096", "65536"})
      int size;
    
      // use concrete classes to remove any possible polymorphic overhead?
      Object[] array;
      ArrayList<Object> arrayList;
      LinkedList<Object> linkedList;
    
      @BeforeExperiment
      void setUp() {
        array = new Object[size];
        arrayList = Lists.newArrayListWithCapacity(size);
        linkedList = Lists.newLinkedList();
    
    Registered: 2024-11-01 12:43
    - Last Modified: 2017-12-04 17:37
    - 4.1K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/RegularImmutableBiMap.java

      RegularImmutableBiMap(@Nullable Object[] alternatingKeysAndValues, int size) {
        this.alternatingKeysAndValues = alternatingKeysAndValues;
        this.size = size;
        this.keyOffset = 0;
        int tableSize = (size >= 2) ? ImmutableSet.chooseTableSize(size) : 0;
        this.keyHashTable =
            RegularImmutableMap.createHashTableOrThrow(alternatingKeysAndValues, size, tableSize, 0);
        Object valueHashTable =
    Registered: 2024-11-01 12:43
    - Last Modified: 2023-11-30 21:54
    - 4.3K bytes
    - Viewed (0)
Back to top