#Operators (B to C)

**This file is automatically generated from java files. Do Not Edit It.**

Operators in the GAML language are used to compose complex expressions. An operator performs a function on one, two, or n operands (which are other expressions and thus may be themselves composed of operators) and returns the result of this function.

Most of them use a classical prefixed functional syntax (i.e. `operator_name(operand1, operand2, operand3)`

, see below), with the exception of arithmetic (e.g. `+`

, `/`

), logical (`and`

, `or`

), comparison (e.g. `>`

, `<`

), access (`.`

, `[..]`

) and pair (`::`

) operators, which require an infixed notation (i.e. `operand1 operator_symbol operand1`

).

The ternary functional if-else operator, `? :`

, uses a special infixed syntax composed with two symbols (e.g. `operand1 ? operand2 : operand3`

). Two unary operators (`-`

and `!`

) use a traditional prefixed syntax that does not require parentheses unless the operand is itself a complex expression (e.g. ` - 10`, `

! (operand1 or operand2)`).

Finally, special constructor operators (`{...}`

for constructing points, `[...]`

for constructing lists and maps) will require their operands to be placed between their two symbols (e.g. `{1,2,3}`

, `[operand1, operand2, ..., operandn]`

or `[key1::value1, key2::value2... keyn::valuen]`

).

With the exception of these special cases above, the following rules apply to the syntax of operators:

- if they only have one operand, the functional prefixed syntax is mandatory (e.g.
`operator_name(operand1)`

) - if they have two arguments, either the functional prefixed syntax (e.g.
`operator_name(operand1, operand2)`

) or the infixed syntax (e.g.`operand1 operator_name operand2`

) can be used. - if they have more than two arguments, either the functional prefixed syntax (e.g.
`operator_name(operand1, operand2, ..., operand)`

) or a special infixed syntax with the first operand on the left-hand side of the operator name (e.g.`operand1 operator_name(operand2, ..., operand)`

) can be used.

All of these alternative syntaxes are completely equivalent.

Operators in GAML are purely functional, i.e. they are guaranteed to not have any side effects on their operands. For instance, the `shuffle`

operator, which randomizes the positions of elements in a list, does not modify its list operand but returns a new shuffled list.

The priority of operators determines, in the case of complex expressions composed of several operators, which one(s) will be evaluated first.

GAML follows in general the traditional priorities attributed to arithmetic, boolean, comparison operators, with some twists. Namely:

- the constructor operators, like
`::`

, used to compose pairs of operands, have the lowest priority of all operators (e.g.`a > b :: b > c`

will return a pair of boolean values, which means that the two comparisons are evaluated before the operator applies. Similarly,`[a > 10, b > 5]`

will return a list of boolean values. - it is followed by the
`?:`

operator, the functional if-else (e.g. ` a > b ? a + 10 : a - 10` will return the result of the if-else). - next are the logical operators,
`and`

and`or`

(e.g.`a > b or b > c`

will return the value of the test) - next are the comparison operators (i.e.
`>`

,`<`

,`<=`

,`>=`

,`=`

,`!=`

) - next the arithmetic operators in their logical order (multiplicative operators have a higher priority than additive operators)
- next the unary operators
`-`

and`!`

- next the access operators
`.`

and`[]`

(e.g.`{1,2,3}.x > 20 + {4,5,6}.y`

will return the result of the comparison between the x and y ordinates of the two points) - and finally the functional operators, which have the highest priority of all.

Actions defined in species can be used as operators, provided they are called on the correct agent. The syntax is that of normal functional operators, but the agent that will perform the action must be added as the first operand.

For instance, if the following species is defined:

```
species spec1 {
int min(int x, int y) {
return x > y ? x : y;
}
}
```

Any agent instance of spec1 can use `min`

as an operator (if the action conflicts with an existing operator, a warning will be emitted). For instance, in the same model, the following line is perfectly acceptable:

```
global {
init {
create spec1;
spec1 my_agent <- spec1[0];
int the_min <- my_agent min(10,20); // or min(my_agent, 10, 20);
}
}
```

If the action doesn’t have any operands, the syntax to use is `my_agent the_action()`

. Finally, if it does not return a value, it might still be used but is considering as returning a value of type `unknown`

(e.g. `unknown result <- my_agent the_action(op1, op2);`

).

Note that due to the fact that actions are written by modelers, the general functional contract is not respected in that case: actions might perfectly have side effects on their operands (including the agent).

box, cone3D, cube, cylinder, dem, hexagon, pyramid, rgb_to_xyz, set_z, sphere, teapot,

-, /, [^](OperatorsAA#^), [*](OperatorsAA#*), +, abs, acos, asin, atan, atan2, ceil, cos, cos_rad, div, even, exp, fact, floor, hypot, is_finite, is_number, ln, log, mod, round, signum, sin, sin_rad, sqrt, tan, tan_rad, tanh, with_precision,

and, eval_when, get_about, get_agent, get_agent_cause, get_belief_op, get_belief_with_name_op, get_beliefs_op, get_beliefs_with_name_op, get_current_intention_op, get_decay, get_desire_op, get_desire_with_name_op, get_desires_op, get_desires_with_name_op, get_dominance, get_familiarity, get_ideal_op, get_ideal_with_name_op, get_ideals_op, get_ideals_with_name_op, get_intensity, get_intention_op, get_intention_with_name_op, get_intentions_op, get_intentions_with_name_op, get_lifetime, get_liking, get_modality, get_obligation_op, get_obligation_with_name_op, get_obligations_op, get_obligations_with_name_op, get_plan_name, get_predicate, get_solidarity, get_strength, get_super_intention, get_trust, get_truth, get_uncertainties_op, get_uncertainties_with_name_op, get_uncertainty_op, get_uncertainty_with_name_op, has_belief_op, has_belief_with_name_op, has_desire_op, has_desire_with_name_op, has_ideal_op, has_ideal_with_name_op, has_intention_op, has_intention_with_name_op, has_obligation_op, has_obligation_with_name_op, has_uncertainty_op, has_uncertainty_with_name_op, new_emotion, new_mental_state, new_predicate, new_social_link, or, set_about, set_agent, set_agent_cause, set_decay, set_dominance, set_familiarity, set_intensity, set_lifetime, set_liking, set_modality, set_predicate, set_solidarity, set_strength, set_trust, set_truth, with_lifetime, with_values,

as, as_int, as_matrix, font, is, is_skill, list_with, matrix_with, species, to_gaml, topology,

-, /, [*](OperatorsAA#*), +, blend, brewer_colors, brewer_palettes, grayscale, hsb, mean, median, rgb, rnd_color, sum,

-, ::, +, accumulate, all_match, among, at, collect, contains, contains_all, contains_any, count, distinct, empty, every, first, first_with, get, group_by, in, index_by, inter, interleave, internal_at, internal_integrated_value, last, last_with, length, max, max_of, mean, mean_of, median, min, min_of, mul, none_matches, one_matches, one_of, product_of, range, reverse, shuffle, sort_by, split, split_in, split_using, sum, sum_of, union, variance_of, where, with_max_of, with_min_of,

-, !=, +, <, <=, =, >, >=, after, before, between, every, milliseconds_between, minus_days, minus_hours, minus_minutes, minus_months, minus_ms, minus_weeks, minus_years, months_between, plus_days, plus_hours, plus_minutes, plus_months, plus_ms, plus_weeks, plus_years, since, to, until, years_between,

auto_correlation, correlation, covariance, durbin_watson, kurtosis, moment, quantile, quantile_inverse, rank_interpolated, rms, skew, variance,

binomial_coeff, binomial_complemented, binomial_sum, chi_square, chi_square_complemented, gamma_distribution, gamma_distribution_complemented, normal_area, normal_density, normal_inverse, pValue_for_fStat, pValue_for_tStat, student_area, student_t_inverse,

diff, diff2, internal_zero_order_equation,

crs, evaluate_sub_model, file, file_exists, folder, get, load_sub_model, new_folder, osm_file, read, step_sub_model, writable,

beta, gamma, incomplete_beta, incomplete_gamma, incomplete_gamma_complement, log_gamma,

add_edge, add_node, adjacency, agent_from_geometry, all_pairs_shortest_path, alpha_index, as_distance_graph, as_edge_graph, as_intersection_graph, as_path, beta_index, betweenness_centrality, biggest_cliques_of, connected_components_of, connectivity_index, contains_edge, contains_vertex, degree_of, directed, edge, edge_between, edge_betweenness, edges, gamma_index, generate_barabasi_albert, generate_complete_graph, generate_watts_strogatz, grid_cells_to_graph, in_degree_of, in_edges_of, layout, load_graph_from_file, load_shortest_paths, main_connected_component, max_flow_between, maximal_cliques_of, nb_cycles, neighbors_of, node, nodes, out_degree_of, out_edges_of, path_between, paths_between, predecessors_of, remove_node_from, rewire_n, source_of, spatial_graph, strahler, successors_of, sum, target_of, undirected, use_cache, weight_of, with_optimizer_type, with_weights,

as_4_grid, as_grid, as_hexagonal_grid, grid_at, path_between,

accumulate, all_match, as_map, collect, count, create_map, distribution_of, distribution_of, distribution_of, distribution2d_of, distribution2d_of, distribution2d_of, first_with, frequency_of, group_by, index_by, last_with, max_of, mean_of, min_of, none_matches, one_matches, product_of, sort_by, sum_of, variance_of, where, with_max_of, with_min_of,

copy_between, index_of, last_index_of,

:, !, ?, add_3Dmodel, add_geometry, add_icon, and, or, xor,

fuzzy_kappa, fuzzy_kappa_sim, kappa, kappa_sim, percent_absolute_deviation,

as_map, create_map, index_of, last_index_of,

-, /, ., [*](OperatorsAA#*), +, append_horizontally, append_vertically, column_at, columns_list, determinant, eigenvalues, index_of, inverse, last_index_of, row_at, rows_list, shuffle, trace, transpose,

electre_DM, evidence_theory_DM, fuzzy_choquet_DM, promethee_DM, weighted_means_DM,

agent_from_geometry, all_pairs_shortest_path, as_path, load_shortest_paths, max_flow_between, path_between, path_to, paths_between, use_cache,

-, /, [*](OperatorsAA#*), +, <, <=, >, >=, add_point, angle_between, any_location_in, centroid, closest_points_with, farthest_point_to, grid_at, norm, points_along, points_at, points_on,

binomial, flip, gauss, improved_generator, open_simplex_generator, poisson, rnd, rnd_choice, sample, shuffle, simplex_generator, skew_gauss, truncated_gauss,

restoreSimulation, restoreSimulationFromFile, saveAgent, saveSimulation, serialize, serializeAgent,

arc, box, circle, cone, cone3D, cross, cube, curve, cylinder, ellipse, envelope, geometry_collection, hexagon, line, link, plan, polygon, polyhedron, pyramid, rectangle, sphere, square, squircle, teapot, triangle,

-, [*](OperatorsAA#*), +, add_point, agent_closest_to, agent_farthest_to, agents_at_distance, agents_inside, agents_overlapping, angle_between, any_location_in, arc, around, as_4_grid, as_grid, as_hexagonal_grid, at_distance, at_location, box, centroid, circle, clean, clean_network, closest_points_with, closest_to, cone, cone3D, convex_hull, covers, cross, crosses, crs, CRS_transform, cube, curve, cylinder, dem, direction_between, disjoint_from, distance_between, distance_to, ellipse, envelope, farthest_point_to, farthest_to, geometry_collection, gini, hexagon, hierarchical_clustering, IDW, inside, inter, intersects, line, link, masked_by, moran, neighbors_at, neighbors_of, overlapping, overlaps, partially_overlaps, path_between, path_to, plan, points_along, points_at, points_on, polygon, polyhedron, pyramid, rectangle, rgb_to_xyz, rotated_by, round, scaled_to, set_z, simple_clustering_by_distance, simplification, skeletonize, smooth, sphere, split_at, split_geometry, split_lines, square, squircle, teapot, to_GAMA_CRS, to_rectangles, to_segments, to_squares, to_sub_geometries, touches, towards, transformed_by, translated_by, triangle, triangulate, union, using, voronoi, with_precision, without_holes,

covers, crosses, intersects, partially_overlaps, touches,

agent_closest_to, agent_farthest_to, agents_at_distance, agents_inside, agents_overlapping, at_distance, closest_to, farthest_to, inside, neighbors_at, neighbors_of, overlapping,

direction_between, distance_between, distance_to, path_between, path_to, towards,

hierarchical_clustering, simple_clustering_by_distance,

-, [*](OperatorsAA#*), +, as_4_grid, as_grid, as_hexagonal_grid, at_location, clean, clean_network, convex_hull, CRS_transform, rotated_by, scaled_to, simplification, skeletonize, smooth, split_geometry, split_lines, to_GAMA_CRS, to_rectangles, to_segments, to_squares, to_sub_geometries, transformed_by, translated_by, triangulate, voronoi, with_precision, without_holes,

index_of, last_index_of, of_generic_species, of_species,

build, corR, dbscan, distribution_of, distribution2d_of, dtw, frequency_of, gamma_rnd, geometric_mean, gini, harmonic_mean, hierarchical_clustering, kmeans, kurtosis, max, mean, mean_deviation, meanR, median, min, moran, mul, predict, simple_clustering_by_distance, skewness, split, split_in, split_using, standard_deviation, sum, variance,

+, <, <=, >, >=, at, char, contains, contains_all, contains_any, copy_between, date, empty, first, in, indented_by, index_of, is_number, last, last_index_of, length, lower_case, replace, replace_regex, reverse, sample, shuffle, split_with, string, upper_case,

., command, copy, dead, eval_gaml, every, is_error, is_warning, user_input,

`BDIPlan`

(`BDIPlan`

`any`

) —>`BDIPlan`

Casts the operand into the type BDIPlan

`before`

(`before`

`date`

) —>`bool`

`any expression`

`before`

`date`

—>`bool`

(`before`

`any expression`

,`date`

) —>`bool`

Returns true if the current_date of the model is strictly before the date passed in argument. Synonym of ‘current_date < argument’

```
reflex when: before(starting_date) {} // this reflex will never be run
```

`beta`

`float`

`beta`

`float`

—>`float`

(`beta`

`float`

,`float`

) —>`float`

Returns the beta function with arguments a, b.

`beta_index`

(`beta_index`

`graph`

) —>`float`

returns the beta index of the graph (Measures the level of connectivity in a graph and is expressed by the relationship between the number of links (e) over the number of nodes (v) : beta = e/v.

```
graph graphEpidemio <- graph([]);
float var1 <- beta_index(graphEpidemio); // var1 equals the beta index of the graph
```

alpha_index, gamma_index, nb_cycles, connectivity_index,

`between`

`date`

`between`

`date`

—>`bool`

(`between`

`date`

,`date`

) —>`bool`

(`between`

`float`

,`float`

,`float`

) —>`bool`

(`between`

`date`

,`date`

,`date`

) —>`bool`

(`between`

`int`

,`int`

,`int`

) —>`bool`

(`between`

`any expression`

,`date`

,`date`

) —>`bool`

returns true if the first float operand is bigger than the second float operand and smaller than the third float operand

returns true the first integer operand is bigger than the second integer operand and smaller than the third integer operand

- returns true if the first operand is between the two dates passed in arguments (both exclusive). Can be combined with ‘every’ to express a frequency between two dates

```
bool var0 <- (date('2016-01-01') between(date('2000-01-01'), date('2020-02-02'))); // var0 equals true// will return true every new day between these two dates, taking the first one as the starting point every(#day between(date('2000-01-01'), date('2020-02-02')))
```

- returns true if the first operand is between the two dates passed in arguments (both exclusive). The version with 2 arguments compares the current_date with the 2 others

```
bool var3 <- (date('2016-01-01') between(date('2000-01-01'), date('2020-02-02'))); // var3 equals true// // will return true if the current_date of the model is in_between the 2 between(date('2000-01-01'), date('2020-02-02'))
```

```
bool var6 <- between(5.0, 1.0, 10.0); // var6 equals true
bool var7 <- between(5, 1, 10); // var7 equals true
```

`betweenness_centrality`

(`betweenness_centrality`

`graph`

) —>`map`

returns a map containing for each vertex (key), its betweenness centrality (value): number of shortest paths passing through each vertex

```
graph graphEpidemio <- graph([]);
map var1 <- betweenness_centrality(graphEpidemio); // var1 equals the betweenness centrality index of the graph
```

`biggest_cliques_of`

(`biggest_cliques_of`

`graph`

) —>`list<list>`

returns the biggest cliques of a graph using the Bron-Kerbosch clique detection algorithm

```
graph my_graph <- graph([]);
list<list> var1 <- biggest_cliques_of (my_graph); // var1 equals the list of the biggest cliques as list
```

`binomial`

`int`

`binomial`

`float`

—>`int`

(`binomial`

`int`

,`float`

) —>`int`

A value from a random variable following a binomial distribution. The operands represent the number of experiments n and the success probability p.

The binomial distribution is the discrete probability distribution of the number of successes in a sequence of n independent yes/no experiments, each of which yields success with probability p, cf. Binomial distribution on Wikipedia.

```
int var0 <- binomial(15,0.6); // var0 equals a random positive integer
```

`binomial_coeff`

`int`

`binomial_coeff`

`int`

—>`float`

(`binomial_coeff`

`int`

,`int`

) —>`float`

Returns n choose k as a double. Note the integerization of the double return value.

`binomial_complemented`

(`binomial_complemented`

`int`

,`int`

,`float`

) —>`float`

Returns the sum of the terms k+1 through n of the Binomial probability density, where n is the number of trials and P is the probability of success in the range 0 to 1.

`binomial_sum`

(`binomial_sum`

`int`

,`int`

,`float`

) —>`float`

Returns the sum of the terms 0 through k of the Binomial probability density, where n is the number of trials and p is the probability of success in the range 0 to 1.

`blend`

`rgb`

`blend`

`rgb`

—>`rgb`

(`blend`

`rgb`

,`rgb`

) —>`rgb`

(`blend`

`rgb`

,`rgb`

,`float`

) —>`rgb`

Blend two colors with an optional ratio (c1 `*`

r + c2 `*`

(1 - r)) between 0 and 1

- If the ratio is omitted, an even blend is done

```
rgb var1 <- blend(#red, #blue); // var1 equals to a color very close to the purple
```

```
rgb var3 <- blend(#red, #blue, 0.3); // var3 equals to a color between the purple and the blue
```

`bool`

(`bool`

`any`

) —>`bool`

Casts the operand into the type bool

`box`

(`box`

`point`

) —>`geometry`

(`box`

`float`

,`float`

,`float`

) —>`geometry`

A box geometry which side sizes are given by the operands.

the center of the box is by default the location of the current agent in which has been called this operator.the center of the box is by default the location of the current agent in which has been called this operator.

- returns nil if the operand is nil.
- returns nil if the operand is nil.

```
geometry var0 <- box({10, 5 , 5}); // var0 equals a geometry as a rectangle with width = 10, height = 5 depth= 5.
geometry var1 <- box(10, 5 , 5); // var1 equals a geometry as a rectangle with width = 10, height = 5 depth= 5.
```

around, circle, sphere, cone, line, link, norm, point, polygon, polyline, square, cube, triangle,

`brewer_colors`

(`brewer_colors`

`string`

) —>`list<rgb>`

`string`

`brewer_colors`

`int`

—>`list<rgb>`

(`brewer_colors`

`string`

,`int`

) —>`list<rgb>`

Build a list of colors of a given type (see website http://colorbrewer2.org/) with a given number of classes Build a list of colors of a given type (see website http://colorbrewer2.org/). The list of palettes can be obtained by calling brewer_palettes

```
list<rgb> var0 <- list<rgb> colors <- brewer_colors("Pastel1", 5);; // var0 equals a list of 5 sequential colors in the palette named 'Pastel1'. The list of palettes can be obtained by calling brewer_palettes
list<rgb> var1 <- list<rgb> colors <- brewer_colors("OrRd");; // var1 equals a list of 6 blue colors
```

`brewer_palettes`

(`brewer_palettes`

`int`

) —>`list<string>`

`int`

`brewer_palettes`

`int`

—>`list<string>`

(`brewer_palettes`

`int`

,`int`

) —>`list<string>`

returns the list a palette with a given min number of classes) returns the list a palette with a given min number of classes and max number of classes)

```
list<string> var0 <- list<string> palettes <- brewer_palettes(3);; // var0 equals a list of palettes that are composed of a min of 3 colors
list<string> var1 <- list<string> palettes <- brewer_palettes(5,10);; // var1 equals a list of palettes that are composed of a min of 5 colors and a max of 10 colors
```

`buffer`

Same signification as +

`build`

(`build`

`matrix<float>`

) —>`regression`

`matrix<float>`

`build`

`string`

—>`regression`

(`build`

`matrix<float>`

,`string`

) —>`regression`

returns the regression build from the matrix data (a row = an instance, the last value of each line is the y value) while using the given method (“GLS” or “OLS”). Usage: build(data,method) returns the regression build from the matrix data (a row = an instance, the last value of each line is the y value) while using the given ordinary least squares method. Usage: build(data)

```
build(matrix([[1,2,3,4],[2,3,4,2]]),"GLS") matrix([[1,2,3,4],[2,3,4,2]])
```

`ceil`

(`ceil`

`float`

) —>`float`

Maps the operand to the smallest following integer, i.e. the smallest integer not less than x.

```
float var0 <- ceil(3); // var0 equals 3.0
float var1 <- ceil(3.5); // var1 equals 4.0
float var2 <- ceil(-4.7); // var2 equals -4.0
```

`centroid`

(`centroid`

`geometry`

) —>`point`

Centroid (weighted sum of the centroids of a decomposition of the area into triangles) of the operand-geometry. Can be different to the location of the geometry

```
point var0 <- centroid(world); // var0 equals the centroid of the square, for example : {50.0,50.0}.
```

any_location_in, closest_points_with, farthest_point_to, points_at,

`char`

(`char`

`int`

) —>`string`

- converts ACSII integer value to character

```
string var0 <- char (34); // var0 equals '"'
```

`chi_square`

`float`

`chi_square`

`float`

—>`float`

(`chi_square`

`float`

,`float`

) —>`float`

Returns the area under the left hand tail (from 0 to x) of the Chi square probability density function with df degrees of freedom.

`chi_square_complemented`

`float`

`chi_square_complemented`

`float`

—>`float`

(`chi_square_complemented`

`float`

,`float`

) —>`float`

Returns the area under the right hand tail (from x to infinity) of the Chi square probability density function with df degrees of freedom.

`circle`

(`circle`

`float`

) —>`geometry`

`float`

`circle`

`point`

—>`geometry`

(`circle`

`float`

,`point`

) —>`geometry`

A circle geometry which radius is equal to the operand. A circle geometry which radius is equal to the first operand, and the center has the location equal to the second operand.

the center of the circle is by default the location of the current agent in which has been called this operator.

- returns a point if the operand is lower or equal to 0.
- returns a point if the operand is lower or equal to 0.

```
geometry var0 <- circle(10); // var0 equals a geometry as a circle of radius 10.
geometry var1 <- circle(10,{80,30}); // var1 equals a geometry as a circle of radius 10, the center will be in the location {80,30}.
```

around, cone, line, link, norm, point, polygon, polyline, rectangle, square, triangle,

`clean`

(`clean`

`geometry`

) —>`geometry`

A geometry corresponding to the cleaning of the operand (geometry, agent, point)

The cleaning corresponds to a buffer with a distance of 0.0

```
geometry var0 <- clean(self); // var0 equals returns the geometry resulting from the cleaning of the geometry of the agent applying the operator.
```

`clean_network`

(`clean_network`

`list<geometry>`

,`float`

,`bool`

,`bool`

) —>`list<geometry>`

A list of polylines corresponding to the cleaning of the first operand (list of polyline geometry or agents), considering the tolerance distance given by the second operand; the third operator is used to define if the operator should as well split the lines at their intersections(true to split the lines); the last operandis used to specify if the operator should as well keep only the main connected component of the network. Usage: clean_network(lines:list of geometries or agents, tolerance: float, split_lines: bool, keepMainConnectedComponent: bool)

The cleaned set of polylines

```
list<geometry> var0 <- clean_network(my_road_shapefile.contents, 1.0, true, false); // var0 equals returns the list of polulines resulting from the cleaning of the geometry of the agent applying the operator with a tolerance of 1m, and splitting the lines at their intersections.
```

`closest_points_with`

`geometry`

`closest_points_with`

`geometry`

—>`list<point>`

(`closest_points_with`

`geometry`

,`geometry`

) —>`list<point>`

A list of two closest points between the two geometries.

```
list<point> var0 <- geom1 closest_points_with(geom2); // var0 equals [pt1, pt2] with pt1 the closest point of geom1 to geom2 and pt1 the closest point of geom2 to geom1
```

any_location_in, any_point_in, farthest_point_to, points_at,

`closest_to`

`container<agent>`

`closest_to`

`geometry`

—>`geometry`

(`closest_to`

`container<agent>`

,`geometry`

) —>`geometry`

(`closest_to`

`container<agent>`

,`geometry`

,`int`

) —>`list<geometry>`

The N agents or geometries among the left-operand list of agents, species or meta-population (addition of species), that are the closest to the operand (casted as a geometry). An agent or a geometry among the left-operand list of agents, species or meta-population (addition of species), the closest to the operand (casted as a geometry).

the distance is computed in the topology of the calling agent (the agent in which this operator is used), with the distance algorithm specific to the topology.the distance is computed in the topology of the calling agent (the agent in which this operator is used), with the distance algorithm specific to the topology.

```
list<geometry> var0 <- [ag1, ag2, ag3] closest_to(self, 2); // var0 equals return the 2 closest agents among ag1, ag2 and ag3 to the agent applying the operator.(species1 + species2) closest_to (self, 5)
geometry var2 <- [ag1, ag2, ag3] closest_to(self); // var2 equals return the closest agent among ag1, ag2 and ag3 to the agent applying the operator.(species1 + species2) closest_to self
```

neighbors_at, neighbors_of, inside, overlapping, agents_overlapping, agents_inside, agent_closest_to,

`collect`

`container`

`collect`

`any expression`

—>`list`

(`collect`

`container`

,`any expression`

) —>`list`

returns a new list, in which each element is the evaluation of the right-hand operand.

collect is similar to accumulate except that accumulate always produces flat lists if the right-hand operand returns a list.In addition, collect can be applied to any container.

- if the left-hand operand is nil, collect throws an error

```
list var0 <- [1,2,4] collect (each *2); // var0 equals [2,4,8]
list var1 <- [1,2,4] collect ([2,4]); // var1 equals [[2,4],[2,4],[2,4]]
list var2 <- [1::2, 3::4, 5::6] collect (each + 2); // var2 equals [4,6,8]
list var3 <- (list(node) collect (node(each).location.x * 2); // var3 equals the list of nodes with their x multiplied by 2
```

`column_at`

`matrix`

`column_at`

`int`

—>`list`

(`column_at`

`matrix`

,`int`

) —>`list`

returns the column at a num_col (right-hand operand)

```
list var0 <- matrix([["el11","el12","el13"],["el21","el22","el23"],["el31","el32","el33"]]) column_at 2; // var0 equals ["el31","el32","el33"]
```

`columns_list`

(`columns_list`

`matrix`

) —>`list<list>`

returns a list of the columns of the matrix, with each column as a list of elements

```
list<list> var0 <- columns_list(matrix([["el11","el12","el13"],["el21","el22","el23"],["el31","el32","el33"]])); // var0 equals [["el11","el12","el13"],["el21","el22","el23"],["el31","el32","el33"]]
```

`command`

(`command`

`string`

) —>`string`

`string`

`command`

`string`

—>`string`

(`command`

`string`

,`string`

) —>`string`

(`command`

`string`

,`string`

,`msi.gama.util.GamaMap<java.lang.String,java.lang.String>`

) —>`string`

command allows GAMA to issue a system command using the system terminal or shell and to receive a string containing the outcome of the command or script executed. By default, commands are blocking the agent calling them, unless the sequence ‘ &’ is used at the end. In this case, the result of the operator is an empty string. The basic form with only one string in argument uses the directory of the model and does not set any environment variables. Two other forms (with a directory and a map<string, string> of environment variables) are available. command allows GAMA to issue a system command using the system terminal or shell and to receive a string containing the outcome of the command or script executed. By default, commands are blocking the agent calling them, unless the sequence ‘ &’ is used at the end. In this case, the result of the operator is an empty string. The basic form with only one string in argument uses the directory of the model and does not set any environment variables. Two other forms (with a directory and a map<string, string> of environment variables) are available. command allows GAMA to issue a system command using the system terminal or shell and to receive a string containing the outcome of the command or script executed. By default, commands are blocking the agent calling them, unless the sequence ‘ &’ is used at the end. In this case, the result of the operator is an empty string

`cone`

(`cone`

`point`

) —>`geometry`

`int`

`cone`

`int`

—>`geometry`

(`cone`

`int`

,`int`

) —>`geometry`

A cone geometry which min and max angles are given by the operands. A cone geometry which min and max angles are given by the operands.

the center of the cone is by default the location of the current agent in which has been called this operator.the center of the cone is by default the location of the current agent in which has been called this operator.

- returns nil if the operand is nil.
- returns nil if the operand is nil.

```
geometry var0 <- cone({0, 45}); // var0 equals a geometry as a cone with min angle is 0 and max angle is 45.
geometry var1 <- cone(0, 45); // var1 equals a geometry as a cone with min angle is 0 and max angle is 45.
```

around, circle, line, link, norm, point, polygon, polyline, rectangle, square, triangle,

`cone3D`

`float`

`cone3D`

`float`

—>`geometry`

(`cone3D`

`float`

,`float`

) —>`geometry`

A cone geometry which base radius size is equal to the first operand, and which the height is equal to the second operand.

the center of the cone is by default the location of the current agent in which has been called this operator.

- returns a point if the operand is lower or equal to 0.

```
geometry var0 <- cone3D(10.0,5.0); // var0 equals a geometry as a cone with a base circle of radius 10 and a height of 5.
```

around, cone, line, link, norm, point, polygon, polyline, rectangle, square, triangle,

`connected_components_of`

(`connected_components_of`

`graph`

) —>`list<list>`

`graph`

`connected_components_of`

`bool`

—>`list<list>`

(`connected_components_of`

`graph`

,`bool`

) —>`list<list>`

returns the connected components of a graph, i.e. the list of all edges (if the boolean is true) or vertices (if the boolean is false) that are in the connected components. returns the connected components of a graph, i.e. the list of all vertices that are in the maximally connected component together with the specified vertex.

```
graph my_graph2 <- graph([]);
list<list> var1 <- connected_components_of (my_graph2, true); // var1 equals the list of all the components as listgraph my_graph <- graph([]);
list<list> var3 <- connected_components_of (my_graph); // var3 equals the list of all the components as list
```

alpha_index, connectivity_index, nb_cycles,

`connectivity_index`

(`connectivity_index`

`graph`

) —>`float`

returns a simple connectivity index. This number is estimated through the number of nodes (v) and of sub-graphs (p) : IC = (v - p) /(v - 1).

```
graph graphEpidemio <- graph([]);
float var1 <- connectivity_index(graphEpidemio); // var1 equals the connectivity index of the graph
```

alpha_index, beta_index, gamma_index, nb_cycles,

`container`

(`container`

`any`

) —>`container`

Casts the operand into the type container

`contains`

`container<KeyType,ValueType>`

`contains`

`unknown`

—>`bool`

(`contains`

`container<KeyType,ValueType>`

,`unknown`

) —>`bool`

`string`

`contains`

`string`

—>`bool`

(`contains`

`string`

,`string`

) —>`bool`

true, if the container contains the right operand, false otherwise

the contains operator behavior depends on the nature of the operand

- if it is a map, contains returns true if the operand is a key of the map
- if it is a file, contains returns true it the operand is contained in the file content
- if it is a population, contains returns true if the operand is an agent of the population, false otherwise
- if it is a graph, contains returns true if the operand is a node or an edge of the graph, false otherwise
- if both operands are strings, returns true if the right-hand operand contains the right-hand pattern;
- if it is a list or a matrix, contains returns true if the list or matrix contains the right operand

```
bool var0 <- [1, 2, 3] contains 2; // var0 equals true
bool var1 <- [{1,2}, {3,4}, {5,6}] contains {3,4}; // var1 equals true
```

```
bool var2 <- 'abcded' contains 'bc'; // var2 equals true
```

`contains_all`

`container`

`contains_all`

`container`

—>`bool`

(`contains_all`

`container`

,`container`

) —>`bool`

`string`

`contains_all`

`list`

—>`bool`

(`contains_all`

`string`

,`list`

) —>`bool`

true if the left operand contains all the elements of the right operand, false otherwise

the definition of contains depends on the container

- if the right operand is nil or empty, contains_all returns true
- if the left-operand is a string, test whether the string contains all the element of the list;

```
bool var4 <- "abcabcabc" contains_all ["ca","xy"]; // var4 equals false
```

```
bool var0 <- [1,2,3,4,5,6] contains_all [2,4]; // var0 equals true
bool var1 <- [1,2,3,4,5,6] contains_all [2,8]; // var1 equals false
bool var2 <- [1::2, 3::4, 5::6] contains_all [1,3]; // var2 equals false
bool var3 <- [1::2, 3::4, 5::6] contains_all [2,4]; // var3 equals true
```

`contains_any`

`container`

`contains_any`

`container`

—>`bool`

(`contains_any`

`container`

,`container`

) —>`bool`

`string`

`contains_any`

`list`

—>`bool`

(`contains_any`

`string`

,`list`

) —>`bool`

true if the left operand contains one of the elements of the right operand, false otherwise

the definition of contains depends on the container

- if the right operand is nil or empty, contains_any returns false

```
bool var0 <- [1,2,3,4,5,6] contains_any [2,4]; // var0 equals true
bool var1 <- [1,2,3,4,5,6] contains_any [2,8]; // var1 equals true
bool var2 <- [1::2, 3::4, 5::6] contains_any [1,3]; // var2 equals false
bool var3 <- [1::2, 3::4, 5::6] contains_any [2,4]; // var3 equals true
bool var4 <- "abcabcabc" contains_any ["ca","xy"]; // var4 equals true
```

`contains_edge`

`graph`

`contains_edge`

`unknown`

—>`bool`

(`contains_edge`

`graph`

,`unknown`

) —>`bool`

`graph`

`contains_edge`

`pair`

—>`bool`

(`contains_edge`

`graph`

,`pair`

) —>`bool`

returns true if the graph(left-hand operand) contains the given edge (righ-hand operand), false otherwise

- if the left-hand operand is nil, returns false
- if the right-hand operand is a pair, returns true if it exists an edge between the two elements of the pair in the graph

```
bool var2 <- graphEpidemio contains_edge (node(0)::node(3)); // var2 equals true
```

```
graph graphFromMap <- as_edge_graph([{1,5}::{12,45},{12,45}::{34,56}]);
bool var1 <- graphFromMap contains_edge link({1,5},{12,45}); // var1 equals true
```

`contains_vertex`

`graph`

`contains_vertex`

`unknown`

—>`bool`

(`contains_vertex`

`graph`

,`unknown`

) —>`bool`

returns true if the graph(left-hand operand) contains the given vertex (righ-hand operand), false otherwise

- if the left-hand operand is nil, returns false

```
graph graphFromMap<- as_edge_graph([{1,5}::{12,45},{12,45}::{34,56}]);
bool var1 <- graphFromMap contains_vertex {1,5}; // var1 equals true
```

`conversation`

(`conversation`

`unknown`

) —>`conversation`

`convex_hull`

(`convex_hull`

`geometry`

) —>`geometry`

A geometry corresponding to the convex hull of the operand.

```
geometry var0 <- convex_hull(self); // var0 equals the convex hull of the geometry of the agent applying the operator
```

`copy`

(`copy`

`unknown`

) —>`unknown`

returns a copy of the operand.

`copy_between`

(`copy_between`

`list`

,`int`

,`int`

) —>`list`

(`copy_between`

`string`

,`int`

,`int`

) —>`string`

Returns a copy of the first operand between the indexes determined by the second (inclusive) and third operands (exclusive)

- If the first operand is empty, returns an empty object of the same type
- If the second operand is greater than or equal to the third operand, return an empty object of the same type
- If the first operand is nil, raises an error

```
list var0 <- copy_between ([4, 1, 6, 9 ,7], 1, 3); // var0 equals [1, 6]
string var1 <- copy_between("abcabcabc", 2,6); // var1 equals "cabc"
```

`corR`

`container`

`corR`

`container`

—>`unknown`

(`corR`

`container`

,`container`

) —>`unknown`

returns the Pearson correlation coefficient of two given vectors (right-hand operands) in given variable (left-hand operand).

- if the lengths of two vectors in the right-hand aren’t equal, returns 0

```
list X <- [1, 2, 3]; list Y <- [1, 2, 4];
unknown var2 <- corR(X, Y); // var2 equals 0.981980506061966
```

`correlation`

`container`

`correlation`

`container`

—>`float`

(`correlation`

`container`

,`container`

) —>`float`

Returns the correlation of two data sequences

`cos`

(`cos`

`float`

) —>`float`

(`cos`

`int`

) —>`float`

Returns the value (in [-1,1]) of the cosinus of the operand (in decimal degrees). The argument is casted to an int before being evaluated.

- Operand values out of the range [0-359] are normalized.

```
float var0 <- cos (0); // var0 equals 1.0
float var1 <- cos(360); // var1 equals 1.0
float var2 <- cos(-720); // var2 equals 1.0
```

`cos_rad`

(`cos_rad`

`float`

) —>`float`

Returns the value (in [-1,1]) of the cosinus of the operand (in radians).

- Operand values out of the range [0-359] are normalized.

`count`

`container`

`count`

`any expression`

—>`int`

(`count`

`container`

,`any expression`

) —>`int`

returns an int, equal to the number of elements of the left-hand operand that make the right-hand operand evaluate to true.

in the right-hand operand, the keyword each can be used to represent, in turn, each of the elements.

- if the left-hand operand is nil, count throws an error

```
int var0 <- [1,2,3,4,5,6,7,8] count (each > 3); // var0 equals 5// Number of nodes of graph g2 without any out edge graph g2 <- graph([]);
int var3 <- g2 count (length(g2 out_edges_of each) = 0 ) ; // var3 equals the total number of out edges// Number of agents node with x > 32 int n <- (list(node) count (round(node(each).location.x) > 32);
int var6 <- [1::2, 3::4, 5::6] count (each > 4); // var6 equals 1
```

`covariance`

`container`

`covariance`

`container`

—>`float`

(`covariance`

`container`

,`container`

) —>`float`

Returns the covariance of two data sequences

`covers`

`geometry`

`covers`

`geometry`

—>`bool`

(`covers`

`geometry`

,`geometry`

) —>`bool`

A boolean, equal to true if the left-geometry (or agent/point) covers the right-geometry (or agent/point).

- if one of the operand is null, returns false.

```
bool var0 <- square(5) covers square(2); // var0 equals true
```

disjoint_from, crosses, overlaps, partially_overlaps, touches,

`create_map`

`list`

`create_map`

`list`

—>`map`

(`create_map`

`list`

,`list`

) —>`map`

returns a new map using the left operand as keys for the right operand

- if the left operand contains duplicates, create_map throws an error.
- if both operands have different lengths, choose the minimum length between the two operandsfor the size of the map

```
map<int,string> var0 <- create_map([0,1,2],['a','b','c']); // var0 equals [0::'a',1::'b',2::'c']
map<int,float> var1 <- create_map([0,1],[0.1,0.2,0.3]); // var1 equals [0::0.1,1::0.2]
map<string,float> var2 <- create_map(['a','b','c','d'],[1.0,2.0,3.0]); // var2 equals ['a'::1.0,'b'::2.0,'c'::3.0]
```

`cross`

(`cross`

`float`

) —>`geometry`

`float`

`cross`

`float`

—>`geometry`

(`cross`

`float`

,`float`

) —>`geometry`

A cross, which radius is equal to the first operand A cross, which radius is equal to the first operand and the width of the lines for the second

```
geometry var0 <- cross(10); // var0 equals a geometry as a cross of radius 10
geometry var1 <- cross(10,2); // var1 equals a geometry as a cross of radius 10, and with a width of 2 for the lines
```

around, cone, line, link, norm, point, polygon, polyline, super_ellipse, rectangle, square, circle, ellipse, triangle,

`crosses`

`geometry`

`crosses`

`geometry`

—>`bool`

(`crosses`

`geometry`

,`geometry`

) —>`bool`

A boolean, equal to true if the left-geometry (or agent/point) crosses the right-geometry (or agent/point).

- if one of the operand is null, returns false.
- if one operand is a point, returns false.

```
bool var0 <- polyline([{10,10},{20,20}]) crosses polyline([{10,20},{20,10}]); // var0 equals true
bool var1 <- polyline([{10,10},{20,20}]) crosses {15,15}; // var1 equals true
bool var2 <- polyline([{0,0},{25,25}]) crosses polygon([{10,10},{10,20},{20,20},{20,10}]); // var2 equals true
```

disjoint_from, intersects, overlaps, partially_overlaps, touches,

`crs`

(`crs`

`file`

) —>`string`

the Coordinate Reference System (CRS) of the GIS file

```
string var0 <- crs(my_shapefile); // var0 equals the crs of the shapefile
```

`CRS_transform`

(`CRS_transform`

`geometry`

) —>`geometry`

`geometry`

`CRS_transform`

`string`

—>`geometry`

(`CRS_transform`

`geometry`

,`string`

) —>`geometry`

- returns the geometry corresponding to the transformation of the given geometry by the current CRS (Coordinate Reference System), the one corresponding to the world’s agent one

```
geometry var0 <- CRS_transform(shape); // var0 equals a geometry corresponding to the agent geometry transformed into the current CRS
```

- returns the geometry corresponding to the transformation of the given geometry by the left operand CRS (Coordinate Reference System)

```
geometry var1 <- shape CRS_transform("EPSG:4326"); // var1 equals a geometry corresponding to the agent geometry transformed into the EPSG:4326 CRS
```

`csv_file`

(`csv_file`

`string`

) —>`file`

Constructs a file of type csv. Allowed extensions are limited to csv, tsv

`cube`

(`cube`

`float`

) —>`geometry`

A cube geometry which side size is equal to the operand.

the center of the cube is by default the location of the current agent in which has been called this operator.

- returns nil if the operand is nil.

```
geometry var0 <- cube(10); // var0 equals a geometry as a square of side size 10.
```

around, circle, cone, line, link, norm, point, polygon, polyline, rectangle, triangle,

`curve`

(`curve`

`point`

,`point`

,`float`

) —>`geometry`

(`curve`

`point`

,`point`

,`point`

) —>`geometry`

(`curve`

`point`

,`point`

,`float`

,`bool`

) —>`geometry`

(`curve`

`point`

,`point`

,`point`

,`int`

) —>`geometry`

(`curve`

`point`

,`point`

,`point`

,`point`

) —>`geometry`

(`curve`

`point`

,`point`

,`float`

,`float`

) —>`geometry`

(`curve`

`point`

,`point`

,`point`

,`point`

,`int`

) —>`geometry`

(`curve`

`point`

,`point`

,`float`

,`int`

,`float`

) —>`geometry`

(`curve`

`point`

,`point`

,`float`

,`bool`

,`int`

) —>`geometry`

(`curve`

`point`

,`point`

,`float`

,`bool`

,`int`

,`float`

) —>`geometry`

(`curve`

`point`

,`point`

,`float`

,`int`

,`float`

,`float`

) —>`geometry`

A cubic Bezier curve geometry built from the two given points with the given coefficient for the radius and composed of 10 points - the last boolean is used to specified if it is the right side. A quadratic Bezier curve geometry built from the three given points composed of a given numnber of points. A cubic Bezier curve geometry built from the two given points with the given coefficient for the radius and composed of 10 points. A cubic Bezier curve geometry built from the four given points composed of 10 points. A cubic Bezier curve geometry built from the two given points with the given coefficient for the radius and composed of the given number of points - the boolean is used to specified if it is the right side and the last value to indicate where is the inflection point (between 0.0 and 1.0 - default 0.5). A cubic Bezier curve geometry built from the two given points with the given coefficient for the radius considering the given rotation angle (90 = along the z axis). A quadratic Bezier curve geometry built from the three given points composed of 10 points. A cubic Bezier curve geometry built from the four given points composed of a given number of points. A cubic Bezier curve geometry built from the two given points with the given coefficient for the radius and composed of the given number of points, considering the given rotation angle (90 = along the z axis). A cubic Bezier curve geometry built from the two given points with the given coefficient for the radius and composed of the given number of points, considering the given inflection point (between 0.0 and 1.0 - default 0.5), and the given rotation angle (90 = along the z axis). A cubic Bezier curve geometry built from the two given points with the given coefficient for the radius and composed of the given number of points - the boolean is used to specified if it is the right side.

- if the operand is nil, returns nil
- if the operand is nil, returns nil
- if the last operand (number of points) is inferior to 2, returns nil
- if the operand is nil, returns nil
- if the operand is nil, returns nil
- if the operand is nil, returns nil
- if the operand is nil, returns nil
- if the operand is nil, returns nil
- if the operand is nil, returns nil
- if the last operand (number of points) is inferior to 2, returns nil
- if the operand is nil, returns nil
- if the operand is nil, returns nil
- if the operand is nil, returns nil

```
geometry var0 <- curve({0,0},{10,10}, 0.5, false); // var0 equals a cubic Bezier curve geometry composed of 10 points from p0 to p1 at the left side.
geometry var1 <- curve({0,0}, {0,10}, {10,10}, 20); // var1 equals a quadratic Bezier curve geometry composed of 20 points from p0 to p2.
geometry var2 <- curve({0,0},{10,10}, 0.5); // var2 equals a cubic Bezier curve geometry composed of 10 points from p0 to p1.
geometry var3 <- curve({0,0}, {0,10}, {10,10}); // var3 equals a cubic Bezier curve geometry composed of 10 points from p0 to p3.
geometry var4 <- curve({0,0},{10,10}, 0.5, false, 100, 0.8); // var4 equals a cubic Bezier curve geometry composed of 100 points from p0 to p1 at the right side.
geometry var5 <- curve({0,0},{10,10}, 0.5, 90); // var5 equals a cubic Bezier curve geometry composed of 100 points from p0 to p1 at the right side.
geometry var6 <- curve({0,0}, {0,10}, {10,10}); // var6 equals a quadratic Bezier curve geometry composed of 10 points from p0 to p2.
geometry var7 <- curve({0,0}, {0,10}, {10,10}); // var7 equals a cubic Bezier curve geometry composed of 10 points from p0 to p3.
geometry var8 <- curve({0,0},{10,10}, 0.5, 100, 90); // var8 equals a cubic Bezier curve geometry composed of 100 points from p0 to p1 at the right side.
geometry var9 <- curve({0,0},{10,10}, 0.5, 100, 0.8, 90); // var9 equals a cubic Bezier curve geometry composed of 100 points from p0 to p1 at the right side.
geometry var10 <- curve({0,0},{10,10}, 0.5, false, 100); // var10 equals a cubic Bezier curve geometry composed of 100 points from p0 to p1 at the right side.
```

around, circle, cone, link, norm, point, polygone, rectangle, square, triangle, line,

`cylinder`

`float`

`cylinder`

`float`

—>`geometry`

(`cylinder`

`float`

,`float`

) —>`geometry`

A cylinder geometry which radius is equal to the operand.

the center of the cylinder is by default the location of the current agent in which has been called this operator.

- returns a point if the operand is lower or equal to 0.

```
geometry var0 <- cylinder(10,10); // var0 equals a geometry as a circle of radius 10.
```

around, cone, line, link, norm, point, polygon, polyline, rectangle, square, triangle,