Hello Alejandro, I'm sorry for being unclear. You can see the forward declarations (and the doxygen doc) here : http://svn.boost.org/svn/boost/sandbox/SOC/2011/checks/boost/checks/checks_f... The documentation is here (you would like to read the introduction) : http://svn.boost.org/svn/boost/sandbox/SOC/2011/checks/libs/checks/doc/check... As you can read in the introduction I thought it was interesting to implement a "low check level library", more general, not designed for a specific number or code. The reason is that I can't implement all the different numbers existing in the world. But with this "low level library", an user should be able to check a number I didn't implement. Nevertheless I'll implement the most well-known such as the isbn, ean, upc, iban, credit card, ... in a "high check level library". The nbr_digits parameter is optional but it is in case that the iterators don't delimit only one number. I designed an example for this special case (In the "Modular sum algorithm - Example - Special case" section). My first idea was to support the check of a lot of numbers between two iterators. But you maybe think it's a little far-fetched ? Any suggestions and comments are appreciated. Thank you very much, Pierre Talbot. 2011/7/17 Alejandro Cabrera <cpp.cabrera@gmail.com>:
Pierre Talbot wrote:
Hello community.
I'm a GSoC student who is assigned to the checks library. I currently design the prototype of a function and I would like to have your opinions.
Pierre,
Could you provide a link to some documentation or source that gives more context on your project?
I would gladly give some feedback, but I do not understand the requirements of your project.
Thanks, -Alej
-- View this message in context: http://boost.2283326.n4.nabble.com/Boost-GSoC-Checks-project-prototype-hesit... Sent from the Boost - Dev mailing list archive at Nabble.com. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost