Re: Sort tool parsing (SMF generally).

AIN@LISTSERV.UA.EDU> wrote on 06/27/2017 05:29:28 AM: > From: Massimo Biancucci <mad4...@gmail.com> > To: IBM-MAIN@LISTSERV.UA.EDU > Date: 06/27/2017 05:29 AM > Subject: Sort tool parsing (SMF generally). > Sent by: IBM Mainframe Discussion List <IBM-MAIN@LISTSERV.UA.EDU&

Sort tool parsing (SMF generally).

I'm wondering if there's any possibility to instruct sort to parse variable position field where variable means relative position is inside the record itself. For instance, SMF30 contains Performance Section at offset (pointed by ...) written at offset 80 (SMF30POF) for length at offset 84

Re: Rexx SORT (was: ... Job Scheduler ... )

On Thu, 8 Jun 2017 07:52:32 -0500, Edward Gould wrote: >TSO is dead TSO is dead, Long live TSO! -- Tom Marchant -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with

Re: Rexx SORT

W dniu 2017-06-09 o 14:54, John McKown pisze: [...] ​If the ISPF people would port their code to be usable from an UNIX shell prompt, I'd have _no_ use for TSO again. What I vaguely envision is having ISPF use "curses" for a character user interface. The second phase would be to extend ISPF to

Re: Rexx SORT (was: ... Job Scheduler ... )

On Fri, Jun 9, 2017 at 12:30 AM, Edward Gould wrote: > ​ > > > Good question. One that has been asked many times. I have the impression > IBM is being mysterious here. We are pretty sure that there is no > development going on for current TSO and IBM is tight lipped on

Re: Replacement of TSO (was: Rexx SORT ...)

(E) are not upgraded or expanded, AFAIK. Granted, there are many new nice things like Udlist for example, which I find very useful. So, I also found out from IBM that TSO + ISPF and all these utilities are sort of 'functionally stabilized'. Simply just look at the ISPxLIB, you will be amazed

Re: Rexx SORT (was: ... Job Scheduler ... )

> On Jun 8, 2017, at 3:19 PM, Clark Morris wrote: > > [Default] On 8 Jun 2017 06:01:57 -0700, in bit.listserv.ibm-main > edgould1...@comcast.net (Edward Gould) wrote: > >>> On Jun 7, 2017, at 7:06 PM, Phil Smith wrote: >>> >>> Lionel Dyck wrote:

Re: Rexx SORT (was: ... Job Scheduler ... )

[Default] On 8 Jun 2017 06:01:57 -0700, in bit.listserv.ibm-main edgould1...@comcast.net (Edward Gould) wrote: >> On Jun 7, 2017, at 7:06 PM, Phil Smith wrote: >> >> Lionel Dyck wrote: >>> If I recall the CMS/TSO Pipes is effectively the same code that is >>> reassembled for

AW: Re: AW: Rexx SORT (was: ... Job Scheduler ... )

--- Original-Nachricht --- Von: Nims,Alva John (Al) Betreff: Re: AW: Rexx SORT (was: ... Job Scheduler ... ) Datum: 08.06.2017, 14:59 Uhr An: IBM-MAIN@LISTSERV.UA.EDU No, z/OS REXX does not have a SORTSTEM function built-in. I currently have a STEMSORT function, but it is from a 3rd party vendor. Al

Re: AW: Rexx SORT (was: ... Job Scheduler ... )

en > Sent: Thursday, June 08, 2017 1:54 AM > To: IBM-MAIN@LISTSERV.UA.EDU > Subject: Re: AW: Rexx SORT (was: ... Job Scheduler ... ) > > Could you point me to the REXX list? > > Also, we have had a SORTSTEM function in VSE REXX for a LONG time. Does z/OS > not have SORTSTEM? >

Re: Rexx SORT (was: ... Job Scheduler ... )

> On Jun 7, 2017, at 7:06 PM, Phil Smith wrote: > > Lionel Dyck wrote: >> If I recall the CMS/TSO Pipes is effectively the same code that is >> reassembled for z/VM or z/OS. Sadly it is a product that is charged for on >> z/OS but is included in z/VM at no charge. It should,

Re: AW: Rexx SORT (was: ... Job Scheduler ... )

@LISTSERV.UA.EDU] On Behalf Of Tony Thigpen Sent: Thursday, June 08, 2017 4:54 AM To: IBM-MAIN@LISTSERV.UA.EDU Subject: Re: AW: Rexx SORT (was: ... Job Scheduler ... ) Could you point me to the REXX list? Also, we have had a SORTSTEM function in VSE REXX for a LONG time. Does z/OS not have SORTSTEM

Re: AW: Rexx SORT (was: ... Job Scheduler ... )

Using Catalist at _www.lsoft.com_ (http://www.lsoft.com) Found these: _rexxl...@listserv.uga.EDU_ (http://www.lsoft.com/scripts/wl.exe?SL1=REXXLIST=LISTSERV.UGA.EDU) (https://listserv.uga.edu/cgi-bin/wa?LIST=REXXLIST) REXX Programming discussion list (356 subscribers)

Re: AW: Rexx SORT (was: ... Job Scheduler ... )

be nice if there was an available PIPE type of command available, oh wait there is: The product where IBM has made a PIPE command available: http://www-01.ibm.com/common/ssi/cgi-bin/ssialias?infotype=dd=sm=897/ENUS5655-D45 Sorting is very simple there: PIPE stem xy. | sort 1 5 | stem yx

Re: Rexx SORT (was: ... Job Scheduler ... )

Paul Gilmartin asked: >Is that true for even the newest release? They're still testing it? John Hartmann may be retired but he ain't dead. >How does one transfer PIPE MODULE S from CMS to z/OS and get a usable >program object? Re-link it? I believe so. >Is it legal? Not sure. But check out

Re: Rexx SORT (was: ... Job Scheduler ... )

On Wed, 7 Jun 2017 17:06:46 -0700, Phil Smith wrote: >Lionel Dyck wrote: >>If I recall the CMS/TSO Pipes is effectively the same code that is >>reassembled for z/VM or z/OS. Sadly it is a product that is charged for on >>z/OS but is included in z/VM at no charge. It should, imho, be included in

Re: Rexx SORT (was: ... Job Scheduler ... )

Lionel Dyck wrote: >If I recall the CMS/TSO Pipes is effectively the same code that is reassembled >for z/VM or z/OS. Sadly it is a product that is charged for on z/OS but is >included in z/VM at no charge. It should, imho, be included in z/OS as a no >charge feature and really give the REXX

Re: [EXTERNAL] Re: AW: Rexx SORT (was: ... Job Scheduler ... )

To: IBM-MAIN@LISTSERV.UA.EDU Subject: [EXTERNAL] Re: AW: Rexx SORT (was: ... Job Scheduler ... ) On 2017-06-07, at 11:27, Nims,Alva John (Al) wrote: > This is getting to be like a discussion that was had on the REXX list > recently, as in it would be nice if there was an available PIP

Re: AW: Rexx SORT (was: ... Job Scheduler ... )

S from single sources, much to their benefit. > Sorting is very simple there: > PIPE stem xy. | sort 1 5 | stem yx. > OrPIPE < indsn | sort 1 5 | > outdsn > But that's one utility that has been specifically repackaged as a Pipelines stage. Rather, what's needed is

Re: AW: Rexx SORT (was: ... Job Scheduler ... )

To: IBM-MAIN@LISTSERV.UA.EDU Subject: Re: AW: Rexx SORT (was: ... Job Scheduler ... ) Please see this RFE: https://www.ibm.com/developerworks/rfe/execute?use_case=viewRfe_ID=47699 -- Lionel B. Dyck -Original Message

Re: [EXTERNAL] Re: Rexx SORT (was: ... Job Scheduler ... )

@LISTSERV.UA.EDU] On Behalf Of Paul Gilmartin Sent: Wednesday, June 07, 2017 12:57 PM To: IBM-MAIN@LISTSERV.UA.EDU Subject: [EXTERNAL] Re: Rexx SORT (was: ... Job Scheduler ... ) On 2017-06-07, at 11:31, Dyck, Lionel B. (TRA) wrote: > Please see this RFE: > https://www.ibm.com/developerworks/rfe/e

Re: Rexx SORT (was: ... Job Scheduler ... )

On 2017-06-07, at 11:31, Dyck, Lionel B. (TRA) wrote: > Please see this RFE: > https://www.ibm.com/developerworks/rfe/execute?use_case=viewRfe_ID=47699 > That gives me: Oops, that's not right! Sorry, the page you're looking for cannot be displayed Please try again later. 500 Internal

Re: AW: Rexx SORT (was: ... Job Scheduler ... )

Of Nims,Alva John (Al) Sent: Wednesday, June 07, 2017 12:28 PM To: IBM-MAIN@LISTSERV.UA.EDU Subject: [EXTERNAL] Re: AW: Rexx SORT (was: ... Job Scheduler ... ) This is getting to be like a discussion that was had on the REXX list recently, as in it would be nice if there was an available PIPE type

Re: AW: Rexx SORT (was: ... Job Scheduler ... )

=dd=sm=897/ENUS5655-D45 Sorting is very simple there: PIPE stem xy. | sort 1 5 | stem yx. Or PIPE < indsn | sort 1 5 | > outdsn These are simple examples and not everything that can be done, but when I was using it (my previous job) it was reasonably quick in execution. Now

Re: AW: Rexx SORT (was: ... Job Scheduler ... )

Paul Gilmartin wrote: >Bernd.Oppolzer wrote: >>http://bernd-oppolzer.de/blog_20150115_151000.htm >>this Contains a REXX Procedure to sort a stem variable. See quicksort_nonrec >o Of course. But why should it be necessary to reinvent the wheel when DFSORT >has vast capab

Re: AW: Rexx SORT (was: ... Job Scheduler ... )

On Wed, 7 Jun 2017 08:12:47 +0200, bernd.oppol...@t-online.de wrote: >http://bernd-oppolzer.de/blog_20150115_151000.htm ><http://bernd-oppolzer.de/blog_20150115_151000.htm> . > >this Contains a REXX Procedure >to sort a stem variable. >See quicksort_nonrec > o

AW: Rexx SORT (was: ... Job Scheduler ... )

http://bernd-oppolzer.de/blog_20150115_151000.htm <http://bernd-oppolzer.de/blog_20150115_151000.htm> . this Contains a REXX Procedure to sort a stem variable. See quicksort_nonrec hth Kind regards Bernd --- Original-Nachricht --- Von: Paul Gilmartin Betreff: Rexx SORT (was: .

Rexx SORT (was: ... Job Scheduler ... )

On Wed, 7 Jun 2017 00:33:30 +, Rob Schramm wrote: >Address SORT > >is more what I was thinking. It is just such a commonly needed thing for >simple sorts i.e. >SORT 1 8 a > I'm guessing the arguments are a column range and Ascending? >Guess I am just lazy/annoyed wh

Re: How to parse rows using SORT

,C'08',C'Sep',C'09', > C'Oct',C'10',C'Nov',C'11',C'Dec',C'12'), > NOMATCH=(C'00'), > 87:89,2,2X)) > > SORT FIELDS=(91,3,CH,A, $ GROUP >81,8,CH,D),EQUALS $ DATE DESC > >

Re: How to parse rows using SORT

,C'11',C'Dec',C'12'), NOMATCH=(C'00'), 87:89,2,2X)) SORT FIELDS=(91,3,CH,A, $ GROUP 81,8,CH,D),EQUALS $ DATE DESC OUTREC OVERLAY=(161:SEQNUM,3,ZD,RESTART=(91,3)) OUTFIL INCLUDE=(150,10,CH,GT,C' ',AND,

Re: How to parse rows using SORT

to reorder the date to be yearmmdd, but I could not figure out how to replace the space with a zero in the first digit of the day and I could not figure out how to get the directory name on each file before sorting. I suppose the space in the day value is not a problem as it would sort lower just like z

Re: How to parse rows using SORT

',AND,5,8,SS,NE,C' '), > BUILD=(01:C'BIN ',56:5,12)) > > > > Further if you have any questions please let me know > > Thanks, > Kolusu > DFSORT Development > > > > From: Bill Ashton <bill00ash...@gmail.com> > To: IBM-MAIN@LIST

Re: How to parse rows using SORT

usu DFSORT Development From: Bill Ashton <bill00ash...@gmail.com> To: IBM-MAIN@LISTSERV.UA.EDU Date: 04/21/2017 01:41 PM Subject:Re: How to parse rows using SORT Sent by:IBM Mainframe Discussion List <IBM-MAIN@LISTSERV.UA.EDU> Thanks, Kolusu - that is better now! I w

Re: How to parse rows using SORT

-MAIN@LISTSERV.UA.EDU> wrote on > 04/21/2017 12:45:56 PM: > > > From: Bill Ashton <bill00ash...@gmail.com> > > To: IBM-MAIN@LISTSERV.UA.EDU > > Date: 04/21/2017 12:46 PM > > Subject: Re: How to parse rows using SORT > > Sent by: IBM Mainframe Discu

Re: How to parse rows using SORT

il.com> > To: IBM-MAIN@LISTSERV.UA.EDU > Date: 04/21/2017 12:46 PM > Subject: Re: How to parse rows using SORT > Sent by: IBM Mainframe Discussion List <IBM-MAIN@LISTSERV.UA.EDU> > > Hi Kolusu, I think I messed up my original note by trying to keep the > characters in order. >

Re: How to parse rows using SORT

e. > > something like this > > //STEP0100 EXEC PGM=SORT > //SYSOUT DD SYSOUT=* > //SORTIN DD * > EZA2284I`-RW-R--R--```1`FTPUSER``FTPUSERS```42160`SEP``2``2016`TESTFL1.BIN > > EZA2284I`-RW-R--R--```1`FTPUSER``FTPUSERS``442160`NOV`10`15:26`TEST2.TXT > //SORTOUT DD SYSOUT=*

Re: How to parse rows using SORT

On Fri, 21 Apr 2017 13:46:30 -0400, Bill Ashton wrote: > >Is there a way to not use ABSPOS=65, but instead to say I want to start >following a space after Col 60? In Rexx, I could say to use the 10th word, >but I don't want to change the SORT to Rexx now, as this input is doi

Re: How to parse rows using SORT

Bill, Why bother about the position. From the looks of it, you need to pick the last qualifier. So go find the last byte space and then subtract 12 bytes to get to your dataset name. something like this //STEP0100 EXEC PGM=SORT //SYSOUT DD SYSOUT=* //SORTIN DD * EZA2284I`-RW-R--R

How to parse rows using SORT

Hello friends! I just ran into a problem, and am a bit confused how to correct this. I am reading the output of an FTP list command, and using SORT to capture and format the FTP GET commands I need. This process is working fine for the most part, and it produces the correct commands most

Re: sort data extract

com> To: IBM-MAIN@LISTSERV.UA.EDU Date: 03/30/2017 06:13 AM Subject: Re: sort data extract Sent by:IBM Mainframe Discussion List <IBM-MAIN@LISTSERV.UA.EDU> That's a big 10-4 Liz and Gil. You don't learn until you read a manual, write a bit of code, test, repeat,

Re: sort data extract

g new functions. > > > > ;-D > > > > > > Lizette > > > > > > > -Original Message- > > > From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On > > > Behalf Of Sri h Kolusu > > > Sent: Wednesday, March 29,

Re: sort data extract

new functions. ;-D Lizette > -Original Message- > From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On > Behalf Of Sri h Kolusu > Sent: Wednesday, March 29, 2017 8:33 AM > To: IBM-MAIN@LISTSERV.UA.EDU > Subject: Re: sort data extract > >

Re: sort data extract

On Wed, 29 Mar 2017 07:53:47 -0700, Lizette Koehler wrote: >Is SORT your only option? > >If not, REXX or SAS, or other languages can do this for you very easily. >... >Do you need any editing once it is found? > Don't overlook grep and sed. >> -Original Me

Re: sort data extract

ok. if string is found , we need to extract the full record and copy to a new file . Thanks! -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO

Re: sort data extract

>>> Is SORT your only option? If not, REXX or SAS, or other languages can do this for you very easily. Lizette, Sort can also do it quite easily. :) retired mainframer already provided that OP needs to look into "Substring Comparison Tests" which would give him the desired

Re: sort data extract

Is SORT your only option? If not, REXX or SAS, or other languages can do this for you very easily. Otherwise, You are stating you have a file LRECL=5000. Within this file, each record has a STRING. Is it just one string you are looking for or multiple? The STRING could be as follows A,B,,X

Re: sort data extract

Look up "Substring Comparison Tests" in your Application Programming Guide. > -Original Message- > From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On > Behalf Of Ron Thomas > Sent: Wednesday, March 29, 2017 4:37 AM > To: IBM-MAIN@LISTSERV.UA

sort data extract

Hi , I have comma seperated VB block file of LRECL 5000, i need to extract all records for those if there is a string like K170119. Could anyone let me know how this to be done using sort jcl ? Thanks! -- For IBM-MAIN subscribe

Re: SORT - How can I put accumulated value on each output record

Kolusu-san, Thank you very much for providing the SORT JCL. Your SORT is more elegant and flexible than I made. What I made SORT control cards based on Woodger-san's suggestion is following. //ACCUM EXEC PGM=ICEMAN //SYSOUT DD SYSOUT=* //SORTIN DD * #001 1 10.5 #002 5

Re: SORT - How can I put accumulated value on each output record

of 10 5. The summary fields are at position 35 for a length of 8 and position 45 for a length of 12. You can use the following JCL //STEP0100 EXEC PGM=SORT //SYSOUT DD SYSOUT=* //SORTIN DD * +1+2+3+4+5+ #001 1 10.5 #002

Re: SORT - How can I put accumulated value on each output record

Woodger-san, Thank you very much for your useful guidance. I have never thought to use SUBTOTAL function yet. I'll try to make SORT control cards to produce SORTOUT data what I want to have. Koehler-san, Thank you for pointing out documents of DFSORT trics. I have to adapt to both DFSORT

Re: SORT - How can I put accumulated value on each output record

The Smart DFSORT Tricks doesn't have anything especially close. Search-engineing *will* provide something very close. But, as the obvious post itself suggests, understanding the code allows the same or similar techniques to be known and therefore available for other circumstances. Gives me a

Re: SORT - How can I put accumulated value on each output record

Which SORT tool do you have? Syncsort or DFSORT? Either one comes with the capability to do something like this. There is a DFSORT Hotline with IBM that you can also ask these types of questions. dfs...@us.ibm.com They are very helpful in creating SORT processes like this. If you have

Re: SORT - How can I put accumulated value on each output record

Yes, you can make this type of output with DFSORT. DFSORT has "reporting features" on OUTFIL. This provides SUBTOT/SUBTOTAL, which is to provide running-totals. SUBTOTAL is available on TRAILER1, TRAILER2 and TRAILER3. None of which do exactly what you want. If you look at what each does

SORT - How can I put accumulated value on each output record

121 120.4 127 134.2 . . . . . . . Output forth column is accumulated value with previous records values on 2nd column. Output 5th column is also accumulated value with previous records values on 3rd column. Can I make this kind of output by SORT? I really appreciate

Re: BSAM vs QSAM (and SORT).

Well, I've never done any sort development and at the risk of creating yet another nostalgia thread, I can tell you that I have seen a lot of tape sorts run and they were a thing of beauty. At any one point in time the sort program was reading half of the tape workfiles backwards. I guess

Re: BSAM vs QSAM (and SORT).

for applications. Tapes are for backup and ML2. I had understood that old-fashioned SORT with SORTWK on tape employed read backwards very effectively. [...] SORTWK on tape? That's so 70's. In my shop I'm trying to eliminate SORTWK at all. Memory is faster. BTW: Read backward effectiveness depends

Re: BSAM vs QSAM (and SORT).

Back in the days of uncompressed tape blocks (reel-to-reel, & early 3480) there was a nice one-to-one correspondence between a fixed point on the tape within a block and all the bits in a byte in parallel tracks on the tape, so it was actually relatively simple to pass the tape past the heads in

Re: BSAM vs QSAM (and SORT).

If you consider me one of the SORT experts, I have been involved with sort development since the early 80's, and never once ran a tape sort. When I first worked for Liberty Mutual Insurance, we had a 7074 hypervisor running on a 360/65 and I saw a tape sort running there, but never wrote any

Re: BSAM vs QSAM (and SORT).

and ML2. > I had understood that old-fashioned SORT with SORTWK on tape employed read backwards very effectively. Perhaps the SORT expert will jump in: https://en.wikipedia.org/wiki/Oscillating_merge_sort It was spectacular to watch. Are the data un-reversed by hardware, firmware, or soft

AW: ISPCFIGU - which one? [SOLVED - sort of]

: ISPCFIGU - which one? [SOLVED - sort of] Prepend is concatenate them in front of what's there, append is at the back. ;) I seem to have solved the problem by regenerating my private command tables from scratch, rather than using the 1.10 & 1.6 versions that I had copied to the ISPF pro

Re: ISPCFIGU - which one? [SOLVED - sort of]

Robert, The fact that you're getting a different ISPVCALL dataset name indicates a different config module. When you say PREPEND, what do you mean? I'll again suggest using TSOLIB for your LOADLIB (instead of whatever else you're doing to "PREPEND"), which has always worked for me. Prepend

Re: ISPCFIGU - which one? [SOLVED - sort of]

On 2017-01-20 23:28, Tom Conley wrote: On 1/20/2017 6:00 PM, Robert Prins wrote: On 2017-01-20 17:50, Tom Conley wrote: On 1/20/2017 12:34 PM, Robert Prins wrote: On 2017-01-20 15:10, Tom Conley wrote: and the Pop-Up that appears after the search tells me Robert, I use TSOLIB from the

Re: Verify record cound against the file trailer [by SORT?]

: "Farley, Peter x23353" <peter.far...@broadridge.com> To: IBM-MAIN@LISTSERV.UA.EDU Date: 06/28/2016 03:27 PM Subject:Re: Verify record cound against the file trailer [by SORT?] Sent by:IBM Mainframe Discussion List <IBM-MAIN@LISTSERV.UA.EDU> Man

Re: Verify record cound against the file trailer [by SORT?]

not X'0999'). Peter -Original Message- From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On Behalf Of Sri h Kolusu Sent: Tuesday, June 28, 2016 4:35 PM To: IBM-MAIN@LISTSERV.UA.EDU Subject: Re: Verify record cound against the file trailer [by SORT?] Peter, It is

Re: Verify record cound against the file trailer [by SORT?]

Peter x23353" <peter.far...@broadridge.com> To: IBM-MAIN@LISTSERV.UA.EDU Date: 06/28/2016 01:00 PM Subject:Re: Verify record cound against the file trailer [by SORT?] Sent by:IBM Mainframe Discussion List <IBM-MAIN@LISTSERV.UA.EDU> Thanks again Sri, your n

Re: Verify record cound against the file trailer [by SORT?]

Kolusu Sent: Monday, June 27, 2016 8:16 PM To: IBM-MAIN@LISTSERV.UA.EDU Subject: Re: Verify record cound against the file trailer [by SORT?] Peter, Your control cards looks good. I cannot comment on syncsort's NULLOFL behavior. I think Alan had already pointed the obvious. So you control cards

Re: Verify record cound against the file trailer [by SORT?]

<peter.far...@broadridge.com> To: IBM-MAIN@LISTSERV.UA.EDU Date: 06/27/2016 04:03 PM Subject:Re: Verify record cound against the file trailer [by SORT?] Sent by:IBM Mainframe Discussion List <IBM-MAIN@LISTSERV.UA.EDU> Hi Sri, I am a colleague of Victor's, a

Re: Verify record cound against the file trailer [by SORT?]

@LISTSERV.UA.EDU Subject: Re: Verify record cound against the file trailer [by SORT?] Hi Peter, The fine print in Syncsort documentation states NULLOFL only applies to non-SORTOUT OUTFIL statements. If I change the DD of SORTOUT to OUT1 and add a FNAMES=OUT1 parameter to the OUTFIL statement then I get a CC 4

Re: Verify record cound against the file trailer [by SORT?]

--Original Message- From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On Behalf Of Sri h Kolusu Sent: Monday, June 27, 2016 3:18 PM To: IBM-MAIN@LISTSERV.UA.EDU Subject: Re: Verify record cound against the file trailer [by SORT?] Victor Gil, It is quite simple to verify

Re: Verify record cound against the file trailer [by SORT?]

To: IBM-MAIN@LISTSERV.UA.EDU Subject: Re: Verify record cound against the file trailer [by SORT?] Victor Gil, It is quite simple to verify the number of records and validate it against the trailer record and if the record count match the return code is 0 and if the count is off then the return

Re: Verify record cound against the file trailer [by SORT?]

that the trailer record is not counted as part of the record count. If it is indeed counted then simply remove the ",START=0" on the INREC statement. Use the following JCL //STEP0100 EXEC PGM=SORT //SYSOUT DD SYSOUT=* //SORTIN DD * A B C D RECS=5 //SORTOUT DD SYSOUT=* //S

Re: Verify record cound against the file trailer [by SORT?]

. If it is indeed counted then simply remove the ",START=0" on the INREC statement. Use the following JCL //STEP0100 EXEC PGM=SORT //SYSOUT DD SYSOUT=* //SORTIN DD * A B C D RECS=5 //SORTOUT DD SYSOUT=* //SYSINDD * OPTION COPY INREC OVERLAY=(81:SEQNUM,5,

Re: Verify record cound against the file trailer [by SORT?]

e: > I am posting this for a co-worker - some of his flat files have trailing > records stating the total record counter, e.g.: > > RECS=00567 > > The question is - what utility [I am guessing SORT should suffice] can he > use to verify the trailer counter against the actual

Verify record cound against the file trailer [by SORT?]

I am posting this for a co-worker - some of his flat files have trailing records stating the total record counter, e.g.: RECS=00567 The question is - what utility [I am guessing SORT should suffice] can he use to verify the trailer counter against the actual number of records in the file

Re: Sort PARSE, ABSPOS and SUBPOS. How to PARSE when one or more fields are missed.

'*', FIXLEN=15))), IFTHEN(WHEN=INIT, PARSE=(%02=(STARTAFT=C'F02:', ENDBEFR=C'*', FIXLEN=15)), BUILD=(C'F00=',%00,C'-F01=',%01,C'-F02=',%02,C'-')) SORT FIELDS=COPY Result: F00=FIELD00-F01=FIELD01-F02=FIELD02

Re: Sort PARSE, ABSPOS and SUBPOS. How to PARSE when one or more fields are missed.

Gee, and here I'm just now finding out DF/SORT isn't feature rich. Stunning,  but I'm glad I retired last year, sigh. Sent from BlueMail On May 27, 2016, 2:38 PM, at 2:38 PM, Massimo Biancucci <mad4...@gmail.com> wrote: >I really thank you for your support. > >Anyway t

Re: Sort PARSE, ABSPOS and SUBPOS. How to PARSE when one or more fields are missed.

;skol...@us.ibm.com>: > Massimo, > > Your issue is not with PARSE but you wanting to perform a horizontal sort > based on the values. So here is a Job that would give you the desired > results. You need to parse the data and then validate the values and > arrange them accordingly.

Re: Sort PARSE, ABSPOS and SUBPOS. How to PARSE when one or more fields are missed.

ould think to improve the product in the future. Thanks again. Massimo 2016-05-27 18:34 GMT+02:00 Sri h Kolusu <skol...@us.ibm.com>: > Massimo, > > Your issue is not with PARSE but you wanting to perform a horizontal sort > based on the values. So here is a Job that would gi

Re: Sort PARSE, ABSPOS and SUBPOS. How to PARSE when one or more fields are missed.

Massimo, Your issue is not with PARSE but you wanting to perform a horizontal sort based on the values. So here is a Job that would give you the desired results. You need to parse the data and then validate the values and arrange them accordingly. //STEP0100 EXEC PGM=SORT //SYSOUT DD

Re: Sort PARSE, ABSPOS and SUBPOS. How to PARSE when one or more fields are missed.

u > DFSORT Development > IBM Corporation > > > > From: Massimo Biancucci <mad4...@gmail.com> > To: IBM-MAIN@LISTSERV.UA.EDU > Date: 05/27/2016 05:36 AM > Subject:Sort PARSE, ABSPOS and SUBPOS. How to PARSE when one or > more fields are missed. > Sent

Re: Sort PARSE, ABSPOS and SUBPOS. How to PARSE when one or more fields are missed.

Biancucci <mad4...@gmail.com> To: IBM-MAIN@LISTSERV.UA.EDU Date: 05/27/2016 05:36 AM Subject: Sort PARSE, ABSPOS and SUBPOS. How to PARSE when one or more fields are missed. Sent by:IBM Mainframe Discussion List <IBM-MAIN@LISTSERV.UA.EDU> Hi everybody, I'm try

Sort PARSE, ABSPOS and SUBPOS. How to PARSE when one or more fields are missed.

'*', FIXLEN=15)), BUILD=(C'F00=',%00,C'-F01=',%01,C'-F02=',%02,C'-') SORT FIELDS=COPY /* The output is: F00=FIELD00-F01=FIELD01-F02=FIELD02- F00=FIELD00-F01=FIELD01-F02=FIELD02- F00=FIELD00-F01=FIELD01-F02=FIELD02- F00=FIELD00

Re: SORT - Merge Two Files by Variable

Development IBM Corporation IBM Mainframe Discussion List <IBM-MAIN@LISTSERV.UA.EDU> wrote on 05/17/2016 12:13:21 AM: > From: Ravi Gaur <gaur.ravi2...@gmail.com> > To: IBM-MAIN@LISTSERV.UA.EDU > Date: 05/17/2016 12:13 AM > Subject: SORT - Merge Two Files by Variable > Sent b

Re: SORT - Merge Two Files by Variable

cht <elardus.engelbre...@sita.co.za> wrote: > > Ravi Gaur wrote: > >> Since I am not that good on Sort programming could somebody throw a code which could help in Merging two files which has common BY variable..(I generally do it with SAS) however where this required it's not licenseds

Re: SORT - Merge Two Files by Variable

Ravi Gaur wrote: >Since I am not that good on Sort programming could somebody throw a code which >could help in Merging two files which has common BY variable..(I generally do >it with SAS) however where this required it's not licensedso it's possible >via rexx however

Re: SORT - Merge Two Files by Variable

I'd research DFSORT JOINKEYS. Cheers, Martin Sent from my iPad > On 17 May 2016, at 08:13, Ravi Gaur <gaur.ravi2...@gmail.com> wrote: > > Since I am not that good on Sort programming could somebody throw a code which could help in Merging two files which has common BY variabl

SORT - Merge Two Files by Variable

Since I am not that good on Sort programming could somebody throw a code which could help in Merging two files which has common BY variable..(I generally do it with SAS) however where this required it's not licensedso it's possible via rexx however for millions of records that's damn slow

Re: Why sort (was Microprocessor Optimization Primer)

f one file fits in memory, you can read it sequentially into a >>>> Hashmap with the using the data you want to match as the key. >>>> Then read the second one, also sequentially, retrieving matching >>>> records from the Hashmap by key. You can also remove them from the >>>>

Re: Why sort (was Microprocessor Optimization Primer)

An excellent synopsis of mainframe history. It follows that most mature shops use SORT extensively because until recently, the platform pretty much required it for reasonable performance as measured by wall clock. One could argue--maybe even prove--that today's DASD allows more random updating

Re: Why sort (was Microprocessor Optimization Primer)

can also remove them from the > > Hashmap as they are found if you need to know if any are unmatched. > > > > But this is a solution for a made up case - I don't know whether it is > > a common situation. I was interested in hearing real reasons why sort > > is so common

Re: Why sort (was Microprocessor Optimization Primer)

On 7/04/2016 7:56 PM, John McKown wrote: On Thu, Apr 7, 2016 at 5:59 AM, Wayne Bickerdike wrote: I'm slightly gobsmacked that this discussion is needed. I guess the forest is lost in the trees. I can recommend "Principles of Program Design" by Michael Jackson c. 1975. Of

Re: Why sort (was Microprocessor Optimization Primer)

On Thu, Apr 7, 2016 at 5:59 AM, Wayne Bickerdike wrote: > I'm slightly gobsmacked that this discussion is needed. I guess the forest > is lost in the trees. > > I can recommend "Principles of Program Design" by Michael Jackson c. 1975. > > Of greater concern is the implication

Re: Why sort (was Microprocessor Optimization Primer)

lso sequentially, retrieving matching records from the Hashmap by key. You can also remove them from the Hashmap as they are found if you need to know if any are unmatched. But this is a solution for a made up case - I don't know whether it is a common situation. I was interested in hearing real reason

Re: Why sort (was Microprocessor Optimization Primer)

Hashmap with the using the data you want to match as the key. > > Then read the second one, also sequentially, retrieving matching > > records from the Hashmap by key. You can also remove them from the > > Hashmap as they are found if you need to know if any are unmatched. > > >

Re: Why sort (was Microprocessor Optimization Primer)

Hashmap by key. You can also remove them from the > Hashmap as they are found if you need to know if any are unmatched. > > But this is a solution for a made up case - I don't know whether it is > a common situation. I was interested in hearing real reasons why sort > is so common on z

Re: Why sort (was Microprocessor Optimization Primer)

sequentially, retrieving matching records > from the Hashmap by key. You can also remove them from the Hashmap as they > are found if you need to know if any are unmatched. > > But this is a solution for a made up case - I don't know whether it is a > common situation. I was interested

Re: Why sort (was Microprocessor Optimization Primer)

whether it is a common situation. I was interested in hearing real reasons why sort is so common on z/OS i.e. Why sort? On Hashmaps etc. in general - they are the memory equivalent to indexed datasets (VSAM etc) versus sequential datasets. Their availability opens up many new ways to process

Re: Why sort (was Microprocessor Optimization Primer)

On Mon, 4 Apr 2016 16:45:37 +1000, Andrew Rowley wrote: >A Hashmap potentially allows you to read sequentially and match records >between files, without caring about the order. Can you please explain what you mean by this? Are you talking about using the hashmap to determine which record to

Re: Why sort (was Microprocessor Optimization Primer)

On 4/04/2016 11:25, David Betten wrote: First the idea of loading all the data into a large hashmap to do the sort tends to eliminate one very important thing and that's overlap. Essentially, you read the entire input, conduct your massive hashsort, and then write the output with no overlap

<    1   2   3   4   5   6   7   8   9   10   >