s-hironobu / algorithmcollection Goto Github PK

In the code "LockFreeList.c" I saw that at line 167:
if (prev_node->key == key)
return false;
I read the paper, It wrote in searchFrom2():
if (next node.key ≤ k)
curr node = next node
next node = curr node.right
But in your code in searchForm2() method at line 127:
if (next_node->key < key) {
curr_node = next_node;
next_node = curr_node->succ.node_ptr;
}
The condition in your code war: next_node->key < key
So in the add() method at line 167:
I think: It should be: next_node->key == key not prev_node->key == key