Generic List
2339 Views
-
# With UEFN version 41.00, we can now implement parametric classes with variable members. # The code below provides a parametric list implementation. # As we know, in Verse, adding or removing elements from an array triggers the allocation of a # new modified array. When the number of elements is small, the overhead may be acceptable. # For larger arrays, however, it can become significant for such a seemingly trivial operation. # Lists provide fast O(1) insertion and removal while avoiding large allocations, typically # requiring memory only for a single element. Their ideal use case is scenarios where the # contents of the collection are not important in a way that would require iteration, but # where efficient acquisition and removal are essential (e.g., object pooling). ADT<public> := module: readable<public>(value_type: type) := interface<computes>:
You're reading a preview
The full reference is free for BrainDeadGuild Discord members — sign in to read it all, or open the original at the source.
Sign in with your BrainDead.TV / BrainDeadGuild Discord account for full access.