coffee/etl
1
0
Fork 0
mirror of https://github.com/ETLCPP/etl.git synced 2026-11-09 22:59:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

Optimisations & others

Browse Source 
Optimisations & use more iterators in implementation
This commit is contained in:
jwellbelove 2014-11-11 15:23:43 +00:00
parent 637573dd3e
commit 940b5eda3b
2 changed files with 285 additions and 261 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

530
ilist.h
View File

File diff suppressed because it is too large Load Diff

16
list.h
View File

@ -117,13 +117,13 @@ namespace etl
// Re-align the node pointers for this list.
if (this->terminal_node.previous != 0)
{
size_t index = std::distance(&node_pool[0], this->terminal_node.previous);
size_t index = std::distance(&node_pool[0], static_cast<Data_Node*>(this->terminal_node.previous));
this->terminal_node.previous = &node_pool[index];
}
if (this->terminal_node.next != 0)
{
size_t index = std::distance(&node_pool[0], this->terminal_node.next);
size_t index = std::distance(&node_pool[0], static_cast<Data_Node*>(this->terminal_node.next));
this->terminal_node.next = &node_pool[index];
}
@ -135,10 +135,10 @@ namespace etl
{
size_t index;
index = std::distance(&node_pool[0], data_node.previous);
index = std::distance(&node_pool[0], static_cast<Data_Node*>(data_node.previous));
data_node.previous = &other.node_pool[index];
index = std::distance(&node_pool[0], data_node.next);
index = std::distance(&node_pool[0], static_cast<Data_Node*>(data_node.next));
data_node.next = &other.node_pool[index];
}
}
@ -146,13 +146,13 @@ namespace etl
// Re-align the node pointers for the other list.
if (other.terminal_node.previous != 0)
{
size_t index = std::distance(&other.node_pool[0], other.terminal_node.previous);
size_t index = std::distance(&other.node_pool[0], static_cast<Data_Node*>(other.terminal_node.previous));
other.terminal_node.previous = &other.node_pool[index];
}
if (other.terminal_node.next != 0)
{
size_t index = std::distance(&other.node_pool[0], other.terminal_node.next);
size_t index = std::distance(&other.node_pool[0], static_cast<Data_Node*>(other.terminal_node.next));
other.terminal_node.next = &other.node_pool[index];
}
@ -164,10 +164,10 @@ namespace etl
{
size_t index;
index = std::distance(&other.node_pool[0], data_node.previous);
index = std::distance(&other.node_pool[0], static_cast<Data_Node*>(data_node.previous));
data_node.previous = &node_pool[index];
index = std::distance(&other.node_pool[0], data_node.next);
index = std::distance(&other.node_pool[0], static_cast<Data_Node*>(data_node.next));
data_node.next = &node_pool[index];
}
}