Liste des Groupes | Revenir à cl c |
Bart wrote:also note i posted whole working program and some other just say what can be done... in working code was my main goal not quite starting in contest of what is fastest (this is also interesting topic but not the main goal)On 22/09/2024 11:24, fir wrote:i wanta discus nt to do enything that is mentioned .. it is hard toPaul wrote:>>The normal way to do this, is do a hash check on the
files and compare the hash. You can use MD5SUM, SHA1SUM, SHA256SUM,
as a means to compare two files. If you want to be picky about
it, stick with SHA256SUM.
>the code i posted work ok, and if someone has windows and mingw/tdm>
may compiel it and check the application if wants
>
hashing is not necessary imo though probably could speed things up -
im not strongly convinced that the probablility of misteke in this
hashing is strictly zero (as i dont ever used this and would need to
produce my own hashing probably).. probably its mathematically proven
ists almost zero but as for now at least it is more interesting for me
if the cde i posted is ok
I was going to post similar ideas (doing a linear pass working out
checksums for each file, sorting the list by checksum and size, then
candidates for a byte-by-byte comparison, if you want to do that, will
be grouped together).
>
But if you're going to reject everyone's suggestions in favour of your
own already working solution, then I wonder why you bothered posting.
>
(I didn't post after all because I knew it would be futile.)
>
>
understand? so i may read on options but literally got no time to
implement even good idead - thsi program i wrote showed to work and im
now using it
Les messages affichés proviennent d'usenet.