| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/pat_trie_/ |
| traits.hpp | 46 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp>
110 leaf; typedef in struct:__gnu_pbds::detail::trie_traits
132 leaf,
143 leaf,
154 leaf,
165 leaf,
175 leaf,
187 leaf,
271 leaf; typedef in struct:__gnu_pbds::detail::trie_traits
293 leaf,
[all...] |
| cond_dtor_entry_dealtor.hpp | 69 m_p_nd->~leaf();
|
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| traits.hpp | 46 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp>
110 leaf; typedef in struct:__gnu_pbds::detail::trie_traits
132 leaf,
143 leaf,
154 leaf,
165 leaf,
175 leaf,
187 leaf,
271 leaf; typedef in struct:__gnu_pbds::detail::trie_traits
293 leaf,
[all...] |
| cond_dtor_entry_dealtor.hpp | 69 m_p_nd->~leaf();
|
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| traits.hpp | 46 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp>
110 leaf; typedef in struct:__gnu_pbds::detail::trie_traits
132 leaf,
143 leaf,
154 leaf,
165 leaf,
175 leaf,
187 leaf,
271 leaf; typedef in struct:__gnu_pbds::detail::trie_traits
293 leaf,
[all...] |
| cond_dtor_entry_dealtor.hpp | 69 m_p_nd->~leaf();
|
| /prebuilt/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| traits.hpp | 46 #include <ext/pb_ds/detail/pat_trie_/leaf.hpp>
110 leaf; typedef in struct:__gnu_pbds::detail::trie_traits
132 leaf,
143 leaf,
154 leaf,
165 leaf,
175 leaf,
187 leaf,
271 leaf; typedef in struct:__gnu_pbds::detail::trie_traits
293 leaf,
[all...] |
| cond_dtor_entry_dealtor.hpp | 69 m_p_nd->~leaf();
|
| /external/quake/quake/src/QW/client/ |
| gl_refrag.c | 59 prev = &ef->leaf->efrags;
94 mleaf_t *leaf; local
102 // add an efrag if the node is a leaf
109 leaf = (mleaf_t *)node;
127 // set the leaf links
128 ef->leaf = leaf;
129 ef->leafnext = leaf->efrags;
130 leaf->efrags = ef;
|
| r_efrag.c | 60 prev = &ef->leaf->efrags;
95 mleaf_t *leaf; local
103 // add an efrag if the node is a leaf
110 leaf = (mleaf_t *)node;
128 // set the leaf links
129 ef->leaf = leaf;
130 ef->leafnext = leaf->efrags;
131 leaf->efrags = ef;
174 r_pefragtopnode = node; // we've reached a non-solid leaf, so it'
[all...] |
| render.h | 30 struct mleaf_s *leaf; member in struct:efrag_s
53 // found in an active leaf
|
| /external/quake/quake/src/WinQuake/ |
| gl_refrag.cpp | 59 prev = &ef->leaf->efrags;
94 mleaf_t *leaf; local
102 // add an efrag if the node is a leaf
109 leaf = (mleaf_t *)node;
127 // set the leaf links
128 ef->leaf = leaf;
129 ef->leafnext = leaf->efrags;
130 leaf->efrags = ef;
|
| r_efrag.cpp | 60 prev = &ef->leaf->efrags;
95 mleaf_t *leaf;
local
103 // add an efrag if the node is a leaf
110 leaf = (mleaf_t *)node;
128 // set the leaf links
129 ef->leaf = leaf;
130 ef->leafnext = leaf->efrags;
131 leaf->efrags = ef;
174 r_pefragtopnode = node; // we've reached a non-solid leaf, so it's
[all...] |
| /external/webkit/Source/WebCore/rendering/ |
| InlineBox.cpp | 246 InlineBox* leaf = 0; local
247 for (InlineBox* box = nextOnLine(); box && !leaf; box = box->nextOnLine())
248 leaf = box->isLeaf() ? box : static_cast<InlineFlowBox*>(box)->firstLeafChild();
249 if (!leaf && parent())
250 leaf = parent()->nextLeafChild();
251 return leaf;
256 InlineBox* leaf = 0; local
257 for (InlineBox* box = prevOnLine(); box && !leaf; box = box->prevOnLine())
258 leaf = box->isLeaf() ? box : static_cast<InlineFlowBox*>(box)->lastLeafChild();
259 if (!leaf && parent()
[all...] |
| RootInlineBox.cpp | 456 static bool isEditableLeaf(InlineBox* leaf)
458 return leaf && leaf->renderer() && leaf->renderer()->node() && leaf->renderer()->node()->rendererIsEditable();
480 for (InlineBox* leaf = firstLeaf; leaf; leaf = leaf->nextLeafChild()) {
481 if (!leaf->renderer()->isListMarker() && (!onlyEditableLeaves || isEditableLeaf(leaf)))
[all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| TCPageMap.h | 104 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf.
111 // Leaf node
112 struct Leaf {
116 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes
147 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local
148 if (leaf == NULL) return false;
149 memset(leaf, 0, sizeof(*leaf))
259 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local
[all...] |
| /external/webkit/Source/WebCore/rendering/svg/ |
| SVGRootInlineBox.cpp | 216 for (InlineBox* leaf = firstLeaf; leaf; leaf = leaf->nextLeafChild()) {
217 if (!leaf->isSVGInlineTextBox())
219 if (point.y() < leaf->m_y)
221 if (point.y() > leaf->m_y + leaf->virtualLogicalHeight())
224 closestLeaf = leaf;
225 if (point.x() < leaf->m_x + leaf->m_logicalWidth
[all...] |
| /frameworks/base/include/utils/ |
| String8.h | 193 * If leaf is a fully qualified path (i.e. starts with '/', it
196 String8& appendPath(const char* leaf);
197 String8& appendPath(const String8& leaf) { return appendPath(leaf.string()); }
202 String8 appendPathCopy(const char* leaf) const
203 { String8 p(*this); p.appendPath(leaf); return p; }
204 String8 appendPathCopy(const String8& leaf) const { return appendPathCopy(leaf.string()); }
|
| /external/chromium/chrome/browser/resources/sync_internals/ |
| sync_node_browser.css | 28 /* TODO(akalin): Find a better icon to use for leaf nodes. */
29 #sync-node-tree .leaf .tree-label {
|
| /sdk/hierarchyviewer2/libs/hierarchyviewerlib/src/com/android/hierarchyviewerlib/ui/util/ |
| DrawableViewNode.java | 52 public boolean leaf; field in class:DrawableViewNode
119 leaf = true;
121 leaf = false;
133 if (prevChild.leaf && child.leaf) {
233 if (leaf) {
|
| /external/v8/test/mjsunit/compiler/ |
| expression-trees.js | 30 // Given a binary operation string and an ordered array of leaf
36 // One leaf is a leaf.
39 // More than one leaf requires an interior node.
63 // Set up leaf masks to set 8 least-significant bits.
86 // Set up leaf masks to clear 8 least-significant bits.
|
| /packages/apps/Browser/tests/src/com/android/browser/tests/utils/ |
| MockObserverNode.java | 73 // If this is the leaf node add the observer
125 private void notifyMyObservers(boolean leaf, ContentObserver observer,
138 if (leaf || (!leaf && entry.notifyForDescendents)) {
149 // This is the leaf node, notify all observers
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newproject/ |
| SdkSelectionPage.java | 243 String leaf = f.getName(); local
244 if (!SdkConstants.FD_SOURCES.equals(leaf) &&
245 !SdkConstants.FD_ASSETS.equals(leaf) &&
246 !SdkConstants.FD_RES.equals(leaf)) {
|
| /external/junit/src/junit/swingui/ |
| TestSuitePanel.java | 56 boolean sel, boolean expanded, boolean leaf, int row, boolean hasFocus) {
58 Component c= super.getTreeCellRendererComponent(tree, value, sel, expanded, leaf, row, hasFocus);
|
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 169 // Both leaf and branch nodes store vectors of pairs.
185 // 8 4 16 0 Leaf<4,4>, Branch<4>
186 // 8 8 12 0 Leaf<4,8>, Branch<8>
187 // 16 4 9 12 Leaf<8,4>
188 // 16 8 8 0 Leaf<8,8>
412 // Compute the leaf node branching factor that makes a node fit in three
426 // Now that we have the leaf branching factor, compute the actual allocation
435 /// Allocator - The recycling allocator used for both branch and leaf nodes.
458 // A NodeRef doesn't know whether it references a leaf node or a branch node.
522 // Leaf nodes store up to N disjoint intervals with corresponding values
[all...] |
