OXIESEC PANEL
- Current Dir:
/
/
usr
/
share
/
doc
/
gawk
/
examples
/
prog
Server IP: 139.59.38.164
Upload:
Create Dir:
Name
Size
Modified
Perms
📁
..
-
10/21/2019 03:49:14 PM
rwxr-xr-x
📄
alarm.awk
2.31 KB
08/25/2016 03:14:42 AM
rw-r--r--
📄
anagram.awk
1.33 KB
08/25/2016 03:14:42 AM
rw-r--r--
📄
awksed.awk
515 bytes
08/25/2016 03:14:42 AM
rw-r--r--
📄
cut.awk
3.61 KB
08/25/2016 03:14:42 AM
rw-r--r--
📄
dupword.awk
507 bytes
08/25/2016 03:14:42 AM
rw-r--r--
📄
egrep.awk
1.91 KB
08/25/2016 03:14:42 AM
rw-r--r--
📄
extract.awk
1.74 KB
08/25/2016 03:14:42 AM
rw-r--r--
📄
guide.awk
165 bytes
08/25/2016 03:14:42 AM
rw-r--r--
📄
histsort.awk
283 bytes
08/25/2016 03:14:42 AM
rw-r--r--
📄
id.awk
1.22 KB
08/25/2016 03:14:42 AM
rw-r--r--
📄
igawk.sh
3.11 KB
08/25/2016 03:14:42 AM
rw-r--r--
📄
indirectcall.awk
952 bytes
08/25/2016 03:14:42 AM
rw-r--r--
📄
labels.awk
1014 bytes
08/25/2016 03:14:42 AM
rw-r--r--
📄
split.awk
1.17 KB
08/25/2016 03:14:42 AM
rw-r--r--
📄
tee.awk
770 bytes
08/25/2016 03:14:42 AM
rw-r--r--
📄
testbits.awk
729 bytes
08/25/2016 03:14:42 AM
rw-r--r--
📄
translate.awk
1.15 KB
08/25/2016 03:14:42 AM
rw-r--r--
📄
uniq.awk
2.64 KB
08/25/2016 03:14:42 AM
rw-r--r--
📄
wc.awk
1.45 KB
08/25/2016 03:14:42 AM
rw-r--r--
📄
wordfreq.awk
347 bytes
08/25/2016 03:14:42 AM
rw-r--r--
Editing: anagram.awk
Close
# anagram.awk --- An implementation of the anagram-finding algorithm # from Jon Bentley's "Programming Pearls," 2nd edition. # Addison Wesley, 2000, ISBN 0-201-65788-0. # Column 2, Problem C, section 2.8, pp 18-20. # # This program requires gawk 4.0 or newer. # Required gawk-specific features: # - True multidimensional arrays # - split() with "" as separator splits out individual characters # - asort() and asorti() functions # # See http://savannah.gnu.org/projects/gawk. # # Arnold Robbins # arnold@skeeve.com # Public Domain # January, 2011 /'s$/ { next } # Skip possessives { key = word2key($1) # Build signature data[key][$1] = $1 # Store word with signature } # word2key --- split word apart into letters, sort, and join back together function word2key(word, a, i, n, result) { n = split(word, a, "") asort(a) for (i = 1; i <= n; i++) result = result a[i] return result } END { sort = "sort" for (key in data) { # Sort words with same key nwords = asorti(data[key], words) if (nwords == 1) continue # And print. Minor glitch: trailing space at end of each line for (j = 1; j <= nwords; j++) printf("%s ", words[j]) | sort print "" | sort } close(sort) }