-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Would it be possible to detect a recursive file operation, stop at that point in the graph and then simply call the corresponding Ruby code the rest of the way down for specific operations?
I can, unfortunately, see this approach wreaking havok with my recent symbolic mode patch as an example of where it wouldn't work. Alternatively, instead of merging all of the sub-file objects into the main graph, could you create a subgraph that is built off of a DFS from that originating recurse point? This would allow you to keep everything the same all the way, but *should* vastly speed things up since this will be a subgraph liner DAG operation instead of a full graph merge. Trevor > > I think we need a smarter way of matching those events, something > involving pruning the graph of some sort. I'll try to think about this. > > - -- Trevor Vaughan Vice President, Onyx Point, Inc. email: [email protected] phone: 410-541-ONYX (6699) - -- This account not approved for unencrypted sensitive information -- -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) iEYEARECAAYFAkuiw88ACgkQyWMIJmxwHpS30QCgzge6zcpwRUiy3q9HsDv0TAFp OD0AoJk8/iZzsPSCq83vUeiUEkHnaFCM =i4jS -----END PGP SIGNATURE----- -- You received this message because you are subscribed to the Google Groups "Puppet Developers" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/puppet-dev?hl=en.
