Search Options

Results per page
Sort
Preferred Languages
Advance

Results 251 - 260 of 798 for NEXT (0.04 sec)

  1. guava/src/com/google/common/collect/EnumBiMap.java

        return getDeclaringClassOrObjectForJ2cl(map.keySet().iterator().next());
      }
    
      private static <V extends Enum<V>> Class<V> inferValueTypeOrObjectUnderJ2cl(Map<?, V> map) {
        if (map instanceof EnumBiMap) {
          return ((EnumBiMap<?, V>) map).valueTypeOrObjectUnderJ2cl;
        }
        checkArgument(!map.isEmpty());
        return getDeclaringClassOrObjectForJ2cl(map.values().iterator().next());
      }
    
      /** Returns the associated key type. */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Aug 24 01:40:03 UTC 2023
    - 6.3K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/collect/EnumBiMap.java

        return getDeclaringClassOrObjectForJ2cl(map.keySet().iterator().next());
      }
    
      private static <V extends Enum<V>> Class<V> inferValueTypeOrObjectUnderJ2cl(Map<?, V> map) {
        if (map instanceof EnumBiMap) {
          return ((EnumBiMap<?, V>) map).valueTypeOrObjectUnderJ2cl;
        }
        checkArgument(!map.isEmpty());
        return getDeclaringClassOrObjectForJ2cl(map.values().iterator().next());
      }
    
      /** Returns the associated key type. */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Aug 24 01:40:03 UTC 2023
    - 6.3K bytes
    - Viewed (0)
  3. src/bufio/bufio.go

    			return
    		}
    	}
    	b.err = io.ErrNoProgress
    }
    
    func (b *Reader) readErr() error {
    	err := b.err
    	b.err = nil
    	return err
    }
    
    // Peek returns the next n bytes without advancing the reader. The bytes stop
    // being valid at the next read call. If Peek returns fewer than n bytes, it
    // also returns an error explaining why the read is short. The error is
    // [ErrBufferFull] if n is larger than b's buffer size.
    //
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Oct 12 14:39:08 UTC 2023
    - 21.8K bytes
    - Viewed (0)
  4. src/main/webapp/WEB-INF/orig/view/searchResults.jsp

    				</li>
    			</c:forEach>
    			<c:if test="${existNextPage}">
    				<li class="page-item"><la:link styleClass="page-link" aria-label="Next"
    						href="/search/next?q=${f:u(q)}&pn=${f:u(currentPageNumber)}&num=${f:u(pageSize)}&sdh=${f:u(fe:sdh(sdh))}${fe:pagingQuery(null)}${fe:facetQuery()}${fe:geoQuery()}">
    						<span class="sr-only"><la:message key="labels.next_page" /></span>
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Jun 09 04:29:42 UTC 2022
    - 9K bytes
    - Viewed (0)
  5. android/guava-tests/test/com/google/common/collect/HashMultisetTest.java

        multiset.add(multiset, 2);
        Multiset<Multiset<?>> copy = SerializableTester.reserialize(multiset);
        assertEquals(2, copy.size());
        assertSame(copy, copy.iterator().next());
      }
    
      @J2ktIncompatible
      @GwtIncompatible // Only used by @GwtIncompatible code
      private static class MultisetHolder implements Serializable {
        public Multiset<?> member;
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 4.4K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/collect/SortedLists.java

       */
      enum KeyAbsentBehavior {
        /**
         * Return the index of the next lower element in the list, or {@code -1} if there is no such
         * element.
         */
        NEXT_LOWER {
          @Override
          int resultIndex(int higherIndex) {
            return higherIndex - 1;
          }
        },
        /**
         * Return the index of the next higher element in the list, or {@code list.size()} if there is
         * no such element.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 11K bytes
    - Viewed (0)
  7. guava-testlib/src/com/google/common/collect/testing/testers/MapPutTester.java

        assertThrows(
            ConcurrentModificationException.class,
            () -> {
              Iterator<Entry<K, V>> iterator = getMap().entrySet().iterator();
              put(e3());
              iterator.next();
            });
      }
    
      @MapFeature.Require({FAILS_FAST_ON_CONCURRENT_MODIFICATION, SUPPORTS_PUT})
      @CollectionSize.Require(absent = ZERO)
      public void testPutAbsentConcurrentWithKeySetIteration() {
        assertThrows(
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 9.1K bytes
    - Viewed (0)
  8. guava-tests/test/com/google/common/collect/TreeMultimapExplicitTest.java

        Entry<String, Collection<Integer>> entry = iterator.next();
        assertEquals(null, entry.getKey());
        assertThat(entry.getValue()).containsExactly(7, 3, 1);
        entry = iterator.next();
        assertEquals("tree", entry.getKey());
        assertThat(entry.getValue()).containsExactly(null, 0);
        entry = iterator.next();
        assertEquals("google", entry.getKey());
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 8.4K bytes
    - Viewed (0)
  9. guava-tests/test/com/google/common/collect/TreeMultimapNaturalTest.java

        Entry<String, Collection<Integer>> entry = iterator.next();
        assertEquals("foo", entry.getKey());
        assertThat(entry.getValue()).containsExactly(1, 3, 7);
        entry = iterator.next();
        assertEquals("google", entry.getKey());
        assertThat(entry.getValue()).containsExactly(2, 6);
        entry = iterator.next();
        assertEquals("tree", entry.getKey());
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 22.3K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/hash/Hashing.java

        LinearCongruentialGenerator generator = new LinearCongruentialGenerator(input);
        int candidate = 0;
        int next;
    
        // Jump from bucket to bucket until we go out of range
        while (true) {
          next = (int) ((candidate + 1) / generator.nextDouble());
          if (next >= 0 && next < buckets) {
            candidate = next;
          } else {
            return candidate;
          }
        }
      }
    
      /**
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Jul 19 16:02:36 UTC 2024
    - 29.3K bytes
    - Viewed (0)
Back to top