45 lines
1.1 KiB
Plaintext
45 lines
1.1 KiB
Plaintext
---
|
|
layout: docs
|
|
page_title: setunion - Functions - Configuration Language
|
|
sidebar_title: 'setunion'
|
|
sidebar_current: configuration-functions-collection-setunion
|
|
description: |-
|
|
The setunion function takes multiple sets and produces a single set
|
|
containing the elements from all of the given sets.
|
|
---
|
|
|
|
# `setunion` Function
|
|
|
|
The `setunion` function takes multiple sets and produces a single set
|
|
containing the elements from all of the given sets. In other words, it
|
|
computes the [union](<https://en.wikipedia.org/wiki/Union_(set_theory)>) of
|
|
the sets.
|
|
|
|
```hcl
|
|
setunion(sets...)
|
|
```
|
|
|
|
## Examples
|
|
|
|
```
|
|
> setunion(["a", "b"], ["b", "c"], ["d"])
|
|
[
|
|
"d",
|
|
"b",
|
|
"c",
|
|
"a",
|
|
]
|
|
```
|
|
|
|
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
|
|
|
|
- [`contains`](./contains.html) tests whether a given list or set contains
|
|
a given element value.
|
|
- [`setintersection`](./setintersection.html) computes the _intersection_ of
|
|
multiple sets.
|
|
- [`setproduct`](./setproduct.html) computes the _Cartesian product_ of multiple
|
|
sets.
|