Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for test_putAll (0.07 sec)

  1. src/test/java/org/codelibs/fess/entity/DataStoreParamsTest.java

            assertTrue(dataStoreParams.containsKey("key1"));
    
            dataStoreParams.put("key2", null);
            assertTrue(dataStoreParams.containsKey("key2"));
        }
    
        // Test putAll
        public void test_putAll() {
            Map<String, String> map = new HashMap<>();
            map.put("key1", "value1");
            map.put("key2", "value2");
            map.put("key3", "value3");
    
            dataStoreParams.putAll(map);
    
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 10.5K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/hash/BloomFilterTest.java

            boolean mightContain = bf.mightContain(value);
            boolean put = bf.put(value);
            assertTrue(mightContain != put);
          }
        }
      }
    
      public void testPutAll() {
        int element1 = 1;
        int element2 = 2;
    
        BloomFilter<Integer> bf1 = BloomFilter.create(Funnels.integerFunnel(), 100);
        bf1.put(element1);
        assertTrue(bf1.mightContain(element1));
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 22K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/hash/BloomFilterTest.java

            boolean mightContain = bf.mightContain(value);
            boolean put = bf.put(value);
            assertTrue(mightContain != put);
          }
        }
      }
    
      public void testPutAll() {
        int element1 = 1;
        int element2 = 2;
    
        BloomFilter<Integer> bf1 = BloomFilter.create(Funnels.integerFunnel(), 100);
        bf1.put(element1);
        assertTrue(bf1.mightContain(element1));
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 22K bytes
    - Viewed (0)
Back to top