如何通过检查第二个文本文件(main.txt
)来删除文本文件(removethese.txt
)中的所有行。如果文件大于10-100mb,那么有效方法是什么? [使用mac]
main.txt
3
1
2
5
删除这些行
removethese.txt
3
2
9
输出:
output.txt
1
5
示例行(这些是我正在使用的实际行 - 顺序无关紧要):
ChIJW3p7Xz8YyIkRBD_TjKGJRS0
ChIJ08x-0kMayIkR5CcrF-xT6ZA
ChIJIxbjOykFyIkRzugZZ6tio1U
ChIJiaF4aOoEyIkR2c9WYapWDxM
ChIJ39HoPKDix4kRcfdIrxIVrqs
ChIJk5nEV8cHyIkRIhmxieR5ak8
ChIJs9INbrcfyIkRf0zLkA1NJEg
ChIJRycysg0cyIkRArqaCTwZ-E8
ChIJC8haxlUDyIkRfSfJOqwe698
ChIJxRVp80zpcEARAVmzvlCwA24
ChIJw8_LAaEEyIkR68nb8cpalSU
ChIJs35yqObit4kR05F4CXSHd_8
ChIJoRmgSdwGyIkRvLbhOE7xAHQ
ChIJaTtWBAWyVogRcpPDYK42-Nc
ChIJTUjGAqunVogR90Kc8hriW8c
ChIJN7P2NF8eVIgRwXdZeCjL5EQ
ChIJizGc0lsbVIgRDlIs85M5dBs
ChIJc8h6ZqccVIgR7u5aefJxjjc
ChIJ6YMOvOeYVogRjjCMCL6oQco
ChIJ54HcCsaeVogRIy9___RGZ6o
ChIJif92qn2YVogR87n0-9R5tLA
ChIJ0T5e1YaYVogRifrl7S_oeM8
ChIJwWGce4eYVogRcrfC5pvzNd4
答案 0 :(得分:9)
有两种标准方法可以做到这一点:
使用grep
:
grep -vxFf removethese main
这使用:
-v
反转比赛。-x
匹配整行,以防止he
匹配hello
或highway to hell
等行。-F
使用固定字符串,以便按原样获取参数,而不是将其解释为正则表达式。-f
从另一个文件中获取模式。在这种情况下,来自removethese
。使用awk
:
$ awk 'FNR==NR {a[$0];next} !($0 in a)' removethese main
1
5
像这样,我们将removethese
中的每一行存储在数组a[]
中。然后,我们读取main
文件,然后打印出数组中不存在的那些行。
答案 1 :(得分:5)
使用grep
:
grep -vxFf removethese.txt main.txt >output.txt
使用fgrep
:
fgrep -vxf removethese.txt main.txt >output.txt
fgrep
已弃用。 fgrep --help
说:
调用' fgrep'已弃用;使用' grep -F'代替。
使用awk
(来自@fedorqui):
awk 'FNR==NR {a[$0];next} !($0 in a)' removethese.txt main.txt >output.txt
使用sed
:
sed "s=^=/^=;s=$=$/d=" removethese.txt | sed -f- main.txt >output.txt
如果 removethese.txt 包含特殊字符,则会失败。为此你可以这样做:
sed 's/[^^]/[&]/g; s/\^/\\^/g' removethese.txt >newremovethese.txt
并在sed
命令中使用此 newremovethese.txt 。但这不值得付出努力,与其他方法相比,它太慢了。
对上述方法进行测试:
sed
方法需要花费太多时间,不值得测试。
使用的文件:
removethese.txt : Size: 15191908 (15MB) Blocks: 29672 Lines: 100233
main.txt : Size: 27640864 (27.6MB) Blocks: 53992 Lines: 180034
命令:
grep -vxFf
| fgrep -vxf
| awk
采取时间:
0m7.966s
| 0m7.823s
| 0m0.237s
0m7.877s
| 0m7.889s
| 0m0.241s
0m7.971s
| 0m7.844s
| 0m0.234s
0m7.864s
| 0m7.840s
| 0m0.251s
0m7.798s
| 0m7.672s
| 0m0.238s
0m7.793s
| 0m8.013s
| 0m0.241s
AVG
0m7.8782s
| 0m7.8468s
| 0m0.2403s
此测试结果表明fgrep
比grep
快一点。
awk
方法(来自@fedorqui)以快速颜色传递测试(仅0.2403 seconds
!!!)。
测试环境:
HP ProBook 440 G1 Laptop
8GB RAM
2.5GHz processor with turbo boost upto 3.1GHz
RAM being used: 2.1GB
Swap being used: 588MB
RAM being used when the grep/fgrep command is run: 3.5GB
RAM being used when the awk command is run: 2.2GB or less
Swap being used when the commands are run: 588MB (No change)
测试结果:
使用awk
方法。
答案 2 :(得分:2)
我喜欢@ fedorqui使用 awk 进行设置,其中有足够的内存来容纳所有“删除这些”行:内存方法的简洁表达。
但是对于要删除的行的大小相对于当前内存大的情况,并且将该数据读入内存数据结构是失败或捶打的邀请,请考虑一种古老的方法:sort / join < / p>
sort main.txt > main_sorted.txt
sort removethese.txt > removethese_sorted.txt
join -t '' -v 1 main_sorted.txt removethese_sorted.txt > output.txt
注意:
答案 3 :(得分:2)
以下是我发现的许多简单有效的解决方案:http://www.catonmat.net/blog/set-operations-in-unix-shell-simplified/
您需要使用Set Complement
bash命令之一。 100MB文件可在几秒或几分钟内解决。
设置会员资格
$ grep -xc 'element' set # outputs 1 if element is in set
# outputs >1 if set is a multi-set
# outputs 0 if element is not in set
$ grep -xq 'element' set # returns 0 (true) if element is in set
# returns 1 (false) if element is not in set
$ awk '$0 == "element" { s=1; exit } END { exit !s }' set
# returns 0 if element is in set, 1 otherwise.
$ awk -v e='element' '$0 == e { s=1; exit } END { exit !s }'
设置平等
$ diff -q <(sort set1) <(sort set2) # returns 0 if set1 is equal to set2
# returns 1 if set1 != set2
$ diff -q <(sort set1 | uniq) <(sort set2 | uniq)
# collapses multi-sets into sets and does the same as previous
$ awk '{ if (!($0 in a)) c++; a[$0] } END{ exit !(c==NR/2) }' set1 set2
# returns 0 if set1 == set2
# returns 1 if set1 != set2
$ awk '{ a[$0] } END{ exit !(length(a)==NR/2) }' set1 set2
# same as previous, requires >= gnu awk 3.1.5
设置基数
$ wc -l set | cut -d' ' -f1 # outputs number of elements in set
$ wc -l < set
$ awk 'END { print NR }' set
子集测试
$ comm -23 <(sort subset | uniq) <(sort set | uniq) | head -1
# outputs something if subset is not a subset of set
# does not putput anything if subset is a subset of set
$ awk 'NR==FNR { a[$0]; next } { if !($0 in a) exit 1 }' set subset
# returns 0 if subset is a subset of set
# returns 1 if subset is not a subset of set
设置联盟
$ cat set1 set2 # outputs union of set1 and set2
# assumes they are disjoint
$ awk 1 set1 set2 # ditto
$ cat set1 set2 ... setn # union over n sets
$ cat set1 set2 | sort -u # same, but assumes they are not disjoint
$ sort set1 set2 | uniq
# sort -u set1 set2
$ awk '!a[$0]++' # ditto
设置交叉点
$ comm -12 <(sort set1) <(sort set2) # outputs insersect of set1 and set2
$ grep -xF -f set1 set2
$ sort set1 set2 | uniq -d
$ join <(sort -n A) <(sort -n B)
$ awk 'NR==FNR { a[$0]; next } $0 in a' set1 set2
设置补语
$ comm -23 <(sort set1) <(sort set2)
# outputs elements in set1 that are not in set2
$ grep -vxF -f set2 set1 # ditto
$ sort set2 set2 set1 | uniq -u # ditto
$ awk 'NR==FNR { a[$0]; next } !($0 in a)' set2 set1
设置对称差异
$ comm -3 <(sort set1) <(sort set2) | sed 's/\t//g'
# outputs elements that are in set1 or in set2 but not both
$ comm -3 <(sort set1) <(sort set2) | tr -d '\t'
$ sort set1 set2 | uniq -u
$ cat <(grep -vxF -f set1 set2) <(grep -vxF -f set2 set1)
$ grep -vxF -f set1 set2; grep -vxF -f set2 set1
$ awk 'NR==FNR { a[$0]; next } $0 in a { delete a[$0]; next } 1;
END { for (b in a) print b }' set1 set2
电源设置
$ p() { [ $# -eq 0 ] && echo || (shift; p "$@") |
while read r ; do echo -e "$1 $r\n$r"; done }
$ p `cat set`
# no nice awk solution, you are welcome to email me one:
# peter@catonmat.net
设置笛卡儿积
$ while read a; do while read b; do echo "$a, $b"; done < set1; done < set2
$ awk 'NR==FNR { a[$0]; next } { for (i in a) print i, $0 }' set1 set2
不相交集测试
$ comm -12 <(sort set1) <(sort set2) # does not output anything if disjoint
$ awk '++seen[$0] == 2 { exit 1 }' set1 set2 # returns 0 if disjoint
# returns 1 if not
空集测试
$ wc -l < set # outputs 0 if the set is empty
# outputs >0 if the set is not empty
$ awk '{ exit 1 }' set # returns 0 if set is empty, 1 otherwise
<强>最小强>
$ head -1 <(sort set) # outputs the minimum element in the set
$ awk 'NR == 1 { min = $0 } $0 < min { min = $0 } END { print min }'
<强>最大强>
$ tail -1 <(sort set) # outputs the maximum element in the set
$ awk '$0 > max { max = $0 } END { print max }'