Relative Content

Tag Archive for c++stdmap

map without a second item?

My legacy code uses a red-black tree to store pointers to homogeneous (typically POD) objects. Let’s call one MyPod. My compare function compares pointers to two such objects based on whatever criteria is required. What I’m trying to find isn’t a SECOND thing, but just the pointer already in the red-black tree.

map without a second item?

My legacy code uses a red-black tree to store pointers to homogeneous (typically POD) objects. Let’s call one MyPod. My compare function compares pointers to two such objects based on whatever criteria is required. What I’m trying to find isn’t a SECOND thing, but just the pointer already in the red-black tree.

map without a second item?

My legacy code uses a red-black tree to store pointers to homogeneous (typically POD) objects. Let’s call one MyPod. My compare function compares pointers to two such objects based on whatever criteria is required. What I’m trying to find isn’t a SECOND thing, but just the pointer already in the red-black tree.

map without a second item?

My legacy code uses a red-black tree to store pointers to homogeneous (typically POD) objects. Let’s call one MyPod. My compare function compares pointers to two such objects based on whatever criteria is required. What I’m trying to find isn’t a SECOND thing, but just the pointer already in the red-black tree.

map without a second item?

My legacy code uses a red-black tree to store pointers to homogeneous (typically POD) objects. Let’s call one MyPod. My compare function compares pointers to two such objects based on whatever criteria is required. What I’m trying to find isn’t a SECOND thing, but just the pointer already in the red-black tree.