|
I want to parse current c++ files in a project and list out all the methods/functions in it and then generate the function call and caller trees. F.g. you can refer how doxygen generates the call tree.
I have checked gccxml but it doesn't list the functions...
Started by Funsuk Wangadu on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
Why not use that?
The static call tree isn't necessarily the runtime call ....
You mention Doxygen.
A good news, but recommended reading.
Gccxml, currently, essentially ignores function bodies (including calls to other functions).
|
|
Hi,
I'm a having a little trouble thinking how the hell do I fix the appropriate pointers when trying to delete a node from a binary tree where that node has 2 children.
I understand the basic concept and I'm basically just having trouble fixing the pointers...
Started by Nazgulled on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
Tree *extractMin(Tree *parent, Tree....
Updated extractMin() to cover the case when tree has no children.
The order of the nodes is:
H else if.
Let's suppose the tree below is ordered.
Inorder successor or predecessor.
|
|
I have a function get_trees() that operates on a complex tree structure T and returns two component tree structures A and B. The only way I have been able tot get this to work is to create a new structure C with pointers to A and B, which is then passed...
Answer Snippets (Read the full thread at stackoverflow):
Good form would be to declare your function has having out);
yeah....
But it's not considered good form.
It seems that the core problem is that "a structure allocated inside a function must of a function.
From the input tree.
|
Ask your Facebook Friends
|
I am looking for something like the $(document).ready function in jQuery, as I work on experimenting with using Closure.
So, my question is simple, is there a function I am missing that will allow me to wait until my function is called when the DOM tree...
Started by James Black on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
Cross Browser JavaScript DOMContentLoaded.
If you want to do it your way (instead of Google's way), perhaps this would work for you .
Inline script blocks appears to be your only choice.
Looks like you're out of luck according to this.
|
|
Hi I have a BST binary search tree
typedef struct Treenode *SearchTree; struct Treenode { int Element; SearchTree Left; SearchTree Right; };
and I want to create a function
FillArray(int sizeoftree, tree, int array[])
And I want to use an array and copy...
Started by nikos on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
Your problem is that your function FillArray is only modifying its argument a , which.
|
|
Suppose I want to implement a reasonably efficient 'keyword recognition algorithm', that is first given a list of keyword, and must then answer if another given word was in the list.
In an imperative language, I would store the keywords in a tree (one...
Started by Xavier Nodet on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
Assuming this or even another kind of ....
Sort of like a simple hash tree scheme for keyword lookup.
I think what you mean is a character per node.. .
I imagine you'd want something like a tree with a list of children, as described here .
|
|
Are there any modules or functions for dealing with trees? I have a type that looks like this:
type t = Leaf of string (* todo: replace with 'a *) | Node of string * t list
and I'm struggling to do insertion, removal of subtrees, etc.
I've used the googles...
Started by Rosarch on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
And extracted from the language documentation = Empty | Node of 'a * 'a btree * 'a btree... .
It depends on the way you want your tree to work, for example if there is order between elements, I've never used that in a b-tree context though...
|
|
Does anybody know where I can find a utility/application running on Windows that analyses C source and outputs a functional dependency tree?
What I'm looking for is something along these lines:
PrintString->PrintCharacter->PrintByte->Printf
Started by Maltrap on
, 6 posts
by 6 people.
Answer Snippets (Read the full thread at stackoverflow):
It can display call tree graphs (and almost any other relationship a conservative....
Here's a page with a sample call tree generated by Doxygen the functionality of CTAGS/CSCOPE rolled in.
With Doxygen (if you have Graphviz dot installed).
|
|
If right[x] != NIL then return TREE-MINIMUM(right[x]) y<-p[x] while y!= NIL and x = right[y] do x<-y y<-p[y] return y
I know what "if right[x] != NIL then return tree-min" means and I've translated it to:
if(p->RChild) return fMinValue(p-&...
Started by Azreal on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
But I'm not sure that I would describe this as a successor function..
Of the algorithm presented here walks up the tree looking for the first time you ascended a left link instead of a right one.
|
|
Any node can have any number of children. To search this tree i wrote something like this
function Search(key, nodes){ for (var i = 0; i < nodes.length; i++) { if (nodes[i].key == key) { return nodes[i]; } if (nodes[i].hasOwnProperty('children')) {...
Started by gnomixa on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
This means "the current Function object." Try replacing this.Search with just Search ..
If this is Javascript, this in your code this.Search is probably what's giving you the problem .
Of the function.
|
