Home
last modified time | relevance | path

Searched refs:hashCode (Results 1 - 25 of 503) sorted by relevance

12345678910>>...21

/third_party/libphonenumber/java/libphonenumber/test/com/google/i18n/phonenumbers/
H A DPhonenumberTest.java39 assertEquals(numberA.hashCode(), numberB.hashCode()); in testEqualSimpleNumber()
51 assertEquals(numberA.hashCode(), numberB.hashCode()); in testEqualWithItalianLeadingZeroSetToDefault()
62 assertEquals(numberA.hashCode(), numberB.hashCode()); in testEqualWithCountryCodeSourceSet()
73 assertFalse(numberA.hashCode() == numberB.hashCode()); in testNonEqualWithItalianLeadingZeroSetToTrue()
88 assertFalse(numberA.hashCode() == numberB.hashCode()); in testNonEqualWithDifferingRawInput()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/number/
H A DDecimalFormatProperties.java84 /| or #equals(), but it will NOT catch if you forget to add it to #hashCode(). |/
137 /| or #equals(), but it will NOT catch if you forget to add it to #hashCode(). |/
318 int hashCode = 0; in _hashCode()
319 hashCode ^= _hashCodeHelper(compactCustomData); in _hashCode()
320 hashCode ^= _hashCodeHelper(compactStyle); in _hashCode()
321 hashCode ^= _hashCodeHelper(currency); in _hashCode()
322 hashCode ^= _hashCodeHelper(currencyPluralInfo); in _hashCode()
323 hashCode ^= _hashCodeHelper(currencyUsage); in _hashCode()
324 hashCode ^= _hashCodeHelper(decimalPatternMatchRequired); in _hashCode()
325 hashCode in _hashCode()
592 public int hashCode() { hashCode() method in DecimalFormatProperties
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/number/
H A DDecimalFormatProperties.java89 /| or #equals(), but it will NOT catch if you forget to add it to #hashCode(). |/
141 /| or #equals(), but it will NOT catch if you forget to add it to #hashCode(). |/
319 int hashCode = 0; in _hashCode()
320 hashCode ^= _hashCodeHelper(compactCustomData); in _hashCode()
321 hashCode ^= _hashCodeHelper(compactStyle); in _hashCode()
322 hashCode ^= _hashCodeHelper(currency); in _hashCode()
323 hashCode ^= _hashCodeHelper(currencyPluralInfo); in _hashCode()
324 hashCode ^= _hashCodeHelper(currencyUsage); in _hashCode()
325 hashCode ^= _hashCodeHelper(decimalPatternMatchRequired); in _hashCode()
326 hashCode in _hashCode()
588 public int hashCode() { hashCode() method in DecimalFormatProperties
[all...]
/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
H A DLazyFieldTest.java46 assertEquals(message.hashCode(), lazyField.hashCode()); in testHashCode()
48 assertEquals(message.hashCode(), lazyField.hashCode()); in testHashCode()
51 assertNotEqual(message.hashCode(), lazyField.hashCode()); in testHashCode()
57 assertEquals(message.hashCode(), lazyField.hashCode()); in testHashCodeEx()
59 assertEquals(message.hashCode(), lazyField.hashCode()); in testHashCodeEx()
[all...]
H A DLiteEqualsAndHashTest.java49 // Since the generated equals and hashCode methods for lite messages are a in testEquals()
76 assertEquals(foo1a.hashCode(), foo1b.hashCode()); in testEquals()
118 assertFalse(o1.hashCode() == o2.hashCode()); in assertEqualsAndHashCodeAreFalse()
123 TestRecursiveOneof.getDefaultInstance().hashCode(); in testRecursiveHashcode()
H A DTextFormatParseLocationTest.java68 assertEquals(loc0.hashCode(), loc1.hashCode()); in testHashCode()
70 TextFormatParseLocation.EMPTY.hashCode(), TextFormatParseLocation.EMPTY.hashCode()); in testHashCode()
/third_party/skia/third_party/externals/oboe/apps/OboeTester/app/src/main/java/com/mobileer/miditools/
H A DMidiPortWrapper.java115 public int hashCode() { in hashCode() method in MidiPortWrapper
116 int hashCode = 1; in hashCode()
117 hashCode = 31 * hashCode + mPortIndex; in hashCode()
118 hashCode = 31 * hashCode + mType; in hashCode()
119 hashCode = 31 * hashCode + mInfo.hashCode(); in hashCode()
120 return hashCode; in hashCode()
[all...]
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DUnknownFieldSetLite.java346 private static int hashCode(int[] tags, int count) { in hashCode() method in UnknownFieldSetLite
347 int hashCode = 17; in hashCode()
349 hashCode = 31 * hashCode + tags[i]; in hashCode()
351 return hashCode; in hashCode()
354 private static int hashCode(Object[] objects, int count) { in hashCode() method in UnknownFieldSetLite
355 int hashCode = 17; in hashCode()
357 hashCode = 31 * hashCode + objects[i].hashCode(); in hashCode()
363 public int hashCode() { hashCode() method in UnknownFieldSetLite
[all...]
H A DAbstractProtobufList.java87 public int hashCode() { in hashCode() method in AbstractProtobufList
89 int hashCode = 1; in hashCode()
91 hashCode = (31 * hashCode) + get(i).hashCode(); in hashCode()
93 return hashCode; in hashCode()
/third_party/icu/icu4c/source/common/
H A Dlsr.cpp37 hashCode(other.hashCode) { in hashCode() function
41 other.hashCode = 0; in hashCode()
57 hashCode = other.hashCode;
61 other.hashCode = 0;
105 if (hashCode == 0) { in setHashCode()
109 hashCode = h * 37 + flags; in setHashCode()
/third_party/skia/third_party/externals/icu/source/common/
H A Dlsr.cpp37 hashCode(other.hashCode) { in hashCode() function
41 other.hashCode = 0; in hashCode()
57 hashCode = other.hashCode;
61 other.hashCode = 0;
105 if (hashCode == 0) { in setHashCode()
109 hashCode = h * 37 + flags; in setHashCode()
/third_party/node/deps/icu-small/source/common/
H A Dlsr.cpp57 hashCode(other.hashCode) { in hashCode() function
61 other.hashCode = 0; in hashCode()
77 hashCode = other.hashCode;
81 other.hashCode = 0;
125 if (hashCode == 0) { in setHashCode()
129 hashCode = h * 37 + flags; in setHashCode()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/number/
H A DPropertiesTest.java134 assertEquals(p1.hashCode(), p2.hashCode()); in testFieldCoverage()
138 hashCodes.add(p1.hashCode()); in testFieldCoverage()
146 assertEquals(p1.hashCode(), p2.hashCode()); in testFieldCoverage()
151 assertEquals(p1.hashCode(), p2.hashCode()); in testFieldCoverage()
156 assertEquals(p1.hashCode(), p2.hashCode()); in testFieldCoverage()
158 hashCodes.add(p1.hashCode()); in testFieldCoverage()
[all...]
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/number/
H A DPropertiesTest.java131 assertEquals(p1.hashCode(), p2.hashCode()); in testFieldCoverage()
135 hashCodes.add(p1.hashCode()); in testFieldCoverage()
143 assertEquals(p1.hashCode(), p2.hashCode()); in testFieldCoverage()
148 assertEquals(p1.hashCode(), p2.hashCode()); in testFieldCoverage()
153 assertEquals(p1.hashCode(), p2.hashCode()); in testFieldCoverage()
155 hashCodes.add(p1.hashCode()); in testFieldCoverage()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DMutableCodePointTrie.java765 int hashCode = makeHashCode(data, start); in extend()
766 addEntry(data, null, start, hashCode, start); in extend()
778 int hashCode = makeHashCode(data, start); in extend()
779 addEntry(null, data, start, hashCode, start); in extend()
784 int hashCode = makeHashCode(blockData, blockStart); in findBlock()
785 int entryIndex = findEntry(data, null, blockData, null, blockStart, hashCode); in findBlock()
794 int hashCode = makeHashCode(blockData, blockStart); in findBlock()
795 int entryIndex = findEntry(null, data, blockData, null, blockStart, hashCode); in findBlock()
804 int hashCode = makeHashCode(blockData, blockStart); in findBlock()
805 int entryIndex = findEntry(null, data, null, blockData, blockStart, hashCode); in findBlock()
849 addEntry(int[] data32, char[] data16, int blockStart, int hashCode, int dataIndex) addEntry() argument
857 findEntry(int[] data32, char[] data16, int[] blockData32, char[] blockData16, int blockStart, int hashCode) findEntry() argument
880 findEntry(int[] data, int blockValue, int hashCode) findEntry() argument
[all...]
H A DStringTrieBuilder.java97 // runtime-equivalent nodes), but the HashMap/hashCode()/equals() are omitted for in buildImpl()
184 // hashCode() and equals() for use with registerNode() and the nodes hash.
186 public abstract int hashCode() /*const*/; in hashCode() method in StringTrieBuilder.Node
280 public int hashCode() /*const*/ { in hashCode() method in StringTrieBuilder.ValueNode
323 public int hashCode() /*const*/ { in hashCode() method in StringTrieBuilder.IntermediateValueNode
324 return (0x222222*37+value)*37+next.hashCode(); in hashCode()
361 public int hashCode() /*const*/ { return hash; } in hashCode() method in StringTrieBuilder.LinearMatchNode
490 hash=(0x333333*37+length)*37+next.hashCode(); in setHashCode()
597 public int hashCode() /*const*/ { return hash; } in hashCode() method in StringTrieBuilder.BranchNode
627 public int hashCode() { in hashCode() method in StringTrieBuilder.ListBranchNode
737 public int hashCode() { hashCode() method in StringTrieBuilder.SplitBranchNode
773 public int hashCode() /*const*/ { hashCode() method in StringTrieBuilder.BranchHeadNode
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/util/
H A DMutableCodePointTrie.java757 int hashCode = makeHashCode(data, start); in extend()
758 addEntry(data, null, start, hashCode, start); in extend()
770 int hashCode = makeHashCode(data, start); in extend()
771 addEntry(null, data, start, hashCode, start); in extend()
776 int hashCode = makeHashCode(blockData, blockStart); in findBlock()
777 int entryIndex = findEntry(data, null, blockData, null, blockStart, hashCode); in findBlock()
786 int hashCode = makeHashCode(blockData, blockStart); in findBlock()
787 int entryIndex = findEntry(null, data, blockData, null, blockStart, hashCode); in findBlock()
796 int hashCode = makeHashCode(blockData, blockStart); in findBlock()
797 int entryIndex = findEntry(null, data, null, blockData, blockStart, hashCode); in findBlock()
841 addEntry(int[] data32, char[] data16, int blockStart, int hashCode, int dataIndex) addEntry() argument
849 findEntry(int[] data32, char[] data16, int[] blockData32, char[] blockData16, int blockStart, int hashCode) findEntry() argument
872 findEntry(int[] data, int blockValue, int hashCode) findEntry() argument
[all...]
H A DStringTrieBuilder.java96 // runtime-equivalent nodes), but the HashMap/hashCode()/equals() are omitted for in buildImpl()
183 // hashCode() and equals() for use with registerNode() and the nodes hash.
185 public abstract int hashCode() /*const*/; in hashCode() method in StringTrieBuilder.Node
279 public int hashCode() /*const*/ { in hashCode() method in StringTrieBuilder.ValueNode
322 public int hashCode() /*const*/ { in hashCode() method in StringTrieBuilder.IntermediateValueNode
323 return (0x222222*37+value)*37+next.hashCode(); in hashCode()
360 public int hashCode() /*const*/ { return hash; } in hashCode() method in StringTrieBuilder.LinearMatchNode
489 hash=(0x333333*37+length)*37+next.hashCode(); in setHashCode()
596 public int hashCode() /*const*/ { return hash; } in hashCode() method in StringTrieBuilder.BranchNode
626 public int hashCode() { in hashCode() method in StringTrieBuilder.ListBranchNode
736 public int hashCode() { hashCode() method in StringTrieBuilder.SplitBranchNode
772 public int hashCode() /*const*/ { hashCode() method in StringTrieBuilder.BranchHeadNode
[all...]
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/rbbi/
H A DRBBIAPITest.java103 * Tests the method hashCode() of RuleBasedBreakIterator
110 logln("Testing hashCode()"); in TestHashCode()
116 if (bi1.hashCode() != bi1clone.hashCode() in TestHashCode()
117 || bi1.hashCode() != bi3.hashCode() in TestHashCode()
118 || bi1clone.hashCode() != bi3.hashCode() in TestHashCode()
119 || bi2.hashCode() != bi2clone.hashCode()) in TestHashCode()
[all...]
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/rbbi/
H A DRBBIAPITest.java100 * Tests the method hashCode() of RuleBasedBreakIterator
107 logln("Testing hashCode()"); in TestHashCode()
113 if (bi1.hashCode() != bi1clone.hashCode() in TestHashCode()
114 || bi1.hashCode() != bi3.hashCode() in TestHashCode()
115 || bi1clone.hashCode() != bi3.hashCode() in TestHashCode()
116 || bi2.hashCode() != bi2clone.hashCode()) in TestHashCode()
[all...]
/third_party/icu/icu4c/source/common/unicode/
H A Dstringtriebuilder.h183 * they call the static Node::hashCode() which checks for a NULL pointer first.
203 inline int32_t hashCode() const { return hash; } in hashCode() function in StringTrieBuilder::Node
205 static inline int32_t hashCode(const Node *node) { return node==NULL ? 0 : node->hashCode(); } in hashCode() function in StringTrieBuilder::Node
301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
318 : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)), in LinearMatchNode()
361 hash=(hash*37u+c)*37u+hashCode(node); in add()
377 hashCode(lessThanNode))*37u+hashCode(greaterOrEqualNode)), in SplitBranchNode()
393 : ValueNode((0x666666u*37u+len)*37u+hashCode(subNod in BranchHeadNode()
[all...]
/third_party/node/deps/icu-small/source/common/unicode/
H A Dstringtriebuilder.h183 * they call the static Node::hashCode() which checks for a nullptr pointer first.
203 inline int32_t hashCode() const { return hash; } in hashCode() function in StringTrieBuilder::Node
205 static inline int32_t hashCode(const Node *node) { return node==nullptr ? 0 : node->hashCode(); } in hashCode() function in StringTrieBuilder::Node
301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
318 : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)), in LinearMatchNode()
361 hash=(hash*37u+c)*37u+hashCode(node); in add()
377 hashCode(lessThanNode))*37u+hashCode(greaterOrEqualNode)), in SplitBranchNode()
393 : ValueNode((0x666666u*37u+len)*37u+hashCode(subNod in BranchHeadNode()
[all...]
/third_party/skia/third_party/externals/icu/source/common/unicode/
H A Dstringtriebuilder.h183 * they call the static Node::hashCode() which checks for a NULL pointer first.
203 inline int32_t hashCode() const { return hash; } in hashCode() function in StringTrieBuilder::Node
205 static inline int32_t hashCode(const Node *node) { return node==NULL ? 0 : node->hashCode(); } in hashCode() function in StringTrieBuilder::Node
301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
318 : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)), in LinearMatchNode()
361 hash=(hash*37u+c)*37u+hashCode(node); in add()
377 hashCode(lessThanNode))*37u+hashCode(greaterOrEqualNode)), in SplitBranchNode()
393 : ValueNode((0x666666u*37u+len)*37u+hashCode(subNod in BranchHeadNode()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/number/
H A DFormattedNumberRange.java165 public int hashCode() { in hashCode() method in FormattedNumberRange
167 // #equals() or #hashCode() on them directly. in hashCode()
168 return Arrays.hashCode(string.toCharArray()) ^ Arrays.hashCode(string.toFieldArray()) in hashCode()
169 ^ quantity1.toBigDecimal().hashCode() ^ quantity2.toBigDecimal().hashCode(); in hashCode()
186 // #equals() or #hashCode() on them directly. in equals()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/number/
H A DFormattedNumberRange.java146 public int hashCode() { in hashCode() method in FormattedNumberRange
148 // #equals() or #hashCode() on them directly. in hashCode()
149 return Arrays.hashCode(string.toCharArray()) ^ Arrays.hashCode(string.toFieldArray()) in hashCode()
150 ^ quantity1.toBigDecimal().hashCode() ^ quantity2.toBigDecimal().hashCode(); in hashCode()
165 // #equals() or #hashCode() on them directly. in equals()

Completed in 22 milliseconds

12345678910>>...21