Search:

I am not sure if that will work? Maybe someone else can help more with fseek?? is that used for searching quickly based on the KEY?

the binary hash file is composed of 60 byte structs. how can i search such a file with NAME as the key?

it is a binary file?? does that help?

i am confused on something...
i have made a hash file, now how do i use the key to search it?

let me rephrase:

i have one program which builds the hash file.
the second program makes use of a queries txt file to access the file.

i need to access my hash file by looking up names. my...

Does anyone have any help they can provide with dealing with a queries.txt file that makes use of my already made hash file and outputs such things as:

the record #, the frequency, and location...

I hate to keep bothering, but how do I deal with collissions now.

I have set up a while loop to go through the entire file, and I read on record at a time and hash it. how can i deal with...

can i still use the hash function you gave me ?

Hey Prelude...

I'll see what I can figure out, but I did have one question:

how do I initialize a hash file??? with a table, it was easy. Also, do I still need to use an array of any sort or...

Oh my, so I thought I was on the right track--then I spoke with my peer advisor and he's what he had to say:

your program is not allowed to create huge arrays to hold the records and your program...

once again, results are taking place...just a few questions:

can I do both of those in the same program with no problems?

where should I place this code you just gave me with respect to the...

Prelude,

alright, so it is my luck day! Nice!

you said that I just need to change my first dimension--however, do i need the second dimension at all???

so i need something like this:
char...

ALSO, I noticed that I seem to be getting collissions within my table with the code I have. How do I go about implementing linear probing to avoid collisions? Would it be placed within the code...

awesome, you guys are helping a lot here!
BUT, you know me...I still have some trouble.

the last chunk of code is close to what I think I need. However, the table I need has to have exactly...

you gave me two sections of code...THANKS!

however, i am unsure where i put each different segment?

also, you stated this:

int index = hash ( string );

where you have string, should i put...

basically, i need to read a file that contains records. i want to use the NAME as my hashing key. however, i am new to hashing, and i am not sure if i can create a hash table with a string or if i...

I need to create a hashing function in which I use a name (c string) as the key. Is there any way to do this without treating it as an int?

alright, sounds like a plan. you guys are great.

i'll get the hashing function and then go from there.

any other comments are welcome.

I am working with a program that needs to open a binary file and then work with regular text files and also mix a little hashing in. I know this is very vague, but could someone give me a SMALL...

she's up and working. bam!

FTree<familyTree>::iterator SearchandLocate(FTree<familyTree> &myFTree,
FTree<familyTree>::iterator &iteratorFirst, string member)
{
if(iteratorFirst !=...

thats what i figured. :(

i don't know if that will help you out of not....

geez, this is frustrating...

the input file i have just has a list of 2 names on each line

// Node form for the family tree

template <typename Etype>
class Tnode
{
public:
Etype info; // The data
Tnode<Etype> *firstchild; // Points to first child (left)...

i can post the class i have available to me if that would make it easier for you...

the tree i am working with can have multiple children while a binary tree can only have 2. however, i don't know how many children each node has prior to searching.