11-26-2008
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Hi,
I have the following data in a flat file:
abcd_efgh_ijkl_20080522.dat|20080602222508|1357
abcd_efgh_ijkl_20080522.dat|20080602222508|1357
abcd_efgh_ijkl_20080522.dat|20080602222508|1357
I need to check the no. of occurence of "|" (pipe) on each line and the output should look like below:... (4 Replies)
Discussion started by: hey_mak
4 Replies
2. UNIX for Advanced & Expert Users
Suppose i have data like :-
1,2,3,4,5
a,b,c
x,y,z,t
I want to count the occurence of , (comma) in every line.
Waiting for a solution.:) (1 Reply)
Discussion started by: sumit207
1 Replies
3. UNIX for Advanced & Expert Users
Hi,
I need help regarding counting specific word or character per line and validate it against a specific number i.e 10. And if number of character equals the specific number then that line will be part of the output.
Specific number = 6
Specific word or char = ||
Sample data:... (1 Reply)
Discussion started by: janzper
1 Replies
4. Shell Programming and Scripting
Please check the attachment for the example.
Purpose: count how many "|" character in one line and also display the line number.
expect result:
Line 1 : there are 473 "|" characters
Line 2 : there are 473 "|" characters
I have tried to use awk to count it, it's ok when the statistic... (8 Replies)
Discussion started by: ambious
8 Replies
5. Shell Programming and Scripting
I have the following string:
31-01-2012, 09:42:37;OK;94727132638;"Mozilla/5.0 (Linux; U; Android 2.2.1)";3G;WAP;I need a script which is counting the occurrence of semicolons ( ; ) but exclude the ones from the quotation marks.
In the string given as example there are 8 semicolons but the script... (3 Replies)
Discussion started by: calinlicj
3 Replies
6. UNIX for Dummies Questions & Answers
Suppose i have multiple line like below in a file.
ASDFAFAGAHAHAHA
AGAHAHAJGAFAGAH
AHAHAKAHAHAHAKA
I need a bash script to count a character and also Also count the number of character present in each line .
suppose for line 1: A=x, S=y, D=x and so on and total character=15. where x y and z is... (3 Replies)
Discussion started by: XXLMMN
3 Replies
7. Shell Programming and Scripting
Hi,
I have a file with more than 1000 lines. Most of the lines have 16 characters. I want to find out lines that have less than 14 characters (usually 12 or 13).
wc -l gives me the line count and wc -c gives me the total characters in a file. I could not get the total characters for each line.... (1 Reply)
Discussion started by: bobbygsk
1 Replies
8. UNIX for Dummies Questions & Answers
I need the character count of the last line of each file in a directory, and not the total.
Now I have been doing this but unfortunately, -exec doesn't support pipes:
find sent/ -type f -exec tail -1|wc -c {} \;
If I try this:
find sent/ -type f -exec tail -1 {} \; | wc -c
It will give... (6 Replies)
Discussion started by: MIA651
6 Replies
9. Shell Programming and Scripting
hello.
How to remove all characters in a line from first character ( a $ ) until and including the third occurrence of that character ( $ ).
Any help is welcome. (10 Replies)
Discussion started by: jcdole
10 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 REDHAT
cptrfs
CPTRFS(l) ) CPTRFS(l)
NAME
CPTRFS - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and
tridiagonal, and provides error bounds and backward error estimates for the solution
SYNOPSIS
SUBROUTINE CPTRFS( UPLO, N, NRHS, D, E, DF, EF, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO )
CHARACTER UPLO
INTEGER INFO, LDB, LDX, N, NRHS
REAL BERR( * ), D( * ), DF( * ), FERR( * ), RWORK( * )
COMPLEX B( LDB, * ), E( * ), EF( * ), WORK( * ), X( LDX, * )
PURPOSE
CPTRFS improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and tridi-
agonal, and provides error bounds and backward error estimates for the solution.
ARGUMENTS
UPLO (input) CHARACTER*1
Specifies whether the superdiagonal or the subdiagonal of the tridiagonal matrix A is stored and the form of the factorization:
= 'U': E is the superdiagonal of A, and A = U**H*D*U;
= 'L': E is the subdiagonal of A, and A = L*D*L**H. (The two forms are equivalent if A is real.)
N (input) INTEGER
The order of the matrix A. N >= 0.
NRHS (input) INTEGER
The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
D (input) REAL array, dimension (N)
The n real diagonal elements of the tridiagonal matrix A.
E (input) COMPLEX array, dimension (N-1)
The (n-1) off-diagonal elements of the tridiagonal matrix A (see UPLO).
DF (input) REAL array, dimension (N)
The n diagonal elements of the diagonal matrix D from the factorization computed by CPTTRF.
EF (input) COMPLEX array, dimension (N-1)
The (n-1) off-diagonal elements of the unit bidiagonal factor U or L from the factorization computed by CPTTRF (see UPLO).
B (input) COMPLEX array, dimension (LDB,NRHS)
The right hand side matrix B.
LDB (input) INTEGER
The leading dimension of the array B. LDB >= max(1,N).
X (input/output) COMPLEX array, dimension (LDX,NRHS)
On entry, the solution matrix X, as computed by CPTTRS. On exit, the improved solution matrix X.
LDX (input) INTEGER
The leading dimension of the array X. LDX >= max(1,N).
FERR (output) REAL array, dimension (NRHS)
The forward error bound for each solution vector X(j) (the j-th column of the solution matrix X). If XTRUE is the true solution
corresponding to X(j), FERR(j) is an estimated upper bound for the magnitude of the largest element in (X(j) - XTRUE) divided by
the magnitude of the largest element in X(j).
BERR (output) REAL array, dimension (NRHS)
The componentwise relative backward error of each solution vector X(j) (i.e., the smallest relative change in any element of A or B
that makes X(j) an exact solution).
WORK (workspace) COMPLEX array, dimension (N)
RWORK (workspace) REAL array, dimension (N)
INFO (output) INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
PARAMETERS
ITMAX is the maximum number of steps of iterative refinement.
LAPACK version 3.0 15 June 2000 CPTRFS(l)