Jump to content

jcarmody

Members
  • Posts

    947
  • Joined

  • Last visited

  • Days Won

    39

Everything posted by jcarmody

  1. I wonder why this method exists; it looks like an inside joke.
  2. Interviewer #1: Have you driven before? Me: Yes. I have a license, and everything. Interviewer #1: Let me show a car I'm currently driving. I'm sure you know how this one works? Me: I'm confident I could figure it out. Let me look at it... Interviewer #1: Never mind. Let me show you some of the cars we need driven. Me:
  3. Passed the CLD-R again. Three more years!!!

  4. Your second mistake was in wiring the buffer size to the max queue size of the obtain queue node. The top loop is filling the queue with five elements and waiting for the bottom loop to respond, which it never does because of the way an Event structure works (see below). Your third mistake was in thinking that the event structure would respond to a change in the Buffer Full indicator. You could use a Value (Signaling) Property node to accomplish this: Your first mistake was your archetecture; take a look at the Producer-Consumer design pattern. Your VI will run if you change the two things I've mentioned, but it'll take forever to finish. If only I had finished my Algorithms course... You could do this, and your graph will fill instantly.
  5. I noticed this yesterday at work and at home. Did I accidentally remove these or is this a bigger issue? I'm accustomed to seeing the reputation count and status updates.
  6. I ended up on the Rube Goldberg thread with this: ... just last year.
  7. Have you considered NI's Third-Party Licensing and Activation Toolkit?
  8. Here's a single VI (so you don't need the extra folder in <LabVIEW>\projects) that's been cleaned a bit. ReqHatch.vi Boo.
  9. You'd have to unbundle each of the smaller clusters before building the larger one.
  10. It's not finding [Covers <id>] tags in any SubVIs. I can't remember if this ever worked (it seems to me that it did) or if TRef Traverse for References.vi has changed in LV2012. Anyway, this attachment finds the missed tags (in a most inelegant manner). Dror, this addresses some of the issues you raise in item 2 of your post. Also, there aren't any mistakes in I fixed the capitalization in my other post. RequirementsHatchway.zip
  11. It's not finding [Covers <id>] tags in dynamically dispatched VIs saved in an llb.
  12. Here's something you can try. I just got it working this afternoon and haven't tested it enough since drastically changing the approach. unzip the attachment into <LabVIEW>\project restart LabVIEW put a "requirements.txt" file in the folder with your LabVIEW project the first line must be the name of the top-level VI (as a relative path from the project's folder) the second line must be blank the third and subsequent must be the requirement ID followed by a tab then the requirement description put free labels in your VIs in the form of [Covers <id>] run Requirements Hatchway from the Tools menu profit Tell me how it goes. By the way - this is only in LabVIEW 2012 because I can't manage to save it to a previous version. All I get is a folder with its dependencies, but no main VI. I'll try from home in case this is an issue with my installation. RequirementsHatchway.zip
  13. I've made CaseSelect into a Quick Drop plugin - https://decibel.ni.com/content/docs/DOC-24058
  14. We have your blog in our feed-readers anyway.
  15. This is in my CaseSelect JKI RCF plugin: You don't use my plugin.
  16. Who is John Galt? Nikola Tesla is John Galt! from http://theoatmeal.com/comics/tesla
  17. I've seen that, only the line was black and there were fewer data points. Somehow my mind wandered from here to an old Isaac Asimov short - The Feeling of Power I made some progress last night re-reading the material and reviewing some of the lectures, but I may always feel like this technician.
  18. Yes, Sedgewick is using his book for this course. I'd read it.
  19. You don't really need any hardware experience for the CLD. And, I FTFY.
  20. I understand the things you've both written. I also think that I understand that a brute-force approach to the "Three Sum" problem is ~N^3 because it nests loops and operates N*N*N times. I guess I understand that expanding a binary search process will lead to 'log N', but I'd only be guessing and accepting some maths that I've either forgotten or never learned. I'm studying Union-Find algorithms this week, too. The programming assignment involves solving a percolation problem. I haven't read the problem statement, but the lectures introduced the concept and I believe I can implement an efficient algorithm because the lecture told me that the "weighted quick-union with path compression" is the best approach. I should probably discuss this in Coursera's forums but I like the people here so much! I'm going to keep plugging away on the off chance that something will click and I'll learn something. Thanks for your comments.
  21. Algorithms Part 1 began today... What do you call a programmer that doesn't understand order-of-growth calculations? Hopeless?
  22. You're welcome; I hope you stick around and enjoy/enrich LAVA.
×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.