More of an experimental "thoughts in progress" snapshot of a commit this time -- not sure when I'll be able to look at this project again in the immediate future so "syncing" any of the local changes...

Reverting the squared/non-linear transform for Latent Class model from "x > 0 ? 1 + x * x : 1 / (1 + x * x)" to a more linear(ish) "x > 0 ? 1 + x : 1 / (1 - x)" -- the intent is to see if a more uniform-covered range of exploration grid would yield a more consistent and successful convergence results.

Given the practically unrealistic "all-coefficient-at-once" complexity modulations in VCGW algorithm -- now floating all of the prior probability coefficients in the Latent Class model. The "sliding around to the boundaries" issue when non-identifyiable coefficients are present is not expected to be much of a problem (due to 'min improvement ratio' parameter and "from one at once to more at once" complexities progression during convergence). Note -- documentation/help section in WebNetCPU is, most-likely, not yet updated/revised.

Minor bug-fix: in cases when shrink_slowdown was set to zero by user, the division by zero would take place in 'shrink_execute' method in converger_1/server.h

Bug-fix: in csv.h, formal args name in a method were name-clashing with the local vars.

Feature addition (extremely small): stl container utils adding 'fastsize' to have support for rbegin/rend iteration as well as pop (in addition to push) semantics.

Minor how-to addation to openssl keys txt -- addition of department/etc. info when generating certificates.