Author: TEERAPONG TOVIRAT
Date: 17:03:23 07/26/99
Go up one level in this thread
On July 24, 1999 at 13:16:17, Pete Galati wrote: >On July 24, 1999 at 03:31:50, TEERAPONG TOVIRAT wrote: > >>I've studied one source code about hashtable.The author assigns keep method >>varialbles as new,old,deep,big1,bigall. I think they are the methods to put >>all >>informations into the table in case of collision. Their names are arbitrary but >>I hope >>someone can guess the idea behind them. Please,let me know. >>Thanks for any help. >>Teerapong > >I don't see that as so much a question about hashtables but a question about >programming, I don't say that to be critical of your question. What you name a >variable is not important to the program. It would have funtioned exactly the >same if the programmer had decided to call "bigall", "smallno" instead. The >names for those variables obviouslly had some sort of organazation importance, >but you'd really have to ask the programmer. > >Pete I know their names are not important .What I want to know is idea behind each variables(methods) or the differences between them. Teerapong
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.