Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for sanje (0.01 seconds)

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

          processCalled--; // don't count the tail invocation (makes tests a bit more understandable)
        }
    
        // ensures that the number of invocations looks sane
        void assertInvariants(int expectedBytes) {
          // we should have seen as many bytes as the next multiple of chunk after expectedBytes - 1
          assertEquals(out.toByteArray().length, ceilToMultiple(expectedBytes, chunkSize));
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Oct 28 18:19:59 GMT 2025
    - 8.6K bytes
    - Click Count (0)
  2. src/cmd/asm/internal/asm/endtoend_test.go

    	ctxt.DiagFunc = func(format string, args ...any) {
    		t.Errorf(format, args...)
    		ok = false
    	}
    	obj.Flushplist(ctxt, pList, nil)
    
    	if !ok {
    		// If we've encountered errors, the output is unlikely to be sane.
    		t.FailNow()
    	}
    
    	for p := top; p != nil; p = p.Link {
    		if p.As == obj.ATEXT {
    			text = p.From.Sym
    		}
    		hexes := hexByLine[p.Line()]
    		if hexes == "" {
    			continue
    		}
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Dec 23 18:45:48 GMT 2025
    - 12.5K bytes
    - Click Count (0)
  3. android/guava-tests/test/com/google/common/hash/HashTestUtils.java

            }
          }
        }
      }
    
      /**
       * Checks that a Hasher returns the same HashCode when given the same input, and also that the
       * collision rate looks sane.
       */
      static void assertInvariants(HashFunction hashFunction) {
        int objects = 100;
        Set<HashCode> hashcodes = Sets.newHashSetWithExpectedSize(objects);
        Random random = new Random(314159);
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Oct 28 18:19:59 GMT 2025
    - 25.6K bytes
    - Click Count (0)
  4. guava-tests/test/com/google/common/hash/HashTestUtils.java

            }
          }
        }
      }
    
      /**
       * Checks that a Hasher returns the same HashCode when given the same input, and also that the
       * collision rate looks sane.
       */
      static void assertInvariants(HashFunction hashFunction) {
        int objects = 100;
        Set<HashCode> hashcodes = Sets.newHashSetWithExpectedSize(objects);
        Random random = new Random(314159);
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Oct 28 18:19:59 GMT 2025
    - 25.6K bytes
    - Click Count (0)
Back to Top