fork download
  1. $6 $8
  2. {
  3. for (f = 1; f <= NF; f++) { a[NR, f] = $f }
  4. }
  5. NF > nf { nf = NF }
  6. END {
  7. for (f = 1; f <= nf; f++) {
  8. for (r = 1; r <= NR; r++) {
  9. printf a[r, f] (r==NR ? RS : FS)
  10. }
  11. }
  12. }
Success #stdin #stdout 0.01s 5284KB
stdin
rmgr: Standby     len (rec/tot):     68/    68, tx:                    0, lsn: 0/A5000028, prev 0/A4073528, desc: RUNNING_XACTS nextXid 2227 latestCompletedXid 2226 oldestRunningXid 2227
rmgr: Storage     len (rec/tot):     44/    44, tx:                    0, lsn: 0/A5000070, prev 0/A5000028, desc: CREATE base/5/19114
rmgr: Heap        len (rec/tot):    277/   277, tx:                 2227, lsn: 0/A50000A0, prev 0/A5000070, desc: INSERT off 52 flags 0x00, blkref #0: rel 1663/5/1247 blk 22
rmgr: Btree       len (rec/tot):     66/    66, tx:                 2227, lsn: 0/A50001B8, prev 0/A50000A0, desc: INSERT_LEAF off 390, blkref #0: rel 1663/5/2703 blk 2
rmgr: Btree       len (rec/tot):     82/    82, tx:                 2227, lsn: 0/A5000200, prev 0/A50001B8, desc: INSERT_LEAF off 40, blkref #0: rel 1663/5/2704 blk 6
stdout
rmgr: rmgr: rmgr: rmgr: rmgr:
Standby Storage Heap Btree Btree
len len len len len
(rec/tot): (rec/tot): (rec/tot): (rec/tot): (rec/tot):
68/ 44/ 277/ 66/ 82/
68, 44, 277, 66, 82,
tx: tx: tx: tx: tx:
0, 0, 2227, 2227, 2227,
lsn: lsn: lsn: lsn: lsn:
0/A5000028, 0/A5000070, 0/A50000A0, 0/A50001B8, 0/A5000200,
prev prev prev prev prev
0/A4073528, 0/A5000028, 0/A5000070, 0/A50000A0, 0/A50001B8,
desc: desc: desc: desc: desc:
RUNNING_XACTS CREATE INSERT INSERT_LEAF INSERT_LEAF
nextXid base/5/19114 off off off
2227  52 390, 40,
latestCompletedXid  flags blkref blkref
2226  0x00, #0: #0:
oldestRunningXid  blkref rel rel
2227  #0: 1663/5/2703 1663/5/2704
  rel blk blk
  1663/5/1247 2 6
  blk  
  22