1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
|
# Written by Aleksey Cheusov <vle@gmx.net>, public domain
#
# This awk module is a part of RunAWK distribution,
# http://sourceforge.net/projects/runawk
#
############################################################
# =head2 min.awk
#
# =over 2
#
# =item I<min, min3, min4, min5>
#
# minimum functions
#
# =item I<min_key(HASH, DFLT)>
#
# returns a minimum key in HASH or DFLT if it is empty
#
# =item I<min_value(HASH, DFLT)>
#
# returns a minimum value in HASH or DFLT if it is empty
#
# =item I<key_of_min_value(HASH, DFLT)>
#
# returns A KEY OF minimum value in HASH or DFLT if it is empty
#
# =back
#
function min (a, b){
return (a < b ? a : b)
}
function min3 (a, b, c, m){
m = (a < b ? a : b)
return (m < c ? m : c)
}
function min4 (a, b, c, d, m){
m = (a < b ? a : b)
m = (m < c ? m : c)
return (m < d ? m : d)
}
function min5 (a, b, c, d, e, m){
m = (a < b ? a : b)
m = (m < c ? m : c)
m = (m < d ? m : d)
return (m < e ? m : e)
}
function min_key(hash, dflt, i){
for (i in hash){
dflt = i
break
}
for (i in hash){
if (i < dflt)
dflt = i
}
return dflt
}
function min_value(hash, dflt, i){
for (i in hash){
dflt = hash [i]
break
}
for (i in hash){
if (hash [i] < dflt)
dflt = hash [i]
}
return dflt
}
function key_of_min_value(hash, dflt, i,v){
for (i in hash){
dflt = i
v = hash [i]
break
}
for (i in hash){
if (hash [i] < v){
dflt = i
v = hash [i]
}
}
return dflt
}
|
