/external/eigen/Eigen/src/SparseLU/ |
SparseLU_relax_snode.h | 43 * \param descendants Number of descendants of each node in the etree 47 void SparseLUImpl<Scalar,Index>::relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end) 50 // compute the number of descendants of each node in the etree 53 descendants.setZero(); 58 descendants(parent) += descendants(j) + 1; 66 while ( parent != n && descendants(parent) < relax_columns ) 75 while (descendants(j) != 0 && j < n) j++;
|
SparseLU_heap_relax_snode.h | 42 * \param descendants Number of descendants of each node in the etree 46 void SparseLUImpl<Scalar,Index>::heap_relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end) 66 // compute the number of descendants of each node in the etree 69 descendants.setZero(); 74 descendants(parent) += descendants(j) + 1; 86 while ( parent != n && descendants(parent) < relax_columns ) 108 if (descendants(i) == 0) 117 while (descendants(j) != 0 && j < n) j++ [all...] |
SparseLUImpl.h | 37 void heap_relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end); 38 void relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end);
|
/external/chromium_org/chrome/browser/task_profiler/ |
task_profiler_data_serializer_unittest.cc | 47 "\"descendants\":[" 98 process_data.descendants.push_back( 100 process_data.descendants.back().parent = parent; 101 process_data.descendants.back().child = child; 106 "\"descendants\":["
|
task_profiler_data_serializer.cc | 102 process_data.descendants.begin(); 103 it != process_data.descendants.end(); ++it) { 109 dictionary->Set("descendants", descendants_list.release());
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
GrammarAST.java | 355 public static List<Tree> descendants(Tree root){ method in class:GrammarAST 356 return descendants(root, false); 359 public static List<Tree> descendants(Tree root, boolean insertDownUpNodes){ method in class:GrammarAST 369 for (Tree subchild : descendants(child, true)) 378 for (Tree subchild : descendants(child, false)) 392 List<Tree> descendants = descendants(this); local 393 for (Tree child : descendants) { 449 Iterator<Tree> thisDescendants = descendants(this, true).iterator(); 450 Iterator<Tree> otherDescendants = descendants(other, true).iterator() [all...] |
/external/chromium_org/base/ |
tracked_objects_unittest.cc | 95 EXPECT_EQ(0u, process_data.descendants.size()); 237 ASSERT_EQ(1u, process_data.descendants.size()); 238 EXPECT_EQ(kFile, process_data.descendants[0].parent.location.file_name); 240 process_data.descendants[0].parent.location.function_name); 242 process_data.descendants[0].parent.location.line_number); 244 process_data.descendants[0].parent.thread_name); 245 EXPECT_EQ(kFile, process_data.descendants[0].child.location.file_name); 247 process_data.descendants[0].child.location.function_name); 249 process_data.descendants[0].child.location.line_number); 250 EXPECT_EQ(kWorkerThreadName, process_data.descendants[0].child.thread_name) [all...] |
tracked_objects.h | 784 std::vector<ParentChildPairSnapshot> descendants; member in struct:tracked_objects::ProcessDataSnapshot [all...] |
tracked_objects.cc | 629 process_data->descendants.push_back(ParentChildPairSnapshot(*it));
|
/external/chromium_org/content/common/ |
child_process_messages.h | 56 IPC_STRUCT_TRAITS_MEMBER(descendants)
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
Fullscreen.cpp | 332 // 3. Let descendants be all the doc's descendant browsing context's documents with a non-empty fullscreen 335 WillBeHeapDeque<RefPtrWillBeMember<Document> > descendants; 341 descendants.prepend(toLocalFrame(descendant)->document()); 344 // 4. For each descendant in descendants, empty descendant's fullscreen element stack, and queue a 346 for (WillBeHeapDeque<RefPtrWillBeMember<Document> >::iterator i = descendants.begin(); i != descendants.end(); ++i) {
|
/external/chromium_org/cc/trees/ |
layer_tree_host_common.cc | 237 // descendants). 312 // If we have unclipped descendants, the draw transform is a translation. 558 // A layer and its descendants should render onto a new RenderSurfaceImpl if 605 // types of quads than RenderPassDrawQuad. Layers having descendants that draw 616 // If the layer clips its descendants but it is not axis-aligned with respect 660 // the blending descendants might have access to the content behind this layer 661 // (layer has transparent background or descendants overflow). 2066 typename LayerType::LayerListType& descendants = local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
RenderBlock.h | 128 TrackedRendererListHashSet* descendants = percentHeightDescendants(); local 129 return descendants && !descendants->isEmpty();
|
RenderBlock.cpp | 307 // Clear our positioned objects list. Our absolutely positioned descendants will be 311 // Remove our absolutely positioned descendants from their current containing block. [all...] |
/external/chromium_org/v8/tools/ |
profile_view.js | 91 * corresponding function and its descendants (not that depending on 153 * corresponding function and its descendants (not that depending on
|
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
focuser.js | 20 * @param {boolean=} opt_focusDescendants Whether or not we check descendants
|
dom_util.js | 129 * for forced invisibility traits of descendants. True by default. 130 * checkDescendants: {boolean=} True if we should consider descendants of 160 * for forced invisibility traits of descendants. 161 * @param {boolean} checkDescendants True if we should consider descendants of 226 * Sometimes we already have information about the descendants, and we do 249 // Carry on with a recursive check of the descendants. 269 * true (invisible) even when an element has have visible descendants. This 270 * is because an element with visibility:hidden can have descendants that 336 * presence of descendants. We should be more precise in the documentation [all...] |
aria_util.js | 512 var descendants = cvox.AriaUtil.getNextLevel(parentControl, 515 listLength = descendants.length; 518 for (var j = 0; j < descendants.length; j++) { 519 if (descendants[j] == currentDescendant) { 585 * @param {Node} parentControl The node whose descendants should be analyzed.
|
/external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/lib/ |
prototype-1.7.js | [all...] |
/external/chromium_org/tools/gyp/pylib/gyp/ |
xcodeproj_file.py | 461 """Verifies that no two objects have the same ID. Checks all descendants. 465 descendants = self.Descendants() 466 for descendant in descendants: 488 def Descendants(self): 489 """Returns a list of all of this object's descendants, including this 494 descendants = [self] 496 descendants.extend(child.Descendants()) 497 return descendants [all...] |
/external/chromium_org/sync/syncable/ |
directory.cc | 324 const OrderedChildSet* descendants = local 326 if (!descendants) 330 child_sets->push_back(descendants); [all...] |
/build/tools/releasetools/ |
ota_from_target_files | 249 print "%s%s" % (" "*indent, self.descendants) 258 values. Recursively calls itself for all descendants. 261 all descendants of this node. (dmode or fmode may be None.) Also 264 descendants of that Item. 268 d = self.descendants = {(self.uid, self.gid, self.mode, None, self.selabel, self.capabilities): 1} 278 # tuple that matches the most descendants. 281 # descendants. 288 # the most descendants with that (uid, gid), and choose those. [all...] |
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
Antlr.Runtime.Tools.pas | 359 /// -IInterface descendants (default property)
|
/external/chromium_org/ui/file_manager/file_manager/foreground/js/ |
directory_contents.js | 521 * and filling the fileList. Different descendants handle various types of
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/parse-only/ |
prototype-1.6.0.3.js | [all...] |