Path: utzoo!utgpu!news-server.csri.toronto.edu!qucis!opus!nielsen
From: nielsen@opus.ee.QueensU.CA (Robert Nielsen)
Newsgroups: comp.windows.ms.programmer
Subject: Memory allocation in global heap.
Keywords: Handles, Linked List
Message-ID: <486@opus.ee.QueensU.CA>
Date: 30 May 91 15:01:19 GMT
Organization: Dept. of Electrical Engineering, Queen's University, Kingston, Ontario, Canada
Lines: 13


I am a brand new Windows programmer about to begin a fairly large project.
The program I will be writing uses several linked lists in which nodes are
allocated as the need arises. This seems to be a problem in Windows as there
are a limited number of memory handles and a large amount of overhead for
each block. The SDK recommends grouping small memory objects together. The
problem with this is that you cannot know in advance how many nodes are 
required. Making an assumption as to the number of nodes required for 
different stages of data structure genereation would be wasteful and would 
probably use much more memory than required.

What is the best way to allocate memory in many small (thousands)
chunks without exhausting Windows memory handling resources?