In practice A and B would each have their own namespaces in C++ codebases, but that wouldn't resolve the tension if each wanted a different version of boost. One approach to resolve that tension is to figure out how to have two versions of boost in the same dependency tree. The below is addressing that proposal.
---
Practically, no. You could certainly create a new namespace C++ names: functions, classes, global variables, and so on.
But there are other "names" in C++ that don't respect C++ namespaces: C symbols, included headers, preprocessor names, and library names (as in `-lfoobar` on a link line). You'd need to make up new names for all of these and possibly a few more things to make a full duplicate of a library.
Now, if you managed to do all that, there are still problems to watch out for. For instance, it's common for projects to assume that global or static names in a C++ namespace can be treated as unique process-wide values in a running program. As in, `mynamespace::important_mutex` might guard access to specific hardware, so having a `mynamespace2::important_mutex` also thinking it has the same job would be bad.
And if that wasn't a problem, you still have to think about types that show up in APIs. How will downstream code be written when you have a `boost::string_ref` and a `boost2::string_ref` in the same codebase? Which `string_ref` do you use where? Can you efficiently convert from one to the other as needed? Will that require changing a lot of downstream code?
At the limit a stale interface is a C interface, but it doesn't have to be. GCC std types are fairly stable, and Qt manages a rich interface while maintaining robust ABI compatibility. It is hard work, and not always worth it of course.
Note that it's not just mutexes. The same can happen with other kinds of "one per process" resources: memory pools, thread pools, connection pools, caches, registry objects, etc.
Even more fun when two dependencies both use different versions of the same lib.
I much prefer bringing everything into our source tree up front and doing the build ourselves rather than just linking a prebuilt lib but sometimes you don't have that option.
e.g. You have Library A using LibDependency-1.0.0 and Library B using a separately compiled LibDependency-2.0.0? Then have MyAwesomeApp linking LibA and LibB and just accept the binary+memory overhead of two copies (albeit different versions) of LibDependency?
Rather than trying to do this at the language level with namespaces or whatever, it's probably easier to compile and link each version of the problem dependency into a separate library (static or dynamic), then to make sure each of your own libraries and executables only directly links to one version of the problem library.
This way, you don't have to rename or namespace anything, because conflicting names will only be exposed externally if you're linking to the problem library dynamically, in which case you should be able to arrange for the names to be qualified by the identity of the correct version of the problem library at dynamic load time (how to ensure this is platform-specific).
LibDependency.h:
typedef struct SomeOpaqueLibDependencyType * SomeOpaqueLibDependencyTypeRef;
SomeOpaqueLibDependencyTypeRef MakeTheThing();
void UseTheThing(SomeOpaqueLibDependencyTypeRef);
LibraryA:
...
SomeOpaqueLibDependencyTypeRef getSomething();
LibraryB:
...
void doSomething(SomeOpaqueLibDependencyTypeRef);
MyAwesomeApp:
LibraryB.doSomething(LibraryA.getSomething()) // pseudocode
The problem is the because LibraryA and LibraryB have distinct copies of LibDependency, the source/api compatible type you're using may have an incompatible internal structure.As a library author there are things you can do for ABI compatibility, but they all basically boil down to providing a bunch of non-opaque API types that have some kind of versioning (it's either an explicit version number, or it's a slightly implicit size field which IIRC is the MS standard). You also have opaque types where the exposure of details is more more restricted, generally either just an opaque pointer, or maybe a pointer to a type that has a vtable (either an automatic one or a manually constructed one). In general use of the non-opaque portions of the API are fairly restricted because they have ABI implications, so a user of a library will communicate by providing those non opaque data to the library, but the library will provide largely opaque results with an ABI stable API that can be used to ask questions of an otherwise opaque type.
This works in general, and it means you don't have to rebuild everything from scratch any time you update anything. It breaks down however when you have different versions of the same library in the same process. The problem is that while you see a single opaque type, it's not opaque to the library itself so while an opaque type from two different versions of a library may look the same to you, the implementation may differ between the two versions. Take a hypothetical:
LibDependency.h:
typedef struct OpaqueArray *ArrayRef;
struct ArrayCallbacks {
int version;
size_t elementSize;
void (*destroyElement)(void *);
void (*copyElement)(void *, const void*);
};
ArrayRef ArrayCreate(const ArrayCallbacks*, size_t);
void ArraySet(ArrayRef, size_t, void*);
void *ArrayGet(ArrayRef, size_t);
which is a kind of generic vaguely ABI stable looking thing (I'm in a comment box, assume real code would have more thought/have fewer errors), but lets imagine the a "plausible" v1.0 LibDependency-1.0.c:
struct InternalArrayCallbacks {
void (*destroyElement)(void *);
void (*copyElement)(void *, const void*);
};
struct OpaqueArray {
InternalArrayCallbacks callbacks;
size_t elementSize;
char buffer[];
}
ArrayRef ArrayCreate(const ArrayCallbacks* callbacks, size_t size) {
size_t allocationSize = sizeof(OpaqueArray) + size * callbacks->elementSize;
OpaqueArray *result = (OpaqueArray *)malloc(allocationSize);
/* initialize result, copy appropriate callbacks, etc */
return result;
}
void ArraySet(ArrayRef array, size_t idx, void* value) {
array->callbacks.copyElement(array->buffer + idx * array->elementSize, value);
}
etc.Now v1.1 says "oh maybe we should bounds check":
LibDependency-1.1.c:
...
struct OpaqueArray {
InternalArrayCallbacks callbacks;
size_t elementSize;
size_t maxSize;
char buffer[];
}
...
void ArraySet(ArrayRef array, size_t idx, void* value) {
if (idx >= array->maxSize) abort();
array->callbacks.copyElement(array->buffer + idx * array->elementSize, value);
}
There's been no source change, no feature change, and from a library/OS implementors PoV no ABI change, but if I had an ArrayRef from the 1.0 implementation and passed it somewhere that would be using the 1.1 implementation, or vice versa, the result would be sadness.As a library implementor there's a lot you have to do and/or think about to ensure ABI stability, and it is manageable, but more or less all of the techniques break down when the scenario is "multiple versions of the same library inside a single process".