Inheritance diagram for com.google.ortools.constraintsolver.FirstSolutionStrategy.Value:

Public Member Functions
final int	getNumber ()

final com.google.protobuf.Descriptors.EnumValueDescriptor	getValueDescriptor ()

final com.google.protobuf.Descriptors.EnumDescriptor	getDescriptorForType ()

Static Public Member Functions
	[static initializer]

static Value	valueOf (int value)

static Value	forNumber (int value)

static com.google.protobuf.Internal.EnumLiteMap< Value >	internalGetValueMap ()

static final com.google.protobuf.Descriptors.EnumDescriptor	getDescriptor ()

static Value	valueOf (com.google.protobuf.Descriptors.EnumValueDescriptor desc)

Public Attributes
	UNSET =(0)

	AUTOMATIC =(15)

	PATH_CHEAPEST_ARC =(3)

	PATH_MOST_CONSTRAINED_ARC =(4)

	EVALUATOR_STRATEGY =(5)

	SAVINGS =(10)

	PARALLEL_SAVINGS =(17)

	SWEEP =(11)

	CHRISTOFIDES =(13)

	ALL_UNPERFORMED =(6)

	BEST_INSERTION =(7)

	PARALLEL_CHEAPEST_INSERTION =(8)

	SEQUENTIAL_CHEAPEST_INSERTION =(14)

	LOCAL_CHEAPEST_INSERTION =(9)

	LOCAL_CHEAPEST_COST_INSERTION =(16)

	GLOBAL_CHEAPEST_ARC =(1)

	LOCAL_CHEAPEST_ARC =(2)

	FIRST_UNBOUND_MIN_VALUE =(12)

	UNRECOGNIZED =(-1)

Static Public Attributes
static final int	UNSET_VALUE = 0

static final int	AUTOMATIC_VALUE = 15

static final int	PATH_CHEAPEST_ARC_VALUE = 3

static final int	PATH_MOST_CONSTRAINED_ARC_VALUE = 4

static final int	EVALUATOR_STRATEGY_VALUE = 5

static final int	SAVINGS_VALUE = 10

static final int	PARALLEL_SAVINGS_VALUE = 17

static final int	SWEEP_VALUE = 11

static final int	CHRISTOFIDES_VALUE = 13

static final int	ALL_UNPERFORMED_VALUE = 6

static final int	BEST_INSERTION_VALUE = 7

static final int	PARALLEL_CHEAPEST_INSERTION_VALUE = 8

static final int	SEQUENTIAL_CHEAPEST_INSERTION_VALUE = 14

static final int	LOCAL_CHEAPEST_INSERTION_VALUE = 9

static final int	LOCAL_CHEAPEST_COST_INSERTION_VALUE = 16

static final int	GLOBAL_CHEAPEST_ARC_VALUE = 1

static final int	LOCAL_CHEAPEST_ARC_VALUE = 2

static final int	FIRST_UNBOUND_MIN_VALUE_VALUE = 12

Detailed Description

Protobuf enum operations_research.FirstSolutionStrategy.Value

Definition at line 52 of file FirstSolutionStrategy.java.

Member Function Documentation

◆ [static initializer]()

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.[static initializer]

static

◆ forNumber()

static Value com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.forNumber ( int value )

static

Parameters

value The numeric wire value of the corresponding enum entry.

Returns: The enum associated with the given numeric wire value.

Definition at line 472 of file FirstSolutionStrategy.java.

◆ getDescriptor()

static final com.google.protobuf.Descriptors.EnumDescriptor com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.getDescriptor ( )

static

Definition at line 521 of file FirstSolutionStrategy.java.

◆ getDescriptorForType()

final com.google.protobuf.Descriptors.EnumDescriptor com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.getDescriptorForType ( )

Definition at line 517 of file FirstSolutionStrategy.java.

◆ getNumber()

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.getNumber ( )

Definition at line 450 of file FirstSolutionStrategy.java.

◆ getValueDescriptor()

final com.google.protobuf.Descriptors.EnumValueDescriptor com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.getValueDescriptor ( )

Definition at line 509 of file FirstSolutionStrategy.java.

◆ internalGetValueMap()

static com.google.protobuf.Internal.EnumLiteMap< Value > com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.internalGetValueMap ( )

static

Definition at line 497 of file FirstSolutionStrategy.java.

◆ valueOf() [1/2]

static Value com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.valueOf ( com.google.protobuf.Descriptors.EnumValueDescriptor desc )

static

Definition at line 527 of file FirstSolutionStrategy.java.

◆ valueOf() [2/2]

static Value com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.valueOf ( int value )

static

Parameters

value The numeric wire value of the corresponding enum entry.

Returns: The enum associated with the given numeric wire value.

Deprecated: Use forNumber(int) instead.

Definition at line 464 of file FirstSolutionStrategy.java.

Member Data Documentation

◆ ALL_UNPERFORMED

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.ALL_UNPERFORMED =(6)

--- Path insertion heuristics ---
Make all nodes inactive. Only finds a solution if nodes are optional (are
element of a disjunction constraint with a finite penalty cost).

ALL_UNPERFORMED = 6;

Definition at line 161 of file FirstSolutionStrategy.java.

◆ ALL_UNPERFORMED_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.ALL_UNPERFORMED_VALUE = 6

static

--- Path insertion heuristics ---
Make all nodes inactive. Only finds a solution if nodes are optional (are
element of a disjunction constraint with a finite penalty cost).

ALL_UNPERFORMED = 6;

Definition at line 364 of file FirstSolutionStrategy.java.

◆ AUTOMATIC

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.AUTOMATIC =(15)

Lets the solver detect which strategy to use according to the model being
solved.

AUTOMATIC = 15;

Definition at line 70 of file FirstSolutionStrategy.java.

◆ AUTOMATIC_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.AUTOMATIC_VALUE = 15

static

Lets the solver detect which strategy to use according to the model being
solved.

AUTOMATIC = 15;

Definition at line 273 of file FirstSolutionStrategy.java.

◆ BEST_INSERTION

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.BEST_INSERTION =(7)

Iteratively build a solution by inserting the cheapest node at its
cheapest position; the cost of insertion is based on the global cost
function of the routing model. As of 2/2012, only works on models with
optional nodes (with finite penalty costs).

BEST_INSERTION = 7;

Definition at line 172 of file FirstSolutionStrategy.java.

◆ BEST_INSERTION_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.BEST_INSERTION_VALUE = 7

static

Iteratively build a solution by inserting the cheapest node at its
cheapest position; the cost of insertion is based on the global cost
function of the routing model. As of 2/2012, only works on models with
optional nodes (with finite penalty costs).

BEST_INSERTION = 7;

Definition at line 375 of file FirstSolutionStrategy.java.

◆ CHRISTOFIDES

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.CHRISTOFIDES =(13)

Christofides algorithm (actually a variant of the Christofides algorithm
using a maximal matching instead of a maximum matching, which does
not guarantee the 3/2 factor of the approximation on a metric travelling
salesman). Works on generic vehicle routing models by extending a route
until no nodes can be inserted on it.
Reference: Nicos Christofides, Worst-case analysis of a new heuristic for
the travelling salesman problem, Report 388, Graduate School of
Industrial Administration, CMU, 1976.

CHRISTOFIDES = 13;

Definition at line 151 of file FirstSolutionStrategy.java.

◆ CHRISTOFIDES_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.CHRISTOFIDES_VALUE = 13

static

Christofides algorithm (actually a variant of the Christofides algorithm
using a maximal matching instead of a maximum matching, which does
not guarantee the 3/2 factor of the approximation on a metric travelling
salesman). Works on generic vehicle routing models by extending a route
until no nodes can be inserted on it.
Reference: Nicos Christofides, Worst-case analysis of a new heuristic for
the travelling salesman problem, Report 388, Graduate School of
Industrial Administration, CMU, 1976.

CHRISTOFIDES = 13;

Definition at line 354 of file FirstSolutionStrategy.java.

◆ EVALUATOR_STRATEGY

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.EVALUATOR_STRATEGY =(5)

Same as PATH_CHEAPEST_ARC, except that arc costs are evaluated using the
function passed to RoutingModel::SetFirstSolutionEvaluator()
(cf. routing.h).

EVALUATOR_STRATEGY = 5;

Definition at line 102 of file FirstSolutionStrategy.java.

◆ EVALUATOR_STRATEGY_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.EVALUATOR_STRATEGY_VALUE = 5

static

Same as PATH_CHEAPEST_ARC, except that arc costs are evaluated using the
function passed to RoutingModel::SetFirstSolutionEvaluator()
(cf. routing.h).

EVALUATOR_STRATEGY = 5;

Definition at line 305 of file FirstSolutionStrategy.java.

◆ FIRST_UNBOUND_MIN_VALUE

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.FIRST_UNBOUND_MIN_VALUE =(12)

Select the first node with an unbound successor and connect it to the
first available node.
This is equivalent to the CHOOSE_FIRST_UNBOUND strategy combined with
ASSIGN_MIN_VALUE (cf. constraint_solver.h).

FIRST_UNBOUND_MIN_VALUE = 12;

Definition at line 244 of file FirstSolutionStrategy.java.

◆ FIRST_UNBOUND_MIN_VALUE_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.FIRST_UNBOUND_MIN_VALUE_VALUE = 12

static

Select the first node with an unbound successor and connect it to the
first available node.
This is equivalent to the CHOOSE_FIRST_UNBOUND strategy combined with
ASSIGN_MIN_VALUE (cf. constraint_solver.h).

FIRST_UNBOUND_MIN_VALUE = 12;

Definition at line 447 of file FirstSolutionStrategy.java.

◆ GLOBAL_CHEAPEST_ARC

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.GLOBAL_CHEAPEST_ARC =(1)

--- Variable-based heuristics ---
Iteratively connect two nodes which produce the cheapest route segment.

GLOBAL_CHEAPEST_ARC = 1;

Definition at line 224 of file FirstSolutionStrategy.java.

◆ GLOBAL_CHEAPEST_ARC_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.GLOBAL_CHEAPEST_ARC_VALUE = 1

static

--- Variable-based heuristics ---
Iteratively connect two nodes which produce the cheapest route segment.

GLOBAL_CHEAPEST_ARC = 1;

Definition at line 427 of file FirstSolutionStrategy.java.

◆ LOCAL_CHEAPEST_ARC

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.LOCAL_CHEAPEST_ARC =(2)

Select the first node with an unbound successor and connect it to the
node which produces the cheapest route segment.

LOCAL_CHEAPEST_ARC = 2;

Definition at line 233 of file FirstSolutionStrategy.java.

◆ LOCAL_CHEAPEST_ARC_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.LOCAL_CHEAPEST_ARC_VALUE = 2

static

Select the first node with an unbound successor and connect it to the
node which produces the cheapest route segment.

LOCAL_CHEAPEST_ARC = 2;

Definition at line 436 of file FirstSolutionStrategy.java.

◆ LOCAL_CHEAPEST_COST_INSERTION

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.LOCAL_CHEAPEST_COST_INSERTION =(16)

Same as LOCAL_CHEAPEST_INSERTION except that the cost of insertion is
based on the routing model cost function instead of arc costs only.

LOCAL_CHEAPEST_COST_INSERTION = 16;

Definition at line 215 of file FirstSolutionStrategy.java.

◆ LOCAL_CHEAPEST_COST_INSERTION_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.LOCAL_CHEAPEST_COST_INSERTION_VALUE = 16

static

Same as LOCAL_CHEAPEST_INSERTION except that the cost of insertion is
based on the routing model cost function instead of arc costs only.

LOCAL_CHEAPEST_COST_INSERTION = 16;

Definition at line 418 of file FirstSolutionStrategy.java.

◆ LOCAL_CHEAPEST_INSERTION

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.LOCAL_CHEAPEST_INSERTION =(9)

Iteratively build a solution by inserting each node at its cheapest
position; the cost of insertion is based on the arc cost function.
Differs from PARALLEL_CHEAPEST_INSERTION by the node selected for
insertion; here nodes are considered in decreasing order of distance to
the start/ends of the routes, i.e. farthest nodes are inserted first.
Is faster than SEQUENTIAL_CHEAPEST_INSERTION.

LOCAL_CHEAPEST_INSERTION = 9;

Definition at line 206 of file FirstSolutionStrategy.java.

◆ LOCAL_CHEAPEST_INSERTION_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.LOCAL_CHEAPEST_INSERTION_VALUE = 9

static

Iteratively build a solution by inserting each node at its cheapest
position; the cost of insertion is based on the arc cost function.
Differs from PARALLEL_CHEAPEST_INSERTION by the node selected for
insertion; here nodes are considered in decreasing order of distance to
the start/ends of the routes, i.e. farthest nodes are inserted first.
Is faster than SEQUENTIAL_CHEAPEST_INSERTION.

LOCAL_CHEAPEST_INSERTION = 9;

Definition at line 409 of file FirstSolutionStrategy.java.

◆ PARALLEL_CHEAPEST_INSERTION

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.PARALLEL_CHEAPEST_INSERTION =(8)

Iteratively build a solution by inserting the cheapest node at its
cheapest position; the cost of insertion is based on the arc cost
function. Is faster than BEST_INSERTION.

PARALLEL_CHEAPEST_INSERTION = 8;

Definition at line 182 of file FirstSolutionStrategy.java.

◆ PARALLEL_CHEAPEST_INSERTION_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.PARALLEL_CHEAPEST_INSERTION_VALUE = 8

static

Iteratively build a solution by inserting the cheapest node at its
cheapest position; the cost of insertion is based on the arc cost
function. Is faster than BEST_INSERTION.

PARALLEL_CHEAPEST_INSERTION = 8;

Definition at line 385 of file FirstSolutionStrategy.java.

◆ PARALLEL_SAVINGS

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.PARALLEL_SAVINGS =(17)

Parallel version of the Savings algorithm.
Instead of extending a single route until it is no longer possible,
the parallel version iteratively considers the next most improving
feasible saving and possibly builds several routes in parallel.

PARALLEL_SAVINGS = 17;

Definition at line 124 of file FirstSolutionStrategy.java.

◆ PARALLEL_SAVINGS_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.PARALLEL_SAVINGS_VALUE = 17

static

Parallel version of the Savings algorithm.
Instead of extending a single route until it is no longer possible,
the parallel version iteratively considers the next most improving
feasible saving and possibly builds several routes in parallel.

PARALLEL_SAVINGS = 17;

Definition at line 327 of file FirstSolutionStrategy.java.

◆ PATH_CHEAPEST_ARC

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.PATH_CHEAPEST_ARC =(3)

--- Path addition heuristics ---
Starting from a route "start" node, connect it to the node which produces
the cheapest route segment, then extend the route by iterating on the
last node added to the route.

PATH_CHEAPEST_ARC = 3;

Definition at line 81 of file FirstSolutionStrategy.java.

◆ PATH_CHEAPEST_ARC_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.PATH_CHEAPEST_ARC_VALUE = 3

static

--- Path addition heuristics ---
Starting from a route "start" node, connect it to the node which produces
the cheapest route segment, then extend the route by iterating on the
last node added to the route.

PATH_CHEAPEST_ARC = 3;

Definition at line 284 of file FirstSolutionStrategy.java.

◆ PATH_MOST_CONSTRAINED_ARC

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.PATH_MOST_CONSTRAINED_ARC =(4)

Same as PATH_CHEAPEST_ARC, but arcs are evaluated with a comparison-based
selector which will favor the most constrained arc first. To assign a
selector to the routing model, see
RoutingModel::ArcIsMoreConstrainedThanArc() in routing.h for details.

PATH_MOST_CONSTRAINED_ARC = 4;

Definition at line 92 of file FirstSolutionStrategy.java.

◆ PATH_MOST_CONSTRAINED_ARC_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.PATH_MOST_CONSTRAINED_ARC_VALUE = 4

static

Same as PATH_CHEAPEST_ARC, but arcs are evaluated with a comparison-based
selector which will favor the most constrained arc first. To assign a
selector to the routing model, see
RoutingModel::ArcIsMoreConstrainedThanArc() in routing.h for details.

PATH_MOST_CONSTRAINED_ARC = 4;

Definition at line 295 of file FirstSolutionStrategy.java.

◆ SAVINGS

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.SAVINGS =(10)

Savings algorithm (Clarke & Wright).
Reference: Clarke, G. & Wright, J.W.:
"Scheduling of Vehicles from a Central Depot to a Number of Delivery
Points", Operations Research, Vol. 12, 1964, pp. 568-581

SAVINGS = 10;

Definition at line 113 of file FirstSolutionStrategy.java.

◆ SAVINGS_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.SAVINGS_VALUE = 10

static

Savings algorithm (Clarke & Wright).
Reference: Clarke, G. & Wright, J.W.:
"Scheduling of Vehicles from a Central Depot to a Number of Delivery
Points", Operations Research, Vol. 12, 1964, pp. 568-581

SAVINGS = 10;

Definition at line 316 of file FirstSolutionStrategy.java.

◆ SEQUENTIAL_CHEAPEST_INSERTION

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.SEQUENTIAL_CHEAPEST_INSERTION =(14)

Iteratively build a solution by constructing routes sequentially, for
each route inserting the cheapest node at its cheapest position until the
route is completed; the cost of insertion is based on the arc cost
function. Is faster than PARALLEL_CHEAPEST_INSERTION.

SEQUENTIAL_CHEAPEST_INSERTION = 14;

Definition at line 193 of file FirstSolutionStrategy.java.

◆ SEQUENTIAL_CHEAPEST_INSERTION_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.SEQUENTIAL_CHEAPEST_INSERTION_VALUE = 14

static

Iteratively build a solution by constructing routes sequentially, for
each route inserting the cheapest node at its cheapest position until the
route is completed; the cost of insertion is based on the arc cost
function. Is faster than PARALLEL_CHEAPEST_INSERTION.

SEQUENTIAL_CHEAPEST_INSERTION = 14;

Definition at line 396 of file FirstSolutionStrategy.java.

◆ SWEEP

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.SWEEP =(11)

Sweep algorithm (Wren & Holliday).
Reference: Anthony Wren & Alan Holliday: Computer Scheduling of Vehicles
from One or More Depots to a Number of Delivery Points Operational
Research Quarterly (1970-1977),
Vol. 23, No. 3 (Sep., 1972), pp. 333-344

SWEEP = 11;

Definition at line 136 of file FirstSolutionStrategy.java.

◆ SWEEP_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.SWEEP_VALUE = 11

static

Sweep algorithm (Wren & Holliday).
Reference: Anthony Wren & Alan Holliday: Computer Scheduling of Vehicles
from One or More Depots to a Number of Delivery Points Operational
Research Quarterly (1970-1977),
Vol. 23, No. 3 (Sep., 1972), pp. 333-344

SWEEP = 11;

Definition at line 339 of file FirstSolutionStrategy.java.

◆ UNRECOGNIZED

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.UNRECOGNIZED =(-1)

Definition at line 245 of file FirstSolutionStrategy.java.

◆ UNSET

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.UNSET =(0)

See the homonymous value in LocalSearchMetaheuristic.

UNSET = 0;

Definition at line 61 of file FirstSolutionStrategy.java.

◆ UNSET_VALUE

final int com.google.ortools.constraintsolver.FirstSolutionStrategy.Value.UNSET_VALUE = 0

static

See the homonymous value in LocalSearchMetaheuristic.

UNSET = 0;

Definition at line 264 of file FirstSolutionStrategy.java.

The documentation for this enum was generated from the following file:

build/java/ortools-java/src/main/java/com/google/ortools/constraintsolver/FirstSolutionStrategy.java

Public Member Functions

Static Public Member Functions

Public Attributes

Static Public Attributes

Detailed Description

Member Function Documentation

◆ [static initializer]()

◆ forNumber()

◆ getDescriptor()

◆ getDescriptorForType()

◆ getNumber()

◆ getValueDescriptor()

◆ internalGetValueMap()

◆ valueOf() [1/2]

◆ valueOf() [2/2]

Member Data Documentation

◆ ALL_UNPERFORMED

◆ ALL_UNPERFORMED_VALUE

◆ AUTOMATIC

◆ AUTOMATIC_VALUE

◆ BEST_INSERTION

◆ BEST_INSERTION_VALUE

◆ CHRISTOFIDES

◆ CHRISTOFIDES_VALUE

◆ EVALUATOR_STRATEGY

◆ EVALUATOR_STRATEGY_VALUE

◆ FIRST_UNBOUND_MIN_VALUE

◆ FIRST_UNBOUND_MIN_VALUE_VALUE

◆ GLOBAL_CHEAPEST_ARC

◆ GLOBAL_CHEAPEST_ARC_VALUE

◆ LOCAL_CHEAPEST_ARC

◆ LOCAL_CHEAPEST_ARC_VALUE

◆ LOCAL_CHEAPEST_COST_INSERTION

◆ LOCAL_CHEAPEST_COST_INSERTION_VALUE

◆ LOCAL_CHEAPEST_INSERTION

◆ LOCAL_CHEAPEST_INSERTION_VALUE

◆ PARALLEL_CHEAPEST_INSERTION

◆ PARALLEL_CHEAPEST_INSERTION_VALUE

◆ PARALLEL_SAVINGS

◆ PARALLEL_SAVINGS_VALUE

◆ PATH_CHEAPEST_ARC

◆ PATH_CHEAPEST_ARC_VALUE

◆ PATH_MOST_CONSTRAINED_ARC

◆ PATH_MOST_CONSTRAINED_ARC_VALUE

◆ SAVINGS

◆ SAVINGS_VALUE

◆ SEQUENTIAL_CHEAPEST_INSERTION

◆ SEQUENTIAL_CHEAPEST_INSERTION_VALUE

◆ SWEEP

◆ SWEEP_VALUE

◆ UNRECOGNIZED

◆ UNSET

◆ UNSET_VALUE