Congratulations to the last person who voted this simple request down. I've had it with the trolls, votebots, and general decline of civilization of PM. I'm outta here.

Updated: Apparently, some people are dim enough to think this is a 'do my homework' type node. It's not. It's code for a future PM-related utility. I'm looking for a little help for something I'd rather not write if it already exists. I think it's called 'Not Reinventing The Wheel'.

I'm looking for some code that will do multi-base number verification. Here's the criteria:

• A value passed in will have no leading, trailing or embedded spaces.
• A base qualifier may have a leading '0x' to indicate hex, a trailing 'h' (upper or lower case) to indicate hex, a trailing 'o' (letter, upper or lower case) to indicate octal, or a possible trailing 't' (upper or lower case) to indicate decimal.
• Numbers with no base qualifiers may be presumed to be decimal.
• Scientific notation is a valid format, i.e. 14E+12 (the 'E' can be upper or lower case).
• 0xffffh is not valid as a hex number, since it contains two qualifiers.
• Hex and octal numbers may not contain decimal points.
• The routine should return a flag indicating if the passed value was a syntactically valid number according to the rules, the base of the detected number, and the value of the number.
• Must run under Perl 5.005 or higher. No 5.6.1+ specific solutions are acceptable.

Ideally, some large esoteric module should not be required. For instance, Parse::RecDescent with a grammar for number parsing is a sub-optimal solution.

I don't really care if it's an elaborate (fool-proof) regexp, a state machine, or pirated-and-ported VB code, as long it's solid.

Anyone got one of these handy, or want to golf one?