On Sun, Mar 16, 2014, at 08:18 PM, Michael Haberler wrote: > > that assumes: 'copy value on first link ever'
That was by design. For example, lets assume that we change the PID gain pins to IN, so that they can be connected to any kind of widget. loadrt PID setp some initial value for gain net gain-sig pid.gain-pin <== widget-pin We want to retain the initial value of gain-pin so that the widget can read it. That is the syntax that would be used if the integrator wanted the default value to come from the setp (or from a compiled in value in PID, if he omits the setp). As an alternative, he could do: net gain-sig widget-pin ==> pid.gain-pin In that case, the widget would win - which would be appropriate if the integrator chooses to store his defaults in glade or some other form that feeds them to the widget. I would rather have the precedence be determined by the HAL file instead of having it compiled in, so the integrator gets to decide which way he prefers. > > a more robust interpretation would be: > > 'copy value on link to first pin which is HAL_OUT or HAL_IO' > > you could shuffle .hal lines (assuming a HAL_OUT, not HAL_IO) and still get > the same result > > not sure it's a valuable distinction, probably 'inherit value from first > linked pin in a .hal file' is the more easily remembered semantics > > - Michael > > > > ------------------------------------------------------------------------------ > Learn Graph Databases - Download FREE O'Reilly Book > "Graph Databases" is the definitive new guide to graph databases and their > applications. Written by three acclaimed leaders in the field, > this first edition is now available. Download your free book today! > http://p.sf.net/sfu/13534_NeoTech > _______________________________________________ > Emc-developers mailing list > [email protected] > https://lists.sourceforge.net/lists/listinfo/emc-developers -- John Kasunich [email protected] ------------------------------------------------------------------------------ Learn Graph Databases - Download FREE O'Reilly Book "Graph Databases" is the definitive new guide to graph databases and their applications. Written by three acclaimed leaders in the field, this first edition is now available. Download your free book today! http://p.sf.net/sfu/13534_NeoTech _______________________________________________ Emc-developers mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/emc-developers
