AWK is a powerful text-processing programming language. Given a multi-million lines of text file containing the following data – we want to know the frequencies the delegation at each integer interval e.g. 2, 3, 4:

First, we output the text file to console using cat then pipe it into grep to filter out non-data rows, and then we can execute the awk script.

cat steem3.txt | grep "delegates" | awk '$6 > 0 {
   data[int($6)]++
} 

END { 
  for (sp in data) {
     print (sp, "=", data[sp]);
  } 
}' 

It filters out the records that have zero values (undelegation records) – then we round the fraction numbers into integers and count them in a hash map.

Basically, we don’t have to declare the hash table prior to using it. And we can access it using the syntax map[key]. And at the END section, we can iterate the keys in the hash map in awk and print each value:

for (key in map) {
   print ("key is ", key, ", value is ", map[key]);
}

–EOF (The Ultimate Computing & Technology Blog) —

推荐阅读：
How to Construct Binary Search Tree from Preorder Traversal in P　 Dynamic Programming Algorithm to Compute the Block Sum in a Matr　 Smallest Multiple Algorithm using Bruteforce or GCD/LCM　 How many different ways can £2 be made using any number of coins　 Compute Factorial Digit Sum: Find the sum of the digits in the n　 Compute the Maximum Integer Right Triangles Solutions　 Power Digit Sum: What is the sum of the digits of the number 2^1　 Digit factorials: Find the Sum of All the Curious Numbers　 Computing the Longest Recurring Cycle in its Decimal Fraction Pa　 How to Use Priority Queue in Java or C++ to Compute Last Stone W