Mercurial > hg > ucis.core
annotate Util/ArrayUtil.cs @ 56:7c15c12ef965
Added new ArrayUtil.ToArray functions
| author | Ivo Smits <Ivo@UCIS.nl> |
|---|---|
| date | Wed, 09 Oct 2013 13:56:35 +0200 |
| parents | f553f6e0a396 |
| children | 4714531734b3 |
| rev | line source |
|---|---|
| 0 | 1 ???using System; |
|
56
7c15c12ef965
Added new ArrayUtil.ToArray functions
Ivo Smits <Ivo@UCIS.nl>
parents:
48
diff
changeset
|
2 using System.Collections; |
| 0 | 3 using System.Collections.Generic; |
| 4 | |
| 5 namespace UCIS.Util { | |
| 6 public class ArrayUtil { | |
| 7 public static T[] Slice<T>(T[] input, int offset) { | |
| 8 if (offset < 0) offset = input.Length + offset; | |
| 9 return Slice(input, offset, input.Length - offset); | |
| 10 } | |
| 11 public static T[] Slice<T>(T[] input, int offset, int count) { | |
| 12 if (offset < 0) offset = input.Length + offset; | |
| 13 if (count < 0) count = input.Length + count - offset; | |
| 14 T[] output = new T[count]; | |
| 15 Array.Copy(input, offset, output, 0, count); | |
| 16 return output; | |
| 17 } | |
|
56
7c15c12ef965
Added new ArrayUtil.ToArray functions
Ivo Smits <Ivo@UCIS.nl>
parents:
48
diff
changeset
|
18 public static Object[] ToArray(ICollection input) { |
|
7c15c12ef965
Added new ArrayUtil.ToArray functions
Ivo Smits <Ivo@UCIS.nl>
parents:
48
diff
changeset
|
19 Object[] output = new Object[input.Count]; |
|
7c15c12ef965
Added new ArrayUtil.ToArray functions
Ivo Smits <Ivo@UCIS.nl>
parents:
48
diff
changeset
|
20 input.CopyTo(output, 0); |
|
7c15c12ef965
Added new ArrayUtil.ToArray functions
Ivo Smits <Ivo@UCIS.nl>
parents:
48
diff
changeset
|
21 return output; |
|
7c15c12ef965
Added new ArrayUtil.ToArray functions
Ivo Smits <Ivo@UCIS.nl>
parents:
48
diff
changeset
|
22 } |
|
7c15c12ef965
Added new ArrayUtil.ToArray functions
Ivo Smits <Ivo@UCIS.nl>
parents:
48
diff
changeset
|
23 public static T[] ToArray<T>(ICollection input) { |
|
7c15c12ef965
Added new ArrayUtil.ToArray functions
Ivo Smits <Ivo@UCIS.nl>
parents:
48
diff
changeset
|
24 T[] output = new T[input.Count]; |
|
7c15c12ef965
Added new ArrayUtil.ToArray functions
Ivo Smits <Ivo@UCIS.nl>
parents:
48
diff
changeset
|
25 input.CopyTo(output, 0); |
|
7c15c12ef965
Added new ArrayUtil.ToArray functions
Ivo Smits <Ivo@UCIS.nl>
parents:
48
diff
changeset
|
26 return output; |
|
7c15c12ef965
Added new ArrayUtil.ToArray functions
Ivo Smits <Ivo@UCIS.nl>
parents:
48
diff
changeset
|
27 } |
| 0 | 28 public static T[] ToArray<T>(ICollection<T> input) { |
| 29 T[] output = new T[input.Count]; | |
| 30 input.CopyTo(output, 0); | |
| 31 return output; | |
| 32 } | |
| 9 | 33 public static T[] ToArray<T>(ArraySegment<T> input) { |
| 34 return Slice(input.Array, input.Offset, input.Count); | |
| 35 } | |
|
43
29cf42a12c34
Added convenience functions in NaCl API and ArrayUtils
Ivo Smits <Ivo@UCIS.nl>
parents:
19
diff
changeset
|
36 public static T[] ToArray<T>(T[] input) { |
|
29cf42a12c34
Added convenience functions in NaCl API and ArrayUtils
Ivo Smits <Ivo@UCIS.nl>
parents:
19
diff
changeset
|
37 return (T[])input.Clone(); |
|
29cf42a12c34
Added convenience functions in NaCl API and ArrayUtils
Ivo Smits <Ivo@UCIS.nl>
parents:
19
diff
changeset
|
38 } |
| 0 | 39 public static IList<T> ToList<T>(IEnumerable<T> input) { |
| 40 return new List<T>(input); | |
| 41 } | |
| 42 public static void GnomeSort<T>(IList<T> a, Comparison<T> comparer) { | |
| 43 int pos = 1; | |
| 44 while (pos < a.Count) { | |
| 45 if (comparer(a[pos], a[pos - 1]) >= 0) { | |
| 46 pos++; | |
| 47 } else { | |
| 48 T tmp = a[pos]; | |
| 49 a[pos] = a[pos - 1]; | |
| 50 a[pos - 1] = tmp; | |
| 51 if (pos > 1) pos--; else pos++; | |
| 52 } | |
| 53 } | |
| 54 } | |
| 55 //Array shuffle | |
| 56 //Array unique | |
| 57 public static T[] Merge<T>(params ArraySegment<T>[] parts) { | |
| 58 int count = 0; | |
| 59 foreach (ArraySegment<T> segment in parts) count += segment.Count; | |
| 60 T[] ret = new T[count]; | |
| 61 int offset = 0; | |
| 62 foreach (ArraySegment<T> segment in parts) { | |
| 63 Array.Copy(segment.Array, segment.Offset, ret, offset, segment.Count); | |
| 64 offset += segment.Count; | |
| 65 } | |
| 66 return ret; | |
| 67 } | |
| 68 public static T[] Merge<T>(params T[][] parts) { | |
| 69 int count = 0; | |
| 70 foreach (T[] segment in parts) count += segment.Length; | |
| 71 T[] ret = new T[count]; | |
| 72 int offset = 0; | |
| 73 foreach (T[] segment in parts) { | |
| 74 segment.CopyTo(ret, offset); | |
| 75 offset += segment.Length; | |
| 76 } | |
| 77 return ret; | |
| 78 } | |
|
48
f553f6e0a396
ArrayUtil: added Merge function to merge ILists
Ivo Smits <Ivo@UCIS.nl>
parents:
43
diff
changeset
|
79 public static T[] Merge<T>(params IList<T>[] parts) { |
|
f553f6e0a396
ArrayUtil: added Merge function to merge ILists
Ivo Smits <Ivo@UCIS.nl>
parents:
43
diff
changeset
|
80 int count = 0; |
|
f553f6e0a396
ArrayUtil: added Merge function to merge ILists
Ivo Smits <Ivo@UCIS.nl>
parents:
43
diff
changeset
|
81 foreach (IList<T> segment in parts) count += segment.Count; |
|
f553f6e0a396
ArrayUtil: added Merge function to merge ILists
Ivo Smits <Ivo@UCIS.nl>
parents:
43
diff
changeset
|
82 T[] ret = new T[count]; |
|
f553f6e0a396
ArrayUtil: added Merge function to merge ILists
Ivo Smits <Ivo@UCIS.nl>
parents:
43
diff
changeset
|
83 int offset = 0; |
|
f553f6e0a396
ArrayUtil: added Merge function to merge ILists
Ivo Smits <Ivo@UCIS.nl>
parents:
43
diff
changeset
|
84 foreach (IList<T> segment in parts) { |
|
f553f6e0a396
ArrayUtil: added Merge function to merge ILists
Ivo Smits <Ivo@UCIS.nl>
parents:
43
diff
changeset
|
85 segment.CopyTo(ret, offset); |
|
f553f6e0a396
ArrayUtil: added Merge function to merge ILists
Ivo Smits <Ivo@UCIS.nl>
parents:
43
diff
changeset
|
86 offset += segment.Count; |
|
f553f6e0a396
ArrayUtil: added Merge function to merge ILists
Ivo Smits <Ivo@UCIS.nl>
parents:
43
diff
changeset
|
87 } |
|
f553f6e0a396
ArrayUtil: added Merge function to merge ILists
Ivo Smits <Ivo@UCIS.nl>
parents:
43
diff
changeset
|
88 return ret; |
|
f553f6e0a396
ArrayUtil: added Merge function to merge ILists
Ivo Smits <Ivo@UCIS.nl>
parents:
43
diff
changeset
|
89 } |
| 0 | 90 public static Boolean Equal<T>(T[] a, T[] b, IEqualityComparer<T> comparer) { |
| 91 if (ReferenceEquals(a, b)) return true; | |
| 92 if (a == null || b == null) return false; | |
| 93 if (a.Length != b.Length) return false; | |
| 94 for (int i = 0; i < a.Length; i++) if (!comparer.Equals(a[i], b[i])) return false; | |
| 95 return true; | |
| 96 } | |
| 97 public static Boolean Equal<T>(T[] a, T[] b) where T : IEquatable<Byte> { | |
| 98 if (ReferenceEquals(a, b)) return true; | |
| 99 if (a == null || b == null) return false; | |
| 100 if (a.Length != b.Length) return false; | |
| 101 for (int i = 0; i < a.Length; i++) { | |
| 102 if (ReferenceEquals(a[i], b[i])) continue; | |
| 103 if (ReferenceEquals(a[i], null) || ReferenceEquals(b[i], null)) continue; | |
| 104 if (!a[i].Equals(b[i])) return false; | |
| 105 } | |
| 106 return true; | |
| 107 } | |
| 108 public static Boolean Equal(Byte[] a, Byte[] b) { | |
| 109 if (ReferenceEquals(a, b)) return true; | |
| 110 if (a == null || b == null) return false; | |
| 111 if (a.Length != b.Length) return false; | |
| 112 for (int i = 0; i < a.Length; i++) if (a[i] != b[i]) return false; | |
| 113 return true; | |
| 114 } | |
|
1
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
115 public static int GetHashCode<T>(T[] array) { |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
116 int h = 0; |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
117 foreach (T v in array) h ^= v.GetHashCode(); |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
118 return h; |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
119 } |
| 19 | 120 public static void Add<T>(ref T[] array, params T[] items) { |
| 121 if (array == null) { | |
| 122 array = new T[items.Length]; | |
| 123 items.CopyTo(array, 0); | |
| 124 } else { | |
| 125 int index = array.Length; | |
| 126 Array.Resize(ref array, index + items.Length); | |
| 127 items.CopyTo(array, index); | |
| 128 } | |
| 129 } | |
| 130 public static void Add<T>(ref T[] array, ICollection<T> items) { | |
| 131 if (array == null) { | |
| 132 array = new T[items.Count]; | |
| 133 items.CopyTo(array, 0); | |
| 134 } else { | |
| 135 int index = array.Length; | |
| 136 Array.Resize(ref array, index + items.Count); | |
| 137 items.CopyTo(array, index); | |
| 138 } | |
| 139 } | |
|
1
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
140 public static void Add<T>(ref T[] array, T item) { |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
141 if (array == null) { |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
142 array = new T[] { item }; |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
143 } else { |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
144 int index = array.Length; |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
145 Array.Resize(ref array, index + 1); |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
146 array[index] = item; |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
147 } |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
148 } |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
149 public static void AddUnique<T>(ref T[] array, T item) { |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
150 if (Array.IndexOf(array, item) != -1) return; |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
151 Add(ref array, item); |
|
28dc7d535036
Small improvements, introduced PacketStream
Ivo Smits <Ivo@UCIS.nl>
parents:
0
diff
changeset
|
152 } |
| 0 | 153 } |
| 154 } |