User talk:CalmoSoft

From Rosetta Code
Revision as of 20:58, 10 March 2018 by Eoraptor (talk | contribs) (→‎Lisp)

Output

Hi. I've noticed that many of your Ring entries do not show output, even if the task requires it. For instance the Runge-Kutta task explicitly requires output, but the Ring code doesn't even seem to print anything. Output is important because it's often the only easy way we can tell if the code works as the task intended. Fwend (talk) 13:39, 30 March 2016 (UTC)

Hello Fwend,

In the Ring "see" is the output command. See the next line in the "Runge-Kutta method" program:

see "y(" + t + ") = " + y + " error = " + (actual - y) + nl ok

Greetings, Gal Zsolt (~ CalmoSoft ~)

Alright, but it's still necessary to post the output. You can do this using <pre>...</pre> tags. Fwend (talk) 17:07, 30 March 2016 (UTC)

Hello Fwend,

Now I have added the output. Thank you very much for suggestions. In the future I will add the outputs.

Greetings, Gal Zsolt (~ CalmoSoft ~)

Upload an image

Hello Fwend,

It is impossible to upload an image.

Greetings, Gal Zsolt (~ CalmoSoft ~)

Yes, image uploads have been disabled (for security reasons). Fwend (talk) 07:31, 30 June 2017 (UTC)

Hello Fwend,

Please can you upload the next image:

CalmoSoft Fifteen Puzzle Game Image

You'd have to ask an admin. But I don't think they can do it either. Some people use an image hosting service. Fwend (talk) 12:01, 30 June 2017 (UTC)

Hello Fwend,

Can you give me the email address of the admin?

Greetings, Gal Zsolt (~ CalmoSoft ~)

Lisp

Hi,

I just saw two of your recent edits. Please notice that in both cases there are already entries for Category:Common Lisp.

Eoraptor (talk) 10:37, 5 March 2018 (UTC)


CalmoSoft: Which dialect of Lisp are you using to write these examples? They look like Common Lisp to me and every Lisp example you have added already has a Common Lisp entry.

Have you read the Lisp page? The general Lisp category is for archaic versions of Lisp. While it doesn't hurt to have multiple examples showing different ways to do things, it would be better if they were classified correctly. --Thundergnat (talk) 12:35, 9 March 2018 (UTC)

Hi.

I use Allegro CL 10.1

Greetings, Gal Zsolt (~ CalmoSoft ~)

So these should be listed under Common Lisp then. Please move or merge them with the Common Lisp entries. Thanks. --Thundergnat (talk) 20:01, 9 March 2018 (UTC)
Agreed. Gal Zsolt, I moved your Lisp programs in the Common Lisp category, which is the correct place for them. Next time, please do not put Common Lisp code in the Lisp category. Eoraptor (talk) 12:45, 10 March 2018 (UTC)
By the way, your program for the Random numbers task is wrong. See Normal distribution on Wikipedia if you don't understand the task. Your program for Knuth shuffle looks weird, and is probably incorrect too (please notice that it's very easy to make this wrong, and if you differ even slightely from the given algorithm, you will almost certainly end up with an incorrect output. It may look correct (it's a permutation after all), but it won't have the desirable probabilistic properties. Besides, you could make use of basic Common Lisp functions, such as rotatef. Your program for Greatest common divisor is also wrong: it fails for negative b. However, the GCD is still defined (and the other programs I have checked, in C and Python for instance, do it correctly). You could also use the psetf function in the program. Your program for Primality by trial division, while not incorrect per se, is awfully inefficient, as you only need to check 2 and odd numbers up to the square root of n (and you could use the isqrt function). Your program for Palindrom detection is correct, but adds absolutely nothing to the existing solution. Same problem with Even or odd and Factorial. You seem to have completely missed the whole point of the Associative array/Iteration task. Hint: it's not about arrays, the word "associative" is here for something. I'm too lazy to continue analyzing your contributions, but there are probably other "surprises". Eoraptor (talk) 20:28, 10 March 2018 (UTC)