Hi Everyone,

i was wondering why can't static member functions be made const or
volatile or virtual?

const static member function, not changing the values of static
member data
valatile static member function, indicating that volatile static
member could be changed beyond the program's control
virtual static member function, as the VTABLE is class specific...

Thanks in advance!!!

On 6 фев, 13:48, "Erik Wikström" telia.com> wrote:

One should. And one sould do it even in common implementations.

iostream conversions use locale abstractions to handle output complied
with national pecularities. According to standard, locale functions
may throw (much time has passed since i was trying to track it, so
you'd better research it again). And now assume that we are in the
locale of Mbongo-bongo savage tribe which has no representation of
numbers but integers from 1 to 10, or in medieval locale where 666 is
banned from being printed. The most straightforward solution here is
to throw an exception (bad_heretic, for example).

I have a warning 'comparison between enum and const enum'.

I tried using static_cast<>.The warning is resolved.but is it really
safe at runtime.

Learn System Analysis and Design for Software Engineering. Explained
step by step with examples and case studies

http://www.freetutes.com/systemanalysis

vector and deque provide similar operations like operator[]. vector
stores the elements contiguously. Does the deque also store the
elements contiguously in order to provide operations similar to the
vector ?. Does the standard say anything regarding how the elements
should be stored in vector and deque ?

Kindly clarify.

Thanks
V.Subramanian

I'm curious how these two structures match up for my use. I've created
a custom tree which is not sorted and each node can have infinite
children. Why? Because each node is a menu in a simple GUI and the
tree is created once and traversal is then rather trivial bopping from
menu to menu is never more than one link away.

Unfortunately this tree has become a maintenance item for me and I'm
considering relieving myself of it. I thought of all the STL options
available, the map might be the one that might beat it out in
performance. Again, the map would be created once and then I'd have to
find a node based on a key value (I've been using the string name of
the menu as a unique key for the overloaded == operator used for the
tree).

Thoughts?

Dear Sir/Madam

I am a student of Warsaw School of Economics. I write a master's
thesis about a opinion on managers.

I would like to ask you to fill in the survey (link below) by you and
as many members of your group as possible. It will help me to write my
thesis. It takes only up to 7 minutes to fill it in.

The survey:
http://entropy.be/~mag/limesurvey/index.php?sid=94762&lang=en

If you could please also forward this mail to other members of the
group.

I will be rally grateful for your help.

Yours sincerely

Dear Sir/Madam

I am a student of Warsaw School of Economics. I write a master's
thesis about a opinion on managers.

I would like to ask you to fill in the survey (link below) by you and
as many members of your group as possible. It will help me to write my
thesis. It takes only up to 7 minutes to fill it in.

The survey:
http://entropy.be/~mag/limesurvey/index.php?sid=94762&lang=en

If you could please also forward this mail to other members of the
group.

I will be rally grateful for your help.

Yours sincerely

James Kanze gmail.com> writes:

[...]

http://xkcd.com/378/ 'Nuff said. :-)

--
Dave Steffen - Software Engineer 4

Hi,

Recently some people I know stumbled upon a strange problem with the
following piece of code. This is reduced as far as possible.

The idea of the code is simple. There are four structs of which one
contains the other three structs. If we allocate a large double array
of that struct and try to initialize it to zero, or try to use one of
them in a function. The program gives a seg fault. If we make the array
slightly smaller, there is no problem. The problem only appears on
x86_64 architectures.

Below I past a copy of the failing code. If DATAMAX is set to 4820 the
program works, if it is set to 4830 it seg faults.

What could the reason be of this? We have calculated the amount of
memory and we have for sure no problem with that. A backtrace also does
not give any deeper insight.

Thanks for the help

#define DATAMAX 4830
#define ISOMAX 7