Norm Kirchner

QUOTE(bono02 @ Nov 20 2007, 08:38 AM) The reason for the 4x of the # of pulses is due the the fact that there are actually 4 digital edges present w/ every 1 full notch. A-up B-up A-down B-down (forward rotation) and since the encoder decoder is smart enough, It can figure out accuracy x4 of the number of notches in your encoder wheel

This is so much better http://www.youtube.c...h?v=TtJRNyPK-lc http://www.youtube.com/watch?v=TtJRNyPK-lc GIRLY MAAAAAAAAAN

Two Big Thumbs Up from The Captain :thumbup: :thumbup:

Good grief. I must be really off my game. For the record. No, I didn't see that method, and yes that is what I needed. ~,~ The Captain was only here in body, his mind is elsewhere

I have a tree that only has 2 genereations, top level parent items and their children (will never change) I am attempting to sort by column, and I've got it figured out how the children need to be re-arranged, but I am not seeing an easy way to re-arrange the children. and deleting and re-inserting is not an option because of the variety of properties associated with a specific element. Does anyone know how to programatically move an item in a tree? So I found how to move an item in a tree programatically, and that's what all the strikeout is above. {found 6.45 seconds after hitting submit post}. But in the spirit of sharing, I'll post my code for the "tree - sort-by-column" code here once done.

My plan b implementation of this was always intended to be through the use of disk access which would solve the problem. I fell back on the variant due to it's simplicity and my lack of need for high count data sets. Let me look through your code and see how this may work

Just a quick diversion. ~,~ The Captain

QUOTE(Norm Kirchner @ Nov 12 2007, 11:22 PM) That link is dead, here is a good link

Actually, NI beat you to it. I have to say that I'm flabbergasted that NI has had this available and never wrapped it up for us, nor have I seen anyone else wrap it up. Is it dangerous to use? ....just flabbergasted. KIWI POWER!

I have always supported not using the display of the tree to store the data, rather, storing the data in a separate source and merely using the tree as a tool to display that data when needed, which goes in-line w/ what you are trying to do. W/ the implementation that I'm working with though, you would still use the tree "assist" in storing the data, but only really format the tree when needed. Maybe this code snibbit will help show what I mean when I say "assist" I would still recommend using the tree to help maintain the relationships because doing this in the external structure may prove dicey. {hence the reason I went this route}

Something just smacked me right in the face w/ regards to inplaceness and memory structures and variant attributes. I'm assuming that if you try to store data in the Variant DB that the compiler can never figure out if you are doing in-place operations/modifications of an already existing attribute. Does anyone have feedback on that? The reason being, is that I have created some modifications to the TreeAPI that allows you to embed data with a specific tag and have it travel around w/ it. The problem at the moment is that I store the data in a Variant DB. I'll post the code to the CR discussion board soon.

Kiwi HAHAHAOAHOAHOAHOAHOAHOAHOAHAOHA ~,~

I haven't seen one yet, but boy oh boy it feels good to know there is going to be someone else out there that I can warn/complain to. We've been using it and I've been acting as admin and w/ the new version we've had nothing but trouble. NI is actively working w/ us on it, so big thanks to them, but we're still having issues. What is the specific thing that you're wondering/hoping to tell about it? how many licenses. Did you know that you can"t turn off the debug log in the 2.1 version. Have Fun ~,~

W/out exact testing, I would have to say definitely that this is an exact example for the use of the In-Place memory structure. The reason that the copies are made is because you have branched your cluster really. There is still a copy of it in the main/owning cluster and the other one that you have pulled out. 2 separate instances of the data 2 wires 2 copies in memory.

Sounds like a nice mini challenge. Be the first to create the all inclusive "Size control to size" tool. We'll judge it by the max# of things that is resizes.

QUOTE(Jim Kring @ Nov 12 2007, 11:24 AM) Just nosed into my code, and realized that there is no direct way to do this because of the lack of a single "writeable" property that can change size. Has OpenG created a tool that will allow for a single input of a class reference and a size and it will correctly call the property to resize the object? ~,~

Wow! Talk about one of those times that my feet are terribly greatful. They are currently wriggling around under my desk doing a jig since realizing they are saved from the pain of a bullet passing through them.

QUOTE(Justin Goeres @ Nov 7 2007, 10:12 AM) Justin, could you post a quick video of your Imagemagic library in work (JingProject.com) I've once tried to install, but can't recall what it was, but there was a big hurdle involved in getting it working. I would just love to see your example of the power of it in action.

QUOTE(i2dx2 @ Nov 11 2007, 08:57 PM) HAHAHAHAHAHAHAH You make me Laugh!!!!! HAHAHA We should forward that message onto Dr. T over @ NI. HAHAHAHAHHAHA focusing on improving what is important instead of just making new parts hahahahahaha No, we should not focus on the CR or the WIKI, no , let's add a video chat room, and then we'll add a 3d LAVA relm linked to second life, then we'll make it a new version of LAVA like LAVA 5.0 then LAVA 6.i in a year, then LAVA 7 extreme with deathmatch coding challenges. WE MUST NOT JUST SIT BACK AND IMPROVE, WE MUST SPEND ALL RESOURCES ON MAKING NEW STUFF THATS BUGGY!!!! AND THEN..... THE WORLD!!!! </Rant>

Here here! I've encountered this more than a few times and ended up making a Brat VI to handle the management of this. I would much rather have the "control resize to tab" be integrated into the environment.

bono, depending on what your cost constraints are, and since time is short, and since you're new to LV, and since you're going to be getting into Real-Time hardware. I would strongly recommend finding an alliance partner in your area to help you get started on this. To give you a framework, a background and some idea how to properly code this up. RT is not a simple task to program properly, especially with the motion control, and w/ the expectation of accuracy and precision. I don't know how much you figured you could learn and implement in a short time, but it looks like you might be over your head. Your project seems really interesting and my true intent is to help you succeed, not be mean. Time to call in the Marines.

I'm a little confused where this would be needed in a program? You're description is a little fuzzy. A child VI like this that controls the parent VI is called a "Brat VI" (wiki entry in the works, but do a LAVA search) I am in the midst of creating a similar program but it will allow you, through the use of hot-keys to pause, break open the BD, remove modality, and more. I'll try to get it posted out soon, but definetly look into what I have already posted for Brat VIs. Good idea, but needs some work on implementation.

QUOTE(Aristos Queue @ Oct 14 2007, 04:44 PM) AQ, What I was asking regarding not the use of just a class, but something more complex, like a cluster. So my comment about needing compare aggregate is still valid.

Idon'tthinkthatthereisanyissuewiththeforumandyouallshouldstopcomplaining.andnowontoannewtopicasyoucou dtellbythebreakthatwasplacedpefectlywithinthepost.

well now you've just totally messed up the flow of the thing