Searched refs:hashCodes (Results 1 – 12 of 12) sorted by relevance
58 final int hashCodes; in match() local63 hashCodes = lookupSwitch.labels.size(); in match()67 hashCodes = tableSwitch.labels.size(); in match()73 for (int i = 0; i < hashCodes; i++) { in match()
525 public static HashCode combineOrdered(Iterable<HashCode> hashCodes) { in combineOrdered() argument526 Iterator<HashCode> iterator = hashCodes.iterator(); in combineOrdered()530 for (HashCode hashCode : hashCodes) { in combineOrdered()550 public static HashCode combineUnordered(Iterable<HashCode> hashCodes) { in combineUnordered() argument551 Iterator<HashCode> iterator = hashCodes.iterator(); in combineUnordered()554 for (HashCode hashCode : hashCodes) { in combineUnordered()
72 Set<Integer> hashCodes = new HashSet<Integer>(); in testFieldCoverage() local138 hashCodes.add(p1.hashCode()); in testFieldCoverage()158 hashCodes.add(p1.hashCode()); in testFieldCoverage()177 hashCodes.add(p3.hashCode()); in testFieldCoverage()179 hashCodes.add(p4.hashCode()); in testFieldCoverage()200 … "Too many hash code collisions: " + hashCodes.size() + " out of " + (fields.length * 4), in testFieldCoverage()201 hashCodes.size() >= fields.length); in testFieldCoverage()
69 Set<Integer> hashCodes = new HashSet<Integer>(); in testFieldCoverage() local135 hashCodes.add(p1.hashCode()); in testFieldCoverage()155 hashCodes.add(p1.hashCode()); in testFieldCoverage()174 hashCodes.add(p3.hashCode()); in testFieldCoverage()176 hashCodes.add(p4.hashCode()); in testFieldCoverage()197 … "Too many hash code collisions: " + hashCodes.size() + " out of " + (fields.length * 4), in testFieldCoverage()198 hashCodes.size() >= fields.length); in testFieldCoverage()
287 List<HashCode> hashCodes = Lists.newArrayList(); in testCombineOrdered_randomHashCodes() local289 hashCodes.add(HashCode.fromLong(random.nextLong())); in testCombineOrdered_randomHashCodes()291 HashCode hashCode1 = Hashing.combineOrdered(hashCodes); in testCombineOrdered_randomHashCodes()292 Collections.shuffle(hashCodes, random); in testCombineOrdered_randomHashCodes()293 HashCode hashCode2 = Hashing.combineOrdered(hashCodes); in testCombineOrdered_randomHashCodes()329 List<HashCode> hashCodes = Lists.newArrayList(); in testCombineUnordered_randomHashCodes() local331 hashCodes.add(HashCode.fromLong(random.nextLong())); in testCombineUnordered_randomHashCodes()333 HashCode hashCode1 = Hashing.combineUnordered(hashCodes); in testCombineUnordered_randomHashCodes()334 Collections.shuffle(hashCodes); in testCombineUnordered_randomHashCodes()335 HashCode hashCode2 = Hashing.combineUnordered(hashCodes); in testCombineUnordered_randomHashCodes()
153 ImmutableSet<HashCode> hashCodes = in testCollisionsDueToIncorrectSignExtension() local158 assertEquals(3, hashCodes.size()); in testCollisionsDueToIncorrectSignExtension()
37 …e a hard and fast guarantee that no two inputs will ever collide. Hence, hashCodes are not 256bits
829 * otherwise encounter collisions for hashCodes that do not differ834 // This function ensures that hashCodes that differ only by