[
https://issues.apache.org/jira/browse/STDCXX-138?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Martin Sebor updated STDCXX-138:
--------------------------------
Affects Version/s: 4.2.0
Fix Version/s: (was: 4.2.1)
4.3
Like STDCXX-139, this also seems too big to do in the 4.2.1 timeframe. Deferred.
> algorithms complexity tests not strict enough
> ---------------------------------------------
>
> Key: STDCXX-138
> URL: https://issues.apache.org/jira/browse/STDCXX-138
> Project: C++ Standard Library
> Issue Type: Improvement
> Components: Tests
> Affects Versions: 4.1.3, 4.1.4, 4.2.0
> Environment: all
> Reporter: Anton Pevtsov
> Priority: Minor
> Fix For: 4.3
>
>
> Affects tests for sort, stable_sort, partial_sort, partial_sort_copy,
> nth_element, etc algorithms where the complexity is O(f(N)), where N is the
> length of the test sequence, f(N) - some function of N: log N, N log N, N.
> It is necessary to investigate each algorithm to find the worst case for it
> and use the complexity on this worst sequence as the upper bound in tests.
> Currently "magic" coefficients are used.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
