-
Notifications
You must be signed in to change notification settings - Fork 2
Open
Description
See #87 (comment)
I assume we could still do things in parallel if we want.
We could create a DisjointViews
(or so) struct that holds non-overlapping ArrayBytesFixedDisjointView
s and has a safe fn add(&mut self, ...) -> bool
that returns if a region was safely added (would not overlap with the already contained regions) or not. Then at runtime,
- create a
Vec<DisjointViews>
by first trying to add each view to the firstDisjointViews
object, then the second, … until each view has been added. - go over the vec and handle each
DisjointViews
object in parallel.
There could be pathological cases where that doesn’t work well, but in practice, those shouldn’t happen
Metadata
Metadata
Assignees
Labels
No labels