awk怎么处理无序的域

战雨灾

比如像cygwin的setup.ini或debian的索引文件(packages)

welcome008

awk不讲究排序的吧？

prc

参考
这段代码用来计算cygwin下某个模块的安装包的依赖关系

1. 
   
2. #! /usr/bin/gawk -f
   
3. #
   
4. #        gawk -v PACKAGES_TO_INSTALL="gdb" \
   
5. #                -f \$get-cygwin-requries.awk setup.ini
   
6. 
   
7. function make_key(package, suffix)
   
8. {
   
9.         return package DS suffix;
   
10. }
    
11. 
    
12. function compare(requires1, requires2, a1,n1,a2,n2,i)
    
13. {
    
14.         n1 = split(requires1, a1);
    
15.         n2 = split(requires2, a2);
    
16.         if( n1 == n2 ) {
    
17.                 asort(a1);
    
18.                 asort(a2);
    
19.                 for(i=1; i<=n1; i++) {
    
20. #                        printf("%s -- %s\n", a1[i], a2[i]) >STDERR;
    
21.                         if(a1[i] != a2[i])
    
22.                                 return -1;
    
23.                 }
    
24.                 return 0;
    
25.         }
    
26.         return n1-n2;
    
27. }
    
28. 
    
29. function in_array(val, array, i)
    
30. {
    
31.         for(i in array) {
    
32.                 if( array[i] == val ) {
    
33. #                        printf("IN\n") >STDERR;
    
34.                         return 1;
    
35.                 }
    
36.         }
    
37. #        printf("OUT\n") >STDERR;;
    
38.         return 0;
    
39. }
    
40. 
    
41. function join(requires1, requires2,
    
42.         a1,n1,a2,n2,i,r)
    
43. {
    
44.         n1 = split(requires1, a1);
    
45.         n2 = split(requires2, a2);
    
46.         r = "";
    
47.        
    
48.         for(i=1; i<=n1; i++)
    
49.                 r = r " " a1[i];
    
50.         for(i=1; i<=n2; i++) {
    
51.                 if( !in_array(a2[i], a1) ) {
    
52.                         r = r " " a2[i];
    
53.                 }
    
54.         }
    
55.         return r;
    
56. }
    
57. 
    
58. 
    
59. function get_requires(all_packages, requires,
    
60.         max_requires, more_requires, req, i, n, key_requires, package)
    
61. {
    
62.         max_requires = requires;
    
63. #        printf("Enter: Level: %d\n", level) >STDERR;
    
64. #        printf("requries: %s\n", requires) >STDERR;
    
65.         n = split(requires, req);
    
66.         for(i=1; i<=n; i++) {
    
67.                 package = req[i];
    
68.                 key_requires = make_key(package, "requires");
    
69. #                printf("key: %s\n", key_requires) >STDERR;
    
70.                 more_requires = all_packages[key_requires];
    
71. #                printf("more_requries: %s\n", more_requires) >STDERR;
    
72.                 max_requires = join(max_requires,  more_requires);
    
73.         }
    
74. #        printf("requires:     %s\n", requires) >STDERR;
    
75. #        printf("max_requires: %s\n", max_requires) >STDERR;
    
76.         if( compare(max_requires, requires) != 0 ) {
    
77.                 more_requires = get_requires(all_packages, max_requires);
    
78.                 max_requires = join(max_requires, more_requires);
    
79.         }
    
80. #        printf("Leave: Level: %d\n", level) >STDERR;
    
81.         return max_requires;
    
82. }
    
83. 
    
84. 
    
85. function resolve_packages(all_packages, packages,
    
86.         a, n, i, key, files)
    
87. {
    
88.         files = "";
    
89.         n = split(packages, a);
    
90.         for(i=1; i<=n; i++) {
    
91.                 key = make_key(a[i], "install");
    
92.                 if( all_packages[key] != "" )
    
93.                         files = files " " all_packages[key];
    
94.         }
    
95.         return files;
    
96. }
    
97. 
    
98. 
    
99. BEGIN {
    
100.         FS = "(:|[ \t]+)";
     
101. #        STDERR = "/dev/stderr";
     
102.         STDERR = "/dev/null";
     
103.         skip_prev = 1;
     
104.         DS = "#";
     
105. }
     
106. 
     
107. 
     
108. {
     
109.         delete words
     
110.         num_words = 0;
     
111.         for(i=1; i<=NF; i++) {
     
112.                 if($i != "") {
     
113.                         num_words++;
     
114.                         words[num_words] = $i;
     
115. #                        printf("%s--", $i) >STDERR;
     
116.                 }
     
117.         }
     
118. #        printf("\n") >STDERR;
     
119.        
     
120.         switch(words[1]) {
     
121.         case "@":
     
122.                 skip_prev = 0;
     
123.                 cur_package = words[2];
     
124.                 printf("@ %s\n", cur_package) >STDERR;
     
125.                 break;
     
126. 
     
127.         case "requires":
     
128.                 if(!skip_prev) {
     
129.                         key = make_key(cur_package, "requires");
     
130.                         requires = "";
     
131.                         for(i=2; i<=num_words; i++)
     
132.                                 requires = requires " " words[i];
     
133.                         all_packages[key] = requires;
     
134.                         printf("requires: %s\n", requires) >STDERR;
     
135.                 }
     
136.                 break;
     
137. 
     
138.         case "install":
     
139.                 if(!skip_prev) {
     
140.                         key = make_key(cur_package, "install");
     
141.                         all_packages[key] = words[2];
     
142.                         printf("install: %s\n", words[2]) >STDERR;
     
143.                 }
     
144.                 break;
     
145. 
     
146.         case "[prev]":
     
147.                 skip_prev = 1; break;
     
148.         }
     
149. }
     
150. 
     
151. END {
     
152.         pkg = get_requires(all_packages, PACKAGES_TO_INSTALL);
     
153.         printf("%s\n", pkg );
     
154.         printf("%s\n", resolve_packages(all_packages,pkg) );
     
155. }
     

复制代码

xwmhmily

怎么个无序法,需要怎么个处理法?

战雨灾

谢谢 prc 大概看明白了,就是函数有点晕,如果要用RS\FS来解析的话怎么写,下面是我写的用来解析packages的,不过每个域的第一个字母会没掉
{
RS=""
FS="\n[^ ]"
}

@xwmhmily 下面一cygwin的setup.ini里的两条数据.第一个域(@ ELFIO)是固定有的,而下面的requires\install等却是不一定有的,但是并不给它们留位置

--------------------------------------------------------
@ ELFIO
sdesc: "ELF file reader and producer implemented as a C++ library"
ldesc: "ELFIO is a C++ library for reading and generating files in the
ELF (Executable and Linkable Format) binary format. This library is
unique and not based on any other product. It is also platform
independent. The library uses standard ANSI C++ constructions and runs
on a wide variety of architectures."
category: Devel System Libs Utils
requires: cygwin
version: 1.0.2-1
install: release/ELFIO/ELFIO-1.0.2-1.tar.bz2 159970 41b32111cbaaad78ea56dc62b757dd46
source: release/ELFIO/ELFIO-1.0.2-1-src.tar.bz2 280550 891cb420a38144e94447e99e3fddafa2
[prev]
version: 1.0.0-1
install: release/ELFIO/ELFIO-1.0.0-1.tar.bz2 151514 47cf28298685439ba5b5ac478e8eb44e
source: release/ELFIO/ELFIO-1.0.0-1-src.tar.bz2 274022 d29ab8fb0cad01250969983afca9891b

@ GConf2-doc
sdesc: "GNOME configuration database system (API documentation)"
ldesc: "GConf is a configuration database system, functionally similar to the
Windows registry but lots better. It's being written for the GNOME
desktop but does not require GNOME; configure should notice if GNOME
is not installed and compile the basic GConf library anyway."
category: Gnome Doc
version: 2.14.0-2
install: release/GNOME/GConf2/GConf2-doc/GConf2-doc-2.14.0-2.tar.bz2 42867 0917edf071036bd8be29fec5dec17930
source: release/GNOME/GConf2/GConf2-2.14.0-2-src.tar.bz2 1909270 578ce94b6bdb2ce9a49dd7c90ede47ea