×
The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.
dcl-proc IToBase36;
dcl-pi *n Char(33);
number Int(10) Const;
end-pi;
dcl-pr itoa Pointer ExtProc('__itoa');
num Int(10) Value;
str Char(33);
base Int(10) Value;
end-pr;
dcl-s string Char(33) Inz('');
string = %str(itoa(number: string: 36));
return string;
end-proc;
Mark Murphy
STAR BASE Consulting, Inc.
mmurphy@xxxxxxxxxxxxxxx
-----"Mark Murphy/STAR BASE Consulting Inc." <mmurphy@xxxxxxxxxxxxxxx> wrote: -----
To: Midrange Systems Technical Discussion <midrange-l@xxxxxxxxxxxx>
From: "Mark Murphy/STAR BASE Consulting Inc." <mmurphy@xxxxxxxxxxxxxxx>
Date: 06/18/2015 09:07AM
Subject: Re: The case of outnumbered numerator
I have done this using the C library function itoa() pass in an integer value and a base (base 36 will give 0-9 and A-Z). You can search google for usage documentation.
Mark Murphy
STAR BASE Consulting, Inc.
mmurphy@xxxxxxxxxxxxxxx
-----Gad Miron <gadmiron@xxxxxxxxx> wrote: -----
To: midrange-l@xxxxxxxxxxxx
From: Gad Miron <gadmiron@xxxxxxxxx>
Date: 06/17/2015 01:45AM
Subject: The case of outnumbered numerator
Hello Pundits
We have a six digits numerator that approaches 899999.
Since it happens to be a CHAR field I would like to start using the
letters A-Z
in lexical order when incrementing this field so that incrementing
899999 will result in 9AAAAA , 9AAAAB , ......., 9AAAAZ, 9AAAA0, 9AAAA1 etc.
(This way the numerator will sort the EBCDIC natural way)
Do you know an *elegant* way of doing it ?
(EBCDIC table having "holes" of unprintable chars does not expedite matters)
Thanks
Gad
As an Amazon Associate we earn from qualifying purchases.
This thread ...
Re: Re: The case of outnumbered numerator, (continued)
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact
[javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.