[QUOTE=scru;874626]Missing? What's missing?[/QUOTE]

oops, looks like a reinstall and restart fixed it, I took a screenshot this morning. So sorry.

So, Python 2.6.2 is supposed to have the following JSON module:

[url]http://docs.python.org/library/json.html[/url]

I have the standard MacPython 2.6.2, but the attributes of my JSON library are different, can someone help me fix this?

Here's mine:

[url=http://img30.imageshack.us/my.php?image=picture1axb.png][img=http://img30.imageshack.us/img30/481/picture1axb.th.png][/url]

That seems like very useful information, thank you.

Understood. Thanks a lot!

[CODE]#include <iostream>
using namespace std;

int main()
{
int a;
cout<<"Enter a number";
cin>>a;
[B]if(a=5)[/B]
{
cout<<"Five";
}
else
{
cout<<"Not Five";
}
}

[/CODE]

When I use the assignment, the result is always "five". I understand that a is assiged 5, but there is no statement to check for that. Does the "if" condition execute simply because it has an invalid argument?

I guess that's why we call them pseudo random functions. Oh boy, the more I think of this, the more my head is getting twisted.

Anyway, thanks, but I'm still looking for the mathematical proof, although I'm certain it exists, if someone finds it do let me know.

I ask this question because I want to try out some probability theories and I want to get as close as possible to randomness. What my instinct tells me is that we cannot fabricate any function that is perfectly random, because we are in the first place defining an algorithm for it to work on.

In that case, I am seeking mathematical proof why perfectly random functions cannot exist?

Thanks,
Abhinav

I prefer SMF. For a free product, it has a lot of features compared to PhpBB.

I've been programming in C++ a year to two myself, mosty console applications, and not much else. How big a step up do you reckon is GUI programming, and how much does C++ help in making apps for platforms other than Windows.

Well, maybe this might help.

Its a mathematical fact that any prime number greater than 3 can be represented by (6a+1) or by (6a-1), where a is a parameter. Simply try to generate all such numbers and avoid repetition.

This should be faster than the method of checking divisibility.

Ok, thanks. I'll check out the group you mentioned too.

Thanks, this is a great first experience here on Daniweb. The replies were very informative.

[QUOTE]

The funny thing is that the derived class sort of inherits the access rights of the friend function and the private members of the base class are accessible to both the friend function and the derived class thanks to the "is a" rule.
[/QUOTE]

So, you mean to say that the friend function is also now a friend function to the derive class. That practically means that within that function, any private members of the derived class can be accessed, right?

I'm new to these concepts but a derived class cannot access private members of the base class because they are simply not accessible externally. But what if I define the derived class in a friend function to the base class. will the private members of the base class be successfully derived and if yes, will they be as public or private, or depend on the type of derivation?

Thanks,
Abhinav