zoukankan      html  css  js  c++  java
  • C# NameValueCollection

    一个简单的例子

    复制代码
                NameValueCollection markStatus = new NameValueCollection();
                string[] values = null;

                markStatus.Add("Very High", "80");
                markStatus.Add("High", "60");
                markStatus.Add("medium", "50");
                markStatus.Add("Pass", "40");

                foreach (string key in markStatus.Keys)
                {
                    values = markStatus.GetValues(key);
                    foreach (string value in values)
                    {
                        MessageBox.Show (key + " - " + value);
                    }
                } 
    复制代码

    微软网站上的例子

    using System;
    using System.Collections;
    using System.Collections.Specialized;

    public class SamplesNameValueCollection { public static void Main()  {

          // Creates and initializes a new NameValueCollection.
          NameValueCollection myCol = new NameValueCollection();
          myCol.Add( "red", "rojo" );
          myCol.Add( "green", "verde" );
          myCol.Add( "blue", "azul" );
          myCol.Add( "red", "rouge" );

          // Displays the values in the NameValueCollection in two different ways.
          Console.WriteLine( "Displays the elements using the AllKeys property and the Item (indexer) property:" );
          PrintKeysAndValues( myCol );
          Console.WriteLine( "Displays the elements using GetKey and Get:" );
          PrintKeysAndValues2( myCol );

          // Gets a value either by index or by key.
          Console.WriteLine( "Index 1 contains the value {0}.", myCol[1] );
          Console.WriteLine( "Key "red" has the value {0}.", myCol["red"] );
          Console.WriteLine();

          // Copies the values to a string array and displays the string array.
          String[] myStrArr = new String[myCol.Count];
          myCol.CopyTo( myStrArr, 0 );
          Console.WriteLine( "The string array contains:" );
          foreach ( String s in myStrArr )
             Console.WriteLine( "   {0}", s );
          Console.WriteLine();

          // Searches for a key and deletes it.
          myCol.Remove( "green" );
          Console.WriteLine( "The collection contains the following elements after removing "green":" );
          PrintKeysAndValues( myCol );

          // Clears the entire collection.
          myCol.Clear();
          Console.WriteLine( "The collection contains the following elements after it is cleared:" );
          PrintKeysAndValues( myCol );

       }

       public static void PrintKeysAndValues( NameValueCollection myCol )  {
          Console.WriteLine( "   KEY        VALUE" );
          foreach ( String s in myCol.AllKeys )
             Console.WriteLine( "   {0,-10} {1}", s, myCol[s] );
          Console.WriteLine();
       }

       public static void PrintKeysAndValues2( NameValueCollection myCol )  {
          Console.WriteLine( "   [INDEX] KEY        VALUE" );
          for ( int i = 0; i < myCol.Count; i++ )
             Console.WriteLine( "   [{0}]     {1,-10} {2}", i, myCol.GetKey(i), myCol.Get(i) );
          Console.WriteLine();
       }


    }

    /*

    This code produces the following output.

    Displays the elements using the AllKeys property and the Item (indexer) property:
       KEY        VALUE
       red        rojo,rouge
       green      verde
       blue       azul

    Displays the elements using GetKey and Get:
       [INDEX] KEY        VALUE
       [0]     red        rojo,rouge
       [1]     green      verde
       [2]     blue       azul

    Index 1 contains the value verde.
    Key "red" has the value rojo,rouge.

    The string array contains:
       rojo,rouge
       verde
       azul

    The collection contains the following elements after removing "green":
       KEY        VALUE
       red        rojo,rouge
       blue       azul

    The collection contains the following elements after it is cleared:
       KEY        VALUE


    */

    将权限管理、工作流管理做到我能力的极致,一个人只能做好那么很少的几件事情。
  • 相关阅读:
    LeetCode算法题-Binary Search(Java实现)
    LeetCode算法题-Kth Largest Element in a Stream(Java实现)
    LeetCode算法题-Search in a Binary Search Tree(Java实现)
    LeetCode算法题-Degree of an Array(Java实现)
    LeetCode算法题-Count Binary Substrings(Java实现)
    LeetCode算法题-Binary Number with Alternating Bits(Java实现)
    之前见汤姆大叔 写过一系列的 js 深入理解 呢 很是感觉经典
    xsd 和 wsdl
    发现 一个业务管理系统 解决了 orm 和 前端框架 剩下的 是 业务逻辑 了 。 哈
    uwp 嗯 我最近 准备开发一个 应用 。 嗯 走起
  • 原文地址:https://www.cnblogs.com/Alex80/p/6920873.html
Copyright © 2011-2022 走看看