Previous: Weak key hashes, Up: Weak References
Weak vectors are mainly useful in Guile's implementation of weak hash tables.
Return a weak vector with k elements, each the empty list. Optional argument fill specifies a value to use instead of the empty list.
Construct a weak vector from a list:
weak-vectoruses the list of its arguments whilelist->weak-vectoruses its only argument l (a list) to construct a weak vector the same wayvector->listwould.