![]() |
China DOS Union-- Unite DOS · Advance DOS · Grow DOS --Union site: www.cn-dos.net Forum site: www.cn-dos.net/forum |
| Guest | Log in | Register | Members | Search | China DOS Union |
|
中国DOS联盟论坛 The time now is 2026-08-09 03:53 |
47,811 topics / 349,895 posts / today 0 new / 48,253 members |
| DOS批处理 & 脚本技术(批处理室) » [Help] Problem with Comparing Two Files |
| Printable Version 3,281 / 52 |
| Floor46 quya | Posted 2008-07-10 00:11 |
| 高级用户 Posts 172 Credits 558 From 江苏 | |
Originally posted by zw19750516 at 2008-7-10 12:09 AM: Sorry, I should have looked at the code on floor 24 plus the code on floor 7. I made a mistake. Also, there might be an issue with missing or extra parentheses in your code. I can't tell. [ Last edited by quya on 2008-7-10 at 12:17 AM ] |
|
| Floor47 bat-zw | Posted 2008-07-10 00:23 |
| 金牌会员 Posts 1,276 Credits 3,105 | |
|
Oh, there's neither more nor less. I can't see it either.
Don't think about it anymore, going to sleep. [ Last edited by zw19750516 on 2008-7-10 at 12:27 AM ] |
|
| Floor48 26933062 | Posted 2008-07-10 00:30 |
| 银牌会员 Posts 879 Credits 2,268 | |
|
The number of loops for the code on floor 39 to 1.txt is equal to the number of lines in 2.txt multiplied by the number of lines in 1.txt, so the efficiency is much lower.
[ Last edited by 26933062 on 2008-7-10 at 12:31 AM ] |
|
| Floor49 26933062 | Posted 2008-07-10 00:46 |
| 银牌会员 Posts 879 Credits 2,268 | |
|
Has the thread starter solved the problem?
|
|
| Floor50 quya | Posted 2008-07-10 00:48 |
| 高级用户 Posts 172 Credits 558 From 江苏 | |
Originally posted by 26933062 at 2008-7-10 12:30 AM: You claimed that you didn't even graduate from junior high school, but now I simply can't believe it. How can someone who didn't graduate from junior high school write programs so skillfully? You've confused me, someone who claims to have at least a college education, completely. If I were ten years younger, I don't think I would come here for help. It's embarrassing. At most, I would stay up all night to thoroughly understand all the commands and then figure out a way, but I'm getting old, and indeed, I can't do it anymore. Going to sleep now. I've learned a lot today. One learns until one dies. Thanks everyone! [ Last edited by quya on 2008-7-10 at 12:52 AM ] |
|
| Floor51 terse | Posted 2008-07-10 01:01 |
| 银牌会员 Posts 946 Credits 2,404 | |
|
Still, Xiao Lou's looks better. Compare with yours.
|
|
| Floor52 26933062 | Posted 2008-07-10 01:11 |
| 银牌会员 Posts 879 Credits 2,268 | |
|
I took another look at the description in the top post, the original poster's sentence.
Now I get a variable value, such as HEDY, which is the first value in the line in file 1.txt. I perform a CRC32 check on the files in the path in 2.txt (if it's a compressed file, first EXPAND it), run CRC32.EXE, assume that the CRC output result is the second Token in the first line, and then compare it with the value in the second line of file 1.txt. IF FIND, then assign the corresponding path to a variable. It seems to be to find the required file name according to the value of a variable, not to compare all. The following: the value of str is the one to be found. It can be multiple, separated by spaces. : [ Last edited by 26933062 on 2008-7-10 at 01:21 AM ] |
|
| Floor53 fastslz | Posted 2008-07-10 17:12 |
| 铂金会员 Posts 2,315 Credits 5,493 From 上海 | |
Originally posted by quya at 2008-7-9 13:53: It's a bit messy. I'll give you a solution for the above problem (requires crc32sum.exe) Function description: Enumerate CA* extensions on drive D. If the extension is CA_, use EXPAND to extract to the temporary folder and then use crc32sum.exe to verify. Otherwise, directly use crc32sum.exe to verify. Assign the verification value to the variable crc32. Finally, filter and display the OEM results. crc32sum.exe can be downloaded from my cloud disk. http://fastslz.cech.com.cn/#show=file This is my execution result File "D:\oembios\XP_ACER_OEM\OEMBIOS.CA_" corresponds to brand Acer |
|
| Prev 1 2 3 4 |
|
[ Contact the Union admin team -
中国DOS联盟 -
Standard version ] Sponsored by ifanr Inc | © 2001–2023 |