Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Re: Re: Interview scheduleing in a database

by jreades (Friar)
on Nov 12, 2002 at 15:13 UTC ( #212279=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: Interview scheduleing in a database
in thread Interview scheduleing in a database

The other awy to do it is to use a combination bitmap/tied hash. This way would have a number of distinct drawbacks, but would save you having to use a database (which, IMO, is the better way).

You could build a bitmap for each employee/employer, and then AND them together to see what's left -- what's left, of course, are the available times for interviews.

Then, assuming that you get a match, you could tie() to a hash and create a reference in (for instance) the appropriate employer's timeslot that points to the person being interviewed (or you could just enter their name, but I like the idea of a hashref) and use it to print out reports and so forth.

Now, suddenly, the database method looks a little bit better, no? ;)


Comment on Re: Re: Re: Interview scheduleing in a database

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://212279]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (7)
As of 2014-07-28 06:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (191 votes), past polls