Matt Bentley

I was referencing https://github.com/Wilfred/Brainfrack/blob/0252dc84791f5461dc8da5a67b755bd48b7cc0b4/llvm/decrement_data_pointer.ll As referenced in your blog post (amongst other samples of code also in this repo): http://www.wilfred.me.uk/blog/2015/02/21/my-first-llvm-compiler/

Hey Zachary, thanks for getting back to me on this, I'm currently busy on the hive (C++ standards version of colony) implementation, but once done there (probably a month to...

Hey - I got a lot of conflicting advice about this - initially I was told, you Should use EBCO for that. Then later I got told, well, that could...

Okay, I will look into it. It may be next year before I come up with something. One of the issues is that the allocator is rebound for several other...

The advice I got when I looked into this recently is that it's a requirement for C++ allocators to have a cheap/shallow copy, and that the copy act as if...

Thanks, will fix- On Wed, 30 Mar 2022 at 12:07, Chris Scrimgeour ***@***.***> wrote: > Update: Similarly, splicing to the beginning has the same issue. If you > replace the...

Also some strange behaviour when removing items from My List, variable as to effect. Best case was, item moved to bottom of my list, then disappeared next time list was...

> I only replaced the big vector by a `std::unique_ptr` and leveraged `std::move` to get the free optimizations for trvially copyable types. I once try to optimize more to use...

> > > > Some more context: https://www.plflib.org/blog.htm#notmystdfilln > > That's interesting. At least on libc++ it doesn't seem to be the case that one is faster than the other....

Like I said, it wasn't an issue with libstdc++, it was an issue with GCC. Cheers-