Hello,
I have been developing a piece of code using various boost libraries, but I have to pause because the compilation has become unwieldy. It's a 50kloc prgm, which takes about 30min to compile on a pentium 3.5GHz HT and 1GB of memory (gcc 3.4 on linux). The binary, using the static linking with 2 boost libraries (program-options, filesystem) yield a 380M binary. Furthermore, it doesn't compile on msvc 7.1 (c1063, compiler stack overflow), and I had to stop mingw after one hour....
The prgm handles the parsing, storage, and serialization of a big raw string.
This string is organized into fragments, about 30
each fragment could be occuring 0 or more times.
each fragment contain on average 30 fields.
each fragment has little in common with other fragments.
my solution was to store the string as a vector of a type Fragment described by
typedef variant