C#

private void tb_KeyPress(object sender, KeyPressEventArgs e)
{
    string regexstring = @"(\d+)|(\d*\.\d{1,2})";

    //Regex reg = new Regex("^[0-9]+.[0-9]*");
    Regex reg = new Regex(regexstring);
    //Regex reg = new Regex("(\d+)|(\d*\.\d{1,2})");
    //Regex reg = new Regex("^[A-Za-z]+\\w*");
    if (reg.IsMatch(Convert.ToString(e.KeyChar)))
    {
        e.Handled = false;
    }
    else
    {
            e.Handled = true;
    }
}

Pete O`Hanlon wrote:

Once it's sorted, use the List<>.BinarySearch to find the string. It really is fast - I've run tests with a 100,000 complex objects where it takes less than a millisecond to find a particular item. I know that this is not a particularly scientific test, but it does indicate that this is a really fast method.

Pete O`Hanlon wrote:

Now, what we need are the equivalents of the STL for .NET.

<br />
using CrystalDecisions.CrystalReports.Engine ;<br />
using CrystalDecisions.Shared ;<br />
using CrystalDecisions.Windows.Forms  ;<br />

<br />
CrystalDecisions.CrystalReports.Engine<br />
CrystalDecisions.ReportSource<br />
CrystalDecisions.Shared<br />
CrystalDecisions.Windows.Forms<br />

<br />
CrystalDecisions.CrystalReports.Engine.ReportDocument<br />
CrystalDecisions.Shared.ParameterField<br />