Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re^4: On Quality (0,1,N)

by Aristotle (Chancellor)
on Feb 24, 2006 at 08:40 UTC ( [id://532490]=note: print w/replies, xml ) Need Help??


in reply to Re^3: On Quality (0,1,N)
in thread On Quality

Ah. That is a lot more concrete than the idea I had in mind, though on reflection, it is the same principle.

This particular thing is something I’ve been doing instinctively – f.ex. one of the reasons to prefer dynamic, garbage-collected languages is that they tend to make this much easier, whereas in something like C, it’s generally a lot less work to pick arbitrary limits. But I hadn’t thought about it in such concrete terms, and I agree that the concreteness is useful.

Thanks for the explanation.

Makeshifts last the longest.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others rifling through the Monastery: (3)
As of 2024-04-24 13:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found