J
jehugaleahsa
Hello:
I got tired of trying to find good implementations of collections and
other data structures in C#. So, I started implementing my own.
However, data structures is a wholly different process in C# compared
to C++. I have to be a lot more careful about dangling pointers to
make sure things don't get pushed into further GC generations.
When I started learning about Comparer and similar classes, I got a
little worried that I am walking in the dark.
Is there a list of things I should be aware of when implementing data
structures in C#? Is there a decent book that covers implementation
details?
Is it possible to implement an efficient Doubly-Linked list without
creating an iterator class? (Just asking)
So far I have implemented an ArrayList<T>, LinkedList<T>, HashTable<K,
V>, BinarySearchTree<T>, Heap<T>, Stack<T>, Queue<T>, and
PriorityQueue<T>. I thought I would stop now before going back becomes
a nightmare.
Should my HashTable really be a HashTable<T>?
Thanks,
Travis
I got tired of trying to find good implementations of collections and
other data structures in C#. So, I started implementing my own.
However, data structures is a wholly different process in C# compared
to C++. I have to be a lot more careful about dangling pointers to
make sure things don't get pushed into further GC generations.
When I started learning about Comparer and similar classes, I got a
little worried that I am walking in the dark.
Is there a list of things I should be aware of when implementing data
structures in C#? Is there a decent book that covers implementation
details?
Is it possible to implement an efficient Doubly-Linked list without
creating an iterator class? (Just asking)
So far I have implemented an ArrayList<T>, LinkedList<T>, HashTable<K,
V>, BinarySearchTree<T>, Heap<T>, Stack<T>, Queue<T>, and
PriorityQueue<T>. I thought I would stop now before going back becomes
a nightmare.
Should my HashTable really be a HashTable<T>?
Thanks,
Travis