Daniel0

You have to manually enable that: http://www.phpfreaks.com/forums/index.php?action=pm;sa=settings

There is no significant difference anyway.

In that case it seems more feasible just printing a message to the screen saying that.

If you just need the Greek characters, doing \p{Greek} will suffice as it in itself represents a character class.

Why are you even trying to do this? I absolutely hate when websites try to open new windows for me. I like to decide when and where and if new windows should be opened. I find anything else intrusive.

Put it in <script> tags.

Sure about that? daniel@daniel-laptop:~$ php -r "var_dump(getimagesize('http://www.phpfreaks.com/media/images/forums/bg_header.png'));" array(6) { [0]=> int(950) [1]=> int(133) [2]=> int(3) [3]=> string(24) "width="950" height="133"" ["bits"]=> int( ["mime"]=> string(9) "image/png" } daniel@daniel-laptop:~$ Do you want us to guess the errors, or are you going to tell us?

Okay...?

Dorky, why exactly do you act so offensively against other people's suggestions? When you ask for people's opinions, don't get offended if they think it sucks. Hell, your topic title says "be honest" so why do you get so upset about people's honest opinions? If you disagree with feedback you can just ignore it. It's not like anyone is forcing you to make any changes.

Yeah I'm not entirely sure what the problem is either. We'd need more info to give accurate help.

I just found out there is something called Adobe Wave: http://labs.adobe.com/technologies/wave/ Hell, they're even claiming trademark on it: Adobe® Wave™ I wonder that'll work out.

Pfft... thorpe is nearing 20k Anyways, post counts were removed from topic view so newcomers wouldn't get the impression that people with higher post counts are more knowledgeable than people with less, and to get people to stop focusing less on post counts and more on posting good stuff and being part of the community. You can still see the top 10 list under stats, you can see anyones post count in their profile and I also think they're still visible in PM view.

Pug, that A is worse than B doesn't mean that B cannot be bad. Lol... what do you think might happen when people have no money and desperately need it? What do you think might happen to the children of the parents working 12 hours per day 30 days a month, left alone by themselves in slum neighborhoods? My guess is the crime rate in those places would be higher than the average.

Then you escape all the tildes...

I doubt Microsoft's target audience are the complete noobs with no programming experience whatsoever.

Just for fun, I decided to throw some functional programming into this: local fun add chars xs = foldl (fn (y,b) => (map (fn x => x^y) xs) @ b) [] chars fun perm' chars length acc n = if n > length then acc else perm' chars length (add chars acc) (n+1) in fun perm chars length = perm' (map str chars) length [""] 1 end That's the permutation function implemented in SML. I like this one better. It's more beautiful.

What do you mean? You just need to escape the one you're using to delimit your string.

If you want to generate all of them, you could do like this: <?php function permute($length, array $chars, array $acc = array(''), $n = 1) { if ($n > $length) { return $acc; } $a2 = array(); foreach ($chars as $c) { foreach ($acc as $s) { $a2[] = $c.$s; } } return permute($length, $chars, $a2, ++$n); } $chars = array_merge(range('a','z'),array_merge(range('A','Z'),range('0','9'))); print_r(permute(6, $chars)); It can without doubt be improved, but it was quick to write Edit: That will be all the strings, you would still have to MD5 them.

PHP doesn't care how large your database is. For all it cares, it could have 1 or Googolplex (10^(10^100)) records. Are you sure it would matter? A DBMS would also be really slow without an index, and to be honest, creating an index for this would be stupid and pointless.

Yeah, sorry, tera of course. Not giga. Oh yeah, and if it actually was 377,149,515,625,000,000,000 you would need 327 EiB of storage. That would be one hell of a RAID setup.

How did you get that number? You have 26*2+10=62 different characters. Given that your string is always 6 characters long, the number of permutations with repeats is 62^6 = 56,800,235,584. Still a large number, but pretty much smaller than 377,149,515,625,000,000,000. At 32 B per MD5 hash, that's about 1.6 GiB assuming you're storing them consecutively with no form of separation. Am I missing something? Edit: @mikesta707: Your algorithm has a worst case running time of O(∞).

You might be able to recover it if you still have the binlogs. Don't count on anything though.

Hmm... Indeed the MX records are correct: daniel@daniel-laptop:~$ dig jobjar.co.uk MX ; <<>> DiG 9.6.1-P1 <<>> jobjar.co.uk MX ;; global options: +cmd ;; Got answer: ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: 48180 ;; flags: qr rd ra; QUERY: 1, ANSWER: 7, AUTHORITY: 0, ADDITIONAL: 0 ;; QUESTION SECTION: ;jobjar.co.uk. IN MX ;; ANSWER SECTION: jobjar.co.uk. 14400 IN MX 30 aspmx4.googlemail.com. jobjar.co.uk. 14400 IN MX 30 aspmx5.googlemail.com. jobjar.co.uk. 14400 IN MX 10 aspmx.l.google.com. jobjar.co.uk. 14400 IN MX 20 alt1.aspmx.l.google.com. jobjar.co.uk. 14400 IN MX 20 alt2.aspmx.l.google.com. jobjar.co.uk. 14400 IN MX 30 aspmx2.googlemail.com. jobjar.co.uk. 14400 IN MX 30 aspmx3.googlemail.com. ;; Query time: 146 msec ;; SERVER: 208.67.222.222#53(208.67.222.222) ;; WHEN: Thu Nov 5 19:47:11 2009 ;; MSG SIZE rcvd: 209 daniel@daniel-laptop:~$ I'm not sure why it wouldn't work.

Well, the basic idea would be to have an infinite loop running that keeps listening for incoming connections. Each time someone connects, you fork an additional process allowing the client to do whatever your client supposed to do. Then just you exit the forked process when the client is done. I would just drop the entire "multiple ports" thing altogether.

It could just act as a proxy so myfunction() in PHP user land (via the extension) would then map to myfunction() in his DLL. Assuming he knows C how to write PHP extensions, that shouldn't be so difficult.