mirror of
https://github.com/yse/easy_profiler.git
synced 2024-12-27 00:21:11 +08:00
Add math functions for calculation complexity
This commit is contained in:
parent
59f04384be
commit
2232407685
@ -77,6 +77,7 @@
|
|||||||
#include "arbitrary_value_inspector.h"
|
#include "arbitrary_value_inspector.h"
|
||||||
#include "treeview_first_column_delegate.h"
|
#include "treeview_first_column_delegate.h"
|
||||||
#include "globals.h"
|
#include "globals.h"
|
||||||
|
#include "easy_complexity_calculator.h"
|
||||||
|
|
||||||
//////////////////////////////////////////////////////////////////////////
|
//////////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
@ -95,18 +95,6 @@ enum class FilterType : uint8_t
|
|||||||
Median,
|
Median,
|
||||||
};
|
};
|
||||||
|
|
||||||
enum class ComplexityType : uint8_t
|
|
||||||
{
|
|
||||||
Constant = 0, ///< O(1)
|
|
||||||
Logarithmic, ///< O(logN)
|
|
||||||
Linear, ///< O(N)
|
|
||||||
Quasilinear, ///< O(N*logN)
|
|
||||||
Quadratic, ///< O(N^2)
|
|
||||||
Cubic, ///< O(N^3)
|
|
||||||
Exponential, ///< O(2^N)
|
|
||||||
Factorial, ///< O(N!)
|
|
||||||
};
|
|
||||||
|
|
||||||
enum class ChartPenStyle : uint8_t
|
enum class ChartPenStyle : uint8_t
|
||||||
{
|
{
|
||||||
Line = 0,
|
Line = 0,
|
||||||
|
126
profiler_gui/easy_complexity_calculator.h
Normal file
126
profiler_gui/easy_complexity_calculator.h
Normal file
@ -0,0 +1,126 @@
|
|||||||
|
/**
|
||||||
|
Lightweight profiler library for c++
|
||||||
|
Copyright(C) 2016-2018 Sergey Yagovtsev, Victor Zarubkin
|
||||||
|
|
||||||
|
Licensed under either of
|
||||||
|
* MIT license (LICENSE.MIT or http://opensource.org/licenses/MIT)
|
||||||
|
* Apache License, Version 2.0, (LICENSE.APACHE or http://www.apache.org/licenses/LICENSE-2.0)
|
||||||
|
at your option.
|
||||||
|
|
||||||
|
The MIT License
|
||||||
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||||
|
of this software and associated documentation files (the "Software"), to deal
|
||||||
|
in the Software without restriction, including without limitation the rights
|
||||||
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
|
||||||
|
of the Software, and to permit persons to whom the Software is furnished
|
||||||
|
to do so, subject to the following conditions:
|
||||||
|
|
||||||
|
The above copyright notice and this permission notice shall be included in all
|
||||||
|
copies or substantial portions of the Software.
|
||||||
|
|
||||||
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
|
||||||
|
INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
|
||||||
|
PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
||||||
|
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
|
||||||
|
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
||||||
|
USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||||
|
|
||||||
|
|
||||||
|
The Apache License, Version 2.0 (the "License");
|
||||||
|
You may not use this file except in compliance with the License.
|
||||||
|
You may obtain a copy of the License at
|
||||||
|
|
||||||
|
http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
|
||||||
|
Unless required by applicable law or agreed to in writing, software
|
||||||
|
distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
See the License for the specific language governing permissions and
|
||||||
|
limitations under the License.
|
||||||
|
|
||||||
|
**/
|
||||||
|
|
||||||
|
#ifndef EASY_COMPLEXITY_CALCULATOR_H
|
||||||
|
#define EASY_COMPLEXITY_CALCULATOR_H
|
||||||
|
|
||||||
|
#include <map>
|
||||||
|
#include <vector>
|
||||||
|
#include <functional>
|
||||||
|
#include <cmath>
|
||||||
|
#include <numeric>
|
||||||
|
|
||||||
|
enum class ComplexityType : uint8_t
|
||||||
|
{
|
||||||
|
Constant = 0, ///< O(1)
|
||||||
|
Logarithmic, ///< O(logN)
|
||||||
|
Linear, ///< O(N)
|
||||||
|
Quasilinear, ///< O(N*logN)
|
||||||
|
Quadratic, ///< O(N^2)
|
||||||
|
Cubic, ///< O(N^3)
|
||||||
|
Exponential, ///< O(2^N)
|
||||||
|
Factorial, ///< O(N!)
|
||||||
|
Unknown, ///< cannot estimate
|
||||||
|
};
|
||||||
|
|
||||||
|
template<class TValue>
|
||||||
|
TValue getAverage(const std::vector<TValue>& derivatives) {
|
||||||
|
TValue result = std::accumulate(derivatives.begin(), derivatives.end(), TValue(0.0), [](TValue a, TValue b){
|
||||||
|
if(std::isnormal(b)) {
|
||||||
|
return a + b;
|
||||||
|
}
|
||||||
|
return a;
|
||||||
|
});
|
||||||
|
return result / TValue(derivatives.size());
|
||||||
|
}
|
||||||
|
|
||||||
|
template<class TKey, class TValue>
|
||||||
|
std::vector<TValue> calculateDerivatives(const std::map<TKey, TValue>& input_array) {
|
||||||
|
std::vector<TValue> result;
|
||||||
|
for(auto it = input_array.cbegin(), next_it = input_array.cbegin()++; next_it != input_array.cend();it = next_it, ++next_it) {
|
||||||
|
auto x0 = it->first;
|
||||||
|
auto x1 = next_it->first;
|
||||||
|
|
||||||
|
auto y0 = it->second;
|
||||||
|
auto y1 = next_it->second;
|
||||||
|
|
||||||
|
result.push_back((y1-y0)/(x1-x0));
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
template<class TKey, class TValue>
|
||||||
|
std::map<TValue, TValue> getLogarithmicChart(const std::map<TKey, std::vector<TValue> >& input) {
|
||||||
|
std::map<TValue, TValue> result;
|
||||||
|
for(auto it: input) {
|
||||||
|
result[static_cast<TValue>(std::log2(it.first))] = std::log2(getAverage(it.second));
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class TKey, class TValue>
|
||||||
|
ComplexityType estimateComplexity(const std::map<TKey, std::vector<TValue> >& input) {
|
||||||
|
auto average = getAverage(calculateDerivatives(getLogarithmicChart(input)));
|
||||||
|
|
||||||
|
double estimate_angle = std::atan(double(average))*57.3;
|
||||||
|
if(estimate_angle < 1.0) {
|
||||||
|
return ComplexityType::Constant;
|
||||||
|
}else if (estimate_angle < 10.0) {
|
||||||
|
return ComplexityType::Logarithmic;
|
||||||
|
}else if (estimate_angle < 30.0) {
|
||||||
|
return ComplexityType::Linear;
|
||||||
|
}else if (estimate_angle < 50.0) {
|
||||||
|
return ComplexityType::Quasilinear;
|
||||||
|
}else if (estimate_angle < 65.0) {
|
||||||
|
return ComplexityType::Quadratic;
|
||||||
|
}else if (estimate_angle < 70.0) {
|
||||||
|
return ComplexityType::Cubic;
|
||||||
|
}else if (estimate_angle < 85.0) {
|
||||||
|
return ComplexityType::Exponential;
|
||||||
|
}else{
|
||||||
|
return ComplexityType::Factorial;
|
||||||
|
}
|
||||||
|
|
||||||
|
return ComplexityType::Unknown;
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
Loading…
x
Reference in New Issue
Block a user