blob: cb95c91757871248d2293117f33d6c40ec79c169 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
/**
* Copyright © 2014 Mattias Andrée (m@maandree.se)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package algorithms.arrays;
import java.util.*;
/**
* Class for reversing arrays
*/
public class Reverse
{
£>for T in boolean char byte short int long; do
/**
* Reverses an array
*
* @param items The array to reverse
*/
public static void reverse(£{T}[] items)
{
for (int i = 0, j = items.length - 1; i < j; i++, j--)
{
items[j] ^= items[i];
items[i] ^= items[j];
items[j] ^= items[i];
}
}
£>done
£>for T in float double Object; do
/**
* Reverses an array
*
* @param items The array to reverse
*/
public static void reverse(£{T}[] items)
{
£{T} temp;
for (int i = 0, j = items.length - 1; i < j; i++, j--)
{
temp = items[i];
items[i] = items[j];
items[j] = temp;
}
}
£>done
£>for T in boolean char byte short int long float double Object; do
/**
* Make a clone of an array, but make it reversed
*
* @param items The array to reverse
* @return The array reversed
*/
public static £{T}[] reverseClone(£{T}[] items)
{
£{T}[] rc = new £{T}[items.length];
for (int i = 0, n = items.length - 1; i <= n; i++)
rc[i] = items[n - i];
return rc;
}
£>done
}
|
