?

Log in

No account? Create an account
 
Previous | Share | Next
 
Hoc Est Qui Sumus
discoflamingo
11 December 2002 @ 10:25 am
Wacky misadventures of sleep deprival  
So I didn't sleep again last night. I helped Luckjohn with his neural net homework while I chewed over Real (and was subsequently chewed), and discovered the magical portions of the C++ Standard Template Library which will help me avoid writing a permutation hashing function for Tom's Program. I don't quite udnerstand it, but it works just like intoning magical words over a sacrificial animal of some kind (Ask Phil about his computational chemistry project - his was 12 chickens, this is about 8). I feel better about doing stuff today, because I can no longer afford to fuck up. And I'm gonna get this shit nailed to the wall - I promise you that much.

Doom/Death/Hit List (Idea courtesy of susanofstohelit)

  • Today - rough draft of Real Paper, Real Homework
  • Tomorrow - Tom's program - Murnaghan-Nakayama Style.
  • Friday - Real Paper, Poetry Revisions
  • Saturday - Discrete Applied Paper
  • Next Week Sometime - Design Patterns Paper,
    Robo-Rally Design Paper and Diagram, Tom's Program - RSK-Insertion
    a/or Cantrell/Miller/Halverson Style
  • Last Day of Finals - Real Take-Home Final
 
 
Current Music: Ray of Light - Madonna (Both Barrels Mix by The Eastern Kings)
 
3 comments | Leave a comment
 
 
3 comments —
( 3 comments — Leave a comment )
truth without proofchronicfreetime on December 11th, 2002 03:51 pm (UTC)
All the standard STL containers use comparators, not hashing. There are GNU extensions like hash_set and hash_map though.
(Reply) (Thread) (Link)
Hoc Est Qui Sumusdiscoflamingo on December 11th, 2002 04:37 pm (UTC)
I don't actually need a hash table - that's just what Tom thought we needed. Having anything that does look-up in polynomial time is better than the horribly complicated permutation-ordering set-up he wanted me to do. So it's all good. Thanks for telling me though - I may end up using hash_map.
(Reply) (Parent) (Thread) (Link)
truth without proofchronicfreetime on December 11th, 2002 05:30 pm (UTC)
Imposing a total ordering on permutations shouldn't be that hard. Be careful trusting the free comparators you get from C++, sometimes they don't work how you might expect. If it's all STL containers and primitives, and you don't get a compile-time error, it's probably fine though.
(Reply) (Parent) (Thread) (Link)