next topic »

[on:]

Hi folks,

I have published my LinkedList Class on GitHub. It's REALLY usefull for all kinds of libraries and projects.

Features that are implemented:

• LinkedList<T>::LinkedList() - Constructor.
• LinkedList<T>::~LinkedList() - Destructor. Clear Nodes to minimize memory.
• int LinkedList<T>::size() - Returns the current size of the list.
• bool LinkedList<T>::add(T) - Add element T at the END of the list.
• bool LinkedList<T>::add(int index, T) - Add element T at index of the list.
• bool LinkedList<T>::unshift(T) - Add element T at the BEGINNING of the list.
• bool LinkedList<T>::set(int index, T) - Set the element at index to T.
• T LinkedList<T>::remove(int index) - Remove element at index. Return the removed element.
• T LinkedList<T>::pop() - Remove the LAST element. Return the removed element.
• T LinkedList<T>::shift() - Remove the FIRST element. Return the removed element.
• T LinkedList<T>::get(int index) - Return the element at index.
• void LinkedList<T>::clear() - Removes all elements.

For more information, and Latest releases go to https://github.com/ivanseidel/LinkedList

Fell free to commit new changes and use it.

Ivan

[Reply #1 on:]

Thanks for sharing,

[Reply #2 on:]

I'm happy to help...

[Reply #3 on:]

-------- NEW VERSION --------

1.1 (2013-08-03): Cache implemented. Getting subsequent objects is now O(N). Before, O(N^2).


We made a simple test, reading 1000 sequently elements 100 times and took the time needed to do it:

With previous version (Without caching system), took about 45000 miliseconds
With the new version (with a simple caching system), took 750 miliseconds

Update now and enjoy =)

[Reply #4 on:]

Have you tried to implement skiplists ?
skiplists are fast dynamic datastructures, use 2n nodes for n values, and have an on average accestime of (Log(n))

- http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/lecture-12-skip-lists/ -

fun structure to implement!

[Reply #5 on:]

Have you tried to implement skiplists ?
skiplists are fast dynamic datastructures, use 2n nodes for n values, and have an on average accestime of (Log(n))

That's cool! I had one idea like that, but didn't know it had a name...

If you want to, you can doit. If it's easy to use, then I can merge with the existing one =)

Thanks for the idea.

Ivan