<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Alan</title><link>http://support.reasonablesw.com/blogs/alan/default.aspx</link><description /><dc:language>en-US</dc:language><generator>CommunityServer 1.1 (Build: 1.1.0.50615)</generator><item><title>NoClone 4 Progress Report</title><link>http://support.reasonablesw.com/blogs/alan/archive/2006/02/15/196.aspx</link><pubDate>Wed, 15 Feb 2006 16:00:00 GMT</pubDate><guid isPermaLink="false">81a7e435-4045-4dd1-b781-64af39d33438:196</guid><dc:creator>alan</dc:creator><slash:comments>0</slash:comments><comments>http://support.reasonablesw.com/blogs/alan/comments/196.aspx</comments><wfw:commentRss>http://support.reasonablesw.com/blogs/alan/commentrss.aspx?PostID=196</wfw:commentRss><description>&lt;P&gt;Hi NoCloners,&lt;/P&gt;
&lt;P&gt;It has been a long delay as NoClone 4 beta is expected to release in last month. Let me explain a bit.&lt;/P&gt;
&lt;P&gt;Unlike previous updates from versions 1.0 to 3.2, this update will involve a big fundamental change. Here are some fundamental limitations to be elimiated in NoClone 4.&lt;/P&gt;
&lt;OL&gt;
&lt;LI&gt;at most 300,000 files can be scanned at one single scan (out of memory error)&lt;/LI&gt;
&lt;LI&gt;stack overflow error&lt;/LI&gt;
&lt;LI&gt;compare files not larger than 2GB&lt;/LI&gt;
&lt;LI&gt;cannot read unicode file name&lt;/LI&gt;
&lt;LI&gt;compare&amp;nbsp;maximun 256 same-sized files&lt;/LI&gt;&lt;/OL&gt;
&lt;P&gt;Most of the issues can be addressed when migrating to VB.net from VB6 except first one. The basic idea to solve the first problem is to store result in disk instead of main memory.&amp;nbsp;This leads to&amp;nbsp;large overhead when scanning a few files. An attempt to store result in main memory for small search is need. After&amp;nbsp;a little research, virtual&amp;nbsp;mode datagridview will be used to load only needed result from database.&amp;nbsp;I have tried to optimize the byte comparison algorithm but found that the original one is optimized. My last hope is speed up byte-by-byte comparison is to write library in VC++ and then called by .net. I don't have much experience on it so, if there is any expert in this area, please write me some code and you will be rewarded.&lt;/P&gt;
&lt;P&gt;In conclusion, too much time on research and in order to have a beta soon, the remained parts will be&amp;nbsp;migrated from&amp;nbsp;original code instead of optimized one. &lt;/P&gt;
&lt;P&gt;Alan&lt;BR&gt;Author&lt;/P&gt;&lt;img src="http://support.reasonablesw.com/aggbug.aspx?PostID=196" width="1" height="1"&gt;</description></item><item><title>NoClone 4</title><link>http://support.reasonablesw.com/blogs/alan/archive/2005/11/19/86.aspx</link><pubDate>Sat, 19 Nov 2005 12:26:00 GMT</pubDate><guid isPermaLink="false">81a7e435-4045-4dd1-b781-64af39d33438:86</guid><dc:creator>alan</dc:creator><slash:comments>0</slash:comments><comments>http://support.reasonablesw.com/blogs/alan/comments/86.aspx</comments><wfw:commentRss>http://support.reasonablesw.com/blogs/alan/commentrss.aspx?PostID=86</wfw:commentRss><description>working...&lt;img src="http://support.reasonablesw.com/aggbug.aspx?PostID=86" width="1" height="1"&gt;</description></item></channel></rss>