> In XPL, each string is accessed via descriptor that contains in a single
> word
> the memory address and the length.
Your code is doing a binary search of the FIXED length POINTER table. It
is not doing a binary search of a table that has variable length rows.
As I said, any table with variable length rows requires the building of
a secondary table with fixed rows before a binary search can be used.
Tony Thigpen
-----Original Message -----
From: robin
Sent: 10/24/2013 08:58 PM
From: "Savor, Tom" <[email protected]>
Sent: Friday, October 25, 2013 11:40 AM
Robin,
Interesting....I would have said the same thing (if asked), that you
can't have binary search on
variable length keys.
Is your code posted C+ ?? I don't know it at all.
The code is PL/I.
How would you do this in Assembler ??
The original was in XPL, published in 1970 (but used well before that
in an unpublished earlier version).
In XPL, each string is accessed via descriptor that contains in a single
word
the memory address and the length.
