<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Z-CPlusPlus</title>
	<atom:link href="http://z-cplusplus.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://z-cplusplus.com</link>
	<description>Your C++ world</description>
	<lastBuildDate>Tue, 08 Nov 2011 00:49:49 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5.1</generator>
		<item>
		<title>Check out my result from Speed&#8230;</title>
		<link>http://z-cplusplus.com/2011/08/05/check-out-my-result-from-speed/</link>
		<comments>http://z-cplusplus.com/2011/08/05/check-out-my-result-from-speed/#comments</comments>
		<pubDate>Fri, 05 Aug 2011 00:22:05 +0000</pubDate>
		<dc:creator>Zbigniew Mastylo</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://z-cplusplus.com/2011/08/05/check-out-my-result-from-speed/</guid>
		<description><![CDATA[Check out my result from Speedtest.net! http://t.co/HdL1lXe]]></description>
		<wfw:commentRss>http://z-cplusplus.com/2011/08/05/check-out-my-result-from-speed/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>ADVICE #6 Cache if possible
Es&#8230;</title>
		<link>http://z-cplusplus.com/2011/06/08/advice-6-cache-if-possiblees/</link>
		<comments>http://z-cplusplus.com/2011/06/08/advice-6-cache-if-possiblees/#comments</comments>
		<pubDate>Wed, 08 Jun 2011 15:46:37 +0000</pubDate>
		<dc:creator>Zbigniew Mastylo</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://z-cplusplus.com/2011/06/08/advice-6-cache-if-possiblees/</guid>
		<description><![CDATA[ADVICE #6 Cache if possible Especially database lookup tables and objects with constant state. This will boost your system&#8217;s performance.]]></description>
		<wfw:commentRss>http://z-cplusplus.com/2011/06/08/advice-6-cache-if-possiblees/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>ADVICE #5 
Use std::for_each v&#8230;</title>
		<link>http://z-cplusplus.com/2011/06/07/advice-5-use-stdfor_each-v/</link>
		<comments>http://z-cplusplus.com/2011/06/07/advice-5-use-stdfor_each-v/#comments</comments>
		<pubDate>Tue, 07 Jun 2011 21:38:39 +0000</pubDate>
		<dc:creator>Zbigniew Mastylo</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://z-cplusplus.com/2011/06/07/advice-5-use-stdfor_each-v/</guid>
		<description><![CDATA[ADVICE #5 Use std::for_each vs hand written loops. You gain clarity, more organized code and better performance overall.]]></description>
		<wfw:commentRss>http://z-cplusplus.com/2011/06/07/advice-5-use-stdfor_each-v/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>ADVICE #4: Be portable. Exampl&#8230;</title>
		<link>http://z-cplusplus.com/2011/05/18/advice-4-be-portable-exampl/</link>
		<comments>http://z-cplusplus.com/2011/05/18/advice-4-be-portable-exampl/#comments</comments>
		<pubDate>Wed, 18 May 2011 05:46:46 +0000</pubDate>
		<dc:creator>Zbigniew Mastylo</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://z-cplusplus.com/2011/05/18/advice-4-be-portable-exampl/</guid>
		<description><![CDATA[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.]]></description>
		<wfw:commentRss>http://z-cplusplus.com/2011/05/18/advice-4-be-portable-exampl/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>ADVICE #3: Ensure you understa&#8230;</title>
		<link>http://z-cplusplus.com/2011/05/18/advice-3-ensure-you-understa/</link>
		<comments>http://z-cplusplus.com/2011/05/18/advice-3-ensure-you-understa/#comments</comments>
		<pubDate>Wed, 18 May 2011 05:27:37 +0000</pubDate>
		<dc:creator>Zbigniew Mastylo</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://z-cplusplus.com/2011/05/18/advice-3-ensure-you-understa/</guid>
		<description><![CDATA[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.]]></description>
		<wfw:commentRss>http://z-cplusplus.com/2011/05/18/advice-3-ensure-you-understa/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>ADVICE #2: Write as little cod&#8230;</title>
		<link>http://z-cplusplus.com/2011/05/18/advice-2-write-as-little-cod/</link>
		<comments>http://z-cplusplus.com/2011/05/18/advice-2-write-as-little-cod/#comments</comments>
		<pubDate>Wed, 18 May 2011 05:05:38 +0000</pubDate>
		<dc:creator>Zbigniew Mastylo</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://z-cplusplus.com/2011/05/18/advice-2-write-as-little-cod/</guid>
		<description><![CDATA[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!]]></description>
		<wfw:commentRss>http://z-cplusplus.com/2011/05/18/advice-2-write-as-little-cod/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>ADVICE #1: Preallocate a vecto&#8230;</title>
		<link>http://z-cplusplus.com/2011/05/18/advice-1-preallocate-a-vecto/</link>
		<comments>http://z-cplusplus.com/2011/05/18/advice-1-preallocate-a-vecto/#comments</comments>
		<pubDate>Wed, 18 May 2011 04:53:23 +0000</pubDate>
		<dc:creator>Zbigniew Mastylo</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://z-cplusplus.com/2011/05/18/advice-1-preallocate-a-vecto/</guid>
		<description><![CDATA[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);]]></description>
		<wfw:commentRss>http://z-cplusplus.com/2011/05/18/advice-1-preallocate-a-vecto/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Protected: Object creation and performance.</title>
		<link>http://z-cplusplus.com/2011/05/02/excessive-object-creation-may/</link>
		<comments>http://z-cplusplus.com/2011/05/02/excessive-object-creation-may/#comments</comments>
		<pubDate>Mon, 02 May 2011 17:53:37 +0000</pubDate>
		<dc:creator>Zbigniew Mastylo</dc:creator>
				<category><![CDATA[Optimization]]></category>

		<guid isPermaLink="false">http://z-cplusplus.com/2011/05/02/excessive-object-creation-may/</guid>
		<description><![CDATA[There is no excerpt because this is a protected post.]]></description>
		<wfw:commentRss>http://z-cplusplus.com/2011/05/02/excessive-object-creation-may/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>This is constant! No, it ain&#8217;t.</title>
		<link>http://z-cplusplus.com/2011/04/29/this-is-constant-no-it-aint/</link>
		<comments>http://z-cplusplus.com/2011/04/29/this-is-constant-no-it-aint/#comments</comments>
		<pubDate>Fri, 29 Apr 2011 13:23:48 +0000</pubDate>
		<dc:creator>Zbigniew Mastylo</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[C++]]></category>
		<category><![CDATA[Constants]]></category>
		<category><![CDATA[const_cast]]></category>

		<guid isPermaLink="false">http://z-cplusplus.com/2011/04/29/this-is-constant-no-it-aint/</guid>
		<description><![CDATA[   ]]></description>
		<wfw:commentRss>http://z-cplusplus.com/2011/04/29/this-is-constant-no-it-aint/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Arrays on the Heap: Part #3</title>
		<link>http://z-cplusplus.com/2011/04/26/arrays-on-the-heap-part-3/</link>
		<comments>http://z-cplusplus.com/2011/04/26/arrays-on-the-heap-part-3/#comments</comments>
		<pubDate>Tue, 26 Apr 2011 04:33:47 +0000</pubDate>
		<dc:creator>Zbigniew Mastylo</dc:creator>
				<category><![CDATA[Arrays]]></category>
		<category><![CDATA[Exercises]]></category>
		<category><![CDATA[Pointers]]></category>
		<category><![CDATA[arrays]]></category>
		<category><![CDATA[C++]]></category>
		<category><![CDATA[heap]]></category>

		<guid isPermaLink="false">http://z-cplusplus.com/?p=571</guid>
		<description><![CDATA[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. [...]]]></description>
		<wfw:commentRss>http://z-cplusplus.com/2011/04/26/arrays-on-the-heap-part-3/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
