/// <summary>
/// 除去数组中的空值和签名参数并以字母a到z的顺序排序
/// </summary>
/// <param name="dicArrayPre">过滤前的参数组</param>
/// <returns>过滤后的参数组</returns>
public static Dictionary<string, string> FilterPara(SortedDictionary<string, string> dicArrayPre)
{
Dictionary<string, string> dicArray = new Dictionary<string, string>();
foreach (KeyValuePair<string, string> temp in dicArrayPre)
{
if (temp.Key.ToLower() != "sign" && temp.Key.ToLower() != "sign_type" && temp.Value != "" && temp.Value != null)
{
dicArray.Add(temp.Key, temp.Value);
}
} return dicArray;
}
        /// <summary>
/// 把数组所有元素,按照“参数=参数值”的模式用“&”字符拼接成字符串
/// </summary>
/// <param name="sArray">需要拼接的数组</param>
/// <returns>拼接完成以后的字符串</returns>
public static string CreateLinkString(Dictionary<string, string> dicArray)
{
StringBuilder prestr = new StringBuilder();
foreach (KeyValuePair<string, string> temp in dicArray)
{
prestr.Append(temp.Key + "=" + temp.Value + "&");
} //去掉最後一個&字符
int nLen = prestr.Length;
prestr.Remove(nLen - , ); return prestr.ToString();
}
        /// <summary>
/// 把数组所有元素,按照“参数=参数值”的模式用“&”字符拼接成字符串,并对参数值做urlencode
/// </summary>
/// <param name="sArray">需要拼接的数组</param>
/// <param name="code">字符编码</param>
/// <returns>拼接完成以后的字符串</returns>
public static string CreateLinkStringUrlencode(Dictionary<string, string> dicArray, Encoding code)
{
StringBuilder prestr = new StringBuilder();
foreach (KeyValuePair<string, string> temp in dicArray)
{
prestr.Append(temp.Key + "=" + HttpUtility.UrlEncode(temp.Value, code) + "&");
} //去掉最後一個&字符
int nLen = prestr.Length;
prestr.Remove(nLen - , ); return prestr.ToString();
}

C# get keys and values from List<KeyValuePair<string, string>

    private List<KeyValuePair<string, string>> KV_List = new List<KeyValuePair<string, string>>();
void initList()
{
KV_List.Add(new KeyValuePair<string, string>("qwer", "asdf"));
KV_List.Add(new KeyValuePair<string, string>("qwer", "ghjk"));
KV_List.Add(new KeyValuePair<string, string>("zxcv", "asdf"));
KV_List.Add(new KeyValuePair<string, string>("hjkl", "uiop"));
}
// #1: get all keys (remove Distinct() if you don't want it)
List<string> allKeys = (from kvp in KV_List select kvp.Key).Distinct().ToList();
// allKeys = { "qwer", "zxcv", "hjkl" } // #2: get values for a key
string key = "qwer";
List<string> values = (from kvp in KV_List where kvp.Key == key select kvp.Value).ToList();
// values = { "asdf", "ghjk" } // #3: get keys for a value
string value = "asdf";
List<string> keys = (from kvp in KV_List where kvp.Value == value select kvp.Key).ToList();
// keys = { "qwer", "zxcv" }

https://stackoverflow.com/questions/31414429/c-sharp-get-keys-and-values-from-listkeyvaluepairstring-string

How to insert an item into a key/value pair object?

List<KeyValuePair<string, string>> kvpList = new List<KeyValuePair<string, string>>()
{
new KeyValuePair<string, string>("Key1", "Value1"),
new KeyValuePair<string, string>("Key2", "Value2"),
new KeyValuePair<string, string>("Key3", "Value3"),
}; kvpList.Insert(, new KeyValuePair<string, string>("New Key 1", "New Value 1"));
foreach (KeyValuePair<string, string> kvp in kvpList)
{
Console.WriteLine(string.Format("Key: {0} Value: {1}", kvp.Key, kvp.Value);
}

最新文章

  1. springMVC基础controller类
  2. 常用ADC滤波处理
  3. Packets(模拟 POJ1017)
  4. jsonp实现原理详细介绍
  5. 最大化 AIX 上的 Java 性能,第 3 部分: 更多就是更好
  6. [leetcode]_Palindrome Number
  7. Photoshop:制作方块背景
  8. MYSQL基础笔记(一)
  9. Headfirst设计模式的C++实现——状态模式(State)
  10. ios 可变参数(va_list,va_start,va_end)
  11. poj 1949 Chores 最长路
  12. hdu1876(dp)
  13. 初识mongo
  14. 本教程针对HBuilder5.0.0,制作日期2014-12-31(从HBuilder工具上获得)
  15. “妄”眼欲穿之CSS 居中问题
  16. quartz整合spring框架service层对象注入为null解决方案
  17. c# usercontrol ,networkcomms3.0 Invoke总结
  18. hdu-1043(八数码+bfs打表+康托展开)
  19. 在 Centos7 的KVM上启用嵌套虚拟化
  20. MySql的数据分页的Sql

热门文章

  1. 烂泥:LVM学习之逻辑卷及卷组缩小空间
  2. 新手在sae部署程序容易忽略的一个细节
  3. 2.NopCommerce中文语言包
  4. JMS介绍入门大白话版
  5. USACO section1.2 Transformation
  6. 译文 对无障碍网页应用(ARIA)的选择
  7. hihocoder 1388 &amp;&amp;2016 ACM/ICPC Asia Regional Beijing Online Periodic Signal
  8. UVA 12266 Stock prices --优先队列
  9. 通过JDBC进行简单的增删改查
  10. ofbiz的部署及安装问题解决办法