C#正则表达式

using System.Text.RegularExpressions;
using System;


class Validation
{
  public static void Main()
  {
    String strToTest;
    Validation objValidate=new Validation();

    Console.Write("Enter a String to Test for Alphabets:");
    strToTest=Console.ReadLine();
    if(objValidate.IsAlpha(strToTest))
    {
      Console.WriteLine("{0} is Valid Alpha String",strToTest);
    }
    else
    {
      Console.WriteLine("{0} is not a Valid Alpha String",strToTest);
    }
  }

  // Function to test for Positive Integers.

  public bool IsNaturalNumber(String strNumber)
  {
    Regex objNotNaturalPattern=new Regex("[^0-9]");
    Regex objNaturalPattern=new Regex("0*[1-9][0-9]*");

    return  !objNotNaturalPattern.IsMatch(strNumber) &&
            objNaturalPattern.IsMatch(strNumber);
  }

  // Function to test for Positive Integers with zero inclusive

    public bool IsWholeNumber(String strNumber)
    {
      Regex objNotWholePattern=new Regex("[^0-9]");

      return !objNotWholePattern.IsMatch(strNumber);
    }

  // Function to Test for Integers both Positive & Negative

    public bool IsInteger(String strNumber)
    {
      Regex objNotIntPattern=new Regex("[^0-9-]");
      Regex objIntPattern=new Regex("^-[0-9]+$|^[0-9]+$");

      return  !objNotIntPattern.IsMatch(strNumber) &&
              objIntPattern.IsMatch(strNumber);
    }

  // Function to Test for Positive Number both Integer & Real

  public bool IsPositiveNumber(String strNumber)
  {
    Regex objNotPositivePattern=new Regex("[^0-9.]");
    Regex objPositivePattern=new Regex("^[.][0-9]+$|[0-9]*[.]*[0-9]+$");
    Regex objTwoDotPattern=new Regex("[0-9]*[.][0-9]*[.][0-9]*");

    return !objNotPositivePattern.IsMatch(strNumber) &&
           objPositivePattern.IsMatch(strNumber)  &&
           !objTwoDotPattern.IsMatch(strNumber);
  }

  // Function to test whether the string is valid number or not
  public bool IsNumber(String strNumber)
  {
    Regex objNotNumberPattern=new Regex("[^0-9.-]");
    Regex objTwoDotPattern=new Regex("[0-9]*[.][0-9]*[.][0-9]*");
    Regex objTwoMinusPattern=new Regex("[0-9]*[-][0-9]*[-][0-9]*");
    String strValidRealPattern="^([-]|[.]|[-.]|[0-9])[0-9]*[.]*[0-9]+$";
    String strValidIntegerPattern="^([-]|[0-9])[0-9]*$";
    Regex objNumberPattern =new Regex("(" + strValidRealPattern +")|(" + strValidIntegerPattern + ")");

    return !objNotNumberPattern.IsMatch(strNumber) &&
           !objTwoDotPattern.IsMatch(strNumber) &&
           !objTwoMinusPattern.IsMatch(strNumber) &&
           objNumberPattern.IsMatch(strNumber);
  }

  // Function To test for Alphabets.

  public bool IsAlpha(String strToCheck)
  {
    Regex objAlphaPattern=new Regex("[^a-zA-Z]");

    return !objAlphaPattern.IsMatch(strToCheck);
  }

  // Function to Check for AlphaNumeric.

  public bool IsAlphaNumeric(String strToCheck)
  {
    Regex objAlphaNumericPattern=new Regex("[^a-zA-Z0-9]");

    return !objAlphaNumericPattern.IsMatch(strToCheck);   
  }


} 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值