org.elasticsearch.discovery.zen.elect

Class ElectMasterService

java.lang.Object

org.elasticsearch.common.component.AbstractComponent

org.elasticsearch.discovery.zen.elect.ElectMasterService

public class ElectMasterService
extends AbstractComponent

Field Summary

Fields

Modifier and Type	Field and Description
static Setting<java.lang.Integer>	DISCOVERY_ZEN_MINIMUM_MASTER_NODES_SETTING

Fields inherited from class org.elasticsearch.common.component.AbstractComponent

deprecationLogger, logger, settings

Constructor Summary

Constructors

Constructor and Description
ElectMasterService(Settings settings)

Method Summary

Modifier and Type	Method and Description
DiscoveryNode	electMaster(java.lang.Iterable<DiscoveryNode> nodes) Elects a new master out of the possible nodes, returning it.
boolean	hasEnoughMasterNodes(java.lang.Iterable<DiscoveryNode> nodes)
boolean	hasTooManyMasterNodes(java.lang.Iterable<DiscoveryNode> nodes)
void	logMinimumMasterNodesWarningIfNecessary(ClusterState oldState, ClusterState newState)
int	minimumMasterNodes()
void	minimumMasterNodes(int minimumMasterNodes)
DiscoveryNode[]	nextPossibleMasters(com.carrotsearch.hppc.ObjectContainer<DiscoveryNode> nodes, int numberOfPossibleMasters) Returns a list of the next possible masters.
java.util.List<DiscoveryNode>	sortByMasterLikelihood(java.lang.Iterable<DiscoveryNode> nodes) Returns the given nodes sorted by likelihood of being elected as master, most likely first.

Methods inherited from class org.elasticsearch.common.component.AbstractComponent

logDeprecatedSetting, logRemovedSetting, nodeName

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

DISCOVERY_ZEN_MINIMUM_MASTER_NODES_SETTING

public static final Setting<java.lang.Integer> DISCOVERY_ZEN_MINIMUM_MASTER_NODES_SETTING

Constructor Detail

ElectMasterService

@Inject
public ElectMasterService(Settings settings)

Method Detail

minimumMasterNodes

public void minimumMasterNodes(int minimumMasterNodes)

minimumMasterNodes

public int minimumMasterNodes()

hasEnoughMasterNodes

public boolean hasEnoughMasterNodes(java.lang.Iterable<DiscoveryNode> nodes)

hasTooManyMasterNodes

public boolean hasTooManyMasterNodes(java.lang.Iterable<DiscoveryNode> nodes)

logMinimumMasterNodesWarningIfNecessary

public void logMinimumMasterNodesWarningIfNecessary(ClusterState oldState,
                                                    ClusterState newState)

sortByMasterLikelihood

public java.util.List<DiscoveryNode> sortByMasterLikelihood(java.lang.Iterable<DiscoveryNode> nodes)

Returns the given nodes sorted by likelihood of being elected as master, most likely first. Non-master nodes are not removed but are rather put in the end

nextPossibleMasters

public DiscoveryNode[] nextPossibleMasters(com.carrotsearch.hppc.ObjectContainer<DiscoveryNode> nodes,
                                           int numberOfPossibleMasters)

Returns a list of the next possible masters.

electMaster

public DiscoveryNode electMaster(java.lang.Iterable<DiscoveryNode> nodes)

Elects a new master out of the possible nodes, returning it. Returns null if no master has been elected.