Searched defs:first_child (Results 1 - 9 of 9) sorted by relevance

/external/qemu/android/
H A Dconfig-file.h25 AConfig* first_child; member in struct:AConfig
/external/chromium_org/mojo/examples/wm_flow/wm/
H A Dwm.cc97 mojo::View* first_child = view->children().front(); local
98 first_child->Destroy();
/external/chromium_org/cc/output/
H A Dbsp_tree.h63 const BspNode* first_child,
67 if (first_child) {
68 WalkInOrderRecursion(action_handler, first_child);
60 WalkInOrderVisitNodes( ActionHandlerType* action_handler, const BspNode* node, const BspNode* first_child, const BspNode* second_child, const ScopedPtrVector<DrawPolygon>& first_coplanars, const ScopedPtrVector<DrawPolygon>& second_coplanars) const argument
/external/chromium_org/extensions/common/features/
H A Dbase_feature_provider.cc159 const FeatureMap::const_iterator first_child = features_.lower_bound(prefix); local
167 result.reserve(std::distance(first_child, after_children));
168 for (FeatureMap::const_iterator it = first_child; it != after_children;
/external/chromium_org/base/json/
H A Djson_value_converter_unittest.cc166 const SimpleMessage* first_child = message.children[0]; local
167 ASSERT_TRUE(first_child);
168 EXPECT_EQ(2, first_child->foo);
169 EXPECT_EQ("foobar", first_child->bar);
170 EXPECT_TRUE(first_child->baz);
171 EXPECT_TRUE(first_child->bstruct);
172 ASSERT_EQ(1U, first_child->string_values.size());
173 EXPECT_EQ("value_1", *first_child->string_values[0]);
/external/chromium_org/content/renderer/accessibility/
H A Drenderer_accessibility_browsertest.cc285 const WebAXObject& first_child = root_obj.childAt(0); local
287 first_child,
/external/chromium_org/cc/layers/
H A Dlayer_unittest.cc1060 scoped_refptr<Layer> first_child = Layer::Create(); local
1066 first_parent->AddChild(first_child);
/external/e2fsprogs/e2fsck/
H A Dprofile.c142 struct profile_node *first_child; member in struct:profile_node
1039 * or more child nodes, pointed to by first_child.
1042 * containing a string. Its first_child pointer must be null.
1059 for (child=node->first_child; child; child = next) {
1124 if (node->value && node->first_child)
1128 for (p = node->first_child; p; last = p, p = p->next) {
1164 for (p=section->first_child, last = 0; p; last = p, p = p->next) {
1183 section->first_child = new;
1214 p = section->first_child;
1392 for (p=section->first_child;
[all...]
/external/openfst/src/include/fst/extensions/ngram/
H A Dngram-fst.h573 size_t first_child = context_index_.Select0(node_rank) + 1; local
574 if (context_index_.Get(first_child) == false) {
579 children = context_words_ + context_index_.Rank1(first_child);
580 loc = lower_bound(children, children + last_child - first_child + 1,
582 if (loc == children + last_child - first_child + 1 ||
586 node = first_child + loc - children;
588 first_child = context_index_.Select0(node_rank) + 1;
589 if (context_index_.Get(first_child) == false) break;
609 size_t first_child = context_index_.Select0(node_rank) + 1; local
611 if (context_index_.Get(first_child) !
[all...]

Completed in 354 milliseconds