GitHub/gf-core
1
0
Fork 1
mirror of https://github.com/GrammaticalFramework/gf-core.git synced 2026-05-22 09:32:53 -06:00
Code Issues Packages Projects Releases Wiki Activity

fix the balancing to avoid segmentation faults

Browse Source
This commit is contained in:
krangelov
2021-08-05 16:28:50 +02:00
parent 84789c9fbf
commit 54421492b2
1 changed files with 43 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

52
src/runtime/c/namespace.h
View File

@@ -111,30 +111,42 @@ public:
if (right->right == 0) { if (right->right == 0) {
return new_node(value,0,right); return new_node(value,0,right);
} else { } else {
Namespace<V> new_left =
new_node(value);
return new_node(right->value, return new_node(right->value,
new_node(value), new_left,
right->right); right->right);
} }
} else { } else {
if (right->right == 0) { if (right->right == 0) {
Namespace<V> new_left =
new_node(value);
Namespace<V> new_right =
new_node(right->value);
return new_node(right->left->value, return new_node(right->left->value,
new_node(value), new_left,
new_node(right->value)); new_right);
} else { } else {
if (right->left->sz < 2 * right->right->sz) { if (right->left->sz < 2 * right->right->sz) {
return new_node(right->value, Namespace<V> new_left =
new_node(value, new_node(value,
0, 0,
right->left), right->left);
return new_node(right->value,
new_left,
right->right); right->right);
} else { } else {
return new_node(right->left->value, Namespace<V> new_left =
new_node(value, new_node(value,
0, 0,
right->left->left), right->left->left);
Namespace<V> new_right =
new_node(right->value, new_node(right->value,
right->left->right, right->left->right,
right->right)); right->right);
return new_node(right->left->value,
new_left,
new_right);
} }
} }
} }
@@ -144,20 +156,28 @@ public:
return new_node(value,left,0); return new_node(value,left,0);
} else { } else {
if (right->sz > 3*left->sz) { if (right->sz > 3*left->sz) {
if (right->left->sz < 2*right->right->sz) if (right->left->sz < 2*right->right->sz) {
Namespace<V> new_left =
new_node(value,
left,
right->left);
return new_node(right->value, return new_node(right->value,
new_node(value, new_left,
left,
right->left),
right->right); right->right);
else } else {
return new_node(right->left->value, Namespace<V> new_left =
new_node(value, new_node(value,
left, left,
right->left->left), right->left->left);
Namespace<V> new_right =
new_node(right->value, new_node(right->value,
right->left->right, right->left->right,
right->right)); right->right);
return new_node(right->left->value,
new_left,
new_right
);
}
} else { } else {
return new_node(value,left,right); return new_node(value,left,right);
} }