Hi.
I have a tab separated file that has a couple nearly identical lines. When doing:
sort file | uniq > file.new
It passes through the nearly identical lines because, well, they still are unique.
a)
I want to look only at field x for uniqueness and if the content in field x is the... (1 Reply)
Dear List,
I have a file of csv data which has a different line per compliance check per host. I do not want any omissions from this csv data file which looks like this:
date,hostname,status,color,check
02-03-2012,COMP1,FAIL,Yellow,auth_pass_change... (3 Replies)
Hi experts,
I need to print the first field first then last two fields should come next and then i need to print rest of the fields.
Input :
a1,abc,jsd,fhf,fkk,b1,b2
a2,acb,dfg,ghj,b3,c4
a3,djf,wdjg,fkg,dff,ggk,d4,d5
Expected output:
a1,b1,b2,abc,jsd,fhf,fkk... (6 Replies)
In the tab-delimited input below I am trying to use awk to -10 from $2 and +10 to $3. Something like
awk -F'\t' -v OFS='\t' -v s=10 '{split($4,a,":"); print $1,$2-s,$3+s,a,$5,$6} | awk {split(a,b,"-"); print $1,$2-s,$3+s,b-s,b+s,$5,$6}' input
should do that. I also need to -10 from $4... (2 Replies)
In the below I am trying to use awk to match all the $13 values in input, which is tab-delimited,
that are in $1 of gene which is just a single column of text.
However only the line with the greatest $9 value in input needs to be printed.
So in the example below all the MECP2 and LTBP1... (0 Replies)
I am trying to remove all the lines and spaces where the count in $4 or $5 is greater than 1 (more than 1 letter). The file and the output are tab-delimited. Thank you :).
file
X 5811530 . G C NLGN4X
17 10544696 . GA G MYH3
9 96439004 . C ... (1 Reply)
In the awk below I am trying to print the entire line, along with the header row, if $2 is SNV or MNV or INDEL. If that condition is met or is true, and $3 is less than or equal to 0.05, then in $7 the sub pattern :GMAF= is found and the value after the = sign is checked. If that value is less than... (0 Replies)
I apologize in advance, but I continue to have trouble searching for matches between two files and then printing portions of each to output in awk and would very much appreciate some help.
I have data as follows:
File1
PS012,002 PRQ 0 1 1 17 1 0 -1 3 2 1 2 -1 ... (7 Replies)
In the awk I am trying to add :p.=? to the end of each $9 that matches the pattern NM_. The below executes andis close but I can not seem to figure out why the :p.=? repeats in the split as in the green in the current output. I have added comments as well. Thank you :).
file
... (4 Replies)
The awk below produces the current output, which will add +1 to $3. However, I am trying to add the length of the matching characters between $5 and $6 to $3. I have tried using sub as a variable to store the length but am not able to do so correctly. I added comments to each line and the... (4 Replies)
Discussion started by: cmccabe
4 Replies
LEARN ABOUT DEBIAN
uniunmask
UNIUNMASK(1) General Commands Manual UNIUNMASK(1)NAME
uniunmask - XOR bits or substitute glyphs in a GNU Unifont file.
SYNOPSIS
uniunmask [-iinput_file] [-ooutput_file]
DESCRIPTION
uniunmask reads a GNU Unifont .hex file. As it reads the font file, it scans for code points matching entries in the "masks.hex" and "sub-
stitutes.hex" files. "masks.hex" and "substitutes.hex" are also in GNU Unifont .hex format, ordered by Unicode code point (the hexadecimal
number to the left of the colon on each line).
If a code point is encountered from "substitutes.hex", the input code point in the original .hex file is ignored (as is any entry with the
same code point in "masks.hex") and the glyph from "substitutes.hex" is written to the output file.
Otherwise, if a code point is encountered from "masks.hex", the input glyph in the original .hex file is XORed with the bits in the
"masks.hex" entry. The result of this XOR operation is written to the output file.
OPTIONS -i Specify the input file. The default is stdin.
-o Specify the output file. The default is stdout.
FILES
masks.hex, substitutes.hex, *.hex GNU Unifont font files
SEE ALSO bdfimplode(1), hex2bdf(1), hex2bdf-split(1), hex2sfd(1), hexbraille(1), hexdraw(1), hexmerge(1), johab2ucs2(1), unibmp2hex(1), unicover-
age(1), unidup(1), unihex2bmp(1), unipagecount(1)AUTHOR
uniunmask was written by Paul Hardy.
LICENSE
uniunmask is Copyright (C) 2007 Paul Hardy, and is released under version 2 of the GNU General Public License, or (at your option) a later
version.
BUGS
No known real bugs exist, except that this software does not perform extensive error checking on its input files. If they're not in the
format of the original GNU Unifont hex file, all bets are off.
2008 Jul 6 UNIUNMASK(1)