Re^2: How to avoid eval()?

I didn't want to enter in too much detail and as they usually recommand not trusting eval(), I thought it would suffice.

The problem is that I loose the well ordering of my recursive set when calling my function through an eval() while it is kept when using a dedicated program to perform the same function.

In the past I went into much confusion for problems of this kind till I migrated my recursive functions to C.

Comment on Re^2: How to avoid eval()?

Replies are listed 'Best First'.
Re^3: How to avoid eval()? by moritz (Cardinal) on Sep 16, 2011 at 09:20 UTC
What you wrote doesn't make any sense (or maybe only in some context that is not apparent from this discussion thread) I don't see how using eval() would destroy any order, and there's no code to demonstrate it. Oh, and sets are unordered by definition. Perl 6 - second systems done right	[reply]
A reply falls below the community's threshold of quality. You may see it by logging in.
Re^3: How to avoid eval()? by Corion (Patriarch) on Sep 16, 2011 at 08:56 UTC
I highly doubt that you mean what you say when you use words like Well Ordering a Recursive Set. Maybe you really want to show us the relevant part of your code as a self-contained program. Please also do show what input data you give it and what output you get and what output you expect.	[reply]
Re^4: How to avoid eval()? by emilbarton (Scribe) on Sep 16, 2011 at 09:00 UTC
To be more precise I should have said : well ordering of a set made by recursion probably...	[reply]
A reply falls below the community's threshold of quality. You may see it by logging in.