median.awk revision 1.3 1 #!/bin/awk -f
2 # $NetBSD: median.awk,v 1.3 1995/03/26 21:45:21 glass Exp $
3 #
4 # Copyright (c) 1990, 1993
5 # The Regents of the University of California. All rights reserved.
6 #
7 # This code is derived from software contributed to Berkeley by
8 # Van Jacobson.
9 #
10 # Redistribution and use in source and binary forms, with or without
11 # modification, are permitted provided that the following conditions
12 # are met:
13 # 1. Redistributions of source code must retain the above copyright
14 # notice, this list of conditions and the following disclaimer.
15 # 2. Redistributions in binary form must reproduce the above copyright
16 # notice, this list of conditions and the following disclaimer in the
17 # documentation and/or other materials provided with the distribution.
18 # 3. All advertising materials mentioning features or use of this software
19 # must display the following acknowledgement:
20 # This product includes software developed by the University of
21 # California, Berkeley and its contributors.
22 # 4. Neither the name of the University nor the names of its contributors
23 # may be used to endorse or promote products derived from this software
24 # without specific prior written permission.
25 #
26 # THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 # ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 # ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 # FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 # DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 # OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 # HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 # LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 # OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 # SUCH DAMAGE.
37 #
38 # from: @(#)median.awk 8.1 (Berkeley) 6/6/93
39 # $Id: median.awk,v 1.3 1995/03/26 21:45:21 glass Exp $
40 #
41 /^ *[0-9]/ {
42 # print out the median time to each hop along a route.
43 tottime = 0; n = 0;
44 for (f = 5; f <= NF; ++f) {
45 if ($f == "ms") {
46 ++n
47 time[n] = $(f - 1)
48 }
49 }
50 if (n > 0) {
51 # insertion sort the times to find the median
52 for (i = 2; i <= n; ++i) {
53 v = time[i]; j = i - 1;
54 while (time[j] > v) {
55 time[j+1] = time[j];
56 j = j - 1;
57 if (j < 0)
58 break;
59 }
60 time[j+1] = v;
61 }
62 if (n > 1 && (n % 2) == 0)
63 median = (time[n/2] + time[(n/2) + 1]) / 2
64 else
65 median = time[(n+1)/2]
66
67 print $1, median
68 }
69 }
70