12-10-2010
Make the changes in sed command for finding an exact string as per your requirement. Or, delimit the special characters in sed command.
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Hi ,
I am required to view the fixed postion file very often . I am looking for the utility like this
if the file has a one or multile line
abcdefghijklmnopqr
Utility should make my file look like this
12345678910111213141516--------------------------
abcdefghijk l m n o p q r ... (4 Replies)
Discussion started by: akrathi
4 Replies
2. UNIX for Dummies Questions & Answers
Hello all,
I have a script which picks up a series of large numbers, each of which are actually amalgamations of a series of other numbers. Unfortunately there are no separator characters so I can't use awk -F. I am looking for a way of splitting them into variables according to their... (4 Replies)
Discussion started by: michaeltravisuk
4 Replies
3. Shell Programming and Scripting
hi,
is it possible to find the number of occurences of a pattern between two paranthesis.
for e.g
i have a file as below.
>>{
>>hi
>>GoodMorning
>>how are you?
>>}
>>is it good,
>>tell me yes, if it is good
In the above file, its clear the occurence of word "Good"... (17 Replies)
Discussion started by: divak
17 Replies
4. Shell Programming and Scripting
I want to insert space in 7th position of all the lines usign vi editor or sed command
Input file
12345689010
abcdefghijk
.
.
Output file
123456 89010
abcdef ghijk
.
. (7 Replies)
Discussion started by: Jairaj
7 Replies
5. Shell Programming and Scripting
i want to find the position of a character in a line , the first position, last, 5th occurence position , i ve tried grep -n , and expr index but they dont fit the bill. Please let me know if there is any other alternative (2 Replies)
Discussion started by: phpsnook
2 Replies
6. Shell Programming and Scripting
Hi all
let's say i have a file named 1234_v2_abcd
i need to find the position of the character located after _v, in above case this would be character number 2
the count of the characters before _v can change, but i always have a number after _v
can anybody help :) (4 Replies)
Discussion started by: gigagigosu
4 Replies
7. Shell Programming and Scripting
Hi,
i want find the character '-' in a file from position 284-298, if it occurs i need to replace it with 'O ' for the position in the file. How to do that using SED command.
thanks in advance,
Sara (9 Replies)
Discussion started by: Sara183
9 Replies
8. Shell Programming and Scripting
I am interested in finding a regex to find a word in second position on a line. The word in question is या
I tried the following PERL EXPRESSION but it did not work:
] या
or
^\W या
But both gave Null results
I am giving below a Sample file:
देना या सौंपना=delegate
तह जमना या... (8 Replies)
Discussion started by: gimley
8 Replies
9. Shell Programming and Scripting
Identify the First Column Position in Second Column and add the position value in 3rd column.
Sample data:
a|c
b|d
c|a
d|b
e|e
f|g
g|f
|h
|i
Expected Output:
a|c|1
b|d|2
c|a|3
d|b|4 (6 Replies)
Discussion started by: BrahmaNaiduA
6 Replies
10. Shell Programming and Scripting
I will appreciate if you help me here in this script in Solaris Enviroment.
Scenario:
i have 2 files :
1) /tmp/TRANSACTIONS_DAILY_20180730.txt:
201807300000000004
201807300000000005
201807300000000006
201807300000000007
201807300000000008
2)... (10 Replies)
Discussion started by: teokon90
10 Replies
LEARN ABOUT SUSE
bitmap_remap
BITMAP_REMAP(9) Basic Kernel Library Functions BITMAP_REMAP(9)
NAME
bitmap_remap - Apply map defined by a pair of bitmaps to another bitmap
SYNOPSIS
void bitmap_remap(unsigned long * dst, const unsigned long * src, const unsigned long * old, const unsigned long * new, int bits);
ARGUMENTS
dst
remapped result
src
subset to be remapped
old
defines domain of map
new
defines range of map
bits
number of bits in each of these bitmaps
DESCRIPTION
Let old and new define a mapping of bit positions, such that whatever position is held by the n-th set bit in old is mapped to the n-th set
bit in new. In the more general case, allowing for the possibility that the weight 'w' of new is less than the weight of old, map the
position of the n-th set bit in old to the position of the m-th set bit in new, where m == n % w.
If either of the old and new bitmaps are empty, or if src and dst point to the same location, then this routine copies src to dst.
The positions of unset bits in old are mapped to themselves (the identify map).
Apply the above specified mapping to src, placing the result in dst, clearing any bits previously set in dst.
For example, lets say that old has bits 4 through 7 set, and new has bits 12 through 15 set. This defines the mapping of bit position 4 to
12, 5 to 13, 6 to 14 and 7 to 15, and of all other bit positions unchanged. So if say src comes into this routine with bits 1, 5 and 7 set,
then dst should leave with bits 1, 13 and 15 set.
COPYRIGHT
Kernel Hackers Manual 2.6. July 2010 BITMAP_REMAP(9)