# Adaptable Predicate

Category: functors | Component type: concept

### Description

An Adaptable Predicate is a Predicate that is also an Adaptable Unary Function. That is, it is a Unary Function whose return type is `bool`, and that includes nested `typedef`s that define its argument type and return type.

### Refinement of

Predicate, Adaptable Unary Function

### Associated types

None, except for those associated with Predicate and Adaptable Unary Function.

### Notation

### Definitions

### Valid expressions

None, except for those defined by the Predicate and Adaptable Unary Function requirements.

### Expression semantics

### Complexity guarantees

### Invariants

### Models

- `logical_not`
- `unary_negate`

### Notes

### See also

Predicate, Binary Predicate, Adaptable Binary Predicate

Copyright © 1999 Silicon Graphics, Inc. All Rights Reserved. TrademarkInformation