Rozental, Gennadiy wrote:
It is not necessary. You program will be given *string* "(0,1) (1,3)" and
can parse it using more powerfull means. I guess Spirit is quite appropriate.
I provide a way to parse it with very simple means.
I don't see that yet, but see below.
OK. I've looked at the code you've uploaded. I have some questions already, but to form final opinion, I would very much like to see other lookup policies. You've announced double_key_polycy, getopt_polycy, positional_policy, but I do not see any of them in the archive. They wouldUnfortunately I will be reallywork on this further meanwhile.
busy till the middle of February. So may not be able to
It's a pity, because I've only one more or less serious interface change left
in my library, and would prefer to ask for review after that. Do you have any idea when your library will have documentation, examples and tests?
Not before the date I mention. If you feel that your design could stand in review go ahead. I will submit my once it's done. Hopefully really soon, cause Boost.Test changes will rely on it.
really be important to understand how policies are used.
Also, did you uploaded your config file library, too?
- Volodya
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost