Arrays.cs 1.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4. namespace SharpCifs.Util.Sharpen
  5. {
  6. public class Arrays
  7. {
  8. public static List<T> AsList<T>(params T[] array)
  9. {
  10. return array.ToList();
  11. }
  12. public static bool Equals<T>(T[] a1, T[] a2)
  13. {
  14. if (a1.Length != a2.Length)
  15. {
  16. return false;
  17. }
  18. return !a1.Where((t, i) => !t.Equals(a2[i])).Any();
  19. }
  20. public static void Fill<T>(T[] array, T val)
  21. {
  22. Fill(array, 0, array.Length, val);
  23. }
  24. public static void Fill<T>(T[] array, int start, int end, T val)
  25. {
  26. for (int i = start; i < end; i++)
  27. {
  28. array[i] = val;
  29. }
  30. }
  31. public static void Sort(string[] array)
  32. {
  33. Array.Sort(array, (s1, s2) => string.CompareOrdinal(s1, s2));
  34. }
  35. public static void Sort<T>(T[] array)
  36. {
  37. Array.Sort(array);
  38. }
  39. public static void Sort<T>(T[] array, IComparer<T> c)
  40. {
  41. Array.Sort(array, c);
  42. }
  43. public static void Sort<T>(T[] array, int start, int count)
  44. {
  45. Array.Sort(array, start, count);
  46. }
  47. public static void Sort<T>(T[] array, int start, int count, IComparer<T> c)
  48. {
  49. Array.Sort(array, start, count, c);
  50. }
  51. }
  52. }