# Adaptable Binary Predicate

Category: functors | Component type: concept

### Description

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

### Refinement of

Predicate, Adaptable Binary Function

### Associated types

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

### Notation

### Definitions

### Valid expressions

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

### Expression semantics

### Complexity guarantees

### Invariants

### Models

- `less`
- `equal_to`
- `logical_and`
- `logical_or`
- `binary_negate`

### Notes

### See also

Binary Predicate, Predicate, Adaptable Predicate

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