|
| 1 | +namespace FastCloner.Benchmark.Ideas.Clone2DimArray; |
| 2 | + |
| 3 | +internal static class Clone2DimArrayIdeaMethods |
| 4 | +{ |
| 5 | + // Lifted from the original Clone2DimArrayInternal shallow-copy flow. |
| 6 | + internal static T[,] OriginalShallow<T>(T[,] objFrom, T[,] objTo) |
| 7 | + { |
| 8 | + if (objFrom.GetLowerBound(0) != 0 || objFrom.GetLowerBound(1) != 0 |
| 9 | + || objTo.GetLowerBound(0) != 0 || objTo.GetLowerBound(1) != 0) |
| 10 | + return (T[,])CloneAbstractArrayShallow(objFrom, objTo)!; |
| 11 | + |
| 12 | + int l1 = Math.Min(objFrom.GetLength(0), objTo.GetLength(0)); |
| 13 | + int l2 = Math.Min(objFrom.GetLength(1), objTo.GetLength(1)); |
| 14 | + |
| 15 | + if (objFrom.GetLength(0) == objTo.GetLength(0) |
| 16 | + && objFrom.GetLength(1) == objTo.GetLength(1)) |
| 17 | + { |
| 18 | + Array.Copy(objFrom, objTo, objFrom.Length); |
| 19 | + return objTo; |
| 20 | + } |
| 21 | + |
| 22 | + for (int i = 0; i < l1; i++) |
| 23 | + for (int k = 0; k < l2; k++) |
| 24 | + objTo[i, k] = objFrom[i, k]; |
| 25 | + |
| 26 | + return objTo; |
| 27 | + } |
| 28 | + |
| 29 | + // Lifted from the edited Clone2DimArrayInternal shallow-copy flow. |
| 30 | + internal static T[,] EditedShallow<T>(T[,] objFrom, T[,] objTo) |
| 31 | + { |
| 32 | + int fromLower0 = objFrom.GetLowerBound(0); |
| 33 | + int fromLower1 = objFrom.GetLowerBound(1); |
| 34 | + int toLower0 = objTo.GetLowerBound(0); |
| 35 | + int toLower1 = objTo.GetLowerBound(1); |
| 36 | + if (fromLower0 != 0 || fromLower1 != 0 || toLower0 != 0 || toLower1 != 0) |
| 37 | + return (T[,])CloneAbstractArrayShallow(objFrom, objTo)!; |
| 38 | + |
| 39 | + int fromLength0 = objFrom.GetLength(0); |
| 40 | + int fromLength1 = objFrom.GetLength(1); |
| 41 | + int toLength0 = objTo.GetLength(0); |
| 42 | + int toLength1 = objTo.GetLength(1); |
| 43 | + |
| 44 | + int l1 = Math.Min(fromLength0, toLength0); |
| 45 | + |
| 46 | + // Row-major locality optimization: when row width matches, copy contiguous |
| 47 | + // row prefix in one block. |
| 48 | + if (fromLength1 == toLength1) |
| 49 | + { |
| 50 | + Array.Copy(objFrom, objTo, l1 * fromLength1); |
| 51 | + return objTo; |
| 52 | + } |
| 53 | + |
| 54 | + int l2 = Math.Min(fromLength1, toLength1); |
| 55 | + for (int i = 0; i < l1; i++) |
| 56 | + for (int k = 0; k < l2; k++) |
| 57 | + objTo[i, k] = objFrom[i, k]; |
| 58 | + |
| 59 | + return objTo; |
| 60 | + } |
| 61 | + |
| 62 | + private static Array? CloneAbstractArrayShallow(Array? objFrom, Array? objTo) |
| 63 | + { |
| 64 | + if (objFrom == null || objTo == null) return null; |
| 65 | + int rank = objFrom.Rank; |
| 66 | + |
| 67 | + int[] lowerBoundsFrom = new int[rank]; |
| 68 | + int[] lowerBoundsTo = new int[rank]; |
| 69 | + int[] lengths = new int[rank]; |
| 70 | + int[] idxesFrom = new int[rank]; |
| 71 | + int[] idxesTo = new int[rank]; |
| 72 | + bool hasZeroLength = false; |
| 73 | + for (int i = 0; i < rank; i++) |
| 74 | + { |
| 75 | + int lowerBoundFrom = objFrom.GetLowerBound(i); |
| 76 | + int lowerBoundTo = objTo.GetLowerBound(i); |
| 77 | + int length = Math.Min(objFrom.GetLength(i), objTo.GetLength(i)); |
| 78 | + |
| 79 | + lowerBoundsFrom[i] = lowerBoundFrom; |
| 80 | + lowerBoundsTo[i] = lowerBoundTo; |
| 81 | + lengths[i] = length; |
| 82 | + idxesFrom[i] = lowerBoundFrom; |
| 83 | + idxesTo[i] = lowerBoundTo; |
| 84 | + hasZeroLength |= length == 0; |
| 85 | + } |
| 86 | + |
| 87 | + if (hasZeroLength) |
| 88 | + return objTo; |
| 89 | + |
| 90 | + while (true) |
| 91 | + { |
| 92 | + objTo.SetValue(objFrom.GetValue(idxesFrom), idxesTo); |
| 93 | + int ofs = rank - 1; |
| 94 | + while (true) |
| 95 | + { |
| 96 | + idxesFrom[ofs]++; |
| 97 | + idxesTo[ofs]++; |
| 98 | + if (idxesFrom[ofs] >= lowerBoundsFrom[ofs] + lengths[ofs]) |
| 99 | + { |
| 100 | + idxesFrom[ofs] = lowerBoundsFrom[ofs]; |
| 101 | + idxesTo[ofs] = lowerBoundsTo[ofs]; |
| 102 | + ofs--; |
| 103 | + if (ofs < 0) return objTo; |
| 104 | + } |
| 105 | + else |
| 106 | + break; |
| 107 | + } |
| 108 | + } |
| 109 | + } |
| 110 | +} |
0 commit comments