Home
last modified time | relevance | path

Searched refs:decisions (Results 1 – 25 of 4232) sorted by relevance

12345678910>>...170

/dports/devel/py-nbdime/nbdime-3.1.1/nbdime/tests/
H A Dtest_merge.py112 d = decisions[0]
125 d = decisions[0]
130 d = decisions[1]
141 d = decisions[0]
144 d = decisions[1]
149 d = decisions[2]
257 d = decisions[0]
263 d = decisions[1]
281 d = decisions[1]
314 d = decisions[0]
[all …]
H A Dtest_merge_notebooks_inline.py104 assert decisions[0].local_diff != []
105 assert decisions[0].remote_diff != []
110 assert decisions[0].local_diff != []
111 assert decisions[0].remote_diff != []
162 assert apply_decisions(b, decisions) == l
365 assert len(decisions) == 1
366 assert decisions[0].conflict
388 assert len(decisions) == 1
389 assert decisions[0].conflict
421 assert len(decisions) == 1
[all …]
H A Dtest_autoresolve.py39 merged, decisions = merge_notebooks(base, local, remote, args)
43 assert not any(d.conflict for d in decisions)
60 merged, decisions = merge_notebooks(base, local, remote, args)
64 assert decisions[0].conflict is True
65 assert len(decisions) == 1
83 merged, decisions = merge_notebooks(base, local, remote, args)
87 assert not any(d.conflict for d in decisions)
105 merged, decisions = merge_notebooks(base, local, remote, args)
109 assert not any(d.conflict for d in decisions)
119 merged, decisions = merge_notebooks(nbb, nbl, nbr, args)
[all …]
H A Dtest_apply_merge.py13 from nbdime.merging.decisions import (
19 def has_merge_conflicts(decisions): argument
21 return any(item.conflict for item in decisions)
66 def gather_merge_decisions(base, decisions): argument
67 assert not has_merge_conflicts(decisions)
68 for dec in decisions:
103 decisions = [
109 return decisions
113 decisions = []
115 assert base == apply_decisions(base, decisions)
/dports/devel/py-nbdime/nbdime-3.1.1/nbdime/merging/
H A Dgeneric.py194 decisions.onesided(path,
272 return decisions
387 return decisions
426 return decisions
635 return decisions
660 decisions.conflict(
696 if any([decisions.decisions[i] == decisions.decisions[j]
697 for i in range(len(decisions.decisions))
698 for j in range(len(decisions.decisions))
702 return decisions
[all …]
H A Dstrategies.py167 decisions.decisions = [d for d in decisions if not d.conflict]
401 decisions.decisions = []
404 decisions.decisions.extend(decs)
424 decisions.decisions = []
427 decisions.decisions.extend(decs)
453 decisions.decisions = [d for d in decisions if not d.conflict]
521 old_decisions = decisions.decisions
522 decisions.decisions = []
526 decisions.decisions.append(d)
534 decisions.decisions.append(d)
[all …]
H A Dautoresolve.py9 from .decisions import filter_decisions, build_diffs
42 def split_decisions_by_cell(decisions): argument
45 for dec in decisions:
54 def make_bundled_decisions(base, prefix, decisions, callback): argument
59 if not any(dec.conflict for dec in decisions):
61 for dec in decisions:
63 return decisions
72 def bundle_decisions(base, decisions, pattern, callback): argument
73 indices = filter_decisions(pattern, decisions)
76 other_decisions = [decisions[i] for i in range(len(decisions)) if i not in index_set]
[all …]
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/antlr/antlr4/runtime/Java/src/org/antlr/v4/runtime/atn/
H A DParseInfo.java49 for (int i=0; i<decisions.length; i++) { in getLLDecisions()
50 long fallBack = decisions[i].LL_Fallback; in getLLDecisions()
64 for (int i=0; i<decisions.length; i++) { in getTotalTimeInPrediction()
65 t += decisions[i].timeInPrediction; in getTotalTimeInPrediction()
78 for (int i = 0; i < decisions.length; i++) { in getTotalSLLLookaheadOps()
79 k += decisions[i].SLL_TotalLook; in getTotalSLLLookaheadOps()
93 k += decisions[i].LL_TotalLook; in getTotalLLLookaheadOps()
106 k += decisions[i].SLL_ATNTransitions; in getTotalSLLATNLookaheadOps()
119 k += decisions[i].LL_ATNTransitions; in getTotalLLATNLookaheadOps()
136 k += decisions[i].SLL_ATNTransitions; in getTotalATNLookaheadOps()
[all …]
H A DProfilingATNSimulator.java21 protected final DecisionInfo[] decisions; field in ProfilingATNSimulator
51 decisions[i] = new DecisionInfo(i); in ProfilingATNSimulator()
65 decisions[decision].invocations++; in adaptivePredict()
69 …decisions[decision].SLL_MinLook = decisions[decision].SLL_MinLook==0 ? SLL_k : Math.min(decisions[… in adaptivePredict()
72 decisions[decision].SLL_MaxLookEvent = in adaptivePredict()
79 …decisions[decision].LL_MinLook = decisions[decision].LL_MinLook==0 ? LL_k : Math.min(decisions[dec… in adaptivePredict()
81 decisions[decision].LL_MaxLook = LL_k; in adaptivePredict()
82 decisions[decision].LL_MaxLookEvent = in adaptivePredict()
104 decisions[currentDecision].errors.add( in getExistingTargetState()
136 decisions[currentDecision].errors.add( in computeReachSet()
[all …]
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/antlr/antlr4/runtime/Swift/Sources/Antlr4/atn/
H A DParseInfo.swift45 let length = decisions.count in getLLDecisions()
64 let length = decisions.count in getTotalTimeInPrediction()
66 t += decisions[i].timeInPrediction in getTotalTimeInPrediction()
79 let length = decisions.count in getTotalSLLLookaheadOps()
81 k += decisions[i].SLL_TotalLook in getTotalSLLLookaheadOps()
94 let length = decisions.count in getTotalLLLookaheadOps()
96 k += decisions[i].LL_TotalLook in getTotalLLLookaheadOps()
108 let length = decisions.count in getTotalSLLATNLookaheadOps()
122 let length = decisions.count in getTotalLLATNLookaheadOps()
124 k += decisions[i].LL_ATNTransitions in getTotalLLATNLookaheadOps()
[all …]
H A DProfilingATNSimulator.swift15 private(set) var decisions: [DecisionInfo] variable
39 decisions = [DecisionInfo]()
48 decisions[i] = DecisionInfo(i)
64 decisions[decision].invocations += 1 in adaptivePredict()
67 decisions[decision].SLL_TotalLook += SLL_k in adaptivePredict()
68 …decisions[decision].SLL_MinLook = decisions[decision].SLL_MinLook == 0 ? SLL_k : min(decisions[dec… in adaptivePredict()
69 if SLL_k > decisions[decision].SLL_MaxLook { in adaptivePredict()
70 decisions[decision].SLL_MaxLook = SLL_k in adaptivePredict()
71 decisions[decision].SLL_MaxLookEvent = in adaptivePredict()
78 …decisions[decision].LL_MinLook = decisions[decision].LL_MinLook == 0 ? LL_k : min(decisions[decisi… in adaptivePredict()
[all …]
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/antlr/antlr4/runtime/CSharp/runtime/CSharp/Antlr4.Runtime/Atn/
H A DParseInfo.cs53 for (int i = 0; i < decisions.Length; i++) in getLLDecisions()
55 long fallBack = decisions[i].LL_Fallback; in getLLDecisions()
70 for (int i = 0; i < decisions.Length; i++) in getTotalTimeInPrediction()
72 t += decisions[i].timeInPrediction; in getTotalTimeInPrediction()
86 for (int i = 0; i < decisions.Length; i++) in getTotalSLLLookaheadOps()
88 k += decisions[i].SLL_TotalLook; in getTotalSLLLookaheadOps()
104 k += decisions[i].LL_TotalLook; in getTotalLLLookaheadOps()
119 k += decisions[i].SLL_ATNTransitions; in getTotalSLLATNLookaheadOps()
134 k += decisions[i].LL_ATNTransitions; in getTotalLLATNLookaheadOps()
153 k += decisions[i].SLL_ATNTransitions; in getTotalATNLookaheadOps()
[all …]
H A DProfilingATNSimulator.cs17 protected readonly DecisionInfo[] decisions; field in Antlr4.Runtime.Atn.ProfilingATNSimulator
50 decisions[i] = new DecisionInfo(i); in ProfilingATNSimulator()
65 decisions[decision].invocations++; in AdaptivePredict()
69 …decisions[decision].SLL_MinLook = decisions[decision].SLL_MinLook == 0 ? SLL_k : Math.Min(decision… in AdaptivePredict()
73 decisions[decision].SLL_MaxLookEvent = in AdaptivePredict()
81 …decisions[decision].LL_MinLook = decisions[decision].LL_MinLook == 0 ? LL_k : Math.Min(decisions[d… in AdaptivePredict()
84 decisions[decision].LL_MaxLook = LL_k; in AdaptivePredict()
85 decisions[decision].LL_MaxLookEvent = in AdaptivePredict()
110 decisions[currentDecision].errors.Add( in GetExistingTargetState()
145 decisions[currentDecision].errors.Add( in ComputeReachSet()
[all …]
/dports/games/fs2open/fs2open.github.com-release_21_4_1/lib/antlr4-cpp-runtime/runtime/src/atn/
H A DParseInfo.cpp26 for (size_t i = 0; i < decisions.size(); ++i) { in getLLDecisions()
27 long long fallBack = decisions[i].LL_Fallback; in getLLDecisions()
38 for (size_t i = 0; i < decisions.size(); ++i) { in getTotalTimeInPrediction()
39 t += decisions[i].timeInPrediction; in getTotalTimeInPrediction()
47 for (size_t i = 0; i < decisions.size(); ++i) { in getTotalSLLLookaheadOps()
48 k += decisions[i].SLL_TotalLook; in getTotalSLLLookaheadOps()
57 k += decisions[i].LL_TotalLook; in getTotalLLLookaheadOps()
66 k += decisions[i].SLL_ATNTransitions; in getTotalSLLATNLookaheadOps()
75 k += decisions[i].LL_ATNTransitions; in getTotalLLATNLookaheadOps()
84 k += decisions[i].SLL_ATNTransitions; in getTotalATNLookaheadOps()
[all …]
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/antlr/antlr4/runtime/Cpp/runtime/src/atn/
H A DParseInfo.cpp26 for (size_t i = 0; i < decisions.size(); ++i) { in getLLDecisions()
27 long long fallBack = decisions[i].LL_Fallback; in getLLDecisions()
38 for (size_t i = 0; i < decisions.size(); ++i) { in getTotalTimeInPrediction()
39 t += decisions[i].timeInPrediction; in getTotalTimeInPrediction()
47 for (size_t i = 0; i < decisions.size(); ++i) { in getTotalSLLLookaheadOps()
48 k += decisions[i].SLL_TotalLook; in getTotalSLLLookaheadOps()
57 k += decisions[i].LL_TotalLook; in getTotalLLLookaheadOps()
66 k += decisions[i].SLL_ATNTransitions; in getTotalSLLATNLookaheadOps()
75 k += decisions[i].LL_ATNTransitions; in getTotalLLATNLookaheadOps()
84 k += decisions[i].SLL_ATNTransitions; in getTotalATNLookaheadOps()
[all …]
/dports/devel/libantlr4/libantlr4-4.9.3/runtime/src/atn/
H A DParseInfo.cpp26 for (size_t i = 0; i < decisions.size(); ++i) { in getLLDecisions()
27 long long fallBack = decisions[i].LL_Fallback; in getLLDecisions()
38 for (size_t i = 0; i < decisions.size(); ++i) { in getTotalTimeInPrediction()
39 t += decisions[i].timeInPrediction; in getTotalTimeInPrediction()
47 for (size_t i = 0; i < decisions.size(); ++i) { in getTotalSLLLookaheadOps()
48 k += decisions[i].SLL_TotalLook; in getTotalSLLLookaheadOps()
57 k += decisions[i].LL_TotalLook; in getTotalLLLookaheadOps()
66 k += decisions[i].SLL_ATNTransitions; in getTotalSLLATNLookaheadOps()
75 k += decisions[i].LL_ATNTransitions; in getTotalLLATNLookaheadOps()
84 k += decisions[i].SLL_ATNTransitions; in getTotalATNLookaheadOps()
[all …]
/dports/www/node10/node-v10.24.1/deps/v8/third_party/antlr4/runtime/Cpp/runtime/src/atn/
H A DParseInfo.cpp25 for (size_t i = 0; i < decisions.size(); ++i) { in getLLDecisions()
26 long long fallBack = decisions[i].LL_Fallback; in getLLDecisions()
37 for (size_t i = 0; i < decisions.size(); ++i) { in getTotalTimeInPrediction()
38 t += decisions[i].timeInPrediction; in getTotalTimeInPrediction()
46 for (size_t i = 0; i < decisions.size(); ++i) { in getTotalSLLLookaheadOps()
47 k += decisions[i].SLL_TotalLook; in getTotalSLLLookaheadOps()
56 k += decisions[i].LL_TotalLook; in getTotalLLLookaheadOps()
65 k += decisions[i].SLL_ATNTransitions; in getTotalSLLATNLookaheadOps()
74 k += decisions[i].LL_ATNTransitions; in getTotalLLATNLookaheadOps()
83 k += decisions[i].SLL_ATNTransitions; in getTotalATNLookaheadOps()
[all …]
/dports/devel/py-nbdime/nbdime-3.1.1/packages/nbdime/test/src/merge/
H A Ddecisions.spec.ts58 let d = new decisions.MergeDecision(
180 value = decisions.popPath(diffs)!;
186 value = decisions.popPath(diffs)!;
256 value = decisions.popPath(diffs);
272 value = decisions.popPath(diffs);
300 value = decisions.popPath(diffs);
635 new decisions.MergeDecision({
640 new decisions.MergeDecision({
645 new decisions.MergeDecision({
649 new decisions.MergeDecision({
[all …]
H A Dmodel.spec.ts268 d = model.decisions[1];
287 d = model.decisions[1];
307 d = model.decisions[1];
332 d = model.decisions[1];
338 d = model.decisions[2];
344 d = model.decisions[3];
369 d = model.decisions[1];
375 d = model.decisions[2];
381 d = model.decisions[3];
406 d = model.decisions[1];
[all …]
/dports/devel/py-moto/moto-2.2.16/tests/test_swf/responses/
H A Dtest_decision_tasks.py427 decisions = [
462 decisions = [
496 decisions = [
502 task_token, decisions=decisions
514 decisions = [
521 taskToken=task_token, decisions=decisions
543 task_token, decisions=decisions
565 taskToken=task_token, decisions=decisions
589 task_token, decisions=decisions
607 task_token, decisions=decisions
[all …]
H A Dtest_activity_tasks.py23 decision_token, decisions=[SCHEDULE_ACTIVITY_TASK_DECISION]
47 taskToken=decision_token, decisions=[SCHEDULE_ACTIVITY_TASK_DECISION]
102 decision_token, decisions=[SCHEDULE_ACTIVITY_TASK_DECISION]
144 decision_token, decisions=[SCHEDULE_ACTIVITY_TASK_DECISION]
197 decision_token, decisions=[SCHEDULE_ACTIVITY_TASK_DECISION]
246 decision_token, decisions=[SCHEDULE_ACTIVITY_TASK_DECISION]
290 decision_token, decisions=[SCHEDULE_ACTIVITY_TASK_DECISION]
356 decision_token, decisions=[SCHEDULE_ACTIVITY_TASK_DECISION]
394 decision_token, decisions=[SCHEDULE_ACTIVITY_TASK_DECISION]
427 decision_token, decisions=[SCHEDULE_ACTIVITY_TASK_DECISION]
[all …]
/dports/www/bolt/bolt-2.2.24/vendor/composer/composer/src/Composer/DependencyResolver/
H A DSolver.php45 protected $decisions; variable in Composer\\DependencyResolver\\Solver
90 $decisionStart = count($this->decisions) - 1;
108 if ($this->decisions->satisfy($literal)) {
216 $this->decisions = new Decisions($this->pool);
264 $this->decisions
284 while (!$this->decisions->isEmpty()) {
285 $literal = $this->decisions->lastLiteral();
297 $this->decisions->revertLast();
409 $decisionId = count($this->decisions);
559 foreach ($this->decisions as $decision) {
[all …]
/dports/devel/py-nbdime/nbdime-3.1.1/packages/nbdime/src/merge/model/
H A Dcell.ts66 for (let md of decisions) {
132 this.processDecisions(decisions);
311 let dec = this.decisions[0];
339 for (let md of this.decisions) {
342 decisions.push(nmd);
362 if (decisions.length === 1) {
365 let md = decisions[0];
368 this.decisions.push(md);
373 for (let md of decisions) {
398 this.decisions.push(md);
[all …]
H A Dcommon.ts40 constructor(base: any, decisions: MergeDecision[],
48 this.decisions = decisions;
54 decisions: MergeDecision[]; property in DecisionStringDiffModel
124 let diff = buildDiffs(this.rawBase, this.decisions, 'merged');
163 constructor(base: ObjectType | null, decisions: MergeDecision[], mimetype: string,
169 this.decisions = decisions;
185 readonly decisions: MergeDecision[]; property in ObjectMergeModel
194 return applyDecisions(this.base, this.decisions);
204 let diff = buildDiffs(this.base, this.decisions, 'local');
216 let diff = buildDiffs(this.base, this.decisions, 'remote');
[all …]
/dports/math/cadical/cadical-1.0.3-cb89cbf/src/
H A Dlimit.cpp43 lim.decisions >= 0 && in terminating()
44 stats.decisions >= lim.decisions) { in terminating()
45 LOG ("decision limit %" PRId64 " reached", lim.decisions); in terminating()
62 decisions = conflicts = -1; // unlimited in Inc()
78 if (l < 0 && inc.decisions < 0) { in limit_decisions()
82 inc.decisions = -1; in limit_decisions()
84 inc.decisions = stats.decisions + l; in limit_decisions()

12345678910>>...170