awk diamond code golf (just for fun!) Post: 302986530

7 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Diamond operator in Until Statement (perl)

Hello: I have the following perl script which is giving me trouble inside the second elsif statement. The purpose of the script is to go through a file and print out only those lines which contain pertinent information. The tricky part came when I realized that certain items actually spanned...

2. Shell Programming and Scripting

Fun with awk

uggc://ra.jvxvcrqvn.bet/jvxv/EBG13 #!/usr/bin/awk -f BEGIN { for (n=0;n<26;n++) { x=sprintf("%c",n+65); y=sprintf("%c",(n+13)%26+65) r=y; r=tolower(y) } } { b = "" for (n=1; x=substr($0,n,1); n++) b = b ((y=r)?y:x) print b } ...

3. Shell Programming and Scripting

More fun with awk

#!/usr/bin/ksh ls -l $@ | awk ' /^-/ { l = 5*log($5) h = sprintf("%7d %-72s",$5,$8) print "\x1B ls command with histogram of file sizes. The histogram scale is logaritmic, to avoid very short bars for smaller files or very long bars for bigger files. Screenshot:

4. Shell Programming and Scripting

Perl Diamond Operator

I know that when using 'while (<FILE>) {}', Perl reads only one line of the file at one time, and store it in '$_'. Can I change some parameters so that 'while (<>) {}' can read more than one lines, like 2 or 5 lines at one time? Thanks for the help!

5. UNIX for Dummies Questions & Answers

fun and easy awk question

I have a file called mytitles.txt containing a list of book titles I have a second file called abfile.txt containing a list of book titles (in the 3rd field) and it has author info and copyright year info as well.. I want to search mytitles.txt for a match in the 3rd field of abfiles.txt, and...

6. What is on Your Mind?

Place your bets! - Ryder Cup 2012 (Golf)

Who will win the 2012 Ryder Cup. Europe vs USA There is an open event in the Event Prediction Forum. The event closes on 27th Sep 2012. 2012 Ryder Cup - Wikipedia, the free encyclopedia

7. Shell Programming and Scripting

To print diamond asterisk pattern based on inputs

I have to print the number of stars that increases on each line from the minimum number until it reaches the maximum number, and then decreases until it goes back to the minimum number. After printing out the lines of stars, it should also print the total number of stars printed. I have tried...

LEARN ABOUT NETBSD

nice

NICE(1) 						    BSD General Commands Manual 						   NICE(1)

NAME

     nice -- execute a utility with an altered scheduling priority

SYNOPSIS

     nice [-n increment] utility [argument ...]

DESCRIPTION

     nice runs utility at an altered scheduling priority.  If an increment is given, it is used; otherwise an increment of 10 is assumed.  The
     super-user can run utilities with priorities higher than normal by using a negative increment.  The priority can be adjusted over a range of
     -20 (the highest) to 20 (the lowest).  A priority of 19 or 20 will prevent a process from taking any cycles from others at nice 0 or better.

     Available options:

     -n increment
	     A positive or negative decimal integer used to modify the system scheduling priority of utility.

EXIT STATUS

     The nice utility exits with one of the following values:

     1-125   An error occurred in the nice utility.

     126     The utility was found but could not be invoked.

     127     The utility could not be found.

     Otherwise, the exit status of nice will be that of utility.

COMPATIBILITY

     The historic -increment option has been deprecated but is still supported in this implementation.

SEE ALSO

     csh(1), getpriority(2), setpriority(2), renice(8)

STANDARDS

     The nice utility conforms to IEEE Std 1003.2-1992 (``POSIX.2'').

HISTORY

     A nice utility appeared in Version 6 AT&T UNIX.

BUGS

     nice is built into csh(1) with a slightly different syntax than described here.  The form 'nice +10' nices to positive nice, and 'nice -10'
     can be used by the super-user to give a process more of the processor.

BSD
								   June 6, 1993 							       BSD