https://issues.dlang.org/show_bug.cgi?id=17881
Steven Schveighoffer changed:
What|Removed |Added
See Also||https://issues.dlang.org/sh
https://issues.dlang.org/show_bug.cgi?id=17881
Iain Buclaw changed:
What|Removed |Added
Priority|P1 |P4
--
https://issues.dlang.org/show_bug.cgi?id=17881
Stanislav Blinov changed:
What|Removed |Added
CC||stanislav.bli...@gmail.com
--- Comment
https://issues.dlang.org/show_bug.cgi?id=17881
--- Comment #12 from Rainer Schuetze ---
The current GC already does something in that regard as it pre-assigns a new
memory page to a free-list of elements of the size of the last request.
The GC locking overhead can be reduced
https://issues.dlang.org/show_bug.cgi?id=17881
--- Comment #11 from Steven Schveighoffer ---
(In reply to Andrei Alexandrescu from comment #10)
> This issue should be closed. A good allocator should be able to handle
> repeated allocations of the same size without this kind
https://issues.dlang.org/show_bug.cgi?id=17881
--- Comment #10 from Andrei Alexandrescu ---
(In reply to Steven Schveighoffer from comment #8)
> What I am looking for,
> though, is the high-level API of "I have 20 million T's I want to allocate,
> give me them properly
https://issues.dlang.org/show_bug.cgi?id=17881
--- Comment #9 from safety0ff.bugz ---
(In reply to Steven Schveighoffer from comment #8)
> Internally, I think something like this is needed. What I am looking for,
> though, is the high-level API of "I have 20 million T's
https://issues.dlang.org/show_bug.cgi?id=17881
--- Comment #8 from Steven Schveighoffer ---
(In reply to safety0ff.bugz from comment #7)
> I think the API should obviously should have the size of the elements as a
> separate arguments and provide as much information as
https://issues.dlang.org/show_bug.cgi?id=17881
safety0ff.bugz changed:
What|Removed |Added
CC|
https://issues.dlang.org/show_bug.cgi?id=17881
Alexandru Razvan Caciulescu changed:
What|Removed |Added
CC|
https://issues.dlang.org/show_bug.cgi?id=17881
--- Comment #6 from Steven Schveighoffer ---
(In reply to Rainer Schuetze from comment #5)
> A slightly simpler API could be to add allocating N same-sized chunks from
> the GC that returns them in a free-list-like chain.
I
https://issues.dlang.org/show_bug.cgi?id=17881
Rainer Schuetze changed:
What|Removed |Added
CC||r.sagita...@gmx.de
https://issues.dlang.org/show_bug.cgi?id=17881
--- Comment #4 from Steven Schveighoffer ---
Stevens-MacBook-Pro:testd steves$ cat testpreallocate.d
struct S
{
S *next;
}
void main()
{
version(freelist)
{
S* head = null;
foreach(i; 0 ..
https://issues.dlang.org/show_bug.cgi?id=17881
--- Comment #3 from Andrei Alexandrescu ---
>The use case is different than for GC.allocate.
The semi-joke was this is all needed.
>I want to fill in a structure of nodes, I know I'm going to fill it in with
>10,000 elements,
https://issues.dlang.org/show_bug.cgi?id=17881
--- Comment #2 from Steven Schveighoffer ---
The use case is different than for GC.allocate.
I want to fill in a structure of nodes, I know I'm going to fill it in with
10,000 elements, so I'm going to allocate them all in a
https://issues.dlang.org/show_bug.cgi?id=17881
Andrei Alexandrescu changed:
What|Removed |Added
CC||and...@erdani.com
16 matches
Mail list logo