Return to Question

Edit: This code was reworked and repostetd under a new question: Generic Skip list implementation in C++ Version 3

I continued the work on the Skiplist. I tryed to incorporate the improvements suggested. I still don't feel ready to add more stuff ( Iterator class, Template Skipnode). I think is better to first present the progress so far:

A short summary what has changed:

I added alot more comments and tryed to make the code in general more readable. I hope the code is now easier to follow. I think one of the reasons not many people commented the last time, was the missing explanations in the code

The random generator was reworked like suggested

I implemented the missing functions Copy Constructor, Move Constructor, Copy Assignment and Move assignment

Head now doesn't hold key and value anymore it only contains pointers.

I added Unit Tests in seperate cpp / h to test the vector more systematically.

Random Generator Last timee it was suggestetd to move Random Generator completly out of the class in a seperate class. I didnt understande how. Is the currently implementation inside the class ok?

I continued the work on the Skiplist. I tried to incorporate the improvements suggested. I still don't feel ready to add more stuff ( Iterator class, Template Skipnode). I think it's better to first present the progress so far.

A short summary of what has changed:

I added alot more comments and tried to make the code more readable in general. I hope the code is now easier to follow. I think one of the reasons not many people commented last time, was the missing explanations in the code.

The random generator was reworked like suggested.

I implemented the missing functions Copy Constructor, Move Constructor, Copy Assignment and Move assignment.

Head now doesn't hold key and value anymore, it only contains pointers.

I added Unit Tests in seperate cpp / h files to test the vector more systematically.

Random Generator

Last time someone suggested to move Random Generator completely out of the class, and to put it in a separate class. I didn't understand how. Is the current implementation inside the class ok?

EDIT: It was commented that map is superior to skiplist with insert / delete. So which container would be better to use for a compare. Is there a common Skiplist implementation in c++ to use?