At 11:24 AM 7/26/99 -0700, you wrote:
>I don't have my copy of the Image Handbook handy so I'm posting this
question to the group.  When adding records to a detail set and one of the
chains has a sorted path defined, what is the direction the DBPUT code
reads the chain in order to define the next/previous record numbers for the
new record.  Does it start at the beginning of the chain and reads forward
or does it start at the end of the chain and read backwards?

IMAGE's DBPUT starts reading the chain in reverse order until the beginning of
the chain is encountered or the entry retrieved is less than/equal to the
value of the entry being added.


>It sure would be nice if a new access method would be implemented that
would perform a binary search on the chain before updating the pointers, if
enabled via DBUTIL or a different DBPUT mode.  (Did someone post a similar
idea earlier for this option?)


/jf
                              _\\///_
                             (' o-o ')
___________________________ooOo_( )_OOoo____________________________________

                        Monday, July 26th

          Today in 1775 - U.S. Post Office established by the
                          Continental Congress.
                   1788 - New York became the 11th state.

___________________________________Oooo_____________________________________
                            oooO  (    )
                           (    )  )  /
                            \  (   (_/
                             \_)