Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re^4: How to avoid eval()?

by emilbarton (Scribe)
on Sep 16, 2011 at 09:13 UTC ( [id://926360]=note: print w/replies, xml ) Need Help??


in reply to Re^3: How to avoid eval()?
in thread How to avoid eval()?

This node falls below the community's threshold of quality. You may see it by logging in.

Replies are listed 'Best First'.
Re^5: How to avoid eval()?
by Corion (Patriarch) on Sep 16, 2011 at 09:37 UTC

    Well ordering is a concept that is trivial when finite sets are involved. Invoking the term "well ordering" instead of just sorting implies needing theory and concepts that are rarely needed. You obviously don't need that theory, as you seem to want to implement sorting of a finite set. Every finite set has many relations that make it well-ordered, the most obvious one is the injection of the set into the set of natural numbers ("counting").

    If cleaning up your code is too much work for you, why do you expect us to wade through it or make guesses about where in your code you go wrong?

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://926360]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others lurking in the Monastery: (7)
As of 2024-03-19 02:32 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found