wanted: improve gcing of weak pointers from O(n^2)
Bug #394777 reported by
Gábor Melis
This bug affects 1 person
| Affects | Status | Importance | Assigned to | Milestone | |
|---|---|---|---|---|---|
| SBCL |
Invalid
|
Wishlist
|
Unassigned | ||
Bug Description
Currently, the algorithm implemented is roughly the "Second Try" in this nice writeup:
http://
It would be nice to have something like the "Third Try".
| tags: | added: optimization |
| Changed in sbcl: | |
| importance: | Undecided → Wishlist |
| Changed in sbcl: | |
| status: | New → Confirmed |
| summary: |
- Improve gcing of weak pointers from O(n^2) + wanted: improve gcing of weak pointers from O(n^2) |
| Changed in sbcl: | |
| assignee: | nobody → Paul Khuong (pvk) |
| Changed in sbcl: | |
| assignee: | Paul Khuong (pvk) → nobody |
Revision history for this message
| Douglas Katzman (dougk) wrote | #1 |
Revision history for this message
| Douglas Katzman (dougk) wrote | #2 |
| Changed in sbcl: | |
| status: | Confirmed → Invalid |
To post a comment you must log in.
GC of weak-pointer objects is NOT O(n^2), it's linear in the number of objects.
GC of weak hash tables, that's a different story.
Maybe this bug report meant the general concept of weak object, referring to weak hash-tables?