- Boost-users - lists.boost.org

RE: Re: MultiIndexSet invariant test failure
by Manges, Ross G 13 Apr '05

13 Apr '05

> Date: Wed, 13 Apr 2005 06:58:01 +0000 (UTC) > From: Joaquin M Lopez Munoz <joaquin(a)tid.es> > Subject: [Boost-users] Re: MultiIndexSet invariant test failure > To: boost-users(a)lists.boost.org > Message-ID: <loom.20050413T084751-297(a)post.gmane.org> > Content-Type: text/plain; charset=utf-8 > > So, once you have mutex-guarded your code, the problem > does not show? Please confirm. The invariant test fails (asserts) on a call to 'insert()' regardless of my mutex gaurds. I have even gone as far as to wrap 'read' methods such as calls to 'size()' and 'empty()' with mutexes. > Other than that, you'll have to guard your code with > mutexes like you say you're doing now. Yes, I understand this, but it seems that the invariant assertion is happening and it may not (?) necessarily be related to a threading issue. According to my backtrace, it appears that I do not have a thread contention issue. There is only one thread that is performing a call to any of the container methods (the other threads are waiting on a mutex release), and that call is 'insert()', and it is causing the aforementioned invariant assert. The invariant assert does not happen during every test run, but it does happen frequently. What are the kinds of things that could cause the invariant assert? The documentation doesn't go into any great detail in this area. > Hope this helps. Best regards, Any help is most welcome; thanks!

2 1

uBLAS compatible to OpenGL?
by Malte Clasen 13 Apr '05

13 Apr '05

Hi, is the uBLAS library memory compatible to OpenGL vector and matrix operations? I'd like to use a single representation for both internal maths and the rendering interface of my application. OpenGL expects a pointer to a float or double C-array. For example 4x4 matrices are stored linearly as 16 values. When using std::vector<T> or bounded_array<T> as storage, is there a guarantee that m(0,0) is a reference to the first element of an array of (at least) 16 values that equal the linearized matrix elements? Or is there another way to get access to the low-level storage if it has a compatible memory layout? If there isn't, is it possible customize the uBLAS library by an additional "storage organization" or "adapted array" class? best regards, Malte

2 1

serializing abstract base class
by Alex Olivas 13 Apr '05

13 Apr '05

I'm trying to serialize an abstract base class. I used the BOOST_IS_ABSTRACT macro, but the compile fails with the following error... public/dataclasses/I3Particle.h:225: syntax error before `namespace' public/dataclasses/I3Particle.h:225: syntax error before `}' token line 225 of I3Particle is... BOOST_IS_ABSTRACT(I3Particle); Is is not as simple as adding this one line? I'm using gcc 3.2.3. Thanks, Alex.

3 2

Boost thread problem
by Sliwa, Przemyslaw (London) 13 Apr '05

13 Apr '05

All, I have got a problem with the boost::thread package. My idea was to facilitate the multiprocessor ability of my computer and write a program which creates 10 threads which firstly write to the disk certain amount of information and then they read it back and push back certain objects. I am getting some memory access problems when pushing back the objects to the global vector. Can anyone of you understand why there is a problem? I really do not get it since the mutex is locked and the access to the vector is exclusively guaranteed to the active thread. Can you help? Thank you in advance Pshemek #include "FXTrade.h" #include <string> #include <fstream> #include <vector> #include <iostream> #include <cmath> #include <exception> #include <boost/random.hpp> #include <boost/thread/thread.hpp> #include <boost/thread/mutex.hpp> #include <boost/bind.hpp> using namespace std; using namespace boost; namespace write_namespace { mutex file_mutex; ofstream out; const size_t dimension(10000); const size_t size(10); const unsigned int number_of_threads(8); } vector<CFXTrade> TradeVector; namespace read_namespace { mutex in_file_mutex; ifstream in; } void write_to_disk(const vector<CFXTrade>& nVector) { using namespace write_namespace; mutex::scoped_lock lock(file_mutex); for(vector<CFXTrade>::const_iterator i_ptr=nVector.begin(); i_ptr!=nVector.end(); ++i_ptr) { out << i_ptr->m_TradeID << ";" << i_ptr->m_Name << ";" << i_ptr->m_Amount << endl; } } auto_ptr<CFXTrade> getTradeFromString(string& c_tmp) { int i_TradeID; string c_Name, c_sub; string::size_type pos; double d_Amount(0.0); pos = c_tmp.find(";"); c_sub = c_tmp.substr(0, pos); i_TradeID = atoi(c_sub.c_str()); c_sub = c_tmp.substr(++pos, 3); c_Name = c_sub; c_sub = c_tmp.substr(pos+4, 3); d_Amount = atof(c_sub.c_str()); d_Amount = 100.; return auto_ptr<CFXTrade>(new CFXTrade(i_TradeID, c_Name, d_Amount)); } void read_from_disk(vector<CFXTrade>& nTradeVector) { using namespace write_namespace; using namespace read_namespace; string c_tmp; try { for(size_t i=0; i<dimension; ++i) { mutex::scoped_lock lock(in_file_mutex); getline(in, c_tmp); TradeVector.push_back(*getTradeFromString(c_tmp) ); } } catch(exception& e) { cout << "A standard exception caught from " << __LINE__ << endl; cout << e.what() << endl; } } bool generate_file() { using namespace write_namespace; vector< thread* > ThreadVector(number_of_threads); mt19937 mt2; random_number_generator<mt19937> std_rng(mt2); int TradeIDVector[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; char* NameVector[] = {"ABC", "BCD", "CDE", "DEF", "EFG", "FGH", "GHI", "HIJ", "IJK", "JKL"}; double AmountVector[] = {10., 20., 30., 40., 50., 60., 70., 80., 90., 11.}; vector< vector<CFXTrade> > TradeVector(number_of_threads); for(int i=0; i<number_of_threads; ++i) { for(int j=0; j<dimension; ++j) { TradeVector[i].push_back(CFXTrade(TradeIDVector[std_rng(size)], string(NameVector[std_rng(size)]), AmountVector[std_rng(size)])); } } out.open("file.txt"); for(int i=0; i<number_of_threads; ++i) { ThreadVector[i] = new thread(bind(&write_to_disk, TradeVector[i])); } for(int i=0; i<number_of_threads; ++i) { ThreadVector[i]->join(); } out.close(); for(int i=0; i<number_of_threads; ++i) { delete ThreadVector[i]; } return true; } bool read_trades() { using namespace write_namespace; using namespace read_namespace; vector<thread*> ReadThreadVector(number_of_threads); in.open("file.txt"); try { for(int i=0; i<number_of_threads; ++i) { ReadThreadVector[i] = new thread(bind(&read_from_disk, TradeVector)); } for(int i=0; i<number_of_threads; ++i) { ReadThreadVector[i]->join(); } in.close(); for(int i=0; i<number_of_threads; ++i) { delete ReadThreadVector[i]; } } catch(exception& e) { cout << "A standard exception caught from " << __LINE__ << endl; cout << e.what() << endl; return false; } return true; } int main() { using namespace read_namespace; try { generate_file(); read_trades(); } catch(exception& e) { cout << e.what() << endl; exit(EXIT_FAILURE); } catch(...) { cout << "Unknown exception occured" << endl; } cout << TradeVector.size() << endl; } -------------------------------------------------------- If you are not an intended recipient of this e-mail, please notify the sender, delete it and do not read, act upon, print, disclose, copy, retain or redistribute it. Click here for important additional terms relating to this e-mail. http://www.ml.com/email_terms/ --------------------------------------------------------

1 0

boost::variant and operator<<
by Matt Hortman 13 Apr '05

13 Apr '05

Hello, I feel almost silly asking this but: I can only get the code listed below to compile if I remove the comments on the namespace statements, placing my custom operator<< in the boost::detail::variant namespace. Otherwise I get the error c:\Boost\include\boost-1_32\boost\variant\detail\variant_io.hpp(64) : error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'const T1' (or there is no acceptable conversion) from VC++ 7.1 and a similar error from both gcc 3.3 and 3.4. I'm using boost 1.32 on both WinXP and FreeBSD. Looking at the code in variant_io.hpp, I see no reason why it should not work without the namespace statements. Is there something fundamental about namespaces that I don't understand? Thanks, -Matt #include <vector> #include <string> #include <iostream> #include <boost/variant.hpp> typedef std::vector<std::string> strlist; typedef boost::variant<int, strlist> ConfigItem; //namespace boost { namespace detail { namespace variant { inline std::ostream& operator<< (std::ostream& os, const strlist& slist) { strlist::const_iterator it; for (it=slist.begin(); it!=slist.end(); ++it) os << *it << ", "; return os; } //}}} //using namespace boost::detail::variant; void main (void) { strlist sl; std::cout << sl << std::endl; //compiles fine ConfigItem v; std::cout << v << std::endl; // error no operator found }

3 2

MultiIndexSet invariant test failure
by Manges, Ross G 13 Apr '05

13 Apr '05

I'm running into an invariant test failure (I have BOOST_MULTI_INDEX_INVARIANT_ASSERT defined). Specifically, the trace that follows indicates that the assert fails during a MultiIndexSet "insert" operation. Additionally, I only see this happen when I'm running multi-threaded tests. I have the call to insert() wrapped by a mutex to prevent multiple threads from calling it at the same time. Has anyone else had trouble like this? Searching the users list for multi_index and invariant doesn't turn up much. I'm using the boost library version 1_32 on RHEL3. Thanks for any help.

2 1

A-Star in BGL?
by Vivid Yang 13 Apr '05

13 Apr '05

Hi, I wonder if there is A-Star algorithms implemented in BGL? I could not find it..... Or is it hard to implement (Say, hard to implement the heuristics functor)? Is there a way to implement A-Star based on what we have in BGL? Thanks a lot! Vivid

2 1

Using sparse matrix
by Golan Green 12 Apr '05

12 Apr '05

Hello, I have just started using Boost libraries, and I have 2 questions regarding use of sparse matrix: 1. The matrix should be large (about 3000 * 1500), and I need to make the insertion very efficient. When I use the regular insert function, it seems to work very slow. Is there a better way to insert objects into the sparse matrix? 2. I want to know if there is an efficient way to multiply the matrix with a vector. Regards, Golan.

2 1

Simple question: How to verify two types are the same?
by Stephen Gross 12 Apr '05

12 Apr '05

Hi all... I know this is a simple question, but I can't figure out which boost function to use. How do I find out if two types are the same type? For example: template<C1, C2> void compare() { if(boost::types_are_the_same<C1, C2>::result == true) ... } Thanks! --Steve Stephen Gross Case Western School of Medicine Cleveland, OH "The large print giveth and the small print taketh away." - Tom Waits

3 4

RE: [Boost-users] Re: sun sparc g++ filesystem build error
by Naeem ahmad 12 Apr '05

12 Apr '05

Hi, I am using g++ 2.96 version, It is fail with many libraries of boost. Should I get latest version of g++ compiler, does it will work with all boost libraries. Thanks, Naeem -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Rene Rivera Sent: 12 April 2005 15:47 To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: sun sparc g++ filesystem build error Rene Rivera wrote: > Naeem ahmad wrote: >> /usr/local/boost_1_32_0/bjam "-sBUILD=g++" > > Hence you should do: > > /usr/local/boost_1_32_0/bjam "-sTOOLS=gcc" PS. What Markus said also applies. -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - Grafik/jabber.org _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users AIRCOM to present our integrated OSS Solution at the TeleMangement World, Nice 2005, held May 16th - 19th, in Nice, France at the Acropolis Convention Centre. Visit us at booth 107. www.tmforum.org Disclaimer: The information contained in this e-mail, including any attachments to it, is confidential and intended only for the person(s) to whom it is addressed. Any examination, distribution, disclosure, printing, or copying of this information, or reliance upon this information by any person other than the intended recipient(s) is strictly prohibited. If this e-mail has been misdirected and you are not the intended recipient, please notify the sender immediately and delete this e-mail from your system. The views and opinions contained in this transmission represent those of the author and do not necessarily reflect those of AIRCOM International. AIRCOM International may monitor incoming and outgoing e-mails. By replying to this message, you consent to this monitoring. This e-mail has been scanned by McAfee Group Shield prior to transmission. However, recipients are advised to apply their own antivirus detection measures to this e-mail and any attachments upon receipt. AIRCOM International does not accept liability for any damage or losses arising as a result of receiving this e-mail.

2 1