Home
last modified time | relevance | path

Searched refs:ancestor (Results 151 – 175 of 12880) sorted by relevance

12345678910>>...516

/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/paint/
H A Dpre_paint_tree_walk_test.cc353 auto& ancestor = *GetLayoutObjectByElementId("ancestor"); in TEST_P() local
357 EXPECT_FALSE(ancestor.EffectiveAllowedTouchActionChanged()); in TEST_P()
365 EXPECT_FALSE(ancestor.InsideBlockingTouchEventHandler()); in TEST_P()
374 EXPECT_FALSE(ancestor.EffectiveAllowedTouchActionChanged()); in TEST_P()
378 EXPECT_TRUE(ancestor.DescendantEffectiveAllowedTouchActionChanged()); in TEST_P()
383 EXPECT_FALSE(ancestor.EffectiveAllowedTouchActionChanged()); in TEST_P()
391 EXPECT_FALSE(ancestor.InsideBlockingTouchEventHandler()); in TEST_P()
408 auto& ancestor = *GetLayoutObjectByElementId("ancestor"); in TEST_P() local
412 EXPECT_FALSE(ancestor.EffectiveAllowedTouchActionChanged()); in TEST_P()
424 EXPECT_FALSE(ancestor.EffectiveAllowedTouchActionChanged()); in TEST_P()
[all …]
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.ua/org.eclipse.help.base/src/org/eclipse/help/internal/base/scope/
H A DScopeUtils.java138 UAElement ancestor = indexSee.getParentElement(); in hasInScopeTarget() local
139 while (!(ancestor instanceof Index)) { in hasInScopeTarget()
140 if (ancestor == null) { in hasInScopeTarget()
143 ancestor = ancestor.getParentElement(); in hasInScopeTarget()
145 IIndexEntry target = ((Index)ancestor).getSeeTarget(indexSee); in hasInScopeTarget()
160 UAElement ancestor = indexSee.getParentElement(); in showInTree() local
161 while (!(ancestor instanceof Index)) { in showInTree()
162 if (ancestor == null) { in showInTree()
165 ancestor = ancestor.getParentElement(); in showInTree()
167 IIndexEntry target = ((Index)ancestor).getSeeTarget(indexSee); in showInTree()
/dports/cad/fritzing/fritzing-app-0.9.2b/src/
H A Ddebugdialog.cpp59 this->m_ancestor = ancestor; in DebugEvent()
115 void DebugDialog::debug(QString prefix, const QPointF &point, DebugLevel debug, QObject *ancestor) { in debug() argument
117 DebugDialog::debug(msg,debug,ancestor); in debug()
120 void DebugDialog::debug(QString prefix, const QRectF &rect, DebugLevel debug, QObject *ancestor) { in debug() argument
123 DebugDialog::debug(msg,debug,ancestor); in debug()
126 void DebugDialog::debug(QString prefix, const QPoint &point, DebugLevel debug, QObject *ancestor) { in debug() argument
128 DebugDialog::debug(msg,debug,ancestor); in debug()
131 void DebugDialog::debug(QString prefix, const QRect &rect, DebugLevel debug, QObject *ancestor) { in debug() argument
134 DebugDialog::debug(msg,debug,ancestor); in debug()
137 void DebugDialog::debug(QString message, DebugLevel debugLevel, QObject * ancestor) { in debug() argument
[all …]
/dports/lang/ruby26/ruby-2.6.9/gems/test-unit-3.2.9/lib/test/unit/
H A Dattribute.rb167 ancestors.each do |ancestor|
168 next if ancestor == self
169 if ancestor.is_a?(Class) and ancestor < Test::Unit::Attribute
170 parent_attributes = ancestor.attributes(method_name)
197 @cached_parent_test_case ||= ancestors.find do |ancestor|
198 ancestor != self and
199 ancestor.is_a?(Class) and
200 ancestor < Test::Unit::Attribute
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.team/bundles/org.eclipse.team.ui/src/org/eclipse/team/internal/ui/mapping/
H A DAbstractCompareInput.java31 private ITypedElement ancestor; field in AbstractCompareInput
38 ITypedElement ancestor, in AbstractCompareInput() argument
42 this.ancestor = ancestor; in AbstractCompareInput()
106 return ancestor; in getAncestor()
127 return ancestor; in getMainElement()
169 public void setAncestor(ITypedElement ancestor) { in setAncestor() argument
170 this.ancestor = ancestor; in setAncestor()
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/WebCore/dom/
H A DEventDispatcher.cpp239 Node* ancestor = m_node.get(); in ensureEventAncestors() local
240 EventTarget* target = eventTargetRespectingSVGTargetRules(ancestor); in ensureEventAncestors()
243 bool isSVGShadowRoot = ancestor->isSVGShadowRoot(); in ensureEventAncestors()
244 if (isSVGShadowRoot || ancestor->isShadowRoot()) { in ensureEventAncestors()
248 ancestor = isSVGShadowRoot ? ancestor->svgShadowHost() : ancestor->shadowHost(); in ensureEventAncestors()
250 ancestor = ancestor->shadowHost(); in ensureEventAncestors()
253 target = ancestor; in ensureEventAncestors()
255 ancestor = ancestor->parentNodeGuaranteedHostFree(); in ensureEventAncestors()
257 if (!ancestor) in ensureEventAncestors()
262 shouldSkipNextAncestor = ancestor->isSVGShadowRoot(); in ensureEventAncestors()
[all …]
/dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/objMesh/
H A DobjMesh-disjointSet.cpp81 int ancestor = x; in FindSet() local
82 while(disjointSetParent[ancestor] >= 0) in FindSet()
83 ancestor = disjointSetParent[ancestor]; // backtrack the ancestor in FindSet()
85 while(x != ancestor) in FindSet()
88 disjointSetParent[x] = ancestor; in FindSet()
91 return ancestor; // here ancestor should be >=0 in FindSet()
/dports/devel/lazygit/lazygit-0.31.4/pkg/gui/mergeconflicts/
H A Dstate_test.go73 ancestor: -1,
79 ancestor: -1,
85 ancestor: -1,
91 ancestor: -1,
97 ancestor: -1,
103 ancestor: -1,
109 ancestor: 40,
/dports/math/gap/gap-4.11.0/pkg/digraphs-1.1.1/extern/edge-addition-planarity-suite-Version_3.0.0.5/c/
H A DgraphIsolator.c417 ancestor > gp_GetVertexLowpoint(theGraph, child)) in _GetLeastAncestorConnection()
418 ancestor = gp_GetVertexLowpoint(theGraph, child); in _GetLeastAncestorConnection()
423 return ancestor; in _GetLeastAncestorConnection()
452 ancestor > gp_GetVertexLowpoint(theGraph, child)) in _FindUnembeddedEdgeToAncestor()
460 *pAncestor = ancestor; in _FindUnembeddedEdgeToAncestor()
523 e = gp_GetVertexFwdArcList(theGraph, ancestor); in _FindUnembeddedEdgeToSubtree()
620 while (descendant != ancestor) in _MarkDFSPath()
721 _AddBackEdge(theGraph, ancestor, descendant); in _AddAndMarkEdge()
725 gp_SetVertexVisited(theGraph, ancestor); in _AddAndMarkEdge()
778 gp_SetFirstArc(theGraph, ancestor, fwdArc); in _AddBackEdge()
[all …]
/dports/math/planarity/edge-addition-planarity-suite-Version_3.0.1.1/c/
H A DgraphIsolator.c417 ancestor > gp_GetVertexLowpoint(theGraph, child)) in _GetLeastAncestorConnection()
418 ancestor = gp_GetVertexLowpoint(theGraph, child); in _GetLeastAncestorConnection()
423 return ancestor; in _GetLeastAncestorConnection()
452 ancestor > gp_GetVertexLowpoint(theGraph, child)) in _FindUnembeddedEdgeToAncestor()
460 *pAncestor = ancestor; in _FindUnembeddedEdgeToAncestor()
523 e = gp_GetVertexFwdArcList(theGraph, ancestor); in _FindUnembeddedEdgeToSubtree()
620 while (descendant != ancestor) in _MarkDFSPath()
721 _AddBackEdge(theGraph, ancestor, descendant); in _AddAndMarkEdge()
725 gp_SetVertexVisited(theGraph, ancestor); in _AddAndMarkEdge()
778 gp_SetFirstArc(theGraph, ancestor, fwdArc); in _AddBackEdge()
[all …]
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.team/bundles/org.eclipse.team.cvs.ui/src/org/eclipse/team/internal/ccvs/ui/
H A DCVSCompareEditorInput.java40 private ITypedElement ancestor; field in CVSCompareEditorInput
74 this.ancestor = ancestor; in CVSCompareEditorInput()
81 if (ancestor != null) { in CVSCompareEditorInput()
82 this.ancestorImage = ancestor.getImage(); in CVSCompareEditorInput()
177 if (ancestor != null) { in guessResourceName()
178 return ancestor.getName(); in guessResourceName()
194 if (ancestor != null && ancestor instanceof ResourceEditionNode) { in guessResourcePath()
233 if (ancestor != null) { in initLabels()
255 ITypedElement ancestor = this.ancestor; in setLabels() local
267 if (ancestor != null) { in setLabels()
[all …]
/dports/games/naev/naev-0.7.0/lib/csparse/
H A Dcs_leaf.c4 int *ancestor, int *jleaf) in cs_leaf() argument
7 if (!first || !maxfirst || !prevleaf || !ancestor || !jleaf) return (-1) ; in cs_leaf()
15 for (q = jprev ; q != ancestor [q] ; q = ancestor [q]) ; in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
19 ancestor [s] = q ; in cs_leaf()
/dports/math/casadi/casadi-3.5.5/external_packages/CSparse/Source/
H A Dcs_leaf.c4 int *ancestor, int *jleaf) in cs_leaf() argument
7 if (!first || !maxfirst || !prevleaf || !ancestor || !jleaf) return (-1) ; in cs_leaf()
15 for (q = jprev ; q != ancestor [q] ; q = ancestor [q]) ; in cs_leaf()
18 sparent = ancestor [s] ; /* path compression */ in cs_leaf()
19 ancestor [s] = q ; in cs_leaf()
/dports/lang/racket/racket-8.3/share/pkgs/datalog/tests/paren-examples/
H A Dtutorial.rkt15 (! (:- (ancestor A B)
17 (! (:- (ancestor A B)
19 (ancestor C B)))
20 (? (ancestor A B))
22 (? (ancestor X john))
28 (? (ancestor A B))
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/util/
H A DLengauerTarjan.java51 int[] parent, ancestor, vertex; field in LengauerTarjan
66 ancestor = new int[n]; in LengauerTarjan()
158 ancestor[v] = NIL; in dfs()
173 if (ancestor[ancestor[v]] != NIL) { in compress()
174 compress(ancestor[v]); in compress()
175 if (semi[label[ancestor[v]]] < semi[label[v]]) in compress()
176 label[v] = label[ancestor[v]]; in compress()
177 ancestor[v] = ancestor[ancestor[v]]; in compress()
182 if (ancestor[v] == NIL) in eval()
191 ancestor[w] = v; in link()
/dports/java/java-subversion/subversion-1.14.1/subversion/libsvn_client/
H A Dlayout.c48 struct layout_item_t *ancestor; member
85 lb->stack = it->ancestor; in layout_set_path()
119 it->ancestor = lb->stack; in layout_set_path()
122 if (!it->ancestor) in layout_set_path()
124 else if (it->ancestor->depth == svn_depth_infinity) in layout_set_path()
135 it->ancestor in layout_set_path()
165 lb->stack = it->ancestor; in layout_link_path()
179 it->ancestor = lb->stack; in layout_link_path()
182 if (it->ancestor->depth == svn_depth_infinity) in layout_link_path()
193 it->ancestor in layout_link_path()
[all …]
/dports/sysutils/chezmoi/chezmoi-2.9.3/vendor/github.com/go-git/go-git/v5/_examples/merge_base/
H A Dhelp-long.msg.go10 or: %_COMMAND_NAME_% <path> --is-ancestor <commitRev> <commitRev>
17 …the best common ancestor(s) between two commits. One common ancestor is better than another common…
18 …A common ancestor that does not have any better common ancestor is a best common ancestor, i.e. a …
28 --is-ancestor
29 …Check if the first commit is an ancestor of the second one, and exit with status 0 if true, or wit…
32 …d B, %_COMMAND_NAME_% A B will output a commit which is the best common ancestor of both, what mea…
44 …When the history involves cross-cross merges, there can be more than one best common ancestor for …
52 …s depending on other feature branches there can be also more than one common ancestor. For example:
/dports/net/cloudquery/cloudquery-0.16.0/vendor/github.com/go-git/go-git/v5/_examples/merge_base/
H A Dhelp-long.msg.go10 or: %_COMMAND_NAME_% <path> --is-ancestor <commitRev> <commitRev>
17 …the best common ancestor(s) between two commits. One common ancestor is better than another common…
18 …A common ancestor that does not have any better common ancestor is a best common ancestor, i.e. a …
28 --is-ancestor
29 …Check if the first commit is an ancestor of the second one, and exit with status 0 if true, or wit…
32 …d B, %_COMMAND_NAME_% A B will output a commit which is the best common ancestor of both, what mea…
44 …When the history involves cross-cross merges, there can be more than one best common ancestor for …
52 …s depending on other feature branches there can be also more than one common ancestor. For example:
/dports/sysutils/gomplate/gomplate-3.9.0/vendor/github.com/go-git/go-git/v5/_examples/merge_base/
H A Dhelp-long.msg.go10 or: %_COMMAND_NAME_% <path> --is-ancestor <commitRev> <commitRev>
17 …the best common ancestor(s) between two commits. One common ancestor is better than another common…
18 …A common ancestor that does not have any better common ancestor is a best common ancestor, i.e. a …
28 --is-ancestor
29 …Check if the first commit is an ancestor of the second one, and exit with status 0 if true, or wit…
32 …d B, %_COMMAND_NAME_% A B will output a commit which is the best common ancestor of both, what mea…
44 …When the history involves cross-cross merges, there can be more than one best common ancestor for …
52 …s depending on other feature branches there can be also more than one common ancestor. For example:
/dports/devel/lazygit/lazygit-0.31.4/vendor/github.com/jesseduffield/go-git/v5/go-git-341962be15a4/_examples/merge_base/
H A Dhelp-long.msg.go10 or: %_COMMAND_NAME_% <path> --is-ancestor <commitRev> <commitRev>
17 …the best common ancestor(s) between two commits. One common ancestor is better than another common…
18 …A common ancestor that does not have any better common ancestor is a best common ancestor, i.e. a …
28 --is-ancestor
29 …Check if the first commit is an ancestor of the second one, and exit with status 0 if true, or wit…
32 …d B, %_COMMAND_NAME_% A B will output a commit which is the best common ancestor of both, what mea…
44 …When the history involves cross-cross merges, there can be more than one best common ancestor for …
52 …s depending on other feature branches there can be also more than one common ancestor. For example:
/dports/devel/py-subversion/subversion-1.14.1/subversion/libsvn_client/
H A Dlayout.c48 struct layout_item_t *ancestor; member
85 lb->stack = it->ancestor; in layout_set_path()
119 it->ancestor = lb->stack; in layout_set_path()
122 if (!it->ancestor) in layout_set_path()
124 else if (it->ancestor->depth == svn_depth_infinity) in layout_set_path()
135 it->ancestor in layout_set_path()
165 lb->stack = it->ancestor; in layout_link_path()
179 it->ancestor = lb->stack; in layout_link_path()
182 if (it->ancestor->depth == svn_depth_infinity) in layout_link_path()
193 it->ancestor in layout_link_path()
[all …]
/dports/security/subversion-gnome-keyring/subversion-1.14.1/subversion/libsvn_client/
H A Dlayout.c48 struct layout_item_t *ancestor; member
85 lb->stack = it->ancestor; in layout_set_path()
119 it->ancestor = lb->stack; in layout_set_path()
122 if (!it->ancestor) in layout_set_path()
124 else if (it->ancestor->depth == svn_depth_infinity) in layout_set_path()
135 it->ancestor in layout_set_path()
165 lb->stack = it->ancestor; in layout_link_path()
179 it->ancestor = lb->stack; in layout_link_path()
182 if (it->ancestor->depth == svn_depth_infinity) in layout_link_path()
193 it->ancestor in layout_link_path()
[all …]
/dports/devel/gitty/gitty-0.3.0/vendor/github.com/go-git/go-git/v5/_examples/merge_base/
H A Dhelp-long.msg.go10 or: %_COMMAND_NAME_% <path> --is-ancestor <commitRev> <commitRev>
17 …the best common ancestor(s) between two commits. One common ancestor is better than another common…
18 …A common ancestor that does not have any better common ancestor is a best common ancestor, i.e. a …
28 --is-ancestor
29 …Check if the first commit is an ancestor of the second one, and exit with status 0 if true, or wit…
32 …d B, %_COMMAND_NAME_% A B will output a commit which is the best common ancestor of both, what mea…
44 …When the history involves cross-cross merges, there can be more than one best common ancestor for …
52 …s depending on other feature branches there can be also more than one common ancestor. For example:
/dports/devel/p5-subversion/subversion-1.14.1/subversion/libsvn_client/
H A Dlayout.c48 struct layout_item_t *ancestor; member
85 lb->stack = it->ancestor; in layout_set_path()
119 it->ancestor = lb->stack; in layout_set_path()
122 if (!it->ancestor) in layout_set_path()
124 else if (it->ancestor->depth == svn_depth_infinity) in layout_set_path()
135 it->ancestor in layout_set_path()
165 lb->stack = it->ancestor; in layout_link_path()
179 it->ancestor = lb->stack; in layout_link_path()
182 if (it->ancestor->depth == svn_depth_infinity) in layout_link_path()
193 it->ancestor in layout_link_path()
[all …]
/dports/devel/hadoop/jetty-6.1.14/modules/annotations/src/main/java/org/mortbay/jetty/annotations/
H A DAnnotationParser.java136 Class ancestor = clazz.getSuperclass(); in processClass() local
137 while (ancestor!=null && (!ancestor.equals(Object.class))) in processClass()
139 processHierarchy (clazz, ancestor, collection); in processClass()
140 ancestor = ancestor.getSuperclass(); in processClass()
156 …private static void processHierarchy (Class targetClazz, Class ancestor, AnnotationCollection coll… in processHierarchy() argument
160 if (ancestor==null) in processHierarchy()
164 collection.addClass(ancestor); in processHierarchy()
175 Method[] methods = ancestor.getDeclaredMethods(); in processHierarchy()
187 Field[] fields = ancestor.getDeclaredFields(); in processHierarchy()

12345678910>>...516