2019-01-15 20:51:21 +01:00
|
|
|
---
|
2021-11-23 00:57:25 +01:00
|
|
|
layout: "language"
|
|
|
|
page_title: "setintersection - Functions - Configuration Language"
|
|
|
|
sidebar_current: "docs-funcs-collection-setintersection"
|
2019-01-15 20:51:21 +01:00
|
|
|
description: |-
|
|
|
|
The setintersection function takes multiple sets and produces a single set
|
|
|
|
containing only the elements that all of the given sets have in common.
|
|
|
|
---
|
|
|
|
|
|
|
|
# `setintersection` Function
|
|
|
|
|
|
|
|
The `setintersection` function takes multiple sets and produces a single set
|
|
|
|
containing only the elements that all of the given sets have in common.
|
|
|
|
In other words, it computes the
|
2021-11-23 00:57:25 +01:00
|
|
|
[intersection](https://en.wikipedia.org/wiki/Intersection_(set_theory)) of the sets.
|
2019-01-15 20:51:21 +01:00
|
|
|
|
|
|
|
```hcl
|
|
|
|
setintersection(sets...)
|
|
|
|
```
|
|
|
|
|
|
|
|
## Examples
|
|
|
|
|
|
|
|
```
|
|
|
|
> setintersection(["a", "b"], ["b", "c"], ["b", "d"])
|
|
|
|
[
|
|
|
|
"b",
|
|
|
|
]
|
|
|
|
```
|
|
|
|
|
|
|
|
The given arguments are converted to sets, so the result is also a set and
|
|
|
|
the ordering of the given elements is not preserved.
|
|
|
|
|
|
|
|
## Related Functions
|
|
|
|
|
2021-11-23 00:57:25 +01:00
|
|
|
* [`contains`](./contains.html) tests whether a given list or set contains
|
2019-01-15 20:51:21 +01:00
|
|
|
a given element value.
|
2021-11-23 00:57:25 +01:00
|
|
|
* [`setproduct`](./setproduct.html) computes the _Cartesian product_ of multiple
|
2019-01-15 20:51:21 +01:00
|
|
|
sets.
|
2021-11-23 00:57:25 +01:00
|
|
|
* [`setsubtract`](./setsubtract.html) computes the _relative complement_ of two sets
|
|
|
|
* [`setunion`](./setunion.html) computes the _union_ of
|
2019-01-15 20:51:21 +01:00
|
|
|
multiple sets.
|