Article View: comp.sys.amiga.tech
Article #2122Memory allocation methods
From: Dennis Robert Gorrie
Date: Tue, 14 Nov 1989 16:15
Date: Tue, 14 Nov 1989 16:15
18 lines
1361 bytes
1361 bytes
I have to write a tiny 50x30 spreadsheet program in m.l. for a class project, and I am looking for some good memory allocation schemes. The worksheet basicaly consists of 16 bit pointers to data elements in a memory pool. The data elements may be strings, 24 bit integers, and formulas. The 16 bit pointers are POINTERS ONLY, and all the data type/lenght information must be contained in the data element itself. Doing a memory allocation scheme for this is not too hard, until I started trying to figure out a way of cleaning up data from cleared pointers, or strings that change lenght for example. Any general flow diagrams or algorithims would be helpful. +-----------------------------------------------------------------------+ |Dennis Gorrie 'Chain-Saw Tag... | |GORRIEDE AT UREGINA1.BITNET Try It, You'll Like It!'| +-----------------------------------------------------------------------+
Technical Details
Message-ID:
<8911141624.AA11622@jade.berkeley.edu>Path:
arc1-ca.pugleaf.net!utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!tut.cis.ohio-state.edu!ucbvax!UREGINA1.BITNET!GORRIEDEShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!tut.cis.ohio-state.edu!ucbvax!UREGINA1.BITNET!GORRIEDE From: GORRIEDE@UREGINA1.BITNET (Dennis Robert Gorrie) Newsgroups: comp.sys.amiga.tech Subject: Memory allocation methods Message-ID: <8911141624.AA11622@jade.berkeley.edu> Date: 14 Nov 89 16:15:47 GMT Sender: daemon@ucbvax.BERKELEY.EDU Lines: 18