http://z-cplusplus.com Tue, 08 Nov 2011 00:49:49 +0000 http://backend.userland.com/rss092 en Check out my result from Speedtest.net! http://t.co/HdL1lXe<img src="http://feeds.feedburner.com/~r/Z-cplusplus/~4/oJKystfyJqw" height="1" width="1"/> http://feedproxy.google.com/~r/Z-cplusplus/~3/oJKystfyJqw/ http://z-cplusplus.com/2011/08/05/check-out-my-result-from-speed/ ADVICE #6 Cache if possible Especially database lookup tables and objects with constant state. This will boost your system&#8217;s performance.<img src="http://feeds.feedburner.com/~r/Z-cplusplus/~4/BInr9-CUE78" height="1" width="1"/> http://feedproxy.google.com/~r/Z-cplusplus/~3/BInr9-CUE78/ http://z-cplusplus.com/2011/06/08/advice-6-cache-if-possiblees/ ADVICE #5 Use std::for_each vs hand written loops. You gain clarity, more organized code and better performance overall.<img src="http://feeds.feedburner.com/~r/Z-cplusplus/~4/kVTmWy3mk7c" height="1" width="1"/> http://feedproxy.google.com/~r/Z-cplusplus/~3/kVTmWy3mk7c/ http://z-cplusplus.com/2011/06/07/advice-5-use-stdfor_each-v/ ADVICE #4 Be portable. Example: Use size_t for size related items; string s(&#8220;Some Elem&#8221;); size_t len(s.size()); Don&#8217;t use unsigned instead.<img src="http://feeds.feedburner.com/~r/Z-cplusplus/~4/5KW6Kevn8jE" height="1" width="1"/> http://feedproxy.google.com/~r/Z-cplusplus/~3/5KW6Kevn8jE/ http://z-cplusplus.com/2011/05/18/advice-4-be-portable-exampl/ ADVICE #3 Ensure you understand pointers. Explain: Be able to deal with: char **pp(new char*[25]), int** fun(int** pp) to name a few.<img src="http://feeds.feedburner.com/~r/Z-cplusplus/~4/Er1-6S-jWhU" height="1" width="1"/> http://feedproxy.google.com/~r/Z-cplusplus/~3/Er1-6S-jWhU/ http://z-cplusplus.com/2011/05/18/advice-3-ensure-you-understa/ ADVICE #2 Write as little code as possible, but no less. Explain: implement what is required, don&#8217;t get fancy, don&#8217;t over-design. Deliver!<img src="http://feeds.feedburner.com/~r/Z-cplusplus/~4/sN7AmsJ8fjs" height="1" width="1"/> http://feedproxy.google.com/~r/Z-cplusplus/~3/sN7AmsJ8fjs/ http://z-cplusplus.com/2011/05/18/advice-2-write-as-little-cod/ ADVICE #1 Preallocate a vector if you know a number of items to insert. Example: insert 30 items; std::vector&#60;SomeType&#62; v; v.reserve(30);<img src="http://feeds.feedburner.com/~r/Z-cplusplus/~4/wZhtzKntfs0" height="1" width="1"/> http://feedproxy.google.com/~r/Z-cplusplus/~3/wZhtzKntfs0/ http://z-cplusplus.com/2011/05/18/advice-1-preallocate-a-vecto/ There is no excerpt because this is a protected post.<img src="http://feeds.feedburner.com/~r/Z-cplusplus/~4/UGg-pCoGbsA" height="1" width="1"/> http://feedproxy.google.com/~r/Z-cplusplus/~3/UGg-pCoGbsA/ http://z-cplusplus.com/2011/05/02/excessive-object-creation-may/ <img src="http://feeds.feedburner.com/~r/Z-cplusplus/~4/DV39C9dYfzA" height="1" width="1"/> http://feedproxy.google.com/~r/Z-cplusplus/~3/DV39C9dYfzA/ http://z-cplusplus.com/2011/04/29/this-is-constant-no-it-aint/ In this part of the &#8220;Arrays on the Heap&#8221; sequence I will discuss a different approach to implement a dynamic array. I will finish with the complete implementation that is cleaner, extensible and better overall. Before I go into details of implementation, I would like to point out a certain property of multi dimensional arrays. [...]<img src="http://feeds.feedburner.com/~r/Z-cplusplus/~4/CneTpAkIlFY" height="1" width="1"/> http://feedproxy.google.com/~r/Z-cplusplus/~3/CneTpAkIlFY/ http://z-cplusplus.com/2011/04/26/arrays-on-the-heap-part-3/