glad | Language Vulkan/GL/GLES/EGL/GLX/WGL Loader | Graphics library

The ItemProperties component has multiple root nodes because it renders a list in the root with v-for.

Based on the class name (infobox-item-properties), I think you want the class to be applied to a container element, so a simple solution is to just add that element (e.g., a div) in your component at the root:

It's due to the introduction of Turbo in Rails 7. Without that status, Turbo wouldn't really know what to do with the redirects.

You can read more about it here: https://turbo.hotwired.dev/handbook/drive#redirecting-after-a-form-submission

Otherwise, you could just disable Turbo and it should go back to "normal".

I'm interpreting the conditions in the if and the else portion to be rectangular limits on the (x,y) coordinates. If this is incorrect please let me know and I can adjust the logic in the if/else.

I tested your example in 2013-32 with an empty class v with the 100 properties, and only got a small difference in timings. I can only assume something related with your particular setup.

However I'd say your 0.45 sec is slow even in an old system, and the reason for that is your particular use of a large Collection. Two ways to improve -

1. Counter intuitively with large collections it's much faster to use Keys rather than Indexes to retrieve items, populating is only slightly slower with keys. Referencing col.Item(1) is fast but bigger indexes are progressively slower, seems internally the collection is looped to find the given index each time ...

First off, this is a pretty hard problem to solve. Obviously, you need some way to pass data into a function outside of its arguments. However, pretty any method of doing that via a static could easily result in race conditions or worse, depending on what the c library does and how the library is used. The other option is to JIT some glue code that calls your closure. At first glance, that seems even worse, but libffi abstracts most of that away. A wrapper using the libffi crate would like this:

In tutorial 1 of the link in the comment, the author introduces

You are correct in the assumption that a general solution will involve some recursive calls (or a queue of candidates to expand until the queue is empty).

The output structure levels alternate between:

1. a person with partnerships
2. partnerships that contain a partner and children (each child is then again a 1.)

To make things simpler we can just model the 2 steps above with 2 separate functions. I chose the names expandPerson and expandPartnership.

The reason is this breaking change:

DeflateStream, GZipStream, and CryptoStream diverged from typical Stream.Read and Stream.ReadAsync behavior in two ways:

They didn't complete the read operation until either the buffer passed to the read operation was completely filled or the end of the stream was reached.

And the new behaviour is:

Starting in .NET 6, when Stream.Read or Stream.ReadAsync is called on one of the affected stream types with a buffer of length N, the operation completes when:

At least one byte has been read from the stream, or The underlying stream they wrap returns 0 from a call to its read, indicating no more data is available.

In your case you are affected because of this code in Decrypt method:

There doesn't seem to be any documentation on this at all, but I managed to hack together something that works. The trick I found is to use a very simple converter that always uses the same type name, like this: