Hey Paul,

First of all, thanks for the tips, it did help a lot. But would you mind if I use you a little more to get up to speed with this project?

Answering your first question, yes, I'm studying to the best of my capacities and time-constrains. I found the PDF a little too succint though. If you had some more recommended literature, I'd be very happy to read it.
I took a brief look at the present library's code but I must confess I got a little confused. Probably because I was too unprepared. I'll do that again when I experiment a little more with the examples and know exactly what to look for.

I did a couple of quick tests to see if my setup is working fine (it is). I tested it using some Boost.Math functions as suggested, but I reckon the test was not solid enough yet.
I'll search for a few known big numbers and way to compute them tomorrow. 

I think it's more convenient (not to overuse the list) to put my files here (https://bitbucket.org/luk51000/multiprecision). It's currently empty since I my git broke today and I didn't have time to fix it, but I should be pushing code as soon as tomorrow.

--
Lucas Oliveira


On Wed, Apr 10, 2013 at 2:01 PM, <boost-users-request@lists.boost.org> wrote:
Send Boost-users mailing list submissions to
        boost-users@lists.boost.org

To subscribe or unsubscribe via the World Wide Web, visit
        http://listarchives.boost.org/mailman/listinfo.cgi/boost-users
or, via email, send a message with subject or body 'help' to
        boost-users-request@lists.boost.org

You can reach the person managing the list at
        boost-users-owner@lists.boost.org

When replying, please edit your Subject line so it is more specific
than "Re: Contents of Boost-users digest..."


Today's Topics:

   1. Re: Asio Serial ports: enumerating all the devices
      (Kerry, Richard)
   2. Re: [BGL] Error using breadth_first_search with labeled_graph
      (Jeremiah Willcock)
   3. Re: [multiprecision] radix-2 (Paul A. Bristow)


----------------------------------------------------------------------

Message: 1
Date: Wed, 10 Apr 2013 13:22:14 +0000
From: "Kerry, Richard" <richard.kerry@atos.net>
To: "boost-users@lists.boost.org" <boost-users@lists.boost.org>
Subject: Re: [Boost-users] Asio Serial ports: enumerating all the
        devices
Message-ID:
        <61C67DC73308BD49B2D4B65072480DBA15397181@DEFTHW99EZ1MSX.ww931.my-it-solutions.net>

Content-Type: text/plain; charset="us-ascii"


"vendor id, product id "
What's that ?
I mean for a serial device.  If they are present in the device protocol then fine, but that depends on the individual devices and their protocols.
You can check whether there has been any traffic, which might be useful, but serial connections are just streams of bytes.


Unhelpfully,
Richard.


PS
I do recognize "vendor id, product id " for SNMP and for other protocols working at a higher level than "serial".





________________________________
From: Boost-users [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Vincent Boucher
Sent: 10 April 2013 13:40
To: boost-users@lists.boost.org
Subject: [Boost-users] Asio Serial ports: enumerating all the devices

Hello,

Are there cross-platform methods to discover all the devices currently connected through serial ports with Boost?

The idea is to have a function returning a list of device objects, each containing a handle, the related vendor id, product id and the baud rate at which the device was able to communicate.

My knowledge of serial communication is very limited, may be it is technically infeasible. Do you have any thoughts for Boost or other libs?


Analog enumerate method for HID devices:
http://www.signal11.us/oss/hidapi/

Thanks,

Vincent
-------------- next part --------------
HTML attachment scrubbed and removed

------------------------------

Message: 2
Date: Wed, 10 Apr 2013 11:28:43 -0400 (EDT)
From: Jeremiah Willcock <jewillco@osl.iu.edu>
To: boost-users@lists.boost.org
Subject: Re: [Boost-users] [BGL] Error using breadth_first_search with
        labeled_graph
Message-ID: <alpine.LRH.2.03.1304101127040.48027@cs.indiana.edu>
Content-Type: text/plain; charset="iso-8859-1"; Format="flowed"

On Tue, 9 Apr 2013, Julio Cezar Novais Raffaine wrote:

> Hi,
> I'm having the above (end of email) error message when compiling my source using breadth_first_search in a
> labeled_graph, here are some of my definitions:
>
> I'm using boost 1.51.0.
>
> struct VertexProperty
> {
> ? string x;
> };
>
> typedef boost::property<boost::edge_weight_t, double> IndexProperty;
> typedef boost::labeled_graph<?
> boost::adjacency_list<boost::vecS, boost::setS, boost::bidirectionalS, VertexProperty, IndexProperty>,
> std::string> GraphT;

I think the issue is that your vertex container is setS.  Many Boost.Graph
algorithms, including BFS, require a vertex_index property in your graph
by default, and the error message is saying that your graph does not have
one.  If you hare not modifying your graph frequently, you might want to
change the setS to vecS in the definition of GraphT and see if that
changes anything.

-- Jeremiah Willcock

------------------------------

Message: 3
Date: Wed, 10 Apr 2013 18:01:03 +0100
From: "Paul A. Bristow" <pbristow@hetp.u-net.com>
To: <boost-users@lists.boost.org>
Subject: Re: [Boost-users] [multiprecision] radix-2
Message-ID: <002e01ce360c$fc000410$f4000c30$@hetp.u-net.com>
Content-Type: text/plain; charset="us-ascii"



From: Boost-users [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Lucas Sousa de Oliveira
Sent: Wednesday, April 10, 2013 1:04 PM
To: boost-users@lists.boost.org
Subject: [Boost-users] [multiprecision] radix-2

Hey Lucas

I'm considering participating in this year's GSoC 2013 with Boost. I think the multiprecision
problem is very interesting and I'll give my best to implement it

But first, what would you think is the challenge here? What would make this problem very complex?
I'm studying the general radix algorithm and it doesn't seem to be that bad. Am I being misled?

I hope you are studying

https://svn.boost.org/trac/boost/wiki/SoC2013#Boost.Multiprecision

http://www.boost.org/doc/libs/1_53_0/libs/multiprecision/doc/html/index.html

and especially

http://www.loria.fr/~zimmerma/mca/mca-cup-0.5.1.pdf

If you study the existing decimal (radix = 10) implementation, you will see that multiprecision
makes it rather complicated, even if the underlying algorithms are not.

It must be specific for radix = 2 to be fast.

Ask again if you are still interested after studying these documents, and some of the code.

It would be useful to see if you can build some of the examples using Boost.Multiprecision decimal,
perhaps using a Boost.Math function or two.  You could send us a zip of your files and output.

Extra marks for providing a Boost.Test comparing with a handful of published values. You can use any
platform, Linux, Mac or Microsoft with your IDE of choice, perhaps Visual Studio or NetBeans?

HTH

Paul


---
Paul A. Bristow,
Prizet Farmhouse, Kendal LA8 8AB  UK
+44 1539 561830  07714330204
pbristow@hetp.u-net.com




-------------- next part --------------
HTML attachment scrubbed and removed

------------------------------

Subject: Digest Footer

_______________________________________________
Boost-users mailing list
Boost-users@lists.boost.org
http://listarchives.boost.org/mailman/listinfo.cgi/boost-users

------------------------------

End of Boost-users Digest, Vol 3411, Issue 3
********************************************