HomeSort by relevance Sort by last modified time
    Searched refs:siblings (Results 1 - 25 of 96) sorted by null

1 2 3 4

  /external/chromium_org/third_party/WebKit/Source/core/html/
HTMLContentElement.h 46 bool canSelectNode(const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth) const;
59 bool matchSelector(const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth) const;
81 inline bool HTMLContentElement::canSelectNode(const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth) const
87 if (!siblings[nth]->isElementNode())
89 return matchSelector(siblings, nth);
HTMLContentElement.cpp 113 static inline bool checkOneSelector(const CSSSelector& selector, const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth)
115 Element* element = toElement(siblings[nth]);
118 ShadowDOMSiblingTraversalStrategy strategy(siblings, nth);
122 bool HTMLContentElement::matchSelector(const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth) const
125 if (checkOneSelector(*selector, siblings, nth))
  /external/chromium_org/third_party/WebKit/Source/core/accessibility/
AXARIAGridCell.cpp 87 AccessibilityChildrenVector siblings = parent->children();
88 unsigned childrenSize = siblings.size();
90 if (siblings[k].get() == this) {
110 AccessibilityChildrenVector siblings = parent->children();
111 unsigned childrenSize = siblings.size();
113 if (siblings[k].get() == this) {
  /external/chromium_org/ui/wm/core/
transient_window_stacking_client.cc 19 // siblings of |window|. Returns true if any ancestors were found, false if not.
30 // are still siblings (have a common transient parent). |window1| and |window2|
103 // are siblings. This prevents one transient group from being inserted in the
110 const Window::Windows& siblings((*child)->parent()->children());
112 std::find(siblings.begin(), siblings.end(), *target) - siblings.begin();
113 while (target_i + 1 < siblings.size() &&
114 HasTransientAncestor(siblings[target_i + 1], *target)) {
117 *target = siblings[target_i]
    [all...]
base_focus_rules.cc 179 // windows is limited to the |ignore|'s siblings.
180 const aura::Window::Windows& siblings = ignore->parent()->children(); local
181 DCHECK(!siblings.empty());
183 for (aura::Window::Windows::const_reverse_iterator rit = siblings.rbegin();
184 rit != siblings.rend();
  /external/chromium_org/third_party/libvpx/source/libvpx/third_party/nestegg/halloc/src/
halloc.c 31 hlist_item_t siblings; /* 2 pointers */ member in struct:hblock
82 hlist_init_item(&p->siblings);
97 hlist_relink(&p->siblings);
105 hlist_del(&p->siblings);
125 hlist_del(&b->siblings);
138 hlist_add(&p->children, &b->siblings);
228 hblock_t * q = structof(i, hblock_t, siblings);
249 hblock_t * q = structof(i, hblock_t, siblings);
  /external/libvpx/libvpx/third_party/nestegg/halloc/src/
halloc.c 31 hlist_item_t siblings; /* 2 pointers */ member in struct:hblock
82 hlist_init_item(&p->siblings);
97 hlist_relink(&p->siblings);
105 hlist_del(&p->siblings);
125 hlist_del(&b->siblings);
138 hlist_add(&p->children, &b->siblings);
228 hblock_t * q = structof(i, hblock_t, siblings);
249 hblock_t * q = structof(i, hblock_t, siblings);
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/third_party/nestegg/halloc/src/
halloc.c 31 hlist_item_t siblings; /* 2 pointers */ member in struct:hblock
82 hlist_init_item(&p->siblings);
97 hlist_relink(&p->siblings);
105 hlist_del(&p->siblings);
125 hlist_del(&b->siblings);
138 hlist_add(&p->children, &b->siblings);
228 hblock_t * q = structof(i, hblock_t, siblings);
249 hblock_t * q = structof(i, hblock_t, siblings);
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/components/
DOMPresentationUtils.js 331 var siblings = parent.children(); variable
332 for (var i = 0; (ownIndex === -1 || !needsNthChild) && i < siblings.length; ++i) {
333 var sibling = siblings[i];
458 // Returns -1 in case of error, 0 if no siblings matching the same expression, <XPath index among the same expression-matching sibling nodes> otherwise.
476 var siblings = node.parentNode ? node.parentNode.children() : null;
477 if (!siblings)
478 return 0; // Root node - no siblings.
480 for (var i = 0; i < siblings.length; ++i) {
481 if (areNodesSimilar(node, siblings[i]) && siblings[i] !== node)
    [all...]
  /packages/apps/Mms/src/com/android/mms/dom/
NodeImpl.java 109 Vector<Node> siblings = ((NodeImpl)mParentNode).mChildNodes; local
110 int indexOfThis = siblings.indexOf(this);
111 return siblings.elementAt(indexOfThis + 1);
140 Vector<Node> siblings = ((NodeImpl)mParentNode).mChildNodes; local
141 int indexOfThis = siblings.indexOf(this);
142 return siblings.elementAt(indexOfThis - 1);
  /external/linux-tools-perf/perf-3.12.0/tools/perf/util/
callchain.h 24 struct list_head siblings; member in struct:callchain_node
93 INIT_LIST_HEAD(&root->node.siblings);
callchain.c 29 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);
424 list_del(&child->siblings);
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
SelectionOverlay.java 219 List<CanvasViewInfo> siblings = view.getNodeSiblings(); local
220 if (siblings != null) {
221 for (CanvasViewInfo sibling : siblings) {
CanvasViewInfo.java 100 * a <b>circular</b> list of all the siblings that share the same node.
210 * @return a non-empty list of siblings (including this), or null
641 * (for example that {@code <merge>} siblings will provide {@link MergeCookie}
1085 List<CanvasViewInfo> siblings = parentView.getChildren(); local
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/css/
SiblingTraversalStrategies.h 121 ShadowDOMSiblingTraversalStrategy(const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth)
122 : m_siblings(siblings)
  /external/chromium_org/third_party/libxslt/libxslt/
pattern.c 100 struct _xsltCompMatch *next; /* siblings in the name hash */
966 xmlNodePtr siblings = NULL; local
968 if (parent) siblings = parent->children;
970 while (siblings != NULL) {
971 if (siblings->type == XML_ELEMENT_NODE) {
972 if (siblings == node) {
976 (siblings->name != NULL) &&
977 (node->name[0] == siblings->name[0]) &&
978 (xmlStrEqual(node->name, siblings->name))) {
980 ((siblings->ns != NULL) &
1072 xmlNodePtr siblings = NULL; local
    [all...]
  /external/chromium_org/third_party/WebKit/Tools/Scripts/
malloc-tree 148 default=True, help='don\'t show bars lining up siblings in tree');
  /packages/apps/Bluetooth/src/com/android/bluetooth/map/
BluetoothMapEmailSettingsAdapter.java 138 BluetoothMapEmailSettingsItem siblings = childList.get(i);
139 if (!siblings.mIsChecked) {
  /external/chromium_org/sync/syncable/
directory.cc 328 const OrderedChildSet* siblings = local
331 OrderedChildSet::const_iterator it = siblings->find(kernel);
332 return std::distance(siblings->begin(), it);
1367 const OrderedChildSet* siblings = local
    [all...]
  /build/tools/droiddoc/templates-pdk/assets/
android-developer-docs.js 539 node.siblings().css("display","none"); // hide all siblings
544 node.siblings().filter(".en").css("display","inline");
553 node.siblings().css("display","none"); // hide all siblings
558 node.siblings().filter(".en").css("display","inline");
carousel.js 49 $("#"+appName).show().siblings().hide();
  /external/doclava/res/assets/templates/assets/
doclava-developer-docs.js 452 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/chrome/browser/resources/chromeos/chromevox/chromevox/injected/
node_breadcrumb.js 103 // if the siblings are needed, then some ancestor
  /external/chromium_org/chrome/browser/resources/chromeos/chromevox/walkers/
abstract_selection_walker.js 75 // to move across siblings if necessary and take the deepest node which can
  /external/yaffs2/yaffs2/
yaffs_guts.c 1318 newObjects[i].siblings.next =
1322 newObjects[nObjects - 1].siblings.next = (void *)dev->freeObjects;
1356 (yaffs_Object *) (dev->freeObjects->siblings.next);
1367 INIT_LIST_HEAD(&tn->siblings);
    [all...]

Completed in 1578 milliseconds

1 2 3 4