Search Options

Results per page
Sort
Preferred Languages
Advance

Results 941 - 950 of 1,182 for happens (0.07 sec)

  1. src/bufio/bufio_test.go

    	for i := 0; i < 100; i++ {
    		// Obtain a buffer to append to.
    		b := w.AvailableBuffer()
    		if w.Available() != cap(b) {
    			t.Fatalf("Available() = %v, want %v", w.Available(), cap(b))
    		}
    
    		// While not recommended, it is valid to append to a shifted buffer.
    		// This forces Write to copy the input.
    		if rn.Intn(8) == 0 && cap(b) > 0 {
    			b = b[1:1:cap(b)]
    		}
    
    		// Append a random integer of varying width.
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Nov 01 21:52:12 UTC 2024
    - 51.6K bytes
    - Viewed (0)
  2. compat/maven-artifact/src/main/java/org/apache/maven/artifact/versioning/VersionRange.java

                for (Iterator<Restriction> i = restrictions.iterator(); i.hasNext(); ) {
                    Restriction r = i.next();
    
                    buf.append(r.toString());
    
                    if (i.hasNext()) {
                        buf.append(',');
                    }
                }
                return buf.toString();
            }
        }
    
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 19K bytes
    - Viewed (0)
  3. guava/src/com/google/common/hash/HashCode.java

       */
      @Override
      public final String toString() {
        byte[] bytes = getBytesInternal();
        StringBuilder sb = new StringBuilder(2 * bytes.length);
        for (byte b : bytes) {
          sb.append(hexDigits[(b >> 4) & 0xf]).append(hexDigits[b & 0xf]);
        }
        return sb.toString();
      }
    
      private static final char[] hexDigits = "0123456789abcdef".toCharArray();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 19:54:59 UTC 2024
    - 12.6K bytes
    - Viewed (0)
  4. src/bytes/bytes_test.go

    	for _, r16 := range rt.R16 {
    		for r := rune(r16.Lo); r <= rune(r16.Hi); r += rune(r16.Stride) {
    			if r != needle {
    				rs = append(rs, rune(r))
    			}
    		}
    	}
    	for _, r32 := range rt.R32 {
    		for r := rune(r32.Lo); r <= rune(r32.Hi); r += rune(r32.Stride) {
    			if r != needle {
    				rs = append(rs, rune(r))
    			}
    		}
    	}
    	// Shuffle the runes so that they are not in descending order.
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Aug 19 19:09:04 UTC 2024
    - 61.2K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/util/concurrent/ExecutionList.java

        // drop the contract on the method that enforces this queue like behavior since depending on it
        // is likely to be a bug anyway.
    
        // N.B. All writes to the list and the next pointers must have happened before the above
        // synchronized block, so we can iterate the list without the lock held here.
        RunnableExecutorPair reversedList = null;
        while (list != null) {
          RunnableExecutorPair tmp = list;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Apr 22 21:17:24 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  6. gradle/wrapper/gradle-wrapper.jar

    package org.gradle.wrapper; public final synchronized class Logger implements Appendable { public final boolean quiet; public void Logger(boolean); public final void log(String); public final Appendable append(CharSequence); public final Appendable append(CharSequence, int, int); public final Appendable append(char); } org/gradle/wrapper/PathAssembler.class package org.gradle.wrapper; public final synchronized class PathAssembler { public void PathAssembler(java.io.File, java.io.File); } org/gradle/wra...
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sun Dec 24 09:00:26 UTC 2023
    - 42.4K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/base/SplitterTest.java

        StringBuilder builder = new StringBuilder();
        Iterator<String> iterator = splitter.split(builder).iterator();
    
        builder.append("A,");
        assertEquals("A", iterator.next());
        builder.append("B,");
        assertEquals("B", iterator.next());
        builder.append("C");
        assertEquals("C", iterator.next());
        assertFalse(iterator.hasNext());
      }
    
      public void testFixedLengthSimpleSplit() {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Sep 17 18:14:12 UTC 2024
    - 29.6K bytes
    - Viewed (0)
  8. internal/disk/stat_linux.go

    		return nil, err
    	}
    	statLine := strings.TrimSpace(s)
    	for _, token := range strings.Fields(statLine) {
    		ui64, err := strconv.ParseUint(token, 10, 64)
    		if err != nil {
    			return nil, err
    		}
    		stats = append(stats, ui64)
    	}
    
    	return stats, nil
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Feb 26 19:34:50 UTC 2024
    - 4.8K bytes
    - Viewed (0)
  9. schema/naming.go

    )
    
    func init() {
    	commonInitialismsForReplacer := make([]string, 0, len(commonInitialisms))
    	for _, initialism := range commonInitialisms {
    		commonInitialismsForReplacer = append(commonInitialismsForReplacer, initialism, cases.Title(language.Und).String(initialism))
    	}
    	commonInitialismsReplacer = strings.NewReplacer(commonInitialismsForReplacer...)
    }
    
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Wed Jun 12 03:46:59 UTC 2024
    - 5.3K bytes
    - Viewed (0)
  10. cmd/os_windows.go

    				// directory symlinks are ignored.
    				continue
    			}
    		case data.FileAttributes&syscall.FILE_ATTRIBUTE_DIRECTORY != 0:
    			name += SlashSeparator
    		}
    
    		count--
    		entries = append(entries, name)
    
    	}
    
    	return entries, nil
    }
    
    func globalSync() {
    	// no-op on windows
    }
    
    func syscallErrToFileErr(dirPath string, err error) error {
    	switch err {
    	case nil:
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Oct 18 18:08:15 UTC 2023
    - 5.1K bytes
    - Viewed (0)
Back to top