Update ICU to ICU 70-1 with tests
Size Impact:
Android +143K
Cast -143K
ChromeOS -154.7K
Common -159K
flutter -123.1K
iOS -157.6K
Diary https://docs.google.com/document/d/1NqMw7DAVFCZRx67auC7sgOvrikHvCYuaB87JUf21yG8
Bug: 1260116
Change-Id: I90102bf8c5a9d54a59658b2d2f7fb25b405917ad
Reviewed-on: https://chromium-review.googlesource.com/c/chromium/deps/icu/+/3268349
Reviewed-by: Jungshik Shin <jshin@chromium.org>
diff --git a/source/common/stringtriebuilder.cpp b/source/common/stringtriebuilder.cpp
index 6f9cc2e..4d52a88 100644
--- a/source/common/stringtriebuilder.cpp
+++ b/source/common/stringtriebuilder.cpp
@@ -383,7 +383,7 @@
return *(const Node *)left==*(const Node *)right;
}
-UBool
+bool
StringTrieBuilder::Node::operator==(const Node &other) const {
return this==&other || (typeid(*this)==typeid(other) && hash==other.hash);
}
@@ -396,13 +396,13 @@
return edgeNumber;
}
-UBool
+bool
StringTrieBuilder::FinalValueNode::operator==(const Node &other) const {
if(this==&other) {
- return TRUE;
+ return true;
}
if(!Node::operator==(other)) {
- return FALSE;
+ return false;
}
const FinalValueNode &o=(const FinalValueNode &)other;
return value==o.value;
@@ -413,25 +413,25 @@
offset=builder.writeValueAndFinal(value, TRUE);
}
-UBool
+bool
StringTrieBuilder::ValueNode::operator==(const Node &other) const {
if(this==&other) {
- return TRUE;
+ return true;
}
if(!Node::operator==(other)) {
- return FALSE;
+ return false;
}
const ValueNode &o=(const ValueNode &)other;
return hasValue==o.hasValue && (!hasValue || value==o.value);
}
-UBool
+bool
StringTrieBuilder::IntermediateValueNode::operator==(const Node &other) const {
if(this==&other) {
- return TRUE;
+ return true;
}
if(!ValueNode::operator==(other)) {
- return FALSE;
+ return false;
}
const IntermediateValueNode &o=(const IntermediateValueNode &)other;
return next==o.next;
@@ -451,13 +451,13 @@
offset=builder.writeValueAndFinal(value, FALSE);
}
-UBool
+bool
StringTrieBuilder::LinearMatchNode::operator==(const Node &other) const {
if(this==&other) {
- return TRUE;
+ return true;
}
if(!ValueNode::operator==(other)) {
- return FALSE;
+ return false;
}
const LinearMatchNode &o=(const LinearMatchNode &)other;
return length==o.length && next==o.next;
@@ -471,21 +471,21 @@
return edgeNumber;
}
-UBool
+bool
StringTrieBuilder::ListBranchNode::operator==(const Node &other) const {
if(this==&other) {
- return TRUE;
+ return true;
}
if(!Node::operator==(other)) {
- return FALSE;
+ return false;
}
const ListBranchNode &o=(const ListBranchNode &)other;
for(int32_t i=0; i<length; ++i) {
if(units[i]!=o.units[i] || values[i]!=o.values[i] || equal[i]!=o.equal[i]) {
- return FALSE;
+ return false;
}
}
- return TRUE;
+ return true;
}
int32_t
@@ -550,13 +550,13 @@
}
}
-UBool
+bool
StringTrieBuilder::SplitBranchNode::operator==(const Node &other) const {
if(this==&other) {
- return TRUE;
+ return true;
}
if(!Node::operator==(other)) {
- return FALSE;
+ return false;
}
const SplitBranchNode &o=(const SplitBranchNode &)other;
return unit==o.unit && lessThan==o.lessThan && greaterOrEqual==o.greaterOrEqual;
@@ -584,13 +584,13 @@
offset=builder.write(unit);
}
-UBool
+bool
StringTrieBuilder::BranchHeadNode::operator==(const Node &other) const {
if(this==&other) {
- return TRUE;
+ return true;
}
if(!ValueNode::operator==(other)) {
- return FALSE;
+ return false;
}
const BranchHeadNode &o=(const BranchHeadNode &)other;
return length==o.length && next==o.next;