Michael Stack
http://www.kcats.org
), for example. Or am I
missing something?
Michael Stack
At 01:47 PM 1/18/2012 -0500, Victor Gil wrote:
How about this - run through the linked list and collect ALL pointers into
an array[1:M].
Then do binary search on the array?
HTH,
-Victor-
On Wed, 18 Jan 2012 10:42:11 +0100, Rob van der Heij
Surely. And if a sequence set is necessary then a more complex structure,
perhaps a B*-tree, is required. I was simply responding to the requirement to
search a linked list.
Michael Stack
At 03:20 PM 1/18/2012 -0500, you wrote:
On 1/18/2012 2:45 PM, Michael Stack wrote:
While binary search
Knuth algorithm 6.2.3A (Balanced Tree Search and Insertion) (AVL) is not much
more work. A couple instructions for a single rotate, a few more when double
rotate is needed. Students coded it pretty quickly.
Michael Stack
At 03:39 PM 1/19/2012 -0700, you wrote:
On 1/18/2012 1:20 PM, Gerhard
contained such
oddities as
R3 EQU 5
Michael Stack
At 05:46 AM 6/13/2012 +0200, Thomas Berg wrote:
-Ursprungligt meddelande-
Från: IBM Mainframe Assembler List [mailto:ASSEMBLER-
l...@listserv.uga.edu] För John Ehrman
Skickat: den 13 juni 2012 01:44
Till: ASSEMBLER-LIST@LISTSERV.UGA.EDU
Ämne: Re: DS 0H
Paul Gilmartin asked:
Does
At 11:30 AM 11/2/2012 +1100, you wrote:
From: John Gilmore
Sent: Friday, 2 November 2012 8:25 AM
Long division is not hashing.
Even long division can be hashing.
Just so. See Knuth, TAoCP, Ch 6.4 .
Mike
Dividing and taking the remainder to
achieve a more-fewer mapping is---by
The 360/67 had a Branch and Store (BAS, BASR) to deal with 32-bit virtual
addresses.
Mike
At 07:25 AM 4/10/2013 -0500, you wrote:
IIRC, some models of the S/360 had a BAS instruction. But I don't have
an old S/360 POPS to make sure exactly what it did.
On Wed, Apr 10, 2013 at 6:52 AM, Peter
The blue card itself can be seen at
http://archive.michigan-terminal-system.org/documentation/documents/IBM360-67RefCard.pdf
Mike
At 01:15 PM 4/10/2013 -0500, you wrote:
This green card documents BAS as Branch and Store with footnote (e) Model
67.
I wish I could help, but this is the closest I could come:
The recognition of the insuperable limits to his knowledge ought indeed to
teach the student of society a lesson of humility which should guard him
against becoming an accomplice in men's fatal striving to control society - a
striving
I keep hoping to find a replacement, but I can find nothing with the facilities
of Eudora. So, I plod on ...
Michael
At 07:15 PM 2/20/2014 +, you wrote:
Content-Transfer-Encoding: base64Michael:
I have used Eudora in awhile, wow ..thank you
Regards,
Scott
From: Michael Stack
ROFLMAO!
Mike
At 12:10 PM 10/1/2014 -0400, you wrote:
...
Our subject here is not defunct in either sense; but it is probably
better that those who think it is not be disabused of their error.
They will do less harm preoccupying themselves with RPG II.
John Gilmore, Ashland, MA 01721 - USA
Correctness is the most important, and most difficult to achieve,
characteristic of PoO.
An example: in my nine-years-old e-copy of PoO, there is in Appendix A a
section on sorting instructions (p. A-52 in my edition). The headers and first
sentence read:
And is Teneke prepared to have you home all day, day after day, week after
week, ...?? :-)
Mike
At 06:42 PM 4/13/2016, you wrote:
>...
>
>I'll be retiring from IBM at the end of May, ... .
>
>...
>Regards... John
>-
>555 Bailey Ave, San Jose CA 95141 USA
>+1-408-463-3543
This is by far the easiest, if not the simplest, solution. There was, once upon
a time, an example in an IBM pub, but for the life of me, I cannot recall
where. Still, one TR will do it; create a result field whose bytes are indexes
into the source value treated as a TR table such that only the
itical before the data is stored in a packed field and it can not be handled
>by any simple TR instruction.
>
>Sign identification can also be an issue since there is no standard of putting
>it first or last.
>
>(And as others have said, the TR and TRT instruction are cpu hogs
It makes a fine introduction to macro language programming (iteration) for
assembler students, so add another count for each of those.
Mike
At 03:05 PM 7/20/2017, you wrote:
>Makes sense, I think.
>
>I would guess that about 10,000 programmers and/or shops (literally) have done
>their own.
>
That would surely be nice, Ed, but there are so many possibilities for
circumvention of any such "solution" that I would be skeptic No 1. (And I
haven't thought about nastiness like this in YEARS!).
Mike
At 11:21 PM 10/9/2017, you wrote:
>Like most ISVs writing HLASM code, we use OPTABLE to
At 09:25 AM 12/11/2017, you wrote:
>In VM-land, they're canon, because of use of CMS UPDATE for maintenance. z/OS
>is poorer for lack of an equivalent: I know there's IEBUPDTE, but with no good
>way to create updates, it doesn't seem to be used much. XEDIT in UPDATE mode
>makes source
Walt, you wrote, "Therefore, RACF is not allowing an ENQ on a DSN, because RACF
has no idea that an ENQ is being done." and it occurs to me to point out that,
likewise, ENQ is not preventing access to a DSN because ENQ has no idea that a
dsn is being accessed (which, of course, is different
20 matches
Mail list logo
