headers
console shark | 1 Oct 01:19
Picon
Favicon

Re: How does one build the asio system library?

Yeah I mean Boost.System, but that wasn't part of the boost download, it seems to come with Asio, right? So now that I put the /system stuff in there, how does it get built? As far as I know it wasn't there prior to me putting it in the /boost/ directory.

----- Original Message ----
From: Richard Dingwall <rdingwall <at> gmail.com>
To: boost-users <at> lists.boost.org
Sent: Sunday, September 30, 2007 6:04:13 PM
Subject: Re: [Boost-users] How does one build the asio system library?

On 10/1/07, console shark <consolejoker <at> yahoo.com> wrote:
The docs say to run bjam inside /boost/libs/system/build

I did this, and it claims to have built the file but I can't fine it anywhere on my hard drive. Subsequent attempts to run bjam don't seem to do anything.

The Asio library is header only. You don't need to build anything.

You may however need to link against the Boost.System and Boost.Regex libraries.

Richard 




Tonight's top picks. What will you watch tonight? Preview the hottest shows on Yahoo! TV. 
_______________________________________________
Boost-users mailing list
Boost-users <at> lists.boost.org
http://lists.boost.org/mailman/listinfo.cgi/boost-users
Permalink | Reply | 0 comments |
headers
Anjaly | 1 Oct 05:52
Picon

Re: u32regex_search crashes

In the regex document it was said that the size of data type of the
variable passed to the make_u32regex  that determines character encoding
(utf8,utf16 or utf32) . I passed wchar_t (which i think size is 4) so
that the buffer encoding is considered as utf8  by u32regex_search
irrespectively.  Actually i am trying to do a utf8 search.

 				Anjaly G S

On Fri, 2007-09-28 at 10:53 +0100, John Maddock wrote: 
> Jens Seidel wrote:
> > That's the valid byte order mark. See
> > e.g. http://bugs.sun.com/bugdatabase/view_bug.do?bug_id=4508058
> 
> Right: it's a byte order mark for UTF16LE, but the user is trying to read it 
> as a UTF8 sequence.
> 
> If the file is indeed UTF16LE then it's up to the user to read it into a 
> sequence of valid UTF16 code points before passing to Boost.Regex.
> 
> HTH, John. 
> 
> _______________________________________________
> Boost-users mailing list
> Boost-users <at> lists.boost.org
> http://lists.boost.org/mailman/listinfo.cgi/boost-users

______________________________________
Scanned and protected by Email scanner
Permalink | Reply | 3 comments |
headers
Tony Turner | 1 Oct 05:57
Picon

Re: Inquiring about the feasibility of boost::mpl basedstatechart DSELs that generate boost::statechart based components

Hi, Andreas;

Thank you for your response. Yes, after playing with replacing the mpl
based DSL from the textbook with boost::statechart based templates, I
find that so far, there is no need for further use of the mpl, beyond
that which boost::statechart itself uses, i.e., mpl::list.

Thank you for your time,

Tony Turner

On Sun, 2007-09-30 at 18:02 +0200, Andreas Huber wrote:
> Hi Tony
> 
> >        I am currently experimenting with the feasibility of writing a
> >        boost::mpl based library of metaprograms that process statechart
> >        DSEL
> >        language phrases ( see ref #1 below), that then specifically
> >        generate
> >        boost::statechart based components.
> 
> I don't have the book but I guess that there should be little difficulty in
> converting an FSM implemented with the referenced DSL to one that employs
> Boost.Statechart. I'm just not sure how MPL is going to help here. Could you
> please elaborate?
> 
> Thanks & Regards,
> 
> --
> Andreas Huber
> When replying by private email, please remove the words spam and trap
> from the address shown in the header.
> 
> 
> 
> _______________________________________________
> Boost-users mailing list
> Boost-users <at> lists.boost.org
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
Permalink | Reply | 0 comments |
headers
François Duranleau | 1 Oct 07:16
Picon

[parameter] Return type dependent on parameter type?

Hi!

I have a function like this:

template< typename Arg0 ,
           typename Arg1 ,
           ... >
Arg1 the_function( Arg0 arg0 , Arg1 arg1 , ... ) { ... }

The return type should be the same as one of its parameters, and all '...' 
are optional parameters. Is there a way to use BOOST_PARAMETER_FUNCTION in 
such a case? I didn't find anything in the documentation about it. I tried 
this:

BOOST_PARAMETER_NAME( (arg1 , kw) arg1 )
BOOST_PARAMETER_NAME( (arg2 , kw) arg2 )

BOOST_FUNCTION_PARAMETER(
     (kw::arg2::_) ,
     the_function ,
     kw ,
     (required (arg1 , *) (arg2 , *))
     (optional ...)
)

but it doesn't work. Looking at the macro's expansion, the meta function 
used to extract the result type seems to ignore it's template argument 
Args. Is it a limitation or a bug?

Are there any other tricks (aside from manually handling argument packs as 
before)?

--

-- 
Francois Duranleau
Permalink | Reply | 14 comments |
headers
abhishek.v | 1 Oct 09:19
Favicon

Problem in calculating critical path and fundamental ckts


Hi..

I want to calculate the critical paths of a graph using BGL. So what i did is i calculated
the connected components of a graph then remove the edge one by one if the number of
connected component increase then the edge is critical edge or a bridge. This works fine in
case of undirected graph. But how do i calculate connected component of a directed or Bidirected graph
i m able to calculate the strongly connected component but it is not helping me out.
Can you suggest me something regarding this.

Also i want to calculate the fundamental ckt that exist in a graph now. What i did here is i m calculating K-MST.
Now i want to calculate the fundamental ckt how should i do that...


Thanks
Abhishek Vyas
Tata Consultancy Services
Mailto: abhishek.v <at> tcs.com
Website: http://www.tcs.com
____________________________________________
Experience certainty.        IT Services
                       Business Solutions
                       Outsourcing
____________________________________________=====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you 
_______________________________________________
Boost-users mailing list
Boost-users <at> lists.boost.org
http://lists.boost.org/mailman/listinfo.cgi/boost-users
Permalink | Reply | 0 comments |
headers
Cory Nelson | 1 Oct 10:25
Picon
Gravatar

Passing extra compiler arguments with bjam

I'm wanting to pass some extra arguments for VC++ whole program
optimization (specifically, /GL to the compile, /LTCG to the linker).
Does anyone know how?

--

-- 
Cory Nelson
Permalink | Reply | 0 comments |
headers
John Maddock | 1 Oct 10:42
Picon

Re: u32regex_search crashes

Anjaly wrote:
> In the regex document it was said that the size of data type of the
> variable passed to the make_u32regex  that determines character
> encoding (utf8,utf16 or utf32) .

*For construction of the regex object*.

The search algorithms operate independently on any of UTF8/16/32.

> I passed wchar_t (which i think size
> is 4) so that the buffer encoding is considered as utf8  by
> u32regex_search irrespectively.  Actually i am trying to do a utf8
> search.

Except the data file you sent *was not valid UTF8* !

It looks like it's probably UTF16LE, it's up to you in that case to decode 
the byte order mark and read the text into something that Boost.Regex can 
handle (for example platform-native UTF16).  ICU should have some file IO 
routines for doing that kind of thing: for example for loading a file into a 
UnicodeString type.

HTH, John.
Permalink | Reply | 2 comments |
headers
gast128 | 1 Oct 10:59
Picon

string_algo no replace_if 2

Pavol Droba <droba <at> topmail.sk> writes:

> 
> Hi,
> 
> I think that your arguments are reasonable. Even if I don't like to
> extend the number of find/erase/replace functions very much.
> 
> I'll put it on my todo list, but I cannot promise when it actually be
> implemented.
> 
> Reagards,
> Pavol.

ok that would be nice. One character replacement could also be achieved by 
using std::replace_if:

std::replace_if(str4.begin(), str4.end(), boost::is_any_of("ab"), _T('c'));

But then again putting this in string_algo (with its extra power) would be 
better.
Permalink | Reply | 0 comments |
headers
Anjaly | 1 Oct 11:02
Picon

Re: u32regex_search crashes

I am sorry the last message had an mistake.I wanted to say that I want
to do a search that would take all the data as though it is  Utf32
rather than utf8 ( as i incorrectly wrote). I don't know whether i am
making myself clear (I am not very good in expressing the opnion).

What i really want to do is a unicode search on the available data.

						Anjaly G S

On Mon, 2007-10-01 at 09:42 +0100, John Maddock wrote:
> Anjaly wrote:
> > In the regex document it was said that the size of data type of the
> > variable passed to the make_u32regex  that determines character
> > encoding (utf8,utf16 or utf32) .
> 
> *For construction of the regex object*.
> 
> The search algorithms operate independently on any of UTF8/16/32.
> 
> > I passed wchar_t (which i think size
> > is 4) so that the buffer encoding is considered as utf8  by
> > u32regex_search irrespectively.  Actually i am trying to do a utf8
> > search.
> 
> Except the data file you sent *was not valid UTF8* !
> 
> It looks like it's probably UTF16LE, it's up to you in that case to decode 
> the byte order mark and read the text into something that Boost.Regex can 
> handle (for example platform-native UTF16).  ICU should have some file IO 
> routines for doing that kind of thing: for example for loading a file into a 
> UnicodeString type.
> 
> HTH, John. 
> 
> _______________________________________________
> Boost-users mailing list
> Boost-users <at> lists.boost.org
> http://lists.boost.org/mailman/listinfo.cgi/boost-users

______________________________________
Scanned and protected by Email scanner
Permalink | Reply | 1 comment |
headers
abhishek.v | 1 Oct 13:55
Favicon

Problem in calculating cycle sequence...


Hi

I m able to calculate whether the cycle exist in the graph or not. With the help of following code..

//Finding out cycles
struct cycle_detector : public dfs_visitor<>
  {
       
    cycle_detector( bool& has_cycle, int& num):_has_cycle(has_cycle),cycle(num)
    { }
    template <class Edge, class Graph>
    void back_edge(Edge, Graph&)
    {
      cycle++;      
     _has_cycle = true;
    }
   protected:
    bool& _has_cycle;
    int& cycle;
  };

int main ()
{
.....
...
...
//Finding out whether the graph has cycles..
bool has_cycle = false;
int count_cycle=0;
typedef Traits::vertices_size_type size_type;
cycle_detector vis(has_cycle,count_cycle);
boost::depth_first_search(g, visitor(vis));
if(has_cycle)
{
file_op << "\nThe graph is cyclic"<< std::endl;
file_op<<"\nNumber of cycles in the graph is "<<count_cycle;
}
else
std::cout << "The graph is acyclic"<< std::endl;

return 0;

}

Now what i want is to calculate the vertex between which the cycle exist .. How to calculate that..


Thanks
Abhishek Vyas
Tata Consultancy Services
Mailto: abhishek.v <at> tcs.com
Website: http://www.tcs.com
____________________________________________
Experience certainty.        IT Services
                       Business Solutions
                       Outsourcing
____________________________________________=====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you 
_______________________________________________
Boost-users mailing list
Boost-users <at> lists.boost.org
http://lists.boost.org/mailman/listinfo.cgi/boost-users
Permalink | Reply | 0 comments |

Gmane