Update disjoint cover making sure (addr,size) is contained in a single element and return an iterator to this element. The element's \b pass number is set to be the smallest value of any previous intersecting element. Additionally an \b intersect code is passed back: - 0 if the only intersection is with range from the same pass - 1 if there is a partial intersection with something old - 2 if the r
source not stored for this graph (policy: none)