Jump to content

Jim Kring

Members
  • Posts

    3,905
  • Joined

  • Last visited

  • Days Won

    34

Posts posted by Jim Kring

  1. Sure - there's nothing new in dqGOOP, but it's a particularly eloquent implementation of it - and also a IMHO great place for those unfamiliar with OO to start understanding the concept.

    Sorry, I should have been more explicit. I was not trying to detract from dqGOOP -- I was just answering your question about whether OpenG, or anyone else, could legally use a similar implementation. IMO, a pure G GOOP implementation is best if it is open. Stay tuned, interesting things to come.

  2. Personally, I'm a big fan of GOOP using queues (I'd implemented my own version prior to the dqGOOP release, but the dq version is a lot cleaned than mine) - it's easy, fast and covers a lot of what I need to do (I'm certainly not a GOOP 'power' user). I'd sure welcome an openG version (is there any legal issues here? Can OpenG release an open under LGPL that's very similar to the dq version?)

    Does anyone have any ideas of what's under the LabVIEW OO engine (soon to be realeased)? Is it going to be queue based, or something else entirely?

    As you mentioned, dq was not the first to use queues for GOOP. And, the author has stated publically that it is a combination of ideas mentioned first elsewhere.

  3. Do you have the OpenG Toolkit installed? I believe there is a function that will give you a quick conversion. It's not a coercion dot, but it's pretty easy.

    Right, you will need to make the input a Variant, which anything will coerce to, and then extract the string value of the variant using the Get Strings From Enum function in the lvdata (LabVIEW Data Tools) package.

  4. Thanks Jim - I was unaware of this new feature in LV8. Does this mean there is no longer any reason to use a VIT?

    I can't think of any reasons to use the VIT technique. Personally, I did not like it, due to the requirement that the VIT cannot be in memory when it is instanciated. This means that you cannot statically link to it in your application, which makes dependency management in stand-alone application builds more complicated and error prone.

  5. I have not tried the .exe approach, but I am not optimistic. My classes are "active" classes (they are top-level and have a meaningful front panel), so use of re-entrant VIs is not an option.

    In LabVIEW 8.0, each instance of a reentrant VI has its own front panel and debuggable block diagram. These are referred to as "clones".

  6. I seem to be having a minor problem. When I did that Firefox reported that it could not find page <filename> and I noticed that the name ended in ht not htm. So I tried it again, except that the more help button does not even press now. Any ideas?

    Mike: I've seen this, too. I don't know whether to blame LabVIEW, FireFox, or Windows. The problem seems to come and go. Does it work for you in LabVIEW 8.0?

    This is pretty cool... :thumbup:

    For me personally, I'd leave out the Error in and out. We all know what they do and they just clutter up the documentation page. (Wish NI would do this too..) And maybe some nice headers for grouping inputs and outputs.

    Jeffrey: That's a great idea. Those error clusters take up a lot of valuable space. It might take a =bit of work to exclude these controls, since I am just delegating the task of generating the input/output control/indicator documentation to some built-in functions.

  7. Has anyone else noticed the degradation in VIT load time over LV7. I have a large application that starts a number of VITs as part of a class implementation for 10 power supplies. It takes an order of magnitude longer - less than a second under LV7 versus 10-15 seconds now. Has anyone heard of a workaround?

    Have you noticed a different between the development environment and the run-time engine (built EXE)? I think I noticed a significant improvement in built EXEs.

  8. I just checked with some of my colleagues in LabVIEW R&D and this is what I found:

    Static VI Reference issue: This is expected behavior. A Static VI Reference will not appear in the Callees' Names or Callees' Paths property list. This is because a Static VI Reference allows you to have a VI call itself recursively, and the Callees' properties do not support recursive VI calls. I have filed a CAR (3VJDFQF2) against the LabVIEW documentation so we can indicate this fact in the help for both the Static VI Reference and the Callees' properties.

    SubVI with Required Input issue: This is a bug, and I have filed a CAR (3VJDCQF2) on this issue as well.

    -D

    Talk about great customer support! Thanks, Darren. And, welcome to the LAVA forums. You get five stars for your first post. :star::star::star::star::star:

  9. The Special Characters for Match Pattern documentation states:

    If ^ is the first character of regular expression, it anchors the match to the offset in string. The match fails unless regular expression matches that topic of string that begins with the character at offset. If ^ is not the first character, it is treated as a regular character.

    What does "topic" mean in the above definition. I don't see any other reference to "topic" in the documentation. Does this relate to the algorithm used by the Match Pattern function? Is "topic" a subset of the string?

  10. Jim, I see you had yours on St. Patricks Day. Happy belated Birthday!

    I hope you had a great day and enjoyed the green Beer. :laugh:

    Thanks, Christian. I did have fun. My wife took me out to a nice french restaurant. I tried sweetbread, which was great until I found out that it wasn't sweet or bread.

  11. :star: Happy Birthday to Jim Kring who turns the big 30 today!! :star:

    We'd all like to thank Jim for his enormous contributions to the LabVIEW community including the founding of OpenG.

    Keep up the good work Jim and may you enjoy many more years of LabVIEW development time... :wub:

    Thanks, Michael. But actually I am only "e"teen years old (that's 0x1E, as I prefer to use the hexidecimal system for keeping track of my age ;) )

×
×
  • Create New...

Important Information

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