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

1 2 3

  /external/chromium_org/third_party/WebKit/Source/core/accessibility/
AccessibilityARIAGridCell.cpp 88 AccessibilityChildrenVector siblings = parent->children();
89 unsigned childrenSize = siblings.size();
91 if (siblings[k].get() == this) {
111 AccessibilityChildrenVector siblings = parent->children();
112 unsigned childrenSize = siblings.size();
114 if (siblings[k].get() == this) {
  /external/chromium_org/third_party/WebKit/Source/core/html/shadow/
HTMLContentElement.h 48 bool canSelectNode(const Vector<Node*>& siblings, int nth) const;
61 bool matchSelector(const Vector<Node*>& siblings, int nth) const;
83 inline bool HTMLContentElement::canSelectNode(const Vector<Node*>& siblings, int nth) const
89 if (!siblings[nth]->isElementNode())
91 return matchSelector(siblings, nth);
HTMLContentElement.cpp 108 static inline bool checkOneSelector(const CSSSelector* selector, const Vector<Node*>& siblings, int nth)
110 Element* element = toElement(siblings[nth]);
113 ShadowDOMSiblingTraversalStrategy strategy(siblings, nth);
118 bool HTMLContentElement::matchSelector(const Vector<Node*>& siblings, int nth) const
121 if (checkOneSelector(selector, siblings, nth))
  /external/libvpx/libvpx/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/ui/views/corewm/
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();
  /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/util/
callchain.h 26 struct list_head siblings; member in struct:callchain_node
82 INIT_LIST_HEAD(&root->node.siblings);
callchain.c 30 list_for_each_entry(child, &parent->children, siblings)
33 list_for_each_entry_safe(child, next, &parent->children, siblings)
193 list_add_tail(&new->siblings, &parent->children);
423 list_del(&child->siblings);
  /external/chromium/net/tools/testserver/
chromiumsync.py 385 siblings = [x for x in self._entries.values()
387 siblings = sorted(siblings, key=operator.attrgetter('position_in_parent'))
390 if not siblings:
395 entry.position_in_parent = ExtendRange(siblings[0], -1)
398 for item, successor in zip(siblings, siblings[1:]):
412 entry.position_in_parent = ExtendRange(siblings[-1], +1)
    [all...]
  /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...]
DomUtilities.java 575 * Returns true iff the given elements are contiguous siblings
578 * @return true if the elements are contiguous siblings with no gaps
582 // All elements must be siblings (e.g. same parent)
593 // Ensure that the siblings are contiguous; no gaps.
596 List<Element> siblings = DomUtilities.getChildren((Element) parent); local
597 if (siblings.size() != elements.size()) {
601 for (Element node : siblings) {
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/css/
SiblingTraversalStrategies.h 125 ShadowDOMSiblingTraversalStrategy(const Vector<Node*>& siblings, int nth)
126 : m_siblings(siblings)
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/
DOMAgent.js 688 // Returns -1 in case of error, 0 if no siblings matching the same expression, <XPath index among the same expression-matching sibling nodes> otherwise.
706 var siblings = this.parentNode ? this.parentNode._children : null;
707 if (!siblings)
708 return 0; // Root node - no siblings.
710 for (var i = 0; i < siblings.length; ++i) {
711 if (areNodesSimilar(this, siblings[i]) && siblings[i] !== this) {
719 for (var i = 0; i < siblings.length; ++i) {
720 if (areNodesSimilar(this, siblings[i])) {
721 if (siblings[i] === this
    [all...]
  /external/chromium_org/sync/syncable/
directory.cc 335 const OrderedChildSet* siblings = local
338 OrderedChildSet::const_iterator it = siblings->find(kernel);
339 return std::distance(siblings->begin(), it);
1224 const OrderedChildSet* siblings = local
    [all...]
  /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/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');
  /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/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...]
yaffs_guts.h 429 struct list_head siblings; member in struct:yaffs_ObjectStruct
  /external/yaffs2/yaffs2/direct/
yaffsfs.c 1205 yaffs_Object,siblings);
1222 struct list_head *next = dsc->nextReturn->siblings.next;
1227 dsc->nextReturn = list_entry(next,yaffs_Object,siblings);
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
tree.rb 214 [siblings] all other nodes sharing the same parent as some node
262 def siblings method in class:ANTLR3.AST.for
    [all...]

Completed in 2670 milliseconds

1 2 3