ListExtensions.cs 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224
  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. namespace Ips.Library.Basic
  5. {
  6. public static class ListExtensions
  7. {
  8. public static void InsertRange<T>(this IList<T> source, int index, IEnumerable<T> items)
  9. {
  10. foreach (var item in items)
  11. {
  12. source.Insert(index++, item);
  13. }
  14. }
  15. public static int FindIndex<T>(this IList<T> source, Predicate<T> selector)
  16. {
  17. for (var i = 0; i < source.Count; ++i)
  18. {
  19. if (selector(source[i]))
  20. {
  21. return i;
  22. }
  23. }
  24. return -1;
  25. }
  26. public static void AddFirst<T>(this IList<T> source, T item)
  27. {
  28. source.Insert(0, item);
  29. }
  30. public static void AddLast<T>(this IList<T> source, T item)
  31. {
  32. source.Insert(source.Count, item);
  33. }
  34. public static void InsertAfter<T>(this IList<T> source, T existingItem, T item)
  35. {
  36. var index = source.IndexOf(existingItem);
  37. if (index < 0)
  38. {
  39. source.AddFirst(item);
  40. return;
  41. }
  42. source.Insert(index + 1, item);
  43. }
  44. public static void InsertAfter<T>(this IList<T> source, Predicate<T> selector, T item)
  45. {
  46. var index = source.FindIndex(selector);
  47. if (index < 0)
  48. {
  49. source.AddFirst(item);
  50. return;
  51. }
  52. source.Insert(index + 1, item);
  53. }
  54. public static void InsertBefore<T>(this IList<T> source, T existingItem, T item)
  55. {
  56. var index = source.IndexOf(existingItem);
  57. if (index < 0)
  58. {
  59. source.AddLast(item);
  60. return;
  61. }
  62. source.Insert(index, item);
  63. }
  64. public static void InsertBefore<T>(this IList<T> source, Predicate<T> selector, T item)
  65. {
  66. var index = source.FindIndex(selector);
  67. if (index < 0)
  68. {
  69. source.AddLast(item);
  70. return;
  71. }
  72. source.Insert(index, item);
  73. }
  74. public static void ReplaceWhile<T>(this IList<T> source, Predicate<T> selector, T item)
  75. {
  76. for (int i = 0; i < source.Count; i++)
  77. {
  78. if (selector(source[i]))
  79. {
  80. source[i] = item;
  81. }
  82. }
  83. }
  84. public static void ReplaceWhile<T>(this IList<T> source, Predicate<T> selector, Func<T, T> itemFactory)
  85. {
  86. for (int i = 0; i < source.Count; i++)
  87. {
  88. var item = source[i];
  89. if (selector(item))
  90. {
  91. source[i] = itemFactory(item);
  92. }
  93. }
  94. }
  95. public static void ReplaceOne<T>(this IList<T> source, Predicate<T> selector, T item)
  96. {
  97. for (int i = 0; i < source.Count; i++)
  98. {
  99. if (selector(source[i]))
  100. {
  101. source[i] = item;
  102. return;
  103. }
  104. }
  105. }
  106. public static void ReplaceOne<T>(this IList<T> source, Predicate<T> selector, Func<T, T> itemFactory)
  107. {
  108. for (int i = 0; i < source.Count; i++)
  109. {
  110. var item = source[i];
  111. if (selector(item))
  112. {
  113. source[i] = itemFactory(item);
  114. return;
  115. }
  116. }
  117. }
  118. public static void ReplaceOne<T>(this IList<T> source, T item, T replaceWith)
  119. {
  120. for (int i = 0; i < source.Count; i++)
  121. {
  122. if (Comparer<T>.Default.Compare(source[i], item) == 0)
  123. {
  124. source[i] = replaceWith;
  125. return;
  126. }
  127. }
  128. }
  129. public static void MoveItem<T>(this List<T> source, Predicate<T> selector, int targetIndex)
  130. {
  131. var currentIndex = source.FindIndex(0, selector);
  132. if (currentIndex == targetIndex)
  133. {
  134. return;
  135. }
  136. var item = source[currentIndex];
  137. source.RemoveAt(currentIndex);
  138. source.Insert(targetIndex, item);
  139. }
  140. public static T GetOrAdd<T>(this IList<T> source, Func<T, bool> selector, Func<T> factory)
  141. {
  142. var item = source.FirstOrDefault(selector);
  143. if (item == null)
  144. {
  145. item = factory();
  146. source.Add(item);
  147. }
  148. return item;
  149. }
  150. public static List<T> SortByDependencies<T>(
  151. this IEnumerable<T> source,
  152. Func<T, IEnumerable<T>> getDependencies,
  153. IEqualityComparer<T> comparer = null)
  154. {
  155. var sorted = new List<T>();
  156. var visited = new Dictionary<T, bool>(comparer);
  157. foreach (var item in source)
  158. {
  159. SortByDependenciesVisit(item, getDependencies, sorted, visited);
  160. }
  161. return sorted;
  162. }
  163. private static void SortByDependenciesVisit<T>(T item, Func<T, IEnumerable<T>> getDependencies, List<T> sorted,
  164. Dictionary<T, bool> visited)
  165. {
  166. bool inProcess;
  167. var alreadyVisited = visited.TryGetValue(item, out inProcess);
  168. if (alreadyVisited)
  169. {
  170. if (inProcess)
  171. {
  172. throw new ArgumentException("Cyclic dependency found! Item: " + item);
  173. }
  174. }
  175. else
  176. {
  177. visited[item] = true;
  178. var dependencies = getDependencies(item);
  179. if (dependencies != null)
  180. {
  181. foreach (var dependency in dependencies)
  182. {
  183. SortByDependenciesVisit(dependency, getDependencies, sorted, visited);
  184. }
  185. }
  186. visited[item] = false;
  187. sorted.Add(item);
  188. }
  189. }
  190. }
  191. }