-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
Group.java
75 lines (66 loc) · 1.9 KB
/
Group.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
69
70
71
72
73
74
75
/*
* Copyright (c) 2002-2018 "Neo4j,"
* Neo4j Sweden AB [http://neo4j.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.scheduler;
import java.util.Objects;
import java.util.concurrent.atomic.AtomicInteger;
/**
* Represents a common group of jobs, defining how they should be scheduled.
*/
public final class Group
{
private final AtomicInteger threadCounter = new AtomicInteger();
private final String name;
Group( String name )
{
Objects.requireNonNull( name, "Group name cannot be null." );
this.name = name;
}
public String groupName()
{
return name;
}
/**
* Name a new thread. This method may or may not be used, it is up to the scheduling strategy to decide
* to honor this.
*/
public String threadName()
{
return "neo4j." + groupName() + "-" + threadCounter.incrementAndGet();
}
@Override
public boolean equals( Object o )
{
if ( this == o )
{
return true;
}
if ( o == null || getClass() != o.getClass() )
{
return false;
}
Group group = (Group) o;
return name.equals( group.name );
}
@Override
public int hashCode()
{
return name.hashCode();
}
}