A hash Table, if there is a collision, item is already here else it is not .
Gunter From: robin <[email protected]> To: [email protected] Date: 08/23/2010 12:57 PM Subject: Re: Efficient Memory List Sent by: IBM Mainframe Assembler List <[email protected]> From: "Patrick Roehl" <[email protected]> Sent: Tuesday, 24 August 2010 12:45 AM >I'm looking for advice on how to handle a potentially large list of data. >The list is comprised of 4-byte entries and the application needs to know >if an incoming item is already present or is new to the list. This is the >approach that is currently in use and that Iâ?Td like to improve upon: How large will the list grow? ----------------------------------------- The information contained in this communication (including any attachments hereto) is confidential and is intended solely for the personal and confidential use of the individual or entity to whom it is addressed. If the reader of this message is not the intended recipient or an agent responsible for delivering it to the intended recipient, you are hereby notified that you have received this communication in error and that any review, dissemination, copying, or unauthorized use of this information, or the taking of any action in reliance on the contents of this information is strictly prohibited. If you have received this communication in error, please notify us immediately by e-mail, and delete the original message. Thank you
