magid@sandstorm.Berkeley.EDU (Paul Magid) (12/31/90)
Is there any way to make arrays larger than the above without running out of data segment space? I am open to any suggestions, kludge, black magic or anything else. The only thing that I can think of is to use pointers. Yuckie! I do not want to do that, since I am not fully comfortable with them. Any help will be appreciated! Paul
magid@sandstorm.Berkeley.EDU (Paul Magid) (12/31/90)
In article <1990Dec30.191234.5416@agate.berkeley.edu> magid@sandstorm.Berkeley.EDU (I) write: > Is there any way to make arrays larger than the above without running >out of data segment space? I am open to any suggestions, kludge, black magic or >anything else. The only thing that I can think of is to use pointers. Yuckie! I >do not want to do that, since I am not fully comfortable with them. > >Any help will be appreciated! I am sorry but I left off my previous posting that I am using TP5.5 Professional. Thanks once again for any help. Paul
ts@uwasa.fi (Timo Salmi) (12/31/90)
In article <1990Dec30.191234.5416@agate.berkeley.edu> magid@sandstorm.Berkeley.EDU (Paul Magid) writes: > > Is there any way to make arrays larger than the above without running >out of data segment space? I am open to any suggestions, kludge, black magic or >anything else. The only thing that I can think of is to use pointers. Yuckie! I >do not want to do that, since I am not fully comfortable with them. > >Any help will be appreciated! Try taking a look at the Turbo Pascal FAQs in /pc/ts/tsfaq15.arc. Available by anonymous ftp from uwasa.fi archives. ................................................................... Prof. Timo Salmi (Moderating at anon. ftp site 128.214.12.3) School of Business Studies, University of Vaasa, SF-65101, Finland Internet: ts@chyde.uwasa.fi Funet: gado::salmi Bitnet: salmi@finfun