Buffered variant of TagSort, which accepts preallocated output arrays as well as special structure for buffered allocations. If arrays are too short,

Same as TagSort, but optimized for real keys without labels. A is sorted, and that's all. NOTES: 1. this function assumes that A[] is finite; it do

Internal TagSortFastI: sorts A[I1...I2] (both bounds are included), applies same permutations to B. -- ALGLIB -- Copyright 06.09.2010 by Bochk

Internal TagSortFastI: sorts A[I1...I2] (both bounds are included), applies same permutations to B. -- ALGLIB -- Copyright 06.09.2010 by Bochk

Internal TagSortFastR: sorts A[I1...I2] (both bounds are included), applies same permutations to B. -- ALGLIB -- Copyright 06.09.2010 by Bochk

Unserialization: complex value *************************************************************************/

Tail(S, 10) *************************************************************************/

Tail(S, 11) *************************************************************************/

Tail(S, 12) *************************************************************************/

Tail(S, 120) *************************************************************************/

Tail(S, 13) *************************************************************************/

Tail(S, 14) *************************************************************************/

Tail(S, 15) *************************************************************************/

Tail(S, 16) *************************************************************************/

Tail(S, 17) *************************************************************************/

Tail(S, 18) *************************************************************************/

Tail(S, 19) *************************************************************************/

Tail(S, 20) *************************************************************************/

Tail(S, 200) *************************************************************************/

Tail(S, 21) *************************************************************************/

Tail(S, 22) *************************************************************************/

Tail(S, 23) *************************************************************************/

Tail(S, 24) *************************************************************************/

Tail(S, 25) *************************************************************************/

Tail(S, 26) *************************************************************************/

Tail(S, 27) *************************************************************************/

Tail(S, 28) *************************************************************************/

Tail(S, 29) *************************************************************************/

Tail(S, 40) *************************************************************************/

Tail(S, 5) *************************************************************************/

Tail(S, 6) *************************************************************************/

Tail(S, 60) *************************************************************************/

Tail(S, 7) *************************************************************************/

Tail(S, 8) *************************************************************************/

Tail(S, 9) *************************************************************************/

More precise complex dot-product. Absolute error of subroutine result is about 1 ulp of max(MX,V), where: MX = max( |a[i]*b[i]| ) V = |(a,b

A convenient wrapper for adding an environment for the test program. You should call this before RUN_ALL_TESTS() is called, probably in main(). If y

INSTANTIATE_TEST_CASE_P macro uses AddGenerator() to record information about a generator.

Adds a TestInfo to the unit test. Arguments: set_up_tc: pointer to the function that sets up the test case tear_down_tc: pointer to the function

TEST_P macro uses AddTestPattern() to record information about a single test in a LocalTestInfo structure. test_case_name is the base name of the test

Advance should not be called on beyond-of-range iterators so no component iterators must be beyond end of range, either.

Advance should not be called on beyond-of-range iterators so no component iterators must be beyond end of range, either.

Advance should not be called on beyond-of-range iterators so no component iterators must be beyond end of range, either.

Advance should not be called on beyond-of-range iterators so no component iterators must be beyond end of range, either.

Advance should not be called on beyond-of-range iterators so no component iterators must be beyond end of range, either.

Advance should not be called on beyond-of-range iterators so no component iterators must be beyond end of range, either.

Advance should not be called on beyond-of-range iterators so no component iterators must be beyond end of range, either.

Advance should not be called on beyond-of-range iterators so no component iterators must be beyond end of range, either.

Advance should not be called on beyond-of-range iterators so no component iterators must be beyond end of range, either.

Creates a UTF-16 wide string from the given ANSI string, allocating memory using new. The caller is responsible for deleting the return value using de

Appends a TestPartResult to the array.

Does nothing if the current thread holds the mutex. Otherwise, crashes with high probability.

AssertHelper constructor.

AssertionResult constructors. Used in EXPECT_TRUE/FALSE(assertion_result).

The AssumeRole process for a Windows death test. It creates a child process with the same executable as the current process to run the death test. T