UpsilonNumworks/Upsilon
1
0
Fork 0
mirror of https://github.com/UpsilonNumworks/Upsilon.git synced 2026-03-24 00:00:44 +01:00
Code Issues Packages Projects Releases Wiki Activity

Start expression simplification

Browse Source
This commit is contained in:
Léa Saviot
2018-06-29 17:54:54 +02:00
parent 53bacec72f
commit f0e2bd0e5c
12 changed files with 147 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
tree_pool.cpp
View File

@@ -41,35 +41,45 @@ void TreePool::logNodeForIdentifierArray() {
}
void TreePool::move(TreeNode * source, TreeNode * destination) {
if (source == destination) {
size_t moveSize = source->deepSize();
moveNodes(source, destination, moveSize);
}
void TreePool::moveChildren(TreeNode * sourceParent, TreeNode * destination) {
size_t moveSize = sourceParent->deepSize() - sourceParent->size();
moveNodes(sourceParent->next(), destination, moveSize);
}
void TreePool::moveNodes(TreeNode * source, TreeNode * destination, size_t moveSize) {
if (source == destination || moveSize == 0) {
return;
}
// Move the Node
size_t srcDeepSize = source->deepSize();
char * destinationAddress = reinterpret_cast<char *>(destination);
char * sourceAddress = reinterpret_cast<char *>(source);
if (insert(destinationAddress, sourceAddress, srcDeepSize)) {
if (insert(destinationAddress, sourceAddress, moveSize)) {
// Update the nodeForIdentifier array
for (int i = 0; i < MaxNumberOfNodes; i++) {
char * nodeAddress = reinterpret_cast<char *>(m_nodeForIdentifier[i]);
if (nodeAddress == nullptr) {
continue;
} else if (nodeAddress >= sourceAddress && nodeAddress < sourceAddress + srcDeepSize) {
} else if (nodeAddress >= sourceAddress && nodeAddress < sourceAddress + moveSize) {
if (destinationAddress < sourceAddress) {
m_nodeForIdentifier[i] = reinterpret_cast<TreeNode *>(nodeAddress - (sourceAddress - destinationAddress));
} else {
m_nodeForIdentifier[i] = reinterpret_cast<TreeNode *>(nodeAddress + (destinationAddress - (sourceAddress + srcDeepSize)));
m_nodeForIdentifier[i] = reinterpret_cast<TreeNode *>(nodeAddress + (destinationAddress - (sourceAddress + moveSize)));
}
} else if (nodeAddress > sourceAddress && nodeAddress < destinationAddress) {
m_nodeForIdentifier[i] = reinterpret_cast<TreeNode *>(nodeAddress - srcDeepSize);
m_nodeForIdentifier[i] = reinterpret_cast<TreeNode *>(nodeAddress - moveSize);
} else if (nodeAddress < sourceAddress && nodeAddress >= destinationAddress) {
m_nodeForIdentifier[i] = reinterpret_cast<TreeNode *>(nodeAddress + srcDeepSize);
m_nodeForIdentifier[i] = reinterpret_cast<TreeNode *>(nodeAddress + moveSize);
}
}
}
}
#include <stdio.h>
void TreePool::log() {