14 Mar
2010
14 Mar
'10
9:37 p.m.
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Am 14.03.2010 um 15:42 schrieb Steven Watanabe:
exp(-0) * vec(3), exp(-1) * vec(0), ... correct?
That's the correct option. in This case vec(3) hold the smallest entry in vec. I think a hash map is a way to realize it, but I think it a little bit overkill for the problem. I need an iterator about the sorted elements in the vector Phil -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.8 (Darwin) iEYEARECAAYFAkudVwsACgkQ6s0Ua5LeGumxwQCgiDLPXybjrgYFwcUvRlr0/mgE 2xkAoMu5O4UzcUc2KPDddWRC2suh1znx =d/s0 -----END PGP SIGNATURE-----