| /dports/devel/pear-PHP_CodeSniffer/PHP_CodeSniffer-3.6.1/tests/Standards/ |
| H A D | AbstractSniffUnitTest.php | 244 $allProblems = [];
249 if (isset($allProblems[$line]) === false) {
250 $allProblems[$line] = [
285 $allProblems[$line]['expected_errors'] = 0;
292 if (isset($allProblems[$line]) === false) {
293 $allProblems[$line] = [
307 $allProblems[$line] = [
349 if (isset($allProblems[$line]) === false) {
350 $allProblems[$line] = [
362 ksort($allProblems);
[all …]
|
| /dports/devel/kdevelop/kdevelop-21.12.3/plugins/problemreporter/ |
| H A D | problemreportermodel.cpp | 71 const auto allProblems = DUChainUtils::allProblemsForContext(ctx); in problems() local
72 result.reserve(result.size() + allProblems.size()); in problems()
73 for (const ProblemPointer& p : allProblems) { in problems()
147 QVector<IProblem::Ptr> allProblems = problems(store()->documents()->get()); in rebuildProblemList() local
150 allProblems += problems(store()->documents()->imports()); in rebuildProblemList()
152 store()->setProblems(allProblems); in rebuildProblemList()
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.core/org.eclipse.jdt.core.tests.builder/src/org/eclipse/jdt/core/tests/builder/ |
| H A D | BuilderTests.java | 249 Problem[] allProblems = allSortedProblems(roots); in expectingNoProblemsFor() local
250 if (allProblems != null) { in expectingNoProblemsFor()
252 buffer.append(allProblems[i]+"\n"); in expectingNoProblemsFor()
506 Problem[] allProblems = null; in allSortedProblems() local
511 if (allProblems == null) { in allSortedProblems()
512 allProblems = problems; in allSortedProblems()
514 int all = allProblems.length; in allSortedProblems()
515 System.arraycopy(allProblems, 0, allProblems = new Problem[all+length], 0, all); in allSortedProblems()
520 if (allProblems != null) { in allSortedProblems()
521 Arrays.sort(allProblems); in allSortedProblems()
[all …]
|
| /dports/games/burrtools/burrtools-0.6.3/src/ |
| H A D | burrTxt.cpp | 43 bool allProblems; variable
76 if (!quiet || allProblems) in assembly()
125 allProblems = false; in main()
164 allProblems = true; in main()
247 if (allProblems) in main()
307 if (allProblems) in main()
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.pde.ui/apitools/org.eclipse.pde.api.tools/src_ant/org/eclipse/pde/api/tools/internal/tasks/ |
| H A D | APIToolsAnalysisTask.java | 172 private Summary[] createAllSummaries(Map<String, IApiProblem[]> allProblems) { in createAllSummaries() argument
173 Set<Map.Entry<String, IApiProblem[]>> entrySet = allProblems.entrySet(); in createAllSummaries()
376 Map<String, IApiProblem[]> allProblems = new HashMap<>(); in execute() local
428 allProblems.put(name, problems); in execute()
485 allProblems.put(id, new IApiProblem[] { problem }); in execute()
505 Summary[] summaries = createAllSummaries(allProblems); in execute()
540 List<IApiProblem> allProblems = null; in removeDuplicates() local
545 if (allProblems == null) { in removeDuplicates()
546 allProblems = new ArrayList<>(length); in removeDuplicates()
549 allProblems.add(apiProblem); in removeDuplicates()
[all …]
|
| H A D | MissingRefProblemsTask.java | 165 Map<String, IApiProblem[]> allProblems = new HashMap<>(); in execute() local
186 …allProblems.put(name + " (" + new Version(version).toString() + ")", problems); //$NON-NLS-1$ //$N… in execute()
207 Summary[] summaries = createAllSummaries(allProblems); in execute()
277 private Summary[] createAllSummaries(Map<String, IApiProblem[]> allProblems) { in createAllSummaries() argument
278 Set<Map.Entry<String, IApiProblem[]>> entrySet = allProblems.entrySet(); in createAllSummaries()
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.pde.ui/apitools/org.eclipse.pde.api.tools/src/org/eclipse/pde/api/tools/internal/builder/ |
| H A D | ReferenceAnalyzer.java | 244 List<IApiProblem> allProblems = new LinkedList<>(); in analyze() local
248 allProblems.addAll(detector.createProblems(loopMonitor.split(1))); in analyze()
250 IApiProblem[] array = allProblems.toArray(new IApiProblem[allProblems.size()]); in analyze()
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.pde.ui/apitools/org.eclipse.pde.api.tools.tests/src/org/eclipse/pde/api/tools/builder/tests/ |
| H A D | ApiBuilderTest.java | 658 ApiProblem[] allProblems = null; in allSortedApiProblems() local
664 if (allProblems == null) { in allSortedApiProblems()
665 allProblems = problems; in allSortedApiProblems()
667 int all = allProblems.length; in allSortedApiProblems()
668 System.arraycopy(allProblems, 0, allProblems = new ApiProblem[all + length], 0, all); in allSortedApiProblems()
669 System.arraycopy(problems, 0, allProblems, all, length); in allSortedApiProblems()
673 if (allProblems != null) { in allSortedApiProblems()
674 Arrays.sort(allProblems); in allSortedApiProblems()
676 return allProblems; in allSortedApiProblems()
|
| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/ode/nonstiff/ |
| H A D | RungeKuttaFieldIntegratorAbstractTest.java | 232 TestFieldProblemAbstract<T>[] allProblems = in doTestDecreasingSteps() local
234 allProblems[0] = new TestFieldProblem1<T>(field); in doTestDecreasingSteps()
235 allProblems[1] = new TestFieldProblem2<T>(field); in doTestDecreasingSteps()
236 allProblems[2] = new TestFieldProblem3<T>(field); in doTestDecreasingSteps()
237 allProblems[3] = new TestFieldProblem4<T>(field); in doTestDecreasingSteps()
238 allProblems[4] = new TestFieldProblem5<T>(field); in doTestDecreasingSteps()
239 allProblems[5] = new TestFieldProblem6<T>(field); in doTestDecreasingSteps()
240 for (TestFieldProblemAbstract<T> pb : allProblems) { in doTestDecreasingSteps()
|
| /dports/java/phpeclipse/plugins/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/compiler/ |
| H A D | CompilationResult.java | 144 IProblem[] allProblems = new IProblem[totalNumberOfProblem]; in getAllProblems() local
179 allProblems[allProblemIndex++] = currentProblem; in getAllProblems()
181 return allProblems; in getAllProblems()
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.core/org.eclipse.jdt.core.tests.model/workspace/Compiler/src/org/eclipse/jdt/internal/compiler/ |
| H A D | CompilationResult.java | 132 IProblem[] allProblems = new IProblem[totalNumberOfProblem]; in getAllProblems() local
166 allProblems[allProblemIndex++] = currentProblem; in getAllProblems()
168 return allProblems; in getAllProblems()
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/rt.equinox.p2/bundles/org.eclipse.equinox.p2.tests.verifier/src/org/eclipse/equinox/internal/p2/tests/verifier/ |
| H A D | VerifierApplication.java | 170 List<IStatus> allProblems = new ArrayList<>(); in checkResolved() local
197 allProblems.add(createError(message)); in checkResolved()
204 allProblems.add(createError(message)); in checkResolved()
208 for (IStatus status : allProblems) in checkResolved()
|
| /dports/java/eclipse-ecj/eclipse-ecj-4.4.2_1/org/eclipse/jdt/internal/compiler/ |
| H A D | CompilationResult.java | 146 CategorizedProblem[] allProblems = new CategorizedProblem[totalNumberOfProblem]; in getAllProblems() local
180 allProblems[allProblemIndex++] = currentProblem; in getAllProblems()
182 return allProblems; in getAllProblems()
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.core/org.eclipse.jdt.core/compiler/org/eclipse/jdt/internal/compiler/ |
| H A D | CompilationResult.java | 150 CategorizedProblem[] allProblems = new CategorizedProblem[totalNumberOfProblem]; in getAllProblems() local
184 allProblems[allProblemIndex++] = currentProblem; in getAllProblems()
186 return allProblems; in getAllProblems()
|
| /dports/devel/kdevelop/kdevelop-21.12.3/plugins/contextbrowser/ |
| H A D | contextbrowser.cpp | 489 QVector<KDevelop::IProblem::Ptr> allProblems; in findProblemsCloseToCursor() local
493 allProblems.reserve(allProblems.size() + problems.size()); in findProblemsCloseToCursor()
495 allProblems += problem; in findProblemsCloseToCursor()
499 if (allProblems.isEmpty()) in findProblemsCloseToCursor()
500 return allProblems; in findProblemsCloseToCursor()
502 std::sort(allProblems.begin(), allProblems.end(), in findProblemsCloseToCursor()
526 for (auto& problem : qAsConst(allProblems)) { in findProblemsCloseToCursor()
|
| /dports/sysutils/libdnf/libdnf-0.64.0/python/hawkey/ |
| H A D | iutil-py.hpp | 77 PyObject * problemRulesPyConverter(std::vector<std::vector<std::string>> & allProblems);
|
| H A D | iutil-py.cpp | 362 problemRulesPyConverter(std::vector<std::vector<std::string>> & allProblems) in problemRulesPyConverter() argument
367 for (auto & problemList: allProblems) { in problemRulesPyConverter()
|
| H A D | goal-py.cpp | 406 auto allProblems = self->goal->describeAllProblemRules(true); in problem_rules() local
407 return problemRulesPyConverter(allProblems); in problem_rules()
|