Home
last modified time | relevance | path

Searched refs:complexity (Results 1 - 25 of 51) sorted by relevance

123

/third_party/benchmark/src/
H A Dcomplexity.cc18 #include "complexity.h"
29 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
31 switch (complexity) { in FittingCurve()
53 // Function to return an string for the calculated complexity
54 std::string GetBigOString(BigO complexity) {
55 switch (complexity) {
99 result.complexity = oLambda;
101 // Calculate complexity.
122 // - complexity : If different than oAuto, the fitting curve will stick to
126 const std::vector<double>& time, const BigO complexity) {
[all...]
H A Dcomplexity.h37 // - complexity : Scalability form (e.g. oN, oNLogN). In case a scalability
43 LeastSq() : coef(0.0), rms(0.0), complexity(oNone) {} in LeastSq()
47 BigO complexity; member
50 // Function to return an string for the calculated complexity
51 std::string GetBigOString(BigO complexity);
H A Dbenchmark_register.cc43 #include "complexity.h"
421 Benchmark* Benchmark::Complexity(BigO complexity) { in Complexity() argument
422 complexity_ = complexity; in Complexity()
426 Benchmark* Benchmark::Complexity(BigOFunc* complexity) { in Complexity() argument
427 complexity_lambda_ = complexity; in Complexity()
H A Dbenchmark_api_internal.h34 BigO complexity() const { return complexity_; } in complexity() function in benchmark::internal::BenchmarkInstance
H A Dcsv_reporter.cc24 #include "complexity.h"
130 Out << GetBigOString(run.complexity); in PrintRunData()
/third_party/skia/src/core/
H A DSkPathComplexityDfx.cpp37 void SkPathComplexityDfx::AddPathComplexityTrace(SkScalar complexity) in AddPathComplexityTrace() argument
40 HITRACE_OHOS_NAME_FMT_ALWAYS("Path Complexity Debug: %f", complexity); in AddPathComplexityTrace()
54 SkScalar complexity = 0.f; in ShowPathComplexityDfx() local
56 compute_complexity(path, avgLength, complexity); in ShowPathComplexityDfx()
57 std::string message = std::to_string(complexity).substr(0, MESSAGE_SIZE); in ShowPathComplexityDfx()
H A DSkScan_AntiPath.cpp613 void compute_complexity(const SkPath& path, SkScalar& avgLength, SkScalar& complexity) {
617 avgLength = complexity = -1;
639 complexity = sk_ieee_float_divide(intersections, path.getBounds().height());
641 if (sk_float_isnan(complexity)) { // it may be possible to have 0.0 / 0.0; inf is fine for us.
642 complexity = -1;
646 static bool ShouldUseAAA(const SkPath& path, SkScalar avgLength, SkScalar complexity) {
679 SkPathComplexityDfx::AddPathComplexityTrace(complexity);
681 // We will use AAA if the number of verbs < kSampleSize and therefore complexity < 0
682 return complexity < kComplexityThreshold;
798 SkScalar avgLength, complexity;
[all...]
H A DSkPathComplexityDfx.h30 static void AddPathComplexityTrace(SkScalar complexity);
35 void compute_complexity(const SkPath& path, SkScalar& avgLength, SkScalar& complexity);
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/units/
H A DMeasureUnitImpl.java24 * The complexity, either SINGLE, COMPOUND, or MIXED.
26 private MeasureUnit.Complexity complexity = MeasureUnit.Complexity.SINGLE; field in MeasureUnitImpl
29 * value of the complexity field.
68 result.complexity = this.complexity; in copy()
87 // This `for` loop will cause time complexity to be O(n^2). in copyAndSimplify()
190 // more than one. thus means the complexity should be `UMEASURE_UNIT_COMPOUND` in appendSingleUnit()
191 if (this.singleUnits.size() > 1 && this.complexity == MeasureUnit.Complexity.SINGLE) { in appendSingleUnit()
230 return complexity; in getComplexity()
233 public void setComplexity(MeasureUnit.Complexity complexity) { in setComplexity() argument
[all...]
/third_party/icu/icu4c/source/i18n/
H A Dmeasunit_extra.cpp589 UMeasureUnitComplexity complexity =
592 // After appending two singleUnits, the complexity will be `UMEASURE_UNIT_COMPOUND`
593 U_ASSERT(result.complexity == UMEASURE_UNIT_COMPOUND);
594 result.complexity = complexity;
595 } else if (result.complexity != complexity) {
1036 // The following `for` loop will cause time complexity to be O(n^2).
1091 // contains more than one. thus means the complexity should be `UMEASURE_UNIT_COMPOUND`
1093 this->complexity
[all...]
H A Dunits_converter.cpp256 if (unit.complexity != UMEASURE_UNIT_SINGLE) {
469 if (source.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED ||
470 target.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) {
522 if (this->conversionRate_.source.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED ||
523 this->conversionRate_.target.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) {
548 if (firstUnit.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED ||
549 secondUnit.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) {
/third_party/node/deps/icu-small/source/i18n/
H A Dmeasunit_extra.cpp589 UMeasureUnitComplexity complexity =
592 // After appending two singleUnits, the complexity will be `UMEASURE_UNIT_COMPOUND`
593 U_ASSERT(result.complexity == UMEASURE_UNIT_COMPOUND);
594 result.complexity = complexity;
595 } else if (result.complexity != complexity) {
1036 // The following `for` loop will cause time complexity to be O(n^2).
1091 // contains more than one. thus means the complexity should be `UMEASURE_UNIT_COMPOUND`
1093 this->complexity
[all...]
H A Dunits_converter.cpp256 if (unit.complexity != UMEASURE_UNIT_SINGLE) {
477 if (source.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED ||
478 target.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) {
530 if (this->conversionRate_.source.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED ||
531 this->conversionRate_.target.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) {
556 if (firstUnit.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED ||
557 secondUnit.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) {
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dmeasunit_extra.cpp593 UMeasureUnitComplexity complexity =
596 // After appending two singleUnits, the complexity will be `UMEASURE_UNIT_COMPOUND`
597 U_ASSERT(result.complexity == UMEASURE_UNIT_COMPOUND);
598 result.complexity = complexity;
599 } else if (result.complexity != complexity) {
1025 // contains more than one. thus means the complexity should be `UMEASURE_UNIT_COMPOUND`
1027 this->complexity == UMeasureUnitComplexity::UMEASURE_UNIT_SINGLE) {
1028 this->complexity
[all...]
H A Dunits_converter.cpp255 if (unit.complexity != UMEASURE_UNIT_SINGLE) {
462 if (source.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED ||
463 target.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) {
515 if (this->conversionRate_.source.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED ||
516 this->conversionRate_.target.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) {
541 if (firstUnit.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED ||
542 secondUnit.complexity == UMeasureUnitComplexity::UMEASURE_UNIT_MIXED) {
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/ubo/
H A DvktRandomUniformBlockCase.cpp165 void RandomUniformBlockCase::generateUniform (de::Random& rnd, UniformBlock& block, deUint32 complexity) in generateUniform() argument
172 VarType type = generateType(rnd, 0, true, complexity); in generateUniform()
182 VarType RandomUniformBlockCase::generateType (de::Random& rnd, int typeDepth, bool arrayOk, deUint32 complexity) in generateType() argument
197 memberTypes.push_back(generateType(rnd, typeDepth+1, true, complexity)); in generateType()
220 if (complexity * arrayLength >= 70) in generateType()
226 VarType elementType = generateType(rnd, typeDepth, arraysOfArraysOk, complexity * arrayLength); in generateType()
H A DvktRandomUniformBlockCase.hpp76 void generateUniform (de::Random& rnd, UniformBlock& block, deUint32 complexity);
77 VarType generateType (de::Random& rnd, int typeDepth, bool arrayOk, deUint32 complexity);
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/ubo/
H A DvktRandomUniformBlockCase.cpp166 void RandomUniformBlockCase::generateUniform (de::Random& rnd, UniformBlock& block, deUint32 complexity) in generateUniform() argument
173 VarType type = generateType(rnd, 0, true, complexity); in generateUniform()
183 VarType RandomUniformBlockCase::generateType (de::Random& rnd, int typeDepth, bool arrayOk, deUint32 complexity) in generateType() argument
198 memberTypes.push_back(generateType(rnd, typeDepth+1, true, complexity)); in generateType()
221 if (complexity * arrayLength >= 70) in generateType()
227 VarType elementType = generateType(rnd, typeDepth, arraysOfArraysOk, complexity * arrayLength); in generateType()
H A DvktRandomUniformBlockCase.hpp77 void generateUniform (de::Random& rnd, UniformBlock& block, deUint32 complexity);
78 VarType generateType (de::Random& rnd, int typeDepth, bool arrayOk, deUint32 complexity);
/third_party/ffmpeg/libavcodec/
H A Dlibspeexenc.c55 * Encoding complexity is controlled by setting avctx->compression_level.
134 av_log(avctx, AV_LOG_DEBUG, "complexity: %d\n", in print_enc_params()
153 int32_t complexity; in encode_init() local
228 /* set encoding complexity */ in encode_init()
230 complexity = av_clip(avctx->compression_level, 0, 10); in encode_init()
231 speex_encoder_ctl(s->enc_state, SPEEX_SET_COMPLEXITY, &complexity); in encode_init()
233 speex_encoder_ctl(s->enc_state, SPEEX_GET_COMPLEXITY, &complexity); in encode_init()
234 avctx->compression_level = complexity; in encode_init()
H A Dlibopusenc.c40 int complexity; member
132 OPUS_SET_COMPLEXITY(opts->complexity)); in libopus_configure_encoder()
135 "Unable to set complexity: %s\n", opus_strerror(ret)); in libopus_configure_encoder()
309 opus->opts.complexity = 10; in libopus_encode_init()
311 opus->opts.complexity = avctx->compression_level; in libopus_encode_init()
/third_party/rust/crates/clap/clap_derive/src/derives/
H A Dinto_app.rs35 clippy::complexity, in gen_for_struct()
75 clippy::complexity, in gen_for_enum()
H A Dvalue_enum.rs57 clippy::complexity, in gen_for_enum()
/third_party/lzma/CPP/7zip/Archive/7z/
H A D7zUpdate.cpp1861 UInt64 complexity = 0; in Update() local
1955 complexity += db->GetFolderFullPackSize(i); in Update()
1961 complexity += repackSize; in Update()
1980 complexity += ui.Size; in Update()
1992 RINOK(updateCallback->SetTotal(complexity)) in Update()
2891 if (skippedSize != 0 && complexity >= skippedSize) in Update()
2893 complexity -= skippedSize; in Update()
2894 RINOK(updateCallback->SetTotal(complexity)) in Update()
/third_party/benchmark/bindings/python/google_benchmark/
H A Dexample.py128 @benchmark.option.complexity(benchmark.oN)

Completed in 24 milliseconds

123