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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
|
global array, agg
probe begin
{
#
# Array section
#
printf("\nArrays:\n");
# Add elements to the array, but in an unsorted order
array[9] = 18;
array[1] = 40
array[8] = 16
array[2] = 4
array[7] = 14
array[3] = 36
array[6] = 12;
array[5] = 10;
array[4] = 8;
array[10] = 20;
# Print the unsorted array
printf("unsorted:\n");
foreach (key in array)
printf("key %d, value %d\n", key, array[key]);
# Print the first 5 unsorted array items
printf("\nunsorted limit 5:\n");
i = 0
foreach (key in array limit 5)
{
printf("key %d, value %d\n", key, array[key]);
i++;
}
printf("loop had %d iterations\n", i);
# Print the first 5 sorted array items (by value)
printf("\nsorted (by values) limit 5:\n");
i = 0
foreach (key in array+ limit 5)
{
printf("key %d, value %d\n", key, array[key]);
i++;
}
printf("loop had %d iterations\n", i);
# Print the first 5 sorted array items (by key)
printf("\nsorted (by keys) limit 5:\n");
i = 0
foreach (key+ in array limit 5)
{
printf("key %d, value %d\n", key, array[key]);
i++;
}
printf("loop had %d iterations\n", i);
# Use a variable reference to limit the loop iteration
x = 3
printf("\nsorted (by values) limit x (%d):\n", x);
i = 0
foreach (key in array+ limit x)
{
printf("key %d, value %d\n", key, array[key])
i++;
}
printf("loop had %d iterations\n", i);
# Use a expression containing a variable reference to limit the
# loop iteration
printf("\nsorted (by values) limit x * 2 (%d):\n", (x * 2));
i = 0
foreach (key in array+ limit x * 2)
{
printf("key %d, value %d\n", key, array[key])
i++;
}
printf("loop had %d iterations\n", i);
# Ensure the expression is only evaluated once
printf("\nsorted (by values) limit ++x:\n");
i = 0
foreach (key in array+ limit ++x)
{
printf("key %d, value %d\n", key, array[key])
i++;
}
printf("loop had %d iterations\n", i);
printf("x ended up as %d\n", x);
# Ensure the expression is only evaluated once
printf("\nsorted (by values) limit x++:\n");
i = 0
foreach (key in array+ limit x++)
{
printf("key %d, value %d\n", key, array[key])
i++;
}
printf("loop had %d iterations\n", i);
printf("x ended up as %d\n", x);
#
# Aggregate section
#
printf("\nAggregates:\n");
# Add items to the aggregate
foreach (key in array)
{
agg <<< array[key]
agg <<< array[key] * 2
agg <<< array[key] * 3
agg <<< array[key] * 4
agg <<< array[key] * 5
agg <<< array[key] * 6
agg <<< array[key] * 7
agg <<< array[key] * 8
agg <<< array[key] * 9
agg <<< array[key] * 10
agg <<< array[key] * 11
agg <<< array[key] * 12
agg <<< array[key] * 12
agg <<< array[key] * 13
agg <<< array[key] * 14
agg <<< array[key] * 15
}
# Find the total number of aggregate entries
i = 0
foreach (bucket in @hist_log(agg))
i++;
printf("%d total aggregate entries\n", i);
# Print the 1st 5 aggregate entries
printf("\naggregate limit 5:\n");
i = 0
foreach (bucket in @hist_log(agg) limit 5)
{
printf("bucket %d: %d\n", bucket, @hist_log(agg)[bucket]);
i++;
}
printf("loop had %d iterations\n", i);
printf("\nDone.\n");
exit()
}
|
