Custom Query (545 matches)
Results (28 - 30 of 545)
Ticket | Resolution | Summary | Owner | Reporter |
---|---|---|---|---|
#130 | fixed | AlterationNotifier::ImmediateDetach invalidates wrong observer | ||
#135 | fixed | The Graph reference must be const in GraphWriter | ||
Description |
The [9c8efad5f587] patch fixes the problem. |
|||
#137 | fixed | Cheap copy of maps (reference counting) PHASE I. | ||
Description |
The idea is that the copy constructor and operator=() of a ListGraph::NodeMap<> &Co. would not effectively copy the map but instead it would use the container array of the source map. The storage would be deallocated when there are no maps pointing to it. Moreover, the default maps would have a copy() member function, which would effectively copy the contents, i.e.: ListDigraph::NodeMap<int> a(g); ListDigraph::NodeMap<int> b(a); /// a and b use the same storage a[e]=5 /// this also sets b[e] to 5. ... b.copy() /// b now have a separate storage a[e]=7 /// the value of b[e] does not change The advantage of this approach is that
However this approach is not fully compatible with the current implementation, therefore we must follow one of the tree approaches below.
P.S: It can also be a nice thing to do something similar with the graphs themselves. Fortunately, graph have no copy constructors and assignment operators, therefore in case of graphs the introduction of "cheap copy" is a clear enhancement and does not break the API compatibility. |