-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On 04/14/2010 12:11 PM, DE wrote:
- a wrapping template class(es) that can be configured with policies whether to use/work with fixed sized buffers/numbers (thus no memory allocation, thus no exception handling code, thus maximally lean code) or dynamically sized buffers (with or without SBOs, deep or shallow copies, reference counting etc etc...)...
and a policy regulating whether to use ordinary arithmetic or modulo one would be vital e.g. a natural expectation is that a fixed 128 bit integer does modulo (2^128) arithmetic
I'm not sure what "normal arithmetic" means for a fixed-size integer. Are you referring to using an unlimited-size integer for intermediate results? - -- Chad Nelson Oak Circle Software, Inc. * * * -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.10 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAkvGRMEACgkQp9x9jeZ9/wT48ACg4q52t2s8xTiWBT3heBf6D0QC tOsAoL0hzT42fxgRV+A+qKsyOpOtka5b =QFKJ -----END PGP SIGNATURE-----