Comments for ronald a. richardson

Comment on PHP MMORPG Maker by Ronald

Ronald — Thu, 22 Dec 2011 22:18:41 +0000

Thanks still in development I now have another developer on the project, she is redeveloping the entire game interface client side in HTML5 while I am handling server side development. More news on the project can be found @ http://cloudrealms.com/

Comment on PHP MMORPG Maker by Juan

Juan — Thu, 22 Dec 2011 22:15:24 +0000

Sounds interesting. I’ve been wanting to make an rpg (or any type of game) myself worklife and other stuff getting in the way of that… I can offer my art skills though. Not to mention I’d like to give it a spin when you finish it. Good luck with this project.

Comment on HACK The Android RC30 t-mobile G1, get root access, and unlock! by Can't SU on ADB in Command Prompt - Android Forums

Can't SU on ADB in Command Prompt - Android Forums — Wed, 14 Dec 2011 01:46:43 +0000

[...] now this is weird. I used a differing rooting method and now it seems that it rooted except I'm still having problems such as in ADB. First problem, [...]

Comment on “NO MORE TEXTING WHILE DRIVING!” by Alisha logston

Alisha logston — Tue, 15 Nov 2011 21:45:24 +0000

DON’T TEXT AND DRIVE
SAVE LIVES

Comment on “NO MORE TEXTING WHILE DRIVING!” by Alisha logston

Alisha logston — Tue, 15 Nov 2011 21:41:59 +0000

i felt sorry for him but he should have not been texting and driving!
but at least no one esle got hurt.

Comment on “NO MORE TEXTING WHILE DRIVING!” by jacbo ronald

jacbo ronald — Tue, 15 Nov 2011 21:39:22 +0000

im with you <3 its bad:p

Comment on “NO MORE TEXTING WHILE DRIVING!” by Alisha Logston

Alisha Logston — Tue, 15 Nov 2011 21:36:12 +0000

i felt sorry for him but he should not have been texting and driving!

Comment on Recursive PHP Spintax Class 3.0 by Article Manager

Article Manager — Sun, 30 Oct 2011 18:43:41 +0000

Yea, I tested and it works. No problems with deep nested sets or repeating options. Way to go, looking forward more cool stuff from this site

Comment on Recursive PHP Spintax Class 3.0 by Ronald

Ronald — Sun, 30 Oct 2011 00:50:11 +0000

Awesome share, I will have to make use of the JavaScript version.

Also:
The replace doesn’t work like that, the regex finds the lowest level of “{}” first then spins it then replace, and all of this happens one match at a time. So they are not all being replaced at the same time.

So the outcome will be random each spin. try it.

Comment on Recursive PHP Spintax Class 3.0 by Article Manager

Article Manager — Sat, 29 Oct 2011 21:57:15 +0000

I’ll be watching this space closely then! Now meanwhile I did something you might be interested too, namely javascript and coffee script version of the spinner. I can’t resist to share them too as a contribution to your site. I noticed your Python version and was inspired to this port:

coffeescript:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

split_str = '|'
replace_regexp_str = /[{}]/gi
match_regexp_str = /{[^{}]+?}/gi

spin = (txt) ->
if txt
txt = capture(txt) while txt.match(match_regexp_str)
txt

capture = (txt) ->
match = txt.match(match_regexp_str)
if (match[0])
words = match[0].split(split_str)
replace = words[Math.floor(Math.random()*words.length)].replace(replace_regexp_str, '')
txt = txt.replace(match[0], replace)
txt

alert spin('This is {my nested {spintax|spuntext} formatted string|your nested {spintax|spuntext} formatted string} test.')

which turns easily to javascript via http://jashkenas.github.com/coffee-script/ evaluator:

var capture, match_regexp_str, replace_regexp_str, spin, split_str;

split_str = '|';
replace_regexp_str = /[{}]/gi;
match_regexp_str = /{[^{}]+?}/gi;

spin = function(txt) {
if (txt) {
while (txt.match(match_regexp_str)) {
txt = capture(txt);
}
}
return txt;
};

capture = function(txt) {
var match, replace, words;
match = txt.match(match_regexp_str);
if (match[0]) {
words = match[0].split(split_str);
replace = words[Math.floor(Math.random() * words.length)].replace(replace_regexp_str, '');
txt = txt.replace(match[0], replace);
}
return txt;
};

alert(spin('This is {my nested {spintax|spuntext} formatted string|your nested {spintax|spuntext} formatted string} test.'));

One case came to my mind; are you sure replace part doesn’t replace all occurrence of one word to same synonym? Say I have a phrase “{one|two|three}{one|two|three}” would it give only: one one or two two or three three? I know, its a small test run to find out