On 07/08/2017 10:39 PM, Phil Bouchard via Boost wrote:

That is flawless... If anybody is willing to fool this memory manager then please go ahead!

Actually I think I'll still need to fine tune-it but I'm getting there. Also it'll be better if I reintegrate the old "inclusive" mode (in the master branch) and the user can choose the mode at run-time or compile-time. Thanks, -Phil

On 07/09/2017 02:30 PM, Phil Bouchard via Boost wrote:

int main() { cout << "Scope 0: BEGIN" << endl; { node_proxy x; // 1st proxy node_ptr<A> a1 = make_node<A>(x, x, "a1");

cout << "Scope 1: BEGIN" << endl; { node_proxy x; // 2nd proxy node_ptr<A> b1 = make_node<A>(x, x, "b1"); node_ptr<A> b2 = make_node<A>(x, x, "b2");

a1 = b1; // upscale scope of b1 to use 1st proxy

b1 = make_node<A>(x, x, "b3"); // scope of b1 will still be associated with the 1st proxy b1->i = b1; // cycle } cout << "Scope 1: END" << endl; } cout << "Scope 0: END" << endl; }

Will output:

Scope 0: BEGIN A::A(const boost::node_proxy&, const char*): a1 Scope 1: BEGIN A::A(const boost::node_proxy&, const char*): b1 A::A(const boost::node_proxy&, const char*): b2 A::~A(): a1 A::A(const boost::node_proxy&, const char*): b3 A::~A(): b2 Scope 1: END A::~A(): b1 A::~A(): b3 Scope 0: END

Verdict: I will dissociate root_ptr from Boost and include it in Qt. I am not sure where the whole Boost memory management crew went over the years but the underlying integration with Javascript is the way to go. But thanks Boost for your support over the years. Sincerely, -Phil

On 07/09/2017 10:51 PM, Josh Juran via Boost wrote:

On Jul 9, 2017, at 7:07 PM, Phil Bouchard via Boost wrote:

...

I am not sure where the whole Boost memory management crew went over the years but the underlying integration with Javascript is the way to go. But thanks Boost for your support over the years.

Mostly I stick to boost::intrusive_ptr or equivalent in my own C++ code. However, as I developed my own high-level programming language[1], I discovered that having recursive closures implies having reference cycles, and I can no longer say that I’ve never written a mark-and-sweep garbage collector in anger.

Recursive closures shouldn't be a problem with root_ptr. I'll give it a shot later this week to confirm.

[1] https://www.vcode.org/

It was essential to maintain the property of timely destruction, though, so it sounds like our respective subsystems have similar requirements.

root_ptr is instantaneous; it's not postponing the destruction of the objects. -Phil

Phil Bouchard wrote:

Verdict: I will dissociate root_ptr from Boost and include it in Qt.

I am not sure where the whole Boost memory management crew went over the years but the underlying integration with Javascript is the way to go. But thanks Boost for your support over the years.

Sincerely, Phil

Hi Phil, Good luck. Please feel encouraged to share the results of including root_ptr in Qt and the lessons learned from that endeavour. Glen

On 07/11/2017 12:46 AM, Phil Bouchard via Boost wrote:

On 07/10/2017 08:38 PM, Glen Fernandes via Boost wrote:

...

Hi Phil,

Good luck. Please feel encouraged to share the results of including root_ptr in Qt and the lessons learned from that endeavour.

Thanks. Meanwhile further updates will be in this branch: https://github.com/philippeb8/root_ptr/tree/qt

Specifically this file: https://github.com/philippeb8/root_ptr/blob/qt/example/javascript_example1.c... I already wrote a manual Javascript to C++ converter algorithm. -Phil