Home
last modified time | relevance | path

Searched refs:siblings (Results 1 – 25 of 46) sorted by relevance

12

/external/chromium_org/third_party/WebKit/Source/core/accessibility/
DAXARIAGridCell.cpp87 AccessibilityChildrenVector siblings = parent->children(); in rowIndexRange() local
88 unsigned childrenSize = siblings.size(); in rowIndexRange()
90 if (siblings[k].get() == this) { in rowIndexRange()
110 AccessibilityChildrenVector siblings = parent->children(); in columnIndexRange() local
111 unsigned childrenSize = siblings.size(); in columnIndexRange()
113 if (siblings[k].get() == this) { in columnIndexRange()
/external/chromium_org/ui/wm/core/
Dtransient_window_stacking_client.cc110 const Window::Windows& siblings((*child)->parent()->children()); in AdjustStacking() local
112 std::find(siblings.begin(), siblings.end(), *target) - siblings.begin(); in AdjustStacking()
113 while (target_i + 1 < siblings.size() && in AdjustStacking()
114 HasTransientAncestor(siblings[target_i + 1], *target)) { in AdjustStacking()
117 *target = siblings[target_i]; in AdjustStacking()
Dbase_focus_rules.cc179 const aura::Window::Windows& siblings = ignore->parent()->children(); in GetNextActivatableWindow() local
180 DCHECK(!siblings.empty()); in GetNextActivatableWindow()
182 for (aura::Window::Windows::const_reverse_iterator rit = siblings.rbegin(); in GetNextActivatableWindow()
183 rit != siblings.rend(); in GetNextActivatableWindow()
/external/chromium_org/third_party/WebKit/Source/core/html/
DHTMLContentElement.h47 … bool canSelectNode(const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth) const;
60 … bool matchSelector(const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth) const;
82 …ement::canSelectNode(const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth) const in canSelectNode() argument
88 if (!siblings[nth]->isElementNode()) in canSelectNode()
90 return matchSelector(siblings, nth); in canSelectNode()
DHTMLContentElement.cpp116 …nst CSSSelector& selector, const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth) in checkOneSelector() argument
118 Element* element = toElement(siblings[nth]); in checkOneSelector()
121 ShadowDOMSiblingTraversalStrategy strategy(siblings, nth); in checkOneSelector()
125 …ement::matchSelector(const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth) const in matchSelector() argument
128 if (checkOneSelector(*selector, siblings, nth)) in matchSelector()
/external/libvpx/libvpx/third_party/nestegg/halloc/src/
Dhalloc.c31 hlist_item_t siblings; /* 2 pointers */ member
82 hlist_init_item(&p->siblings); in halloc()
97 hlist_relink(&p->siblings); in halloc()
105 hlist_del(&p->siblings); in halloc()
125 hlist_del(&b->siblings); in hattach()
138 hlist_add(&p->children, &b->siblings); in hattach()
228 hblock_t * q = structof(i, hblock_t, siblings); in _relate()
249 hblock_t * q = structof(i, hblock_t, siblings); in _free_children()
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/components/
DDOMPresentationUtils.js331 var siblings = parent.children();
332 for (var i = 0; (ownIndex === -1 || !needsNthChild) && i < siblings.length; ++i) {
333 var sibling = siblings[i];
476 var siblings = node.parentNode ? node.parentNode.children() : null;
477 if (!siblings)
480 for (var i = 0; i < siblings.length; ++i) {
481 if (areNodesSimilar(node, siblings[i]) && siblings[i] !== node) {
489 for (var i = 0; i < siblings.length; ++i) {
490 if (areNodesSimilar(node, siblings[i])) {
491 if (siblings[i] === node)
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/
Dcallchain.h24 struct list_head siblings; member
93 INIT_LIST_HEAD(&root->node.siblings); in callchain_init()
Dcallchain.c29 list_for_each_entry(child, &parent->children, siblings)
32 list_for_each_entry_safe(child, next, &parent->children, siblings)
192 list_add_tail(&new->siblings, &parent->children); in create_child()
424 list_del(&child->siblings); in merge_chain_branch()
/external/chromium_org/third_party/libxslt/libxslt/
Dpattern.c966 xmlNodePtr siblings = NULL; in xsltTestCompMatch() local
968 if (parent) siblings = parent->children; in xsltTestCompMatch()
970 while (siblings != NULL) { in xsltTestCompMatch()
971 if (siblings->type == XML_ELEMENT_NODE) { in xsltTestCompMatch()
972 if (siblings == node) { in xsltTestCompMatch()
976 (siblings->name != NULL) && in xsltTestCompMatch()
977 (node->name[0] == siblings->name[0]) && in xsltTestCompMatch()
978 (xmlStrEqual(node->name, siblings->name))) { in xsltTestCompMatch()
980 ((siblings->ns != NULL) && in xsltTestCompMatch()
982 siblings->ns->href)))) in xsltTestCompMatch()
[all …]
/external/doclava/res/assets/templates/assets/
Ddoclava-developer-docs.js452 node.siblings().css("display","none"); // hide all siblings
457 node.siblings().filter(".en").css("display","inline");
466 node.siblings().css("display","none"); // hide all siblings
471 node.siblings().filter(".en").css("display","inline");
/external/chromium_org/third_party/WebKit/Source/core/css/
DSiblingTraversalStrategies.h116 …OMSiblingTraversalStrategy(const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth) in ShadowDOMSiblingTraversalStrategy() argument
117 : m_siblings(siblings) in ShadowDOMSiblingTraversalStrategy()
/external/chromium_org/sync/syncable/
Ddirectory.cc336 const OrderedChildSet* siblings = in GetPositionIndex() local
339 OrderedChildSet::const_iterator it = siblings->find(kernel); in GetPositionIndex()
340 return std::distance(siblings->begin(), it); in GetPositionIndex()
1393 const OrderedChildSet* siblings = in PutPredecessor() local
1396 if (!siblings) { in PutPredecessor()
1406 UniquePosition successor_pos = (*siblings->begin())->ref(UNIQUE_POSITION); in PutPredecessor()
1417 DCHECK(!siblings->empty()); in PutPredecessor()
1430 OrderedChildSet::const_iterator neighbour = siblings->find(predecessor); in PutPredecessor()
1431 DCHECK(neighbour != siblings->end()); in PutPredecessor()
1434 if (neighbour == siblings->end()) { in PutPredecessor()
/external/skia/gyp/
Dcommon_variables.gypi30 # and NOT inherited by "uncles" (siblings of directly enclosing 'variable'
56 # so that siblings of the level-2 'variables' dict can see them.
186 # so that siblings of the level-1 'variables' dict can see them.
/external/chromium_org/third_party/skia/gyp/
Dcommon_variables.gypi30 # and NOT inherited by "uncles" (siblings of directly enclosing 'variable'
56 # so that siblings of the level-2 'variables' dict can see them.
192 # so that siblings of the level-1 'variables' dict can see them.
/external/yaffs2/yaffs2/
Dyaffs_guts.c1318 newObjects[i].siblings.next = in yaffs_CreateFreeObjects()
1322 newObjects[nObjects - 1].siblings.next = (void *)dev->freeObjects; in yaffs_CreateFreeObjects()
1356 (yaffs_Object *) (dev->freeObjects->siblings.next); in yaffs_AllocateEmptyObject()
1367 INIT_LIST_HEAD(&tn->siblings); in yaffs_AllocateEmptyObject()
1435 tn->siblings.next = (struct list_head *)(dev->freeObjects); in yaffs_FreeObject()
4508 list_del_init(&hl->siblings); in yaffs_UnlinkWorker()
5123 l = list_entry(i, yaffs_Object, siblings); in yaffs_Scan()
5804 l = list_entry(i, yaffs_Object, siblings); in yaffs_ScanBackwards()
5814 l = list_entry(i, yaffs_Object, siblings); in yaffs_ScanBackwards()
5837 list_del_init(&obj->siblings); in yaffs_RemoveObjectFromDirectory()
[all …]
Dyaffs_guts.h429 struct list_head siblings; member
/external/yaffs2/yaffs2/direct/
Dyaffsfs.c1205 yaffs_Object,siblings); in yaffsfs_SetDirRewound()
1222 struct list_head *next = dsc->nextReturn->siblings.next; in yaffsfs_DirAdvance()
1227 dsc->nextReturn = list_entry(next,yaffs_Object,siblings); in yaffsfs_DirAdvance()
/external/libmtp/
DTODO106 entire list for each group of siblings right now!
/external/chromium_org/chrome/browser/ui/cocoa/tabs/
Dtab_window_controller.mm298 // Add the tab strip directly above the content view, if they are siblings.
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
Dtree.rb262 def siblings method
/external/chromium_org/content/browser/web_contents/
Dweb_contents_view_mac.mm311 // with us. In case there are other siblings of the content area, we want
/external/protobuf/src/google/protobuf/
Dunittest.proto384 // Test that groups have disjoint field numbers from their siblings and
/external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/
Djquery.js1260 siblings: function(elem){return jQuery.sibling(elem.parentNode.firstChild,elem);}, method
/external/chromium_org/third_party/protobuf/src/google/protobuf/
Dunittest.proto407 // Test that groups have disjoint field numbers from their siblings and

12