feat(pbs): add Set and reusable identity hashing
This commit is contained in:
@@ -177,10 +177,11 @@ faults. List itself rejects directly optional elements.
|
||||
|
||||
The shared implementation is independent of List representation.
|
||||
[Linked](sdk-linked-and-cursor.md) uses Cursor<T> for forward and reverse captures.
|
||||
Future Set<T> producers use Cursor<T>; Map<K,V> uses Cursor<keyval<K,V>>. Set/Map gain
|
||||
no ordering guarantee between captures. A captured keyval association is read-only
|
||||
[Set](sdk-set-and-identity.md) produces Cursor<T>; future Map<K,V> uses
|
||||
Cursor<keyval<K,V>>. Set/Map gain no ordering guarantee between captures.
|
||||
A captured keyval association is read-only
|
||||
and does not follow later association replacement; referenced objects stay shared.
|
||||
Set/Map and keyval are separate deliveries.
|
||||
Map and keyval remain separate deliveries.
|
||||
|
||||
For n logical List positions and k present occurrences, capture takes O(n) work
|
||||
and O(k) additional nodes; next follows one link in O(1). Each node costs allocation,
|
||||
|
||||
Reference in New Issue
Block a user