01-21-2009
Thanks alot !!
Problem is solved
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Hi all,
I have a very large; delimited file. In vi I would like to replace:
CSACT_DY;AVG_UEACT1;uesPerActiveLinkSetSize_1;#;A
CSACT_DY;AVG_UEACT2;uesPerActiveLinkSetSize_2;#;A
CSACT_DY;AVG_UEACT3;uesPerActiveLinkSetSize_3;#;A
with:
CSACT_DY;AVG_UEACT1;Average... (7 Replies)
Discussion started by: gilmord
7 Replies
2. Shell Programming and Scripting
hi all,
I have a text file with following content
PAGENUMBER
asasasa
asasasa
PAGENUMBER
sasasasasa
PAGENUMBER
using sed i want to replace PAGENUMBER by occurrence count
eg
1
asasasa
asasasa
2
sasasasasa
3 (4 Replies)
Discussion started by: uttamhoode
4 Replies
3. Shell Programming and Scripting
Hello,
I have active log file i want to grep the last occurrence of the word in that log file the log file gets on increasing and increasing i want to fetch it from live file.
Please guide me, Thanks in advance (4 Replies)
Discussion started by: vidurmittal
4 Replies
4. Shell Programming and Scripting
Hello Folks..
I need your help ..
here the example of my problem..i know its easy..i don't all the commands in unix to do this especiallly sed...here my string..
dwc2_dfg_ajja_dfhhj_vw_dec2_dfgh_dwq
desired output is..
dwc2_dfg_ajja_dfhhj
it's a simple task with tail... (5 Replies)
Discussion started by: victor369
5 Replies
5. UNIX for Dummies Questions & Answers
Hello,
I have a string like this 0:1:2:0:2:2:4:0:0:0:-200:500......
what i want is to break down how many different characters are there and their count. For example for above string it should display
0 - 5 times
1 - 1 times
2 - 3 times
4 - 1 times
.
.
.
I am stuck in writing... (8 Replies)
Discussion started by: exit86
8 Replies
6. Shell Programming and Scripting
Hello
how to find last occurence of a string
for example in the following I want last occurence of '-' i.e. position 12
str="aa-bbb-cccc-ddd-ee"
my pupose is to get the string 'ee'
Thanks and Regards
Chetanz (5 Replies)
Discussion started by: Chetanz
5 Replies
7. Shell Programming and Scripting
Hello All,
I want to check if a delimiter is existing twice in a line of a text file.
Suppose flat file is like this
234 | 123
123 | 345
456 | 563 |
234 | 548
So the the 3rd line has two delimiters,
How can we find the lines in such a file having more then one delimiters
I tried... (5 Replies)
Discussion started by: nnani
5 Replies
8. Shell Programming and Scripting
I apologize if it was asked before but I couldn't find something related.
I want to replace 2 strings in a file
e.g
pwddb=Lar1wod (need to replace string after =)
pwdapp=Wde2xe (need to replace string after =)
AND in same file want to find last occurrence of a string (SR2-134561),... (2 Replies)
Discussion started by: J_ang
2 Replies
9. Shell Programming and Scripting
####Solved####
Hello,
My aim is to replace searched string with incremented value under ubuntu 16.04.
Example:
aasasasas 9030 31wwo weopwoep
weerasas 9030 ew31wo ieopwoep
bbqqqsas 9030 ew3swo ieeopwoep
ccsaqpas 9030 ewiro o2opwoep
Expected:
aasasasas 9030 31wwo weopwoep
weerasas 9031... (2 Replies)
Discussion started by: baris35
2 Replies
10. UNIX for Beginners Questions & Answers
Hi Friends,
Good morning.
Appended a particular string after occurrence of particular string in a file.
my file abc.sql as below
create or replace function f1(p_cust_no IN VARCHAR)
RETURN number IS
DECLARE
v_country country.customer_tbl%TYPE;
begin
begin
select... (4 Replies)
Discussion started by: ram0106
4 Replies
LEARN ABOUT REDHAT
slagts
SLAGTS(l) ) SLAGTS(l)
NAME
SLAGTS - may be used to solve one of the systems of equations (T - lambda*I)*x = y or (T - lambda*I)'*x = y,
SYNOPSIS
SUBROUTINE SLAGTS( JOB, N, A, B, C, D, IN, Y, TOL, INFO )
INTEGER INFO, JOB, N
REAL TOL
INTEGER IN( * )
REAL A( * ), B( * ), C( * ), D( * ), Y( * )
PURPOSE
SLAGTS may be used to solve one of the systems of equations (T - lambda*I)*x = y or (T - lambda*I)'*x = y, where T is an n by n tridiagonal
matrix, for x, following the factorization of (T - lambda*I) as
(T - lambda*I) = P*L*U ,
by routine SLAGTF. The choice of equation to be solved is controlled by the argument JOB, and in each case there is an option to perturb
zero or very small diagonal elements of U, this option being intended for use in applications such as inverse iteration.
ARGUMENTS
JOB (input) INTEGER
Specifies the job to be performed by SLAGTS as follows:
= 1: The equations (T - lambda*I)x = y are to be solved, but diagonal elements of U are not to be perturbed. = -1: The equa-
tions (T - lambda*I)x = y are to be solved and, if overflow would otherwise occur, the diagonal elements of U are to be per-
turbed. See argument TOL below. = 2: The equations (T - lambda*I)'x = y are to be solved, but diagonal elements of U are not to
be perturbed. = -2: The equations (T - lambda*I)'x = y are to be solved and, if overflow would otherwise occur, the diagonal
elements of U are to be perturbed. See argument TOL below.
N (input) INTEGER
The order of the matrix T.
A (input) REAL array, dimension (N)
On entry, A must contain the diagonal elements of U as returned from SLAGTF.
B (input) REAL array, dimension (N-1)
On entry, B must contain the first super-diagonal elements of U as returned from SLAGTF.
C (input) REAL array, dimension (N-1)
On entry, C must contain the sub-diagonal elements of L as returned from SLAGTF.
D (input) REAL array, dimension (N-2)
On entry, D must contain the second super-diagonal elements of U as returned from SLAGTF.
IN (input) INTEGER array, dimension (N)
On entry, IN must contain details of the matrix P as returned from SLAGTF.
Y (input/output) REAL array, dimension (N)
On entry, the right hand side vector y. On exit, Y is overwritten by the solution vector x.
TOL (input/output) REAL
On entry, with JOB .lt. 0, TOL should be the minimum perturbation to be made to very small diagonal elements of U. TOL should
normally be chosen as about eps*norm(U), where eps is the relative machine precision, but if TOL is supplied as non-positive, then
it is reset to eps*max( abs( u(i,j) ) ). If JOB .gt. 0 then TOL is not referenced.
On exit, TOL is changed as described above, only if TOL is non-positive on entry. Otherwise TOL is unchanged.
INFO (output) INTEGER
= 0 : successful exit
element of the solution vector x. This can only occur when JOB is supplied as positive and either means that a diagonal element of
U is very small, or that the elements of the right-hand side vector y are very large.
LAPACK version 3.0 15 June 2000 SLAGTS(l)