-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
TextValues.java
68 lines (61 loc) · 1.78 KB
/
TextValues.java
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
/*
* Copyright (c) 2002-2017 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.com]
*
* This file is part of Neo4j.
*
* Neo4j is free software: you can redistribute it and/or modify
* it under the terms of the GNU 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package org.neo4j.values;
import java.util.Arrays;
public class TextValues
{
private TextValues()
{
}
public static int compareCharToString( char c, String s )
{
int length = s.length();
int x = length == 0 ? 1 : 0;
if ( x == 0 )
{
x = Character.compare( c, s.charAt( 0 ) );
if ( x == 0 && length > 1 )
{
x = -1;
}
}
return x;
}
public static int compareTextArrays( ValueGroup.VTextArray a, ValueGroup.VTextArray b )
{
int i = 0;
int length = a.length();
int x = length - b.length();
while ( x == 0 && i < length )
{
x = a.stringValue( i ).compareTo( b.stringValue( i ) );
i++;
}
return x;
}
public static int hash( char[] value )
{
return Arrays.hashCode( value );
}
public static int hash( String[] value )
{
return Arrays.hashCode( value );
}
}