is there any faster way to find two file is similar

Question

1.00/5 (1 vote)

See more:

hi-ITNOG

is there any faster way to find two file is similar instead of using hash code .

using hash code for large files is really slow .

regards

Posted 18-Jul-10 21:19pm

Fullmm

Add a Solution

Comments

Toli Cuturicu 20-Jul-10 10:49am

Reason for my vote of 1
post at the article, not here!

5 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Sandeep Mewara · Answer 1 · 2010-07-18T21:33:00

Solution 2

Apart from what CG has told,
It looks like you want to ask this question to an author related to his/her article.

I would suggest you to please use the forum present at the end of the article in order to reach author and get quick response. Rarely you will find authors reading this forum.

Please post the same at the article's message forum.

Posted 18-Jul-10 21:33pm

Sandeep Mewara

Comments

Christian Graus 19-Jul-10 3:47am

I wondered that but thought ITNOG is more likely to stand for something than be someone :-)

Sauro Viti 19-Jul-10 9:31am

I had searched a bit... It seems that ITNOG stands for "In The Name Of Glory" or "In The Name Of God" :-)

Sandeep Mewara 19-Jul-10 9:56am

Ah! might be... it fits in. :)

Fullmm 19-Jul-10 14:22pm

I used -In The Name Of God- wish every one use this in his post . so we may find ourself and do not start any war ! any lie , any ...

Christian Graus · Answer 2 · 2010-07-18T21:20:00

Solution 1

You can make a decision that if xx bytes are the same, they are the same file. Hash codes won't tell you if they are similar, only the same, or different.

Posted 18-Jul-10 21:20pm

Christian Graus

Comments

Fullmm 19-Jul-10 14:24pm

Ho can I do this ?

Getting only one some byte for compare .

#realJSOP · Answer 3 · 2010-07-19T09:39:00

Solution 4

You could read both files into memory, convert the string into lower case, and compare the two strings. A large file is still going to take more time than a small one, though, because the bottleneck is the hardware.

Posted 19-Jul-10 9:39am

#realJSOP

Updated 19-Jul-10 9:41am

v3

Rajesh Sajjanar · Answer 4 · 2010-07-19T10:07:00

Hi

You can do file comparision by doing byte-by-byte comparison on both the files until it finds a mismatch or it reaches the end of the file. Irrespective of the file names , below is code to compare the files

      <br />
         do<br />
            {<br />
                /* Read the bytes from each file until no match found or end of file is reached */<br />
                <br />
f1byte = f1.ReadByte();<br />
                            f2byte = f2.ReadByte();<br />
            }<br />
            while ((f1byte == f2byte) && (f1byte != -1));<br />

shahin.kiassat · Answer 5 · 2010-07-19T08:59:00

Solution 3

read some random bytes
is that clear?
how about LINQ?

Posted 19-Jul-10 8:59am

shahin.kiassat

Comments

Sandeep Mewara 19-Jul-10 15:49pm

Reason for my vote of 1
It was supposed to be an answer that too a little descriptive one.

is there any faster way to find two file is similar

5 solutions

Solution 2

Solution 1

Solution 4

Solution 5

Solution 3

Add your solution here

Preview 0

Existing Members

...or Join us