Mail Archives: geda-user/2012/11/01/17:34:33
Markus Hitter:
> Am 01.11.2012 15:31, schrieb Karl Hammar:
> > Kai-Martin Knaak:
> >> The break condition would need to be implemented. Until it is, you'd be
> >> stuck in an endless loop.
> >
> > There is always the hw limit. If people wants endless loops let them
> > have it. You cannot outlaw stupidity, but forbiddning useful things
> > because of stupidity is not nice to the nice guys.
>
> Please don't forget those being reasonably intelligent, still building a
> recursion accidentally. Grinding the user's whole system to a halt with
> exhaused memory due to a typo won't make you and gEDA friends.
>
> IMHO, there should be at least an recursion counter, like max. 100
> recursions.
Fine with me.
> Still I can't see how "real" recursions can work. Real recursions would
> require to change the recursed item somehow and testing this change to
> reach a limit. So, the recursion should break as soon as the same
> symbol/schematics is detected a second time in the recursion loop.
I don't think "real" recursion in the sense that a symbol loads
itself recuresivly would have any value, but who knows.
I'm more interested in being able to make a subcircuit from symbols,
and the subcircuit can be assembled into new subcircuits and so on.
We can do so in a way today but loading symbols from symbols is not
officially supported and it would also be useful to pass along some
parameters to the subcircuit.
Some simple examples:
. one could have a led and resistor, and given the applied voltage to
the subcircuit it would calc it's resistor value,
. a low pass filter circuit with cutoff freq. as a parameter
Regards,
/Karl Hammar
-----------------------------------------------------------------------
Aspö Data
Lilla Aspö 148
S-742 94 Östhammar
Sweden
+46 173 140 57
- Raw text -