>
> It's a simple structure with a field for a database instance (dbip), a
> function callback when you walk down a hierarchy and encounter combs, a
> callback for the leaves (primitives), and a callback when you walk back up
> the hierarchy for each combination. The client_data field is a generic
> void* that you can use to store any data or state that you need (like the
> matrix or a struct containing your matrix)
>
Well looking at the routine, its looks nice; but was actually thinking of
using db_functree() to walk recursively up the tree from the leaves
inverting and storing the matrix matrix transformations at respective
points up the tree and it'll be simpler than actually calling the
db_traverse struct; but the correct problem i'm facing is implementing the
pull_leaf routine which successfully extracting the matrix transformations
from the leaves since it currently does not have one. Could you please help
me out here. Currently implement the (comb_func) routine which will need
the pull_leaf(). Was actually thinking of using the db_tree_state structure
but don't actually know for sure if its really going to be useful in
implementing my pull_leaf() routine.
Cheers!
Nyah
------------------------------------------------------------------------------
Get 100% visibility into Java/.NET code with AppDynamics Lite!
It's a free troubleshooting tool designed for production.
Get down to code-level detail for bottlenecks, with <2% overhead.
Download for free and get started troubleshooting in minutes.
http://pubads.g.doubleclick.net/gampad/clk?id=48897031&iu=/4140/ostg.clktrk
_______________________________________________
BRL-CAD Developer mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/brlcad-devel
