zoukankan      html  css  js  c++  java
  • UT——case for quiz

            [Fact]
            //[Theory]
            //[InlineData(new string[] { "--count","10" })]
            public int ValidateTest()
            {
                // Console.WriteLine("Sample debug output");    
                string[] args = new string[] { "--name", "10" };
                if (args == null || !args.Any())
                {
                    return -1;
                }
                var nameValueIndex = -1;
                var countValueIndex = -1;
                int index = 0;
                bool ifHelp = false;
                foreach (var i in args)
                {
                    Console.WriteLine(index + ":" + i);
                    if (i.ToLower() == "--name")
                    {
                        nameValueIndex = index + 1;
                    }
                    if (i.ToLower() == "--count")
                    {
                        countValueIndex = index + 1;
                    }
                    if (i.ToLower() == "--help")
                    {
                        ifHelp = true;
                    }
                    index++;
                }
                if (nameValueIndex >= 0)
                {
                    Console.WriteLine("nameValueIndex:" + nameValueIndex);
                    if (nameValueIndex > args.Length - 1)
                    {
                        return -1;
                    }
                    var nameV = args.ElementAt(nameValueIndex);
                    int nameConvertV;
                    if (!int.TryParse(nameV, out nameConvertV))
                    {
                        if (nameV.Length < 3 || nameV.Length > 10)
                        {
                            return -1;
                        }
                    }
                }
                if (countValueIndex >= 0 )
                {
                    Console.WriteLine("countValueIndex:" + countValueIndex);
                    if (countValueIndex > args.Length - 1)
                    {
                        return -1;
                    }
                    var countV = args.ElementAt(countValueIndex);
                    int countConvertV ;
                    if (!int.TryParse(countV,out countConvertV))
                    {
                        return -1;
                    }
                    if(countConvertV<10 || countConvertV > 100)
                    {
                        return -1;
                    }
                }
                if(!ifHelp && countValueIndex<0 && nameValueIndex < 0)
                {
                    return -1;
                }
                if (ifHelp)
                {
                    if (args.Length > 1)
                    {
                        if(countValueIndex < 0 && nameValueIndex < 0)
                        {
                            return -1;
                        }
                    }
                    Console.WriteLine("ifHelp:" + ifHelp);
                    return 1;
                }
                return 0;
            }
    

      

  • 相关阅读:
    [COCI2013]DLAKAVAC
    [TJOI2013]最长上升子序列
    AGC040E Prefix Suffix Addition
    AGC010E Rearranging
    AGC021F Trinity
    AGC002F Leftmost Ball
    JOISC2019D ふたつのアンテナ
    LOJ6210 「美团 CodeM 决赛」tree
    Luogu P3781 [SDOI2017]切树游戏
    Problem. M
  • 原文地址:https://www.cnblogs.com/panpanwelcome/p/14759053.html
Copyright © 2011-2022 走看看