blog:fall2015:ahorton8:journal
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| blog:fall2015:ahorton8:journal [2015/11/01 04:04] – [October 31st, 2015] ahorton8 | blog:fall2015:ahorton8:journal [2015/12/07 17:07] (current) – ahorton8 | ||
|---|---|---|---|
| Line 94: | Line 94: | ||
| Ive gotten the majority of cpnode working, just need to work out a few kinks. In test 0, my result is DLN_INVALID | DLN_ERROR, when it should be DLN_ERROR | DLN_NULL. I tried making a check to see if copiedNode and oldNode were NULL, but it unfortunately caused tests 0, 1, AND 2 to fail, so, yeah. Also, in test 5, tmp's value is 52 instead of 37. So thats always fun. Judging by the unit test, its getting reset to that when it shouldnt be. Not checking to see if its not null correctly perhaps? So I mainly just need to figure out how to make the program distinguish from NULL to NULL/NULL node to NULL and NULL node to NULL node, and figure out how to fix the tmp error. | Ive gotten the majority of cpnode working, just need to work out a few kinks. In test 0, my result is DLN_INVALID | DLN_ERROR, when it should be DLN_ERROR | DLN_NULL. I tried making a check to see if copiedNode and oldNode were NULL, but it unfortunately caused tests 0, 1, AND 2 to fail, so, yeah. Also, in test 5, tmp's value is 52 instead of 37. So thats always fun. Judging by the unit test, its getting reset to that when it shouldnt be. Not checking to see if its not null correctly perhaps? So I mainly just need to figure out how to make the program distinguish from NULL to NULL/NULL node to NULL and NULL node to NULL node, and figure out how to fix the tmp error. | ||
| + | |||
| + | ====November 1st, 2015==== | ||
| + | So I was able to get the issue fixed with it not distinguishing between the the cases, but I have yet to figure out the tmp error. I didnt even malloc in my code, and I ended up rewriting it. But its a stubborn little bug, and rewriting did essentially nothing. Yeah, definitely not going to get everything done on time this week! | ||
| + | |||
| + | ====November 2nd, 2015==== | ||
| + | Okay, got my issues sorted with cpnode finally. I wasnt really copying over the payload. I had tried coping the ->VALUE, itd cause a segfault. I found out that it was because I needed to use either ->DATA or ->OTHER, since they require more memory. But thats fixed, now onto dll0! | ||
| + | |||
| + | ====November 4th, 2015==== | ||
| + | Oh, apparently Ive done a lot in the past few days if I hadnt even started dll0 a few days ago. Well then. I got most things in dll0 moderately functional. Most... I didnt really do much, well, anything with display, and didnt put a whole lot of effort into fixing my issues with cplist. The only two that have zero mismatches are find and mklist. Append has two, both are dealing with the return value, not the actual list structure though. So it... it works, its just not checking for everything I suppose. As for insert, theres only one mismatch, which is the same issue - one of the return values is off. In cplist, theres 11 errors, but thats due to it segfaulting about halfway through the unit test. And that is most likely due to me not using append 100% correctly. Hopefully my not finishing these projects wont interfere too much in the future. I had a lot of work in other classes this week, and I figured my grade would be high enough that not doing as well on this project wouldnt kill me or anything. I had a fun time with this project at least (sarcasm)! Mklist wasnt too bad, cplist was a pain (but so was cpnode, go figure). Append took a while, but eventually I did get it to work. Find I dont believe was too bad, I just had a lot of small errors (mainly missing checks). Insert was relatively easy, since I kind of used append where I could in it. A lot of the function I had to rewrite since it wouldnt work with append, but what would be considered the " | ||
| + | |||
| + | ====November 5th, 2015==== | ||
| + | Surprisingly I managed to get obtain completely done in class. Hooray for getting a headstart! I did it with relatively few issues, just a few returnvalue' | ||
| + | |||
| + | I was also able to get empty and rmlist done rather easily. Empty had a few issues, but wasnt bad. Rmlist was pretty easy, due to just needing to call empty and being set to NULL. Compare is technically next on the list, but I might skip ahead to swap - just because swap sounds easier and I might end up needing it in sort. If I get those done and working, Ill go back to compare. Somehow, Im halfway through the project and its not even Friday. Weird. | ||
| + | |||
| + | Make that more than halfway! I got swap to work. This one was a bit more difficult than the others - with a few issues with a node pointing to another node that pointed to the first node that pointed to the second, ect... that was fun to attempt to debug. Finally gave up on using the debugger to see where it was happening and just ran the program and did Ctrl C as soon as possible. But I also had a few logic errors that needed to be worked out, but nothing serious. I started trying to work out how to do swap on paper, but between the after and prior pointers and such, I got lost on the second line. But, I did realize I could use obtain and insert/ | ||
| + | |||
| + | ====November 6th, 2015==== | ||
| + | I started working on sortlist and... didnt really get all that far. All of the basic checks pass, but the ones that actually do stuff... dont. Unfortunately, | ||
| + | |||
| + | ====November 9th, 2015==== | ||
| + | Okay, so I got sort working a bit better. There was an issue in cplist that was fixed, AND an issue in swap, which is what I was using for sort. Swap wasnt checking for whether or not the nodes were right next to each other, so that was causing a few issues (such as a seg fault...). Right now, it sort of works. As in, it swaps the first two nodes in the list and thats it. But you know, progress! And that only works for mode 0, mode 1 is completely useless, but I still need to fix that up a bit. And mode 2 doesnt even exist yet, so thats always good. | ||
| + | |||
| + | ====November 11th, 2015==== | ||
| + | After a few days of not getting any farther, I decided to just submit dll1 as it was earlier today. The only issues with it were, well, the majority of sort, and compare' | ||
| + | |||
| + | ====November 15th, 2015==== | ||
| + | I'd gotten the majority of dll2 working, and the majority of display (there were only like 19 tests failed I believe). However, after a particularly rough weekend and a need to work on other classes, I decided to submit dll2 as it was, so that I could begin on dls0, which hopefully wont be too difficult. | ||
| + | |||
| + | ====November 17th, 2015==== | ||
| + | I've gotten mkstack done, along with isempty (was only 5 tests, obviously had to go after that). I started working on cpstack, and Ive got it working up to test 4.... but you know, thats 5 tests done! After that it kinda breaks, giving out the wrong codes, causing segfaults when displaying the list, ect. But eh, Ill get them fixed. Eventually... | ||
| + | |||
| + | ====November 18th, 2015==== | ||
| + | So Ive done a bit of jumping around with this project. I got rmstack working completely, so theres that, mkstack, and isempty working 100%. I did some work on peek, pop, and cpstack, but none of them work fully. Peek doesnt create a copy, but instead has the same node for each test (issue with cpnode maybe? I couldnt find one). Pop has a few various issues, most of them resulting from something not being checked/ | ||
| + | |||
| + | ====November 24th, 2015==== | ||
| + | After a much needed break, I started working a bit more on dls0. Out of 92 tests, theres only 12 mismatches. Pop works completely now, push has two issues (some issue with my overflow check, its being triggered when it shouldnt be on the last test), and the same issues as before with peek and cpstack. But at least theres progress! | ||
| + | |||
| + | ====November 30th, 2015==== | ||
| + | Okay, so apparently its been a while since I updated my opus. I decided to skip the rest of stack, and submitted it as it was on I believe last Tuesday. I started working on dlq0, and got everything except for cpqueue working over break. I'm pretty sure the issue I had with cpqueue is the same issue I had with cpstack, I was forgetting to set (*newQueue) to NULL (at least, I think thats what it was) after making it. So because it wasnt NULL, the program wouldnt run. After changing that, it lit up and everything started working. Well okay, there was one issue, but I believe I was forgetting a check. But its done and submitted now, and I can safely say this is the first time all semester that I couldnt do data structures even if I wanted to. | ||
| + | |||
| + | ====December 2nd, 2015==== | ||
| + | I started working a little on the eoce, specifically 0x3. Well, I got 0x0 done too, but that was relatively easy. So far, I have both the journal and participation sections working. I had an issue trying to connect the data into the list, but I was able to get that fixed earlier today. I was reading the information correctly, as in I could read the data from the file and display it in a regular char, but I couldnt get it to work with nodes. However, its functioning now, so I just need to get the project portion working. Which I dont think will be too bad, just kind of a pain to work out how to do I guess. But Ill get there! | ||
| + | |||
| + | ====December 7th, 2015==== | ||
| + | I've done a little more work on the eoce. I havent gotten much more done with 0x3, but I have done a little with addnode (segfaults on test 5, when adding 9 to the tree), and I've created everything except for the unit tests in DoublyLinkedNode. Dont know if everything works or not, but the fact that it compiles is a good sign! | ||
blog/fall2015/ahorton8/journal.1446350691.txt.gz · Last modified: 2015/11/01 04:04 by ahorton8
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
