.. with the aim of safely deleting shapes from the various maps. Given shapes are maps (<shaperef, shape>), thus sorted and connections (graph edges) are vector that assumes index order, removing shapes (and connections) is the only user-facing way to predictable destabilise the shaperef/index relationship. The ultimate aim with this is thus to allow us to find (and test for) the failure points that assume the shaperefs and indices are interchangable, and eventually safely change the connections to a map (or make a shapes/connections pair). This will remove the need for index lookups in the analyses and thus remove a serious performance bottleneck.
.. with the aim of safely deleting shapes from the various maps. Given shapes are maps (<shaperef, shape>), thus sorted and connections (graph edges) are vector that assumes index order, removing shapes (and connections) is the only user-facing way to predictable destabilise the shaperef/index relationship. The ultimate aim with this is thus to allow us to find (and test for) the failure points that assume the shaperefs and indices are interchangable, and eventually safely change the connections to a map (or make a shapes/connections pair). This will remove the need for index lookups in the analyses and thus remove a serious performance bottleneck.
See travis build here