ParseAPI's Function class has a blocklist typedef that, at present,
translates to a vector<Block*>. This vector results in some unfortunate
data duplication; I'd like to both avoid storing it and avoid generating
it when a user calls the blocks() method. There are a few ways to do
this, but all of them center around making a blocklist no longer be
random-access: you would lose the ability to call blocks()[n]. blocks()
would still provide a sorted range interface (begin, end, in-order
iteration).
Question 1: Is anyone actively relying on the vector nature of
blocklists, either because they're manually resolving the typedef (in
which case you are bad people and should feel bad) or because they're
treating random-access iteration as a defined part of the interface? If
so, can you explain a bit about your use case?
Question 2: I believe I can either make the primary container of blocks
be the Address->Block* map that currently exists, or a set of Block*
(with a bit of cleverness to make map-style lookup work internally).
Mostly for paradyn-staff: any preferences as to whether we fake an index
on a set or project a map down to look set-like?
--bw
Bill Williams
Paradyn Project
bill@xxxxxxxxxxx
|
![[Computer Systems Lab]](https://www-auth.cs.wisc.edu/pics/csl_logo.gif){kind=logo}