# std::barrier<CompletionFunction>::arrive_and_drop

> C++ Atlas: `cppatlas.com/w/cpp/thread/barrier/arrive_and_drop` | Source: https://en.cppreference.com/w/cpp/thread/barrier/arrive_and_drop | Domain: Concurrency support | Standards: C++20

Decrements the initial expected count for all subsequent phases by one, and then decrements the expected count for the current phase by one.

## Official Specification Summary (cppreference)

```cpp
void arrive_and_drop(); // (since C++20)
```

Decrements the initial expected count for all subsequent phases by one, and then decrements the expected count for the current phase by one.

This function is executed atomically. The call to this function strongly happens-before the start of the phase completion step for the current phase.

The behavior is undefined if the expected count for the current phase is zero.

### Parameters

(none)

### Return value

(none)

### Exceptions

Throws `std::system_error` with an error code allowed for mutex types on error.

### Notes

This function can cause the completion step for the current phase to start.

If the current expected count is zero before calling this function, the initial expected count for all subsequent phases is also zero, which means the `barrier` cannot be reused.

### Example

> Note: This section is incomplete Reason: no example

---
Attribution: content from https://en.cppreference.com/w/cpp/thread/barrier/arrive_and_drop (cppreference.com), licensed under CC-BY-SA 3.0 and GFDL. Modified: converted to markdown, study notes added. Offline snapshot of 9 February 2025.