I don't think they've got mouse parts at your typical grocery stores, so you might just try fresh mouse straight from the pet store. ;P John "We want to be alone when we hear too many words and we feel alone when it has been a while since anyone has spoken to us." Paul David Tripp -- War of Words

I'm with you on this one: I just got a Toshiba e310, and want to write code for it (obviously). I talked to a Microsoft guy (I won the e310 at a Microsoft conference) and he (obviously) said I should get .NET and develop with it and some "other" (sorry, I can't remember the name now, useless brain!) files from the MS site. But I don't trust .NET quite yet, so I've just been using eMbedded Studio, seems OK so far.

The guys here tell me we chose Python because object orientation is not a bolt on, and it looked nicer to impliment. From the Python.org site, this is Perl vs. Python according to Yoda: EXTERIOR: DAGOBAH -- DAY With Yoda strapped to his back, Luke climbs up one of the many thick vines that grow in the swamp until he reaches the Dagobah statistics lab. Panting heavily, he continues his exercises -- grepping, installing new packages, logging in as root, and writing replacements for two-year-old shell scripts in Python. YODA: Code! Yes. A programmer's strength flows from code maintainability. But beware of Perl. Terse syntax... more than one way to do it... default variables. The dark side of code maintainability are they. Easily they flow, quick to join you when code you write. If once you start down the dark path, forever will it dominate your destiny, consume you it will. LUKE: Is Perl better than Python? YODA: No... no... no. Quicker, easier, more seductive. LUKE: But how will I know why Python is better than Perl? YODA: You will know. When your code you try to read six months from now. They suggest you look at Ruby as well if you're examining options. www.python.org is the site you want for Python info, including embedding information. Here is a comparison of Python to other languages on that site. Christian As I learn the innermost secrets of the around me, they reward me in many ways to keep quiet. Men with pierced ears are better prepared for marriage. They've experienced pain and bought Jewellery.

Its all a little fuzzy, but I think a call to bind should fail if the sockets local address + local port specified in the SOCKADDR is already in use. Also, winsock has the ability to bind to a port generated for you (specify a 0 for port), which you can query with getsockname.

Nevermind, I found the problem...See http://support.microsoft.com/support/kb/articles/Q146/1/20.ASP

You can sort using any predicate function. Here are some examples from code I am working with: struct greater_magnitude { bool operator()(const CTFARect& x, const CTFARect& y) const { return (fabs(x.Value()) > fabs(y.Value())); } }; std::list m_lstRects; ... m_lstRects.sort(greater_magnitude()); In your case, you'd define struct my_comparison_predicate with member bool my_comparison_predicate::operator()(const CTFARect *x, const CTFARect * y) const after my example above. But to use this, you have to fix some bugs in the Microsoft standard C++ library. Look at Dunkumware's list of bug fixes for the VC++ standard library. Edit the standard library headers in "Program Files\Microsoft Visual Studio\vc98\include" to implement the fixes on the Dinkumware page. Then, you must edit the file "list" thus to allow the use of predicates: *** list Tue Jun 27 23:50:23 2000 --- list.original Mon Jun 15 05:00:00 1998 *************** *** 281,288 **** erase(_F++); else ++_F; } ! // typedef binder2nd<not_equal_to<_Ty> > _Pr1; // Fixed 2000 06 27 JMG ! template<class _Pr1> void remove_if(_Pr1 _Pr) // Fixed 2000 06 27 JMG {iterator _L = end(); for (iterator _F = begin(); _F != _L; ) if (_Pr(*_F)) --- 281,288 ---- erase(_F++); else ++_F; } ! typedef binder2nd<not_equal_to<_Ty> > _Pr1; ! void remove_if(_Pr1 _Pr) {iterator _L = end(); for (iterator _F = begin(); _F != _L; ) if (_Pr(*_F)) *************** *** 297,304 **** erase(_M); else _F = _M; } ! // typedef not_equal_to<_Ty> _Pr2; // Fixed 2000 06 27 JMG ! template<class _Pr2> void unique(_Pr2 _Pr) // Fixed 2000 06 27 JMG {iterator _F = begin(), _L = end(); if (_F != _L) for (iterator _M = _F; ++_M != _L; _M = _F) --- 297,304 ---- erase(_M); else _F = _M; } ! typedef not_equal_to<_Ty> _Pr2; ! void unique(_Pr2 _Pr) {iterator _F = begin(), _L = end(); if (_F != _L) for (iterator _M = _F; ++_M != _L; _M = _F) *************** *** 321,328 **** _Splice(_L1, _X, _F2, _L2); _Size += _X._Size; _X._Size = 0; }} ! // typedef greater<_Ty> _Pr3; // Fixed 2000 06 27 JMG ! template<class _Pr3> void merge(_Myt& _X, _Pr3 _Pr) // Fixed 2000 06 27 JMG {if (&_X

I think there is an expression parser in the CodeGuru web site but there might be one in this web site too. They might help but might be too much. I think you only need a syntactical parser. You probably do not need a symantics parser. Are you familiar with Lexx? It is a compiler that generates a syntactical parser written in C. Also see: http://www.snippets.org/ and look for "Jari Laaksonen's comment utilities in C++" near the bottom. It might help.