Home
last modified time | relevance | path

Searched refs:complexity (Results 1 – 25 of 7325) sorted by relevance

12345678910>>...293

/dports/devel/lua-luacheck/luacheck-4e5774169fa/spec/
H A Dcyclomatic_complexity_spec.lua10 … {code = "561", line = 1, column = 1, end_column = 1, complexity = 1, function_type = "main_chunk"}
16 … {code = "561", line = 1, column = 1, end_column = 1, complexity = 1, function_type = "main_chunk"}
30 … {code = "561", line = 1, column = 1, end_column = 1, complexity = 2, function_type = "main_chunk"}
42 … {code = "561", line = 1, column = 1, end_column = 1, complexity = 2, function_type = "main_chunk"}
56 … {code = "561", line = 1, column = 1, end_column = 1, complexity = 2, function_type = "main_chunk"}
68 … {code = "561", line = 1, column = 1, end_column = 1, complexity = 2, function_type = "main_chunk"}
80 … {code = "561", line = 1, column = 1, end_column = 1, complexity = 2, function_type = "main_chunk"}
92 … {code = "561", line = 1, column = 1, end_column = 1, complexity = 2, function_type = "main_chunk"}
121 … {code = "561", line = 1, column = 8, end_column = 17, complexity = 1,function_type = "function"},
124 … {code = "561", line = 3, column = 8, end_column = 21, complexity = 1, function_type = "function",
[all …]
/dports/devel/py-mccabe/mccabe-0.6.1/
H A Dtest_mccabe.py138 self.assertEqual(complexity, max)
143 self.assertEqual(complexity, max)
153 self.assertEqual(complexity, 1)
163 self.assertEqual(complexity, 3)
168 self.assertEqual(complexity, 2)
173 self.assertEqual(complexity, 2)
177 self.assertEqual(complexity, 2)
181 self.assertEqual(complexity, 3)
192 self.assertEqual(complexity, 1)
202 self.assertEqual(complexity, 3)
[all …]
/dports/graphics/ogre3d19/sinbad-ogre-dd30349ea667/Samples/Water/src/
H A DWaterMesh.cpp25 this->complexity = inComplexity ; in WaterMesh()
26 numFaces = 2 * complexity * complexity; in WaterMesh()
27 numVertices = (complexity + 1) * (complexity + 1) ; in WaterMesh()
80 for(y=0;y<=complexity;y++) { in WaterMesh()
81 for(x=0;x<=complexity;x++) { in WaterMesh()
82 texcoordsBufData[2*(y*(complexity+1)+x)+0] = (float)x / complexity ; in WaterMesh()
83 texcoordsBufData[2*(y*(complexity+1)+x)+1] = 1.0f - ((float)y / (complexity)) ; in WaterMesh()
133 for(y=0;y<=complexity;y++) { in WaterMesh()
214 for(y=1;y<complexity;y++) { in calculateFakeNormals()
219 for(x=1;x<complexity;x++) { in calculateFakeNormals()
[all …]
/dports/graphics/ogre3d/ogre-1.11.6/Samples/Water/src/
H A DWaterMesh.cpp27 this->complexity = inComplexity ; in WaterMesh()
28 numFaces = 2 * complexity * complexity; in WaterMesh()
29 numVertices = (complexity + 1) * (complexity + 1) ; in WaterMesh()
82 for(y=0;y<=complexity;y++) { in WaterMesh()
83 for(x=0;x<=complexity;x++) { in WaterMesh()
84 texcoordsBufData[2*(y*(complexity+1)+x)+0] = (float)x / complexity ; in WaterMesh()
85 texcoordsBufData[2*(y*(complexity+1)+x)+1] = 1.0f - ((float)y / (complexity)) ; in WaterMesh()
108 for(y=0 ; y<complexity ; y++) { in WaterMesh()
216 for(y=1;y<complexity;y++) { in calculateFakeNormals()
221 for(x=1;x<complexity;x++) { in calculateFakeNormals()
[all …]
/dports/devel/xsd/xsd-4.1.0.a11+dep/xsd/xsd/cxx/tree/
H A Dcounter.cxx17 Member (size_t& complexity) in Member()
18 : complexity_ (complexity) in Member()
33 Any (size_t& complexity) in Any()
34 : complexity_ (complexity) in Any()
127 size_t complexity (0); in traverse() local
132 counts_.complexity.push_back (complexity); in traverse()
186 size_t complexity (0); in count_last() local
195 complexity += 1; in count_last()
210 if (complexity == 0) in count_last()
218 complexity = 1; in count_last()
[all …]
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/analyzer/
H A Dcomplexity.cc68 complexity::complexity (const region *reg) in complexity() function in ana::complexity
77 complexity::complexity (const svalue *sval) in complexity() function in ana::complexity
86 complexity
87 complexity::from_pair (const complexity &c1, const complexity &c2) in from_pair()
89 return complexity (c1.m_num_nodes + c2.m_num_nodes + 1, in from_pair()
95 complexity
96 complexity::from_vec_svalue (const vec<const svalue *> &vec) in from_vec_svalue()
102 const complexity &iter_c = iter_sval->get_complexity (); in from_vec_svalue()
106 return complexity (num_nodes + 1, max_depth + 1); in from_vec_svalue()
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/utils/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
94 result.complexity = oLambda; in MinimalLeastSq()
125 CHECK_NE(complexity, oNone); in MinimalLeastSq()
129 if (complexity == oAuto) { in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
146 best_fit.complexity = complexity; in MinimalLeastSq()
192 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/libcxx/utils/google-benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
51 switch (complexity) { in GetBigOString()
97 result.complexity = oLambda; in MinimalLeastSq()
128 CHECK_NE(complexity, oNone); in MinimalLeastSq()
132 if (complexity == oAuto) { in MinimalLeastSq()
137 best_fit.complexity = o1; in MinimalLeastSq()
144 best_fit.complexity = fit; in MinimalLeastSq()
149 best_fit.complexity = complexity; in MinimalLeastSq()
198 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/libcxx/utils/google-benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
51 switch (complexity) { in GetBigOString()
97 result.complexity = oLambda; in MinimalLeastSq()
128 CHECK_NE(complexity, oNone); in MinimalLeastSq()
132 if (complexity == oAuto) { in MinimalLeastSq()
137 best_fit.complexity = o1; in MinimalLeastSq()
144 best_fit.complexity = fit; in MinimalLeastSq()
149 best_fit.complexity = complexity; in MinimalLeastSq()
198 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/buildtools/third_party/libc++/trunk/utils/google-benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
51 switch (complexity) { in GetBigOString()
97 result.complexity = oLambda; in MinimalLeastSq()
128 CHECK_NE(complexity, oNone); in MinimalLeastSq()
132 if (complexity == oAuto) { in MinimalLeastSq()
137 best_fit.complexity = o1; in MinimalLeastSq()
144 best_fit.complexity = fit; in MinimalLeastSq()
149 best_fit.complexity = complexity; in MinimalLeastSq()
198 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/utils/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
94 result.complexity = oLambda; in MinimalLeastSq()
125 CHECK_NE(complexity, oNone); in MinimalLeastSq()
129 if (complexity == oAuto) { in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
146 best_fit.complexity = complexity; in MinimalLeastSq()
192 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/libcxx/utils/google-benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
51 switch (complexity) { in GetBigOString()
97 result.complexity = oLambda; in MinimalLeastSq()
128 CHECK_NE(complexity, oNone); in MinimalLeastSq()
132 if (complexity == oAuto) { in MinimalLeastSq()
137 best_fit.complexity = o1; in MinimalLeastSq()
144 best_fit.complexity = fit; in MinimalLeastSq()
149 best_fit.complexity = complexity; in MinimalLeastSq()
198 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/utils/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
92 result.complexity = oLambda; in MinimalLeastSq()
123 CHECK_NE(complexity, oNone); in MinimalLeastSq()
127 if (complexity == oAuto) { in MinimalLeastSq()
132 best_fit.complexity = o1; in MinimalLeastSq()
139 best_fit.complexity = fit; in MinimalLeastSq()
144 best_fit.complexity = complexity; in MinimalLeastSq()
190 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/devel/llvm90/llvm-9.0.1.src/utils/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
94 result.complexity = oLambda; in MinimalLeastSq()
125 CHECK_NE(complexity, oNone); in MinimalLeastSq()
129 if (complexity == oAuto) { in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
146 best_fit.complexity = complexity; in MinimalLeastSq()
192 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/utils/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
94 result.complexity = oLambda; in MinimalLeastSq()
125 CHECK_NE(complexity, oNone); in MinimalLeastSq()
129 if (complexity == oAuto) { in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
146 best_fit.complexity = complexity; in MinimalLeastSq()
192 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/libcxx/utils/google-benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
51 switch (complexity) { in GetBigOString()
97 result.complexity = oLambda; in MinimalLeastSq()
128 CHECK_NE(complexity, oNone); in MinimalLeastSq()
132 if (complexity == oAuto) { in MinimalLeastSq()
137 best_fit.complexity = o1; in MinimalLeastSq()
144 best_fit.complexity = fit; in MinimalLeastSq()
149 best_fit.complexity = complexity; in MinimalLeastSq()
198 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/devel/llvm10/llvm-10.0.1.src/utils/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
94 result.complexity = oLambda; in MinimalLeastSq()
125 CHECK_NE(complexity, oNone); in MinimalLeastSq()
129 if (complexity == oAuto) { in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
146 best_fit.complexity = complexity; in MinimalLeastSq()
192 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/audio/giada/giada-0.17.1/src/deps/json/benchmarks/thirdparty/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
94 result.complexity = oLambda; in MinimalLeastSq()
125 CHECK_NE(complexity, oNone); in MinimalLeastSq()
129 if (complexity == oAuto) { in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
146 best_fit.complexity = complexity; in MinimalLeastSq()
192 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/utils/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
92 result.complexity = oLambda; in MinimalLeastSq()
123 CHECK_NE(complexity, oNone); in MinimalLeastSq()
127 if (complexity == oAuto) { in MinimalLeastSq()
132 best_fit.complexity = o1; in MinimalLeastSq()
139 best_fit.complexity = fit; in MinimalLeastSq()
144 best_fit.complexity = complexity; in MinimalLeastSq()
190 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/utils/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
94 result.complexity = oLambda; in MinimalLeastSq()
125 CHECK_NE(complexity, oNone); in MinimalLeastSq()
129 if (complexity == oAuto) { in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
146 best_fit.complexity = complexity; in MinimalLeastSq()
192 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/utils/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
92 result.complexity = oLambda; in MinimalLeastSq()
123 CHECK_NE(complexity, oNone); in MinimalLeastSq()
127 if (complexity == oAuto) { in MinimalLeastSq()
132 best_fit.complexity = o1; in MinimalLeastSq()
139 best_fit.complexity = fit; in MinimalLeastSq()
144 best_fit.complexity = complexity; in MinimalLeastSq()
190 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/devel/libc++/libcxx-10.0.1.src/utils/google-benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
51 switch (complexity) { in GetBigOString()
97 result.complexity = oLambda; in MinimalLeastSq()
128 CHECK_NE(complexity, oNone); in MinimalLeastSq()
132 if (complexity == oAuto) { in MinimalLeastSq()
137 best_fit.complexity = o1; in MinimalLeastSq()
144 best_fit.complexity = fit; in MinimalLeastSq()
149 best_fit.complexity = complexity; in MinimalLeastSq()
198 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/misc/py-onnx/onnx-1.10.2/third_party/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
94 result.complexity = oLambda; in MinimalLeastSq()
125 CHECK_NE(complexity, oNone); in MinimalLeastSq()
129 if (complexity == oAuto) { in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
146 best_fit.complexity = complexity; in MinimalLeastSq()
192 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/utils/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
94 result.complexity = oLambda; in MinimalLeastSq()
125 CHECK_NE(complexity, oNone); in MinimalLeastSq()
129 if (complexity == oAuto) { in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
146 best_fit.complexity = complexity; in MinimalLeastSq()
192 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/utils/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
48 switch (complexity) { in GetBigOString()
94 result.complexity = oLambda; in MinimalLeastSq()
125 CHECK_NE(complexity, oNone); in MinimalLeastSq()
129 if (complexity == oAuto) { in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
146 best_fit.complexity = complexity; in MinimalLeastSq()
192 big_o.complexity = result_cpu.complexity; in ComputeBigO()
[all …]

12345678910>>...293