A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://sgistl.github.io/AdaptableBinaryFunction.html below:

Adaptable Binary Function

Adaptable Binary Function Description An Adaptable Binary Function is a Binary Function with nested typedefs that define its argument types and result type. [1] [2] These nested typedefs make it possible to use function object adaptors. Refinement ofBinary Function Associated types First argument type F::first_argument_type The type of F's first argument Second argument type F::second_argument_type The type of F's second argument Result type F::result_type The type returned when the Binary Function is called Notation F A type that is a model of Binary Function Definitions Valid expressions None, except for those defined by Binary Function Expression semantics Complexity guarantees Invariants Models Notes

[1] Note the implication of this: a function pointer T (*f)(X,Y) is a Binary Function, but not an Adaptable Binary Function: the expressions f::first_argument_type, f::second_argument_type, and f::result_type are nonsensical.

[2] When you define a class that is a model of Adaptable Binary Function, you must provide these typedefs. The easiest way to do this is to derive the class from the base class binary_function. This is an empty class, with no member functions or member variables; the only reason it exists is to make defining Adaptable Binary Functions more convenient. Binary_function is very similar to the base classes used by the iterator tag functions.

See alsoBinary Function, Adaptable Generator, Adaptable Unary Function STL Main Page

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4