#avr Logs
Dec 02 2018
#avr Calendar
09:07 AM davor_ is now known as davor
09:37 AM nohit: --
09:45 AM jesseg: ++
12:14 PM rue_mohr: hey
12:14 PM rue_mohr: ok, so maybe today I can tie the entry fields to the struct
12:21 PM rue_mohr: so a project file needs a list of toolpaths
12:21 PM rue_mohr: It might be a good time to come up with a project struct
12:23 PM rue_mohr: part of what I need is to sift all the gui stuff out of the source, its crazy
12:24 PM rue_mohr: there are levels here tho that I'm not sure how to sort
01:16 PM vmt: rue_mohr: have you tried out your gui, so that it responds faster than your ultra-quick eyes?
01:16 PM vmt: or your fingers, for that matter
01:49 PM rue_mohr: no problems so far
01:50 PM rue_mohr: no working buttons yet tho:)
01:50 PM rue_mohr: but when draging even a large drawing around, I cant notice any delay
01:50 PM rue_mohr: except when there were 20000 circles, it didn't like that
01:54 PM rue_mohr: test 1 2
01:54 PM rue_mohr: <rue_mohr> no problems so far
01:54 PM rue_mohr: <rue_mohr> no working buttons yet tho:)
01:54 PM rue_mohr: <rue_mohr> but when draging even a large drawing around, I cant notice any delay
01:54 PM rue_mohr: <rue_mohr> except when there were 20000 circles, it didn't like that
01:54 PM rue_mohr: <rue_mohr> test 1 2
01:56 PM rue_shop3: huh
02:00 PM vmt: last i heard buttons are pretty useful
02:15 PM rue_shop3: I'm just wroking on the parts of the code that need to use buttons
02:17 PM rue_shop3: http://trivox.tripod.com/lego-nxt-motor-input-output.html
04:45 PM day__ is now known as day
05:58 PM day__ is now known as day
07:15 PM rue_mohr: this is frustrating, I keep bumping into needing hash tables in my programs
07:16 PM rue_mohr: I suppose I should sit down and put a hash library togethor
07:16 PM rue_mohr: arg
07:37 PM rue_mohr: omg, I'v never done a binary tree!!!!
07:37 PM rue_mohr: WHY!!!
07:38 PM rue_mohr: damnit, I'm just gonna have to do it,
07:38 PM rue_mohr: screw if I need it or not
07:38 PM rue_mohr: how the hell did I get this far without ever having made a binary tree?
08:13 PM rue_mohr: OH GOD RECURSIVE CODE IS GOING TO KILL ME
08:14 PM rue_mohr: void binTreeSearchKey( binTreeNode_t *this, unsigned long key, binTreeNode_t *answer) {
08:14 PM rue_mohr: if (this->key == key) { answer = this; return }
08:14 PM rue_mohr: if (this->key < key) {
08:14 PM rue_mohr: if (this->higher != NULL) {
08:14 PM rue_mohr: binTreeSearchKey( this->higher, key, answer);
08:14 PM rue_mohr: } else {
08:14 PM rue_mohr: answer = NULL;
08:14 PM rue_mohr: return;
08:14 PM rue_mohr: }
08:14 PM rue_mohr: }
08:14 PM rue_mohr: if (this->lower != NULL) {
08:14 PM rue_mohr: binTreeSearchKey( this->lower, key, answer) ;
08:14 PM rue_mohr: } else {
08:14 PM rue_mohr: answer = NULL;
08:14 PM rue_mohr: return;
08:14 PM rue_mohr: }
08:14 PM rue_mohr: }
08:14 PM rue_mohr: thats right, isn't it?
08:14 PM rue_mohr: :)
08:19 PM rue_mohr: omg, I'm insane, I could have just used a while llop
08:20 PM rue_mohr: ok, but first, I ahve to make this work
08:29 PM rue_mohr: ugh, my pointers...
08:29 PM rue_mohr: fixed it tho
08:39 PM rue_mohr: ah, I wanted a slightly different tint for my insert fn tho
08:40 PM rue_mohr: hmm
08:40 PM rue_mohr: the itteitive code is so much smaller :)
08:55 PM rue_mohr: ah, if I make a fn called "set" instead of 'insert' I dont have to take care of collisions
09:10 PM rue_mohr: OH YEA, CODE ME!!!!
09:12 PM rue_mohr: http://paste.debian.net/1054118/
09:12 PM rue_mohr: that worked out ok
09:24 PM rue_mohr: I suppose I need something to turn strings into keys now
11:19 PM [1]MrMobius is now known as MrMobius
11:46 PM day__ is now known as day