-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
SimpleRandomMutation.java
61 lines (54 loc) · 2.01 KB
/
SimpleRandomMutation.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
/*
* Copyright (c) 2002-2016 "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 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 org.neo4j.kernel.stresstests.transaction.checkpoint.mutation;
import java.util.concurrent.ThreadLocalRandom;
import org.neo4j.graphdb.GraphDatabaseService;
class SimpleRandomMutation implements RandomMutation
{
private final long nodeCount;
private final GraphDatabaseService db;
private final Mutation rareMutation;
private final Mutation commonMutation;
public SimpleRandomMutation( long nodeCount, GraphDatabaseService db,
Mutation rareMutation, Mutation commonMutation )
{
this.nodeCount = nodeCount;
this.db = db;
this.rareMutation = rareMutation;
this.commonMutation = commonMutation;
}
private static String[] NAMES =
{"a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s"};
@Override
public void perform()
{
ThreadLocalRandom rng = ThreadLocalRandom.current();
long nodeId = rng.nextLong( nodeCount );
String value = NAMES[rng.nextInt( NAMES.length )];
if ( rng.nextDouble() < 0.01 )
{
rareMutation.perform( nodeId, value );
}
else
{
commonMutation.perform( nodeId, value );
}
}
}