Jump to content

ShaunR

Members
  • Content Count

    4,112
  • Joined

  • Days Won

    216

Everything posted by ShaunR

  1. This is what I deduced for Windows. (It was a while ago, but this is what I recall) Casting the refnum to an integer reveals the same value as the windows file handle (from Process Hacker). Casting it back enables using the native LabVIEW functions. Casting the handle from CreateFileW to a LabVIEW file refnum also allows usage of all the native file functions(including delete) but the LabVIEW delete function isn't symlink aware (treats it as a normal file). The LabVIEW file functions just seem to be primitives of the windows functions *A (which is what can be seen in the imports table). <- this is rubbish It'd be nice if someone from NI confirmed that the file refnum is or isn't just a LabVIEW version of the windows file handle (perhaps with a reference count) but that's all it seems to be. I think it is like the TCP reference in that regard.
  2. Nothing what. It's just an interesting data presentation showing the rise and fall of languages over time. It's just a shame LabVIEW isn't on there.
  3. Neither is SQLite. My (brief) foray into this area was before those solutions were available.
  4. Well. SQLite doesn't let you use point cloud queries directly like LASTools or PGPointCloud. drjdpowell would be better to answer that question on how he did it.
  5. If you grew up on Fortran I would have hoped they had let you retire by now. No rest for the wicked?
  6. RTree just gives you a bounded nearest neighbour search. How you come up with those bounds is not within that scope.
  7. "Just". Without it, it would be a debugging nightmare and if I was coming up with that method, I would "just" think it wasn't working.
  8. Yup. On first glance I thought something could have been done with bytearraytostring etc. But the handle created isn't an array (in the LabVIEW sense) so a Moveblock would be needed to copy into another array to dereference it (double the memory required-not what we want). The really devious bit of your code is the sequence structure. That's some voodoo I probably would never have thought of.
  9. One of the requirements for 3d feature extraction is extracting datapoints in the neighbourhood of the feature. RTree is a good solution for that. RTree would give you the datapoints around your "finger", "elbow" and "shoulder" and you could draw lines between the centroid of those (giving you the lengths). Given you have three centroids you can then calculate the angle between the shoulder/elbow and finger/elbow.
  10. I have done this for VIP, and Zip packages for an installer I've had on the back burner for a while.
  11. I already have that superpower I once used lots of letters so that if you read the for loops top to bottom the letters spelt out my name and a message. I also once heard that wether you use "a" or "i" depends on if you came from a mathematical or engineering background. What's really stange (for me) is in C and PHP; I use "i". But in Pascal, and Python ; I use "a". I know that to a certain extent it is muscle memory since if I use "i" in Pascal, I nearly always leave out the colon before the equal sign. Maybe it's a coping mechanism because I switch between languages so much.
  12. There is DSMaxMem and DSMemStats which aren't much use. Do you have any info on DSMemStatsSlow and DSMemStats2?
  13. Did this today (and any other day I write C). for (int i=0; i < len; i++){ The big question is .. should it have been "a" instead of "i"?
  14. I think you answered your own question there and used the two term method that I described. This is exactly why I said:
  15. I don't think it's that hard. You just have to use two words, one of which describes the domain. Learning complexity, system, complexity, code complexity, network complexity et. al. They all adequately describe what's being talked about. I only had an issue with "accidental" complexity. When using non-domain terminology (like "accidental", "inherent" etc) it needs more defintion in the statement, for example "the inherent complexity of the code". The inherent complexity of the system, etc. This is mainly a grammatical problem rather than semantic.
  16. Thanks.It worked great but I don't think I'm going to go through the other 13 versions and installing it.
  17. Hmm. No 64 bit versions for 2009-2015. Thanks for the info.
  18. I've got it in 2019 but not in all the other versions. Is there a separate test install for each version?
  19. Potato, Potato Like i keep saying (and you agreed earlier) the Priority Queue is ordered PRIORITIES, not necessarily the elements (we disagree on this bit). The underlying implementation is irrelevant the name-it could even be a linked list.
  20. Moderator comment: Discussion started here. Nice. However this is mine.
  21. I don't think it does Cyclomatic Complexity Correct if I'm wrong because I rarely use it.
  22. Perhaps in the AF case. However it's also fairly common for the underlying implementation to be a stack (LIFO). That is effectively what the DQMH implementation is. Like "accidental"? You understimate the power of a marketing department, my friend
×
×
  • Create New...

Important Information

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