Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 938 for nexte (0.02 sec)

  1. android/guava-tests/test/com/google/common/eventbus/SubscriberRegistryTest.java

        assertEquals(o1, three.next().target);
        assertFalse(three.hasNext());
    
        three = registry.getSubscribers("");
    
        registry.unregister(s2);
    
        assertEquals(s1, three.next().target);
        assertEquals(s2, three.next().target);
        assertEquals(o1, three.next().target);
        assertFalse(three.hasNext());
    
        Iterator<Subscriber> two = registry.getSubscribers("");
        assertEquals(s1, two.next().target);
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 5.8K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/collect/AbstractBiMapTest.java

        bimap.put(1, "one");
        bimap.put(2, "two");
        bimap.put(3, "three");
        Iterator<Integer> iterator = bimap.keySet().iterator();
        iterator.next();
        iterator.next();
        iterator.remove();
        iterator.next();
        iterator.remove();
        assertEquals(1, bimap.size());
        assertEquals(1, bimap.inverse().size());
      }
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 2.3K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/collect/AbstractBiMapTest.java

        bimap.put(1, "one");
        bimap.put(2, "two");
        bimap.put(3, "three");
        Iterator<Integer> iterator = bimap.keySet().iterator();
        iterator.next();
        iterator.next();
        iterator.remove();
        iterator.next();
        iterator.remove();
        assertEquals(1, bimap.size());
        assertEquals(1, bimap.inverse().size());
      }
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 2.3K bytes
    - Viewed (0)
  4. src/main/java/jcifs/smb/NetServerEnumIterator.java

         */
        @Override
        public boolean hasNext() {
            return this.next != null;
        }
    
        /**
         * {@inheritDoc}
         *
         * @see java.util.Iterator#next()
         */
        @Override
        public FileEntry next() {
            final FileEntry n = this.next;
            try {
                final FileEntry ne = advance();
                if (ne == null) {
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 6.5K bytes
    - Viewed (0)
  5. guava/src/com/google/common/collect/Iterators.java

          @Override
          @ParametricNullness
          public T next() {
            T next = iterator.next();
            iterator.remove();
            return next;
          }
    
          @Override
          public String toString() {
            return "Iterators.consumingIterator(...)";
          }
        };
      }
    
      /**
       * Deletes and returns the next value from the iterator, or returns {@code null} if there is no
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 16 12:42:11 UTC 2025
    - 51.4K bytes
    - Viewed (0)
  6. src/cmd/asm/internal/lex/input.go

    	return len(in.ifdefStack) == 0 || in.ifdefStack[len(in.ifdefStack)-1]
    }
    
    func (in *Input) expectNewline(directive string) {
    	tok := in.Stack.Next()
    	if tok != '\n' {
    		in.expectText("expected newline after", directive)
    	}
    }
    
    func (in *Input) Next() ScanToken {
    	if in.peek {
    		in.peek = false
    		tok := in.peekToken
    		in.text = in.peekText
    		return tok
    	}
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Wed Nov 12 03:59:40 UTC 2025
    - 12.4K bytes
    - Viewed (0)
  7. api/README

    the new API. This helps with our end-of-cycle audit of new APIs.
    The same requirement applies to next/* (described below), which will
    become a go1.XX.txt for XX >= 19.
    
    The next/ directory contains the only files intended to be mutated.
    Each file in that directory contains a list of features that may be added
    to the next release of Go. The files in this directory only affect the
    warning output from the go api tool. Each file should be named
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Wed Jan 31 19:22:50 UTC 2024
    - 1.2K bytes
    - Viewed (0)
  8. internal/s3select/jstream/scanner.go

    // read next byte
    func (s *scanner) next() byte {
    	if s.pos >= atomic.LoadInt64(&s.end) {
    		return nullByte
    	}
    	s.ipos++
    
    	if s.ipos > s.ifill { // internal buffer is exhausted
    		s.ifill = <-s.fillReady
    
    		s.buf[0] = s.buf[len(s.buf)-1] // copy current last item to guarantee lookback
    		copy(s.buf[1:], s.nbuf[:])     // copy contents of pre-filled next buffer
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Mon Sep 23 19:35:41 UTC 2024
    - 2.5K bytes
    - Viewed (0)
  9. guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java

      }
    
      static int advanceOneBit(int next) {
        if ((next & 1) != 0) {
          return (next >>> 1) ^ CRC32C_GENERATOR_FLIPPED;
        } else {
          return next >>> 1;
        }
      }
    
      public void testCrc32cStrideTable() {
        int next = CRC32C_GENERATOR_FLIPPED;
        for (int i = 0; i < 12; i++) { // for 3 ints = 12 bytes in between each stride window
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 6.6K bytes
    - Viewed (0)
  10. cmd/erasure-decode.go

    	p.readers = tmp
    	// next is the next non-preferred index.
    	next := 0
    	for i, ok := range prefer {
    		if !ok || p.readers[i] == nil {
    			continue
    		}
    		if i == next {
    			next++
    			continue
    		}
    		// Move reader with index i to index next.
    		// Do this by swapping next and i
    		p.readers[next], p.readers[i] = p.readers[i], p.readers[next]
    		p.readerToBuf[next] = i
    		p.readerToBuf[i] = next
    		next++
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Thu Aug 29 01:40:52 UTC 2024
    - 9.5K bytes
    - Viewed (0)
Back to top