Sponsored Content
Top Forums UNIX for Dummies Questions & Answers Integrate MIN and MAX in a string Post 302769678 by RudiC on Wednesday 13th of February 2013 03:54:08 AM
Old 02-13-2013
@elixir_sinari: 2 fast 4 me.
Nevertheless, this might at least be worth a shot:
Code:
awk     'BEGIN{FS=OFS=";"}
         {line[NR] = $0
          a = split ($1, b, "%")
          for (i=1; i<=a; i++)
                {b[i]=b[i]?b[i]:"0";
                 if ((!MIN [$2,i]) || (MIN [$2,i] > b[i])) MIN [$2,i] = b[i]
                 if ((!MAX [$2,i]) || (MAX [$2,i] < b[i])) MAX [$2,i] = b[i]
                }
          if (a > maxfld[$2]) maxfld[$2] = a
         }
         END    {for (i=1; i<=NR; i++)
                  {printf "%s;", line[i]
                   split (line[i], tmp)
                   for (j=1; j<=maxfld[tmp[2]]; j++)
                      printf ("%s-%s%%", MIN[tmp[2],j], MAX[tmp[2],j])
                   printf "\n"
                  }
                }
        ' file
1%2%3%4%;AA;1-5%2-6%3-7%4-8%0-9%
5%6%7%8%9;AA;1-5%2-6%3-7%4-8%0-9%
1%2%3%4%5%6;BB;1-7%2-9%3-10%4-11%5-12%6-6%
7%9%10%11%12;BB;1-7%2-9%3-10%4-11%5-12%6-6%

There's an inconsistency on value 6 in the BB records: the req. has 6-12 (where does the 12 come from?), and elixir_sinari has 0-6, which might sound logical, but the value is missing entirely unlike value 5 in AA's first line ... so, what to do?

Last edited by RudiC; 02-13-2013 at 03:32 PM.. Reason: Typo
This User Gave Thanks to RudiC For This Post:
 

10 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

min and max value of process id

We are running a AIX 5.2 OS. Would anyone happen to know what the max value for a process id could be? Thanks jerardfjay :) (0 Replies)
Discussion started by: jerardfjay
0 Replies

2. Shell Programming and Scripting

Help in finding the max and min position

Hi, I have this input file called ttbitnres (which is catenated and sorted):- 8 0.4444 213 10 0.5555 342 11 0.5555 321 12 0.5555 231 13 0.4444 400 My code is at :- #!/bin/bash echo -e Version "\t" Number of Pass "\t" Number of Fail "\t" Rank Position "\t"Min "\t" Max... (1 Reply)
Discussion started by: ahjiefreak
1 Replies

3. Shell Programming and Scripting

get min, max and average value

hi! i have a file like the attachement. I'd like to get for each line the min, max and average values. (there is 255 values for each line) how can i get that ? i try this, is it right? BEGIN {FS = ","; OFS = ";";max=0;min=0;moy=0;total=0;freq=890} $0 !~ /Trace1:/ { ... (1 Reply)
Discussion started by: riderman
1 Replies

4. Shell Programming and Scripting

Data stream between min and max

Hi, I have a text file containing numbers. There are up to 6 numbers per row and I need to read them, check if they are 0 and if they are not zero check if they are within a given interval (min,max). If they exceed the max or min they should be set to max or min respectively, if they are in the... (4 Replies)
Discussion started by: f_o_555
4 Replies

5. Shell Programming and Scripting

to find min and max value for each column!

Hello Experts, I have got a txt files which has multiple columns, I want to get the max, min and diff (max-min) for each column in the same txt file. Example: cat file.txt a 1 4 b 2 5 c 3 6 I want ouput like: cat file.txt a 1 4 b 2 5 c 3 6 Max 3 6 Min 1 4 Diff 2 2 awk 'min=="" ||... (4 Replies)
Discussion started by: dixits
4 Replies

6. Homework & Coursework Questions

Perl max and min issues

I have to find the min and max on a specific column in a file after sending that column and one other to a output file but I keep getting a maximum of zero below is what i have so far if anyone can give me advice on what i am doing wrong the help would be much appreciated # ! /usr/bin/perl -w... (2 Replies)
Discussion started by: dstewie
2 Replies

7. Shell Programming and Scripting

Print min and max value from two column

Dear All, I have data like this, input: 1254 10125 1254 10126 1254 10127 1254 10128 1254 10129 1255 10130 1255 10131 1255 10132 1255 10133 1256 10134 1256 10135 1256 10137... (3 Replies)
Discussion started by: aksin
3 Replies

8. Shell Programming and Scripting

Get the min avg and max with awk

aaa: 3 ms aaa: 2 ms aaa: 5 ms aaa: 10 ms .......... to get the 3 2 5 10 ...'s min avg and max something like min: 2 ms avg: 5 ms max: 10 ms (2 Replies)
Discussion started by: yanglei_fage
2 Replies

9. Shell Programming and Scripting

How to get min and max values using awk?

Hi, I need your kind help to get min and max values from file based on value in $5 . File1 SP12.3 stc 2240806 2240808 + ID1_N003 ID2_N003T0 SP12.3 sto 2241682 2241684 + ID1_N003 ID2_N003T0 SP12.3 XE 2239943 2240011 + ID1_N003 ID2_N003T0 SP12.3 XE 2240077 2241254 + ID1_N003 ... (12 Replies)
Discussion started by: redse171
12 Replies

10. Shell Programming and Scripting

Get min and max value in column

Gents, I have a big file file like this. 5100010002 5100010004 5100010006 5100010008 5100010010 5100010012 5102010002 5102010004 5102010006 5102010008 5102010010 5102010012 The file is sorted and I would like to find the min and max value, taking in the consideration key1... (3 Replies)
Discussion started by: jiam912
3 Replies
dorcsd.f(3)							      LAPACK							       dorcsd.f(3)

NAME
dorcsd.f - SYNOPSIS
Functions/Subroutines recursive subroutine dorcsd (JOBU1, JOBU2, JOBV1T, JOBV2T, TRANS, SIGNS, M, P, Q, X11, LDX11, X12, LDX12, X21, LDX21, X22, LDX22, THETA, U1, LDU1, U2, LDU2, V1T, LDV1T, V2T, LDV2T, WORK, LWORK, IWORK, INFO) DORCSD Function/Subroutine Documentation recursive subroutine dorcsd (characterJOBU1, characterJOBU2, characterJOBV1T, characterJOBV2T, characterTRANS, characterSIGNS, integerM, integerP, integerQ, double precision, dimension( ldx11, * )X11, integerLDX11, double precision, dimension( ldx12, * )X12, integerLDX12, double precision, dimension( ldx21, * )X21, integerLDX21, double precision, dimension( ldx22, * )X22, integerLDX22, double precision, dimension( * )THETA, double precision, dimension( ldu1, * )U1, integerLDU1, double precision, dimension( ldu2, * )U2, integerLDU2, double precision, dimension( ldv1t, * )V1T, integerLDV1T, double precision, dimension( ldv2t, * )V2T, integerLDV2T, double precision, dimension( * )WORK, integerLWORK, integer, dimension( * )IWORK, integerINFO) DORCSD Purpose: DORCSD computes the CS decomposition of an M-by-M partitioned orthogonal matrix X: [ I 0 0 | 0 0 0 ] [ 0 C 0 | 0 -S 0 ] [ X11 | X12 ] [ U1 | ] [ 0 0 0 | 0 0 -I ] [ V1 | ]**T X = [-----------] = [---------] [---------------------] [---------] . [ X21 | X22 ] [ | U2 ] [ 0 0 0 | I 0 0 ] [ | V2 ] [ 0 S 0 | 0 C 0 ] [ 0 0 I | 0 0 0 ] X11 is P-by-Q. The orthogonal matrices U1, U2, V1, and V2 are P-by-P, (M-P)-by-(M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. C and S are R-by-R nonnegative diagonal matrices satisfying C^2 + S^2 = I, in which R = MIN(P,M-P,Q,M-Q). Parameters: JOBU1 JOBU1 is CHARACTER = 'Y': U1 is computed; otherwise: U1 is not computed. JOBU2 JOBU2 is CHARACTER = 'Y': U2 is computed; otherwise: U2 is not computed. JOBV1T JOBV1T is CHARACTER = 'Y': V1T is computed; otherwise: V1T is not computed. JOBV2T JOBV2T is CHARACTER = 'Y': V2T is computed; otherwise: V2T is not computed. TRANS TRANS is CHARACTER = 'T': X, U1, U2, V1T, and V2T are stored in row-major order; otherwise: X, U1, U2, V1T, and V2T are stored in column- major order. SIGNS SIGNS is CHARACTER = 'O': The lower-left block is made nonpositive (the "other" convention); otherwise: The upper-right block is made nonpositive (the "default" convention). M M is INTEGER The number of rows and columns in X. P P is INTEGER The number of rows in X11 and X12. 0 <= P <= M. Q Q is INTEGER The number of columns in X11 and X21. 0 <= Q <= M. X11 X11 is DOUBLE PRECISION array, dimension (LDX11,Q) On entry, part of the orthogonal matrix whose CSD is desired. LDX11 LDX11 is INTEGER The leading dimension of X11. LDX11 >= MAX(1,P). X12 X12 is DOUBLE PRECISION array, dimension (LDX12,M-Q) On entry, part of the orthogonal matrix whose CSD is desired. LDX12 LDX12 is INTEGER The leading dimension of X12. LDX12 >= MAX(1,P). X21 X21 is DOUBLE PRECISION array, dimension (LDX21,Q) On entry, part of the orthogonal matrix whose CSD is desired. LDX21 LDX21 is INTEGER The leading dimension of X11. LDX21 >= MAX(1,M-P). X22 X22 is DOUBLE PRECISION array, dimension (LDX22,M-Q) On entry, part of the orthogonal matrix whose CSD is desired. LDX22 LDX22 is INTEGER The leading dimension of X11. LDX22 >= MAX(1,M-P). THETA THETA is DOUBLE PRECISION array, dimension (R), in which R = MIN(P,M-P,Q,M-Q). C = DIAG( COS(THETA(1)), ... , COS(THETA(R)) ) and S = DIAG( SIN(THETA(1)), ... , SIN(THETA(R)) ). U1 U1 is DOUBLE PRECISION array, dimension (P) If JOBU1 = 'Y', U1 contains the P-by-P orthogonal matrix U1. LDU1 LDU1 is INTEGER The leading dimension of U1. If JOBU1 = 'Y', LDU1 >= MAX(1,P). U2 U2 is DOUBLE PRECISION array, dimension (M-P) If JOBU2 = 'Y', U2 contains the (M-P)-by-(M-P) orthogonal matrix U2. LDU2 LDU2 is INTEGER The leading dimension of U2. If JOBU2 = 'Y', LDU2 >= MAX(1,M-P). V1T V1T is DOUBLE PRECISION array, dimension (Q) If JOBV1T = 'Y', V1T contains the Q-by-Q matrix orthogonal matrix V1**T. LDV1T LDV1T is INTEGER The leading dimension of V1T. If JOBV1T = 'Y', LDV1T >= MAX(1,Q). V2T V2T is DOUBLE PRECISION array, dimension (M-Q) If JOBV2T = 'Y', V2T contains the (M-Q)-by-(M-Q) orthogonal matrix V2**T. LDV2T LDV2T is INTEGER The leading dimension of V2T. If JOBV2T = 'Y', LDV2T >= MAX(1,M-Q). WORK WORK is DOUBLE PRECISION array, dimension (MAX(1,LWORK)) On exit, if INFO = 0, WORK(1) returns the optimal LWORK. If INFO > 0 on exit, WORK(2:R) contains the values PHI(1), ..., PHI(R-1) that, together with THETA(1), ..., THETA(R), define the matrix in intermediate bidiagonal-block form remaining after nonconvergence. INFO specifies the number of nonzero PHI's. LWORK LWORK is INTEGER The dimension of the array WORK. If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the work array, and no error message related to LWORK is issued by XERBLA. IWORK IWORK is INTEGER array, dimension (M-MIN(P, M-P, Q, M-Q)) INFO INFO is INTEGER = 0: successful exit. < 0: if INFO = -i, the i-th argument had an illegal value. > 0: DBBCSD did not converge. See the description of WORK above for details. References: [1] Brian D. Sutton. Computing the complete CS decomposition. Numer. Algorithms, 50(1):33-65, 2009. Author: Univ. of Tennessee Univ. of California Berkeley Univ. of Colorado Denver NAG Ltd. Date: November 2011 Definition at line 297 of file dorcsd.f. Author Generated automatically by Doxygen for LAPACK from the source code. Version 3.4.1 Sun May 26 2013 dorcsd.f(3)
All times are GMT -4. The time now is 06:42 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy