![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
tsukikageI know every language has its quirks, and I know that debugging sucks in general, but...
Fucking parens!!! I just spent three hours trying to debug this single procedure, and in the end I had an extraneous set of parens.
I eventually asked![[livejournal.com profile]](https://www.dreamwidth.org/img/external/lj-userinfo.gif)
md3000 for help on it, and he tried playing with it in STK, and found the problem about 2 minutes after I did.
Emacs' error message?
"The object ((6 . 6) (8 . 8)) is not applicable."
STK's error message?
"bad function in (pt-list)"
I think I need to start using STK for debugging. ^^;
*tries to finish up this lab before midnight*
[EDIT: Yay!!! Except for one answer to be written in English ("Given the operators written so far, is there a good reason to maintain the point list in sorted order? Give an example of a situation (or operator) where maintaining the point-list in sorted order is beneficial."), I am done with lab 7! I'm not really sure what to make of that one, or at least how to explain it in terms of the procedures we wrote in this lab (or at least the procedures that my tired brain recognizes as applying to the situation), but I'm gonna sleep on that and maybe ask for help on it when I come in for office hours tomorrow to get the rest of the lab graded. But other than that, I'M DONE! This makes me really happy, because it's basically the first lab I've complete all semester. ^^; (Not counting the labs where we basically got full points just for attending.)
Even cooler is that I wrote the final step correctly on the first go. Now that was cool, especially after the three-hour-fun I just went through.
BE HAPPY FOR ME! :-P]
[EDIT 2: I wrote up a best-attempt at an answer, just so I can feel a little better about leaving it with just one part left:
;; Answer to Question:
;;
;; By mainting sorted lists, you can use accumulate-like procedures to apply operators only to certain elements in the list, such as applying the operator sum-xcoord
;; only to the elements which are the 4th through the 8th closest to the origin.
;; (I do not believe I currently have any accumulate-type procedures that will allow this, but they could be easily desinged.)
;;]
Fucking parens!!! I just spent three hours trying to debug this single procedure, and in the end I had an extraneous set of parens.
I eventually asked
md3000 for help on it, and he tried playing with it in STK, and found the problem about 2 minutes after I did.Emacs' error message?
"The object ((6 . 6) (8 . 8)) is not applicable."
STK's error message?
"bad function in (pt-list)"
I think I need to start using STK for debugging. ^^;
*tries to finish up this lab before midnight*
[EDIT: Yay!!! Except for one answer to be written in English ("Given the operators written so far, is there a good reason to maintain the point list in sorted order? Give an example of a situation (or operator) where maintaining the point-list in sorted order is beneficial."), I am done with lab 7! I'm not really sure what to make of that one, or at least how to explain it in terms of the procedures we wrote in this lab (or at least the procedures that my tired brain recognizes as applying to the situation), but I'm gonna sleep on that and maybe ask for help on it when I come in for office hours tomorrow to get the rest of the lab graded. But other than that, I'M DONE! This makes me really happy, because it's basically the first lab I've complete all semester. ^^; (Not counting the labs where we basically got full points just for attending.)
Even cooler is that I wrote the final step correctly on the first go. Now that was cool, especially after the three-hour-fun I just went through.
BE HAPPY FOR ME! :-P]
[EDIT 2: I wrote up a best-attempt at an answer, just so I can feel a little better about leaving it with just one part left:
;; Answer to Question:
;;
;; By mainting sorted lists, you can use accumulate-like procedures to apply operators only to certain elements in the list, such as applying the operator sum-xcoord
;; only to the elements which are the 4th through the 8th closest to the origin.
;; (I do not believe I currently have any accumulate-type procedures that will allow this, but they could be easily desinged.)
;;]
