Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 15 for gotchas (0.06 seconds)

  1. android/guava-tests/test/com/google/common/hash/FarmHashFingerprint64Test.java

          h = remix(h);
          buf[bufLen++] = getChar(h);
    
          h ^= fingerprint(buf, i * i % bufLen);
          h = remix(h);
          buf[bufLen++] = getChar(h);
    
          h ^= fingerprint(buf, i * i * i % bufLen);
          h = remix(h);
          buf[bufLen++] = getChar(h);
    
          h ^= fingerprint(buf, bufLen);
          h = remix(h);
          buf[bufLen++] = getChar(h);
    
          int x0 = buf[bufLen - 1] & 0xff;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 6.4K bytes
    - Click Count (0)
  2. internal/hash/checksum_test.go

    			if !chksm.Equal(gotChksm) {
    				t.Errorf("Checksum mismatch for %s: expected %+v, got %+v", tt.name, chksm, gotChksm)
    			}
    			// Verify the checksum type
    			expectedType := chksm.Type
    			if gotChksm.Type != expectedType {
    				t.Errorf("Type mismatch for %s: expected %s, got %s", tt.name, expectedType.StringFull(), gotChksm.Type.StringFull())
    			}
    		})
    	}
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 22 14:15:21 GMT 2025
    - 7.1K bytes
    - Click Count (0)
  3. android/guava-tests/benchmark/com/google/common/base/StringsRepeatBenchmark.java

        // OutOfMemoryError is not far behind
        int len = string.length();
        int size = len * count;
        char[] array = new char[size];
        for (int i = 0; i < size; i += len) {
          string.getChars(0, len, array, i);
        }
        return new String(array);
      }
    
      @Benchmark
      void mikeRepeat(long reps) {
        for (int i = 0; i < reps; i++) {
          String x = mikeRepeat(originalString, count);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue May 13 18:46:00 GMT 2025
    - 3.4K bytes
    - Click Count (0)
  4. guava-tests/benchmark/com/google/common/base/StringsRepeatBenchmark.java

        // OutOfMemoryError is not far behind
        int len = string.length();
        int size = len * count;
        char[] array = new char[size];
        for (int i = 0; i < size; i += len) {
          string.getChars(0, len, array, i);
        }
        return new String(array);
      }
    
      @Benchmark
      void mikeRepeat(long reps) {
        for (int i = 0; i < reps; i++) {
          String x = mikeRepeat(originalString, count);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue May 13 18:46:00 GMT 2025
    - 3.4K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/escape/CharEscaper.java

            dest = growBuffer(dest, destIndex, destSize);
          }
    
          // If we have skipped any characters, we need to copy them now.
          if (charsSkipped > 0) {
            s.getChars(lastEscape, index, dest, destIndex);
            destIndex += charsSkipped;
          }
    
          // Copy the replacement string into the dest buffer as needed.
          if (rlen > 0) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Feb 13 15:45:16 GMT 2025
    - 6.7K bytes
    - Click Count (0)
  6. cmd/format-erasure_test.go

    	newFormats, errs := loadFormatErasureAll(storageDisks, false)
    	for _, err := range errs {
    		if err != nil && err != errUnformattedDisk {
    			t.Fatal(err)
    		}
    	}
    	gotThis := newFormats[2].Erasure.This
    	if expThis != gotThis {
    		t.Fatalf("expected uuid %s, got %s", expThis, gotThis)
    	}
    }
    
    // tests formatErasureV3ThisEmpty conditions.
    func TestFormatErasureEmpty(t *testing.T) {
    	format := newFormatErasureV3(1, 16)
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 12.7K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/escape/UnicodeEscaper.java

              dest = growBuffer(dest, destIndex, destLength);
            }
            // If we have skipped any characters, we need to copy them now.
            if (charsSkipped > 0) {
              s.getChars(unescapedChunkStart, index, dest, destIndex);
              destIndex += charsSkipped;
            }
            if (escaped.length > 0) {
              System.arraycopy(escaped, 0, dest, destIndex, escaped.length);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Jan 24 04:06:11 GMT 2026
    - 13.2K bytes
    - Click Count (0)
  8. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RealRoutePlanner.kt

        return localRouteSelector.hasNext()
      }
    
      /**
       * Return the route from [connection] if it should be retried, even if the connection itself is
       * unhealthy. The biggest gotcha here is that we shouldn't reuse routes from coalesced
       * connections.
       */
      private fun retryRoute(connection: RealConnection): Route? =
        connection.withLock {
          when {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 12.1K bytes
    - Click Count (0)
  9. src/main/java/jcifs/smb1/util/Hexdump.java

                c[ci++] = ' ';
                c[ci++] = ' ';
                c[ci++] = '|';
                System.arraycopy(d, 0, c, ci, 16);
                ci += 16;
                c[ci++] = '|';
                NL.getChars(0, NL_LENGTH, c, ci);
                ci += NL_LENGTH;
            } while (si < length);
    
            ps.println(c);
        }
    
        /**
         * This is an alternative to the <code>java.lang.Integer.toHexString</code>
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 7.8K bytes
    - Click Count (0)
  10. src/main/java/jcifs/smb1/smb1/SmbRandomAccessFile.java

            final int clen = s.length();
            final int blen = 2 * clen;
            final byte[] b = new byte[blen];
            final char[] c = new char[clen];
            s.getChars(0, clen, c, 0);
            for (int i = 0, j = 0; i < clen; i++) {
                b[j] = (byte) (c[i] >>> 8);
                j++;
                b[j++] = (byte) (c[i] >>> 0);
            }
            write(b, 0, blen);
        }
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 14.1K bytes
    - Click Count (0)
Back to Top