blob: 1800685da9fe790c9c7c9b83062adccf06be522b (
plain)
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
|
package org.bouncycastle.pqc.math.linearalgebra;
public final class CharUtils
{
/**
* Default constructor (private)
*/
private CharUtils()
{
// empty
}
/**
* Return a clone of the given char array. No null checks are performed.
*
* @param array the array to clone
* @return the clone of the given array
*/
public static char[] clone(char[] array)
{
char[] result = new char[array.length];
System.arraycopy(array, 0, result, 0, array.length);
return result;
}
/**
* Convert the given char array into a byte array.
*
* @param chars the char array
* @return the converted array
*/
public static byte[] toByteArray(char[] chars)
{
byte[] result = new byte[chars.length];
for (int i = chars.length - 1; i >= 0; i--)
{
result[i] = (byte)chars[i];
}
return result;
}
/**
* Convert the given char array into a
* byte array for use with PBE encryption.
*
* @param chars the char array
* @return the converted array
*/
public static byte[] toByteArrayForPBE(char[] chars)
{
byte[] out = new byte[chars.length];
for (int i = 0; i < chars.length; i++)
{
out[i] = (byte)chars[i];
}
int length = out.length * 2;
byte[] ret = new byte[length + 2];
int j = 0;
for (int i = 0; i < out.length; i++)
{
j = i * 2;
ret[j] = 0;
ret[j + 1] = out[i];
}
ret[length] = 0;
ret[length + 1] = 0;
return ret;
}
/**
* Compare two char arrays. No null checks are performed.
*
* @param left the char byte array
* @param right the second char array
* @return the result of the comparison
*/
public static boolean equals(char[] left, char[] right)
{
if (left.length != right.length)
{
return false;
}
boolean result = true;
for (int i = left.length - 1; i >= 0; i--)
{
result &= left[i] == right[i];
}
return result;
}
}
|
