«…very basic concept…using it internally…»
Exactly because of that I asked. Best regards, Karl
«The Crux of the Biscuit is the Apostrophe»
| [reply] |
Yes, linked lists are important.
Some years ago, I did a C project which used a very dumbed down version of a Perl hash table. Not as sophisticated of data types, but the basic algorithm and structure are present including how Perl doubles a hash array when it needs to do so. Topics of interest: dynamic memory allocation, structures, array of pointer to linked lists, linked lists. If it would help this guy study, msg me with an email addr and I will find it and send it to you.
Update: Karl did take me up on the offer and I sent him my release version of MemTracker.h. I wrote this for a local CIS department in 2013.
You include this .h file into your gcc, g++4 or MS dev 2008 and 2010 (C or C++) program and it uses pre-processor directives to "take over" and monitor memory allocation. Getting the preprocessor stuff right so that it worked with 4 compliers was non-trivial. It uses something very similar to a Perl hash table for its main data structure. Runs like a rocket (performance impact insignificant) and prints source code line numbers of say allocations which are not later freed before program exit. Plenty of dynamic stacks, lists, etc in this thing. It helps students monitor/debug creation of such things and of course uses such things itself! Current version only works with a single compilation unit, but that is all that was needed for beginning C++. Karl's student will understand some C if he understands this thing.
| [reply] |
