User talk:Gerard Schildberger: Difference between revisions

m
Add some nowiki formatting to keep this page from showing up in the task list. Other twiddle to cope with new site.
m (Add some nowiki formatting to keep this page from showing up in the task list. Other twiddle to cope with new site.)
 
(32 intermediate revisions by 5 users not shown)
Line 1:
==Flag as incorrect==
 
Hi, I think you left a comment ''the above will erroneously return:...'' on a PLI example. Could you change this to use the template incorrect so that PLI users are flagged that the example needs attention. Thanks. --[[User:Paddy3118|Paddy3118]] 18:22, 28 October 2010 (UTC)
 
I confess I didn't know the proper methodology to be used (this was my very first time on Rosetta Code). The fallout from that excursion was not what I expect at all, not exactly a pleasent experience. It would've been nice to actually include the righteous text so I could hit the ground running and re-enter the correct incorrect template. I had thought that putting a comment near the code would get someone's attention and fix the problem. My bad. I was trying to figure out how to contact the author of the code, but I didn't have the skills at that time. I have previously removed the offending comment, leaving the original problem intact, and as far as I know, the errors are still there. To make it worse, I've already forgotten which entry it was, and looking back at it all, I regret trying to address the issue (error). There are so many such errors that I came across a few weeks ago, and I'm glad I didn't mung up more erroneous pages. I'm wondering at this point if erroneous pages are less erroneous with erroneous flagged corrections,   or flags that are erroneous? I wish the process would be more forgiving and above all, much easier to implement without the headaches. If I ever get the time, I may revisit some pages, but I rarely look at other people's code anymore, except for clarification of the specifications of the task to be solved. What is the protocol about these talk pages? Do they hang around forever, or am I supposed to delete (edit) them later when they lose their relevance? [[User:Gerard Schildberger|Gerard Schildberger]]
 
 
Line 75 ⟶ 76:
::We must distinguish between languages and implementations. ooRexx, if you will, implements a subset of Classic Rexx and I am happy with that. Programs written obeying this subset have their place under REXX. Programs that use oo and other extensions (i+=8) should and must go to ooRexx (or be corrected). Again: thanks for telling me about my oversight. --[[User:Walterpachl|Walterpachl]] ([[User talk:Walterpachl|talk]]) 05:44, 26 July 2014 (UTC)
 
::: I'm almost in complete agreement with your first two statements (quite possibly 100%). Classic REXX interpreters that implement the same set of language syntax (rules), with minor differences, contribute to the making of computer programming language dialects.   ooRexx has different BIFs, statements, syntax, etc., and in many people's opinion (and mine), those differences makes it a different language.   I think I know what you meant about writing (ooRexx?) REXX programs that obey ''that subset'', but the programs that I code are for Classic REXX and don't limit writing to a subset --- but I try to limit almost all my Rosetta Code REXX programs to what most Classic REXX programmers use (or know).   Of course there are exceptions, and they are noted when I code a REXX program for a particular Class REXX interpreter that has specific (additional) BIFs to accomplish a particular Rosetta Code task.   For Classic REXX programmers using/running (Microsoft) Windows on PeeCeesPCs, that usually means Regina REXX   (probably the most used, most common [free] REXX interpreter).   [I presume you meant writing/using ooRexx statements that obey ''that subset''.]   Saying that, I'm in complete agreement with your third statement.   The minor disagreement with the 2nd statement is that there are subtle differences in the way Classic REXX and ooRexx treats, ... well, objects versus variables (or rather, their values), if you will, especially stems (possibly tail stems) and/or stemmed arrays --- (and I'm not an expert in ooRexx), but I'm recalling an acute discussion in a REXX newsgroup about this very issue where Classic REXX treats the assignment of a stemmed array (such as   '''a. = b.''') differently than ooRexx (as I recall).   This was sometime ago and I don't recall the details.   ooRexx being what it is (object orientated), it's that way by design (and/or by definition).   The good news is that situation is an uncommon occurrence I should think (programming wise), and is therefore more of an academic discussion/exercise.   Having said that, somebody may point out the error of my assumptions. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 07:12, 26 July 2014 (UTC)
 
 
== Please summarize your edits ==
Line 87 ⟶ 89:
Most of my updates (followups) are so minor that it would be distracting for casual readers what I've done, and I try to keep forcing my self to add comments to most of my REXX examples, something which seems might be a waste of time as I see very little evidence elsewhere of copious (or even brief) comments on (at) the statement level. I spend quite a bit of time dumbing-down my code to make it understandable for the novice (REXX) programmer. In doing so, I try to add (statement) comments on what the statements are doing/accomplishing, but the more advanced one gets, the more shortcuts one takes, and the code becomes obtuse with very little effort, sad to say.
 
REXX leads itself to writing a lot of "one-liner" subroutines (or, at the least, pretty short subroutines/procedures). This hides the commons tasks that happen over and over again, the duldrumsdoldrums of programming. The <strike> one-lines </strike> '''one-liners''' tend to end up at the bottom (end) of the program, usually after some kind of comment fence. Out of sight, out of mind. Most often, the one-lines are very general in nature and have been thourghlythoroughly tested/debugged, and once written, almost never looked at again --- until Rosetta Code. Most REXX programmers write code on serveralseveral classes of computers, PC's just being one. There is a lot of boilerplate to keep track of, environmental impacts, restrictions on command options, command names, command formats, terminal (console) support (linesize, screen width), fonts, file structure(s), file naming protocols, security concerns (read/write), operating system quirks (that's the polite word for it), etc, etc, etc. You wouldn'bet believe the proglogueprologue code that I have written (collected) over the ... ahem, decades of programming in REXX --
cough, cough, since around 1982 or so. And I'm a regular packratpack-rat. PL/I was way back in 1866 , er, make that 1966. Anywhooose, I'll try to make more summaries, even if almost all of them are quite bland and/or uninteresting. [[User:Gerard Schildberger|Gerard Schildberger]]
 
 
Line 95 ⟶ 97:
:Hi Gerard, Adding the summary takes little time, and really helps others. Thanks. --[[User:Paddy3118|Paddy3118]] 06:27, 30 October 2010 (UTC)
 
I'm not sure where these summaries end up, as I never had seen any. Is it under the "history" section? I must confess, when I look at some code, I don't care to read about how and/or when changes where made, all I care about is the final product (so to speak) and I'm not particuralyparticularly interestredinterested in the code's change pedigree. But that's me, and I realize that others might find that sort of detail interesting in some way. [[User:Gerard Schildberger|Gerard Schildberger]]
:The summaries do end up on the page history, but they also end up on [[Special:RecentChanges]] and in that page's RSS feed (http://rosettacode.org/mw/index.php?title=Special:RecentChanges&feed=atom). People like to keep an eye on the recent changes feed. Adding a summary there helps us decide if we need to check on an edit. Also you don't need to add a signature (<nowiki>--~~~~</nowiki>) in the summary. It doesn't get evaluated there (as you can probably see in the recent changes feed) and every place that the edit summary shows up already has your username and a timestamp attached to the edit. --[[User:Mwn3d|Mwn3d]] 13:35, 25 April 2012 (UTC)
 
 
== Welcome! ==
 
{{User:Short Circuit/new user greeting}}--[[User:Short Circuit|Michael Mol]] 12:31, 1 November 2010 (UTC)
 
 
== Too much text on a page ==
Line 111 ⟶ 115:
 
I still haven't found out how to create another (separate) page to hold larger examples. I also have to learn how to link them. [[User:Gerard Schildberger|Gerard Schildberger]]
 
:If you want to create a new page, simply type the intended title in the search bar on the left (you should probably do this in a new tab/window) and hit "Go". The page it takes you to will have a "create" tab at the top and (I think) a link somewhere in the text of the page that will let you create the page. From there, it's just like editing any other page. If you're creating a separate page for a large example or large output sample, you should keep the title of the new page to the form of "task title/language name" or something similar (if you get it wrong, someone will probably correct it). To link to that page (or any other page on the wiki) from the task page, put the title between two pairs of square brackets: <nowiki>[[Page title here]]</nowiki>. You can read up on all sorts of neat wiki tricks [[Help:Formatting|here]]. Also you can watch the [[Special:RecentChanges|Recent changes feed]] after you make edits to see what other people do to them (this is where the edit summary comes in handy). --[[User:Mwn3d|Mwn3d]] 15:01, 8 December 2010 (UTC)
 
 
==Request for dialogue==
 
The text of an email sent to Gerard:
<langsyntaxhighlight emaillang="text">From: Paddy 3118 <paddy3118@xxx.net>
Date: 7 December 2010 04:40
Subject: Rosetta code.
Line 126 ⟶ 133:
Thanks.
 
- Paddy3118.</lang<syntaxhighlight>
 
I was beginning to wonder what
<br><br>[] &nbsp; Watch this page
<br><br>''did'' &nbsp; &nbsp; as I never got any notification(s) of any page watched. I've since learned that I had never entered an E-mail address (I had assummedassumed that "it" would notify me when I logged on Rosetta Code). I never did like entering my E-mail address on a public forum, but ... I guess it is necessary for a diaglog in this forum. As a result, I'm desperately trying to play catchupcatch-up and it's a bit overwhelming. [[User:Gerard Schildberger|Gerard Schildberger]]
 
 
 
===My email, and response===
 
Sorry Paddy; at the point where people start sending open letters, I figure it's time I finally take a look.
 
<langsyntaxhighlight emaillang="text">On Tue, Dec 7, 2010 at 6:21 PM, Gerard Schildberger <GerardS@rrt.net> wrote:
 
Michael Mol:
Line 185 ⟶ 193:
 
... if you're a student of newsgroups, then you know of what I speak. Not all discourse
is benificialbeneficial.
 
 
Line 250 ⟶ 258:
The sequence I've observed to work the best, as far as creation of successful tasks:
 
1) Someone creates a task, and uses <nowiki>{{draft task}}</nowiki> instead of <nowiki>{{task}}</nowiki>, to invite people to critique it and add
some trial solutions.
2) As people add trial solutions, they'll hit on bugs in the spec
Line 256 ⟶ 264:
describe the task to meet the original writer's desires.
4) The task is refined, and we jump back to step 2.
5) Eventually people don't see a need to refine the task farther, and the task gets switched from <nowiki>{{draft task}}</nowiki>
to {{task}}. If I have time, I'll throw a note out to RC's Twitter and Facebook pages announcing the new task.
 
Sometimes step 1 is skipped, and the author uses <nowiki>{{task}}</nowiki> instead of <nowiki>{{draft task}}</nowiki>. When that happens, steps 2
and onward still occur; it just gets a little rougher.
 
Line 292 ⟶ 300:
The task also assumes that there is only one answer, while in fact,
the general case may have no or many answers. The task stated to
find THE answer, and didn't say anything about the posibilitypossibility of showing
other answers (if there were any). ... And so it goes. It didn't mention
if "the" would match up to "Einstein" for example (caseless compariosnscomparisons),
or what to do about punctuation (the obvious thing to do would be to ignore
'em). Yes, yes, I know, there weren't any of those pesky critters...
Line 371 ⟶ 379:
 
 
I wish a lot of the tasks wouldn't be so ego-centriccentrist. That is a problem
that should be address, in my humble opinion. Well, maybe next
Christmas then ...
Line 410 ⟶ 418:
 
--
:wq</langsyntaxhighlight>
 
(I got permission to post the reply.) --[[User:Short Circuit|Michael Mol]] 04:11, 8 December 2010 (UTC)
Line 430 ⟶ 438:
code is like making a silk purse out of a sow's ear, and have become more lax in the addition of REXX statement
comments. [[User:Gerard Schildberger|Gerard Schildberger]]
 
 
== [[Ackermann function]] ==
 
Hi,
 
Line 446 ⟶ 456:
<br><br>That's a pretty ''gihugeic'' number, if not ''gi-normous''.
<br>I don't think it'll fit in the known universe. -- [[User:Gerard Schildberger|Gerard Schildberger]] 20:33, 30 May 2012 (UTC)
 
 
== Regarding Whitespace ==
Line 475 ⟶ 486:
 
:::::::::: That sounds like a great idea. Just peachy! -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:10, 25 July 2014 (UTC)
 
 
== REXX Long Multiplication ==
 
Sorry for the re-addition of the comment, but it doesn't really matter that REXX does its multiplication on decimal
strings -- all languages with bignum supprt are doing the same thing too, they just happen to represent the numbers
Line 486 ⟶ 499:
 
: Well, you say I am claiming that it does, and you are claiming that it doesn't. &nbsp; When you put it like that,
:it sounds like my opinion is being impunedimpugned. &nbsp; This is no place for a shouting match. &nbsp; What do you
:want me to do besides "claim" the facts? &nbsp; By the way, not ALL languages with "bignum" support do it with a
:a base bigger than 10. &nbsp; REXX does not. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 07:14, 13 May 2013 (UTC)
Line 492 ⟶ 505:
::Yes, I'm saying that not only REXX does it, *all* of the bignum libraries do it. The fact that some random library uses base 10 or base 256 or 65536 or whatever is irrelevant since the algorithm is the same for all of them, and re-implementing this algorithm is as bogus with any language as it is with REXX. The page seems like it requests an explicit implementation, regardless of bignum support or how its implemented, and if that's taken as is, then the REXX answer is wrong because it does not implement the algorithm. Like I said on the discussion page, I really don't care either way, but it should be clear which way it should go -- and if an implementation is required it is extremely unfair to single out about 3 solutions as broken when in fact many others on the page are broken. --[[User:Elibarzilay|Elibarzilay]] ([[User talk:Elibarzilay|talk]]) 07:48, 13 May 2013 (UTC)
 
::: No, REXX does explicit arithmetic &nbsp; not &nbsp; with BigNums, but with a method that people use when doing arithmetic on paper. &nbsp; There is no base 10 in that the numbers are stored as characters, not a array of numbers in base 2, base 10, or possibly a higher base. &nbsp; REXX does NOT perform arithmetic like any other langagelanguage (with the possible except of SNOBOL). &nbsp; You just can't say that REXX does arithmetic like every language that has BigNum capability. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 08:01, 13 May 2013 (UTC)
 
::::It looks like you're not aware of how bignums are implemented: an arbitrary-length list of "digits". Operations are implemented in terms of these lists. Usually, the digits are big with each one being a machine word. But it doesn't matter if you use a smaller base-10, everything works the same, and the resulting algorithm *is* what you would do on paper.
Line 511 ⟶ 524:
::This is also not relevant, since the algorithm itself is the same, whether done with decimal digits or another base, whether represented as ASCII numerals or plain numbers, and whether stored in RAM or on printed paper. And since its the same, any of these languages with bignums should be able to have just the quick multiplication as a solution. --[[User:Elibarzilay|Elibarzilay]] ([[User talk:Elibarzilay|talk]]) 07:51, 13 May 2013 (UTC)
 
::: Er, no again. &nbsp; The algorithm (doing multiplication on paper) is not the same as what is done (with computers using BigNum) with binary diginitsdigits, decimal digits, or higher bases. &nbsp; The BigNum algorithm is not a mimic of pencil arithmetic, to coin a phrase. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 08:06, 13 May 2013 (UTC)
 
 
==Discussion moved from task page==
 
Hi, I just moved your [[Talk:Strip_a_set_of_characters_from_a_string#Task_clarification|discussion]] from the task page. It may need cleanup. We don't normally have such discussions on the task page. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 10:05, 8 June 2013 (UTC)
 
Line 519 ⟶ 534:
 
: &nbsp; I don't believe in adding versions (of the same language) that do less, ''and'' with restrictions that make the solution incorrect. &nbsp; And so it goes. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 00:43, 9 June 2013 (UTC)
 
 
== Ironclad programming language ==
Line 547 ⟶ 563:
 
:: Yup, I missed that step. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:17, 26 February 2014 (UTC)
 
 
== Tildes in edit summaries ==
 
<code><nowiki>~~~~</nowiki></code> doesn't work in edit summaries. Fortunately, it's unnecessary. Take a look at [[Special:RecentChanges]] or a specific page's history and you can see that every edit's author shows up automatically, while your tildes remain tildes. —[[User:Underscore|Underscore]] ([[User talk:Underscore|Talk]]) 01:44, 27 February 2014 (UTC)
 
 
==Check edits to: [[Quaternion type]]==
 
Hi, some of your edits to the page left equations that would not parse and show as glaring red errors. Could you review you edits please and fix the page. <br>Thanks. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 22:42, 2 August 2016 (UTC)
 
Line 575 ⟶ 594:
::: Uf-ta. &nbsp; That sure is a bummer when the Google guys may not even acknowledge the problem and/or your reporting of same. &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 19:25, 3 August 2016 (UTC)
 
 
==[[Range extraction/Format]]: Spaces are significant==
== [[Range extraction/Format]]: Spaces are significant ==
 
Hi, The absence of spaces in the description of the format is ''most significant'' so I had to revert your edit. It is good to tidy things up, but you need to thoroughly understand some of these task descriptions before contemplating changes to ensure any change made does not alter the task. In this case you confused the task description - the text described one thing - your changed example introduced spaces.
 
Line 584 ⟶ 605:
--[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 07:09, 4 August 2016 (UTC)
 
 
==Leading and trailing spaces in &lt;math&gt; tags contents makes formulae invisible in OS X Safari & Chrome==
== Leading and trailing spaces in &lt;math&gt; tags contents makes formulae invisible in OS X Safari & Chrome ==
 
Hi Gerard - a quick heads up that in some task-spec tidying you have introduced a single white space character at the start and/or end of various &lt;math&gt; tag contents, and it seems to be this that has recently been rendering formulae invisible in OSX browsers. Simply deleting the flanking spaces turns out to restore visibility for browsers on this platform. [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 19:20, 15 September 2016 (UTC)
Line 614 ⟶ 636:
:Without such spaces, Firefox renders the formula, but other browsers don't. Other web pages seem to employ an image file, or a collection of images of symbols to obtain a pleasing result. If I understand matters correctly, the RC system sends (or could send) different .html stuff according to the name of the browser it is feeding, so, I'm well adrift. [[User:Dinosaur|Dinosaur]] ([[User talk:Dinosaur|talk]]) 11:57, 17 November 2017 (UTC)
 
 
==Restoring formula visibility to 50+ tasks for Chrome, IE/Edge, Safari etc==
== Restoring formula visibility to 50+ tasks for Chrome, IE/Edge, Safari etc ==
 
Hi Gerard, as it has emerged that the loss of formula visibility has not been platform-specific, and, as you mentioned that you did have one of the majority-type browsers installed (Internet Explorer), as well as one of the minority-type (FireFox), you should be able to fix your edits to restore formula visibility by testing their effects in IE.
Line 736 ⟶ 759:
:: Previewing '''&lt;math&gt;''' tag contents in Firefox gives no indication of how things really appear on the majority of browsers. If you do edit in Firefox, you '''must always''' also check the real effects of your edit in either Chrome, IE/Edge, Safari, or Opera.
:: Any one of them will do. [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 11:24, 25 November 2016 (UTC)
 
 
== Thanks ==
 
I've fixed [[Commatizing_numbers#Phix]]. Thanks for the mild slap - it wasn't exactly my best effort, now was it? [[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 22:42, 7 April 2017 (UTC)
 
: I didn't mean my comments to be a slap, just a nudge to fulfill the task's requirements. &nbsp; After any changes/enhancements are done, the "incomplete flag" can be deleted, and all waters are calm. &nbsp; But thank you for completing/fulfilling all of the task's requirements (and having a sense of humor). &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 00:14, 8 April 2017 (UTC)
 
 
== JavaScript program ==
 
Thanks for the JavaScript program for the syntax highlighting! Very good idea/trick! [[User:Violazoli|Violazoli]] ([[User talk:Violazoli|talk]]) 19:00, 10 June 2020 (UTC)
 
: You're very welcome. &nbsp; It's a nice and handy feature to have &nbsp; (the ability to &nbsp; '''turn off''' &nbsp; syntax highlighting if the user chooses to). &nbsp; I wish it would be standard for two reasons. &nbsp; Having the ability to turn off syntax highlighting (for some computer programming languages, some parts of the highlighting are hideous, in the case of REXX, the use of italics for comments mangles some glyphs and make the comments very hard to read). &nbsp; The other good thing is, without highlighting, larger Rosetta Code tasks &nbsp; (with numerous solution) &nbsp; render faster. &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 19:38, 10 June 2020 (UTC)
 
 
== RC POP.OUT ==
Line 751 ⟶ 784:
 
Humm. When a language gains another task's solution, it would be interesting for your schedule to name the task (or tasks), even with a link to the task... One does wonder just which tasks have now been solved. Given that the solutions for a given task are occasionally out of order (or possibly not in the strict character collating order) some caution would be required. [[User:Dinosaur|Dinosaur]] ([[User talk:Dinosaur|talk]]) 10:50, 17 November 2017 (UTC)
 
 
==KPBF sample==
 
Gerard: u got it wrong!
 
Line 768 ⟶ 803:
 
: The &nbsp; ''Kronecker product based fractals'' &nbsp; REXX entry was fixed on June 10<sup>th</sup>, 2017. &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 05:10, 7 September 2017 (UTC)
 
 
== RC POP.OUT, differences ==
Line 798 ⟶ 834:
 
I just re-checked about the (correct) spelling of the computer programming language &nbsp; '''Déjà Vu''', &nbsp; and it is indeed misspelled almost everywhere on Rosetta Code &nbsp; (as &nbsp; '''Déjá Vu'''). &nbsp; Should someone with the proper administrative authority do a global change to reflect the proper spelling? &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 12:03, 4 December 2017 (UTC)
 
:Are you sure? I don't see any instance in [http://www.rosettacode.org/mw/index.php?title=Special:Categories&limit=5000 Special:Categories&limit=5000] (caution: large page). And since the major contributor for this language on RC seems to be its author (see [http://rosettacode.org/mw/index.php?title=Special:Contributions/Gvx&offset=&limit=500&target=Gvx this]and compare to [https://github.com/gvx/deja this]), I guess he takes care to spell it correctly. [[User:Eoraptor|Eoraptor]] ([[User talk:Eoraptor|talk]]) 12:05, 8 December 2017 (UTC)
:Are you sure? I don't see any instance in [http://www.rosettacode.org/mw/index.php?title=Special:Categories&limit=5000 Special:Categories&limit=5000] (caution: large page). And since the major contributor for this language on RC seems to be its author (see [http://rosettacode.org/mw/index.php?title=Special:Contributions/Gvx&offset=&limit=500&target=Gvx this] and compare to [https://github.com/gvx/deja this]), I guess he takes care to spell it correctly. [[User:Eoraptor|Eoraptor]] ([[User talk:Eoraptor|talk]]) 12:05, 8 December 2017 (UTC)
 
-----
 
I finally got to the root of the problem --- it was my misunderstanding/misreading/misinterpreting of the (or a ?) translation of two files that I had downloaded from Rosetta Code. &nbsp; It finally became clear to me that we were observing the same character as two &nbsp; ''different'' &nbsp; characters, even though they were the same ··· err, I hope that almost makes sense. &nbsp; The ASCII files that I was viewing:
 
RC_POP.LAN Line=919 Col=1 Size=918 Alt=0,0;1
 
* * * Top of File * * *
------------------------------- 262 line(s) not displayed ----------------------
* Déjà Vu </wiki/Category:D%C3%A9j%C3%A0_Vu>
------------------------------- 655 line(s) not displayed ----------------------
* * * End of File * * *
 
and
 
RC_POP.CAT Line=1125 Col=1 Size=4818 Alt=0,0;2
 
* * * Top of File * * *
------------------------------- 1123 line(s) not displayed ---------------------
* Déjà Vu </wiki/Category:D%C3%A9j%C3%A0_Vu>‏‎ (105 members)
* Déjà Vu/Omit </wiki/Category:D%C3%A9j%C3%A0_Vu/Omit>‏‎ (6 members)
* Déjà Vu Implementations
-------------------------------- 2 line(s) not displayed -----------------------
* Déjà Vu User
-------------------------------- 2 line(s) not displayed -----------------------
* Déjà Vu examples needing attention
-------------------------------- 2 line(s) not displayed -----------------------
* Déjà Vu related
------------------------------- 3683 line(s) not displayed ---------------------
 
 
where I was interpreting:
 
the 1st character D (ASCII) as capital D
the 2nd character(s) ├⌐ (Unicode) as lowercase é
the 3rd character j (ASCII) as lowercase j
the 4th character(s) ├á (Unicode) as lowercase á
 
You can see where where I made the assumption that &nbsp; <big>'''├á'''</big> &nbsp; was the ASCII character &nbsp; <big>'''á'''</big> &nbsp; &nbsp; &nbsp; (instead of the correct character &nbsp; <big>'''à'''</big>). &nbsp; I'll will correct the translation within my REXX program and also the program's output. &nbsp; (Pardon my French, but that was a bugger to track down). &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 16:55, 10 December 2017 (UTC)
:I see. If you open a file encoded in UTF-8 in a editor that tries to interpret it as another codepage, you will get that kind of problem. For instance, "Déjà" is printed as "D├⌐j├á vu" in CP437 (a DOS codepage, that you seem to be using here), or "DéjÃ" in ISO-8859-1 (Latin-1). That's because UTF-8 encodes Unicode characters as multibyte sequences. It would be possible to read a UTF-8 as binary and do the translation "by hand", but there are programs able to do the translation for you. On Windows, the Notepad++ text editor can do this. [[User:Eoraptor|Eoraptor]] ([[User talk:Eoraptor|talk]]) 10:18, 11 December 2017 (UTC)
 
 
== Sort algorithms ==
 
BTW, I'm not sure I would list lexicographical sorting in with sorting algorithms. It isn't really an algorithm, it's an ordering. (It doesn't specify '''how''' to sort, only the '''order''' the items should end up in.) --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 11:25, 30 July 2018 (UTC)
 
: Yes, I agree. &nbsp; However, I didn't choose the template name, and if Rosetta Code users want to find other Rosetta Code tasks that deal with any flavor of &nbsp; ''sorting'', &nbsp; this was the best place to group all manner of sorting: &nbsp; algorithms, methods, ordering, order arranging, birds-of-a-feather, etc. &nbsp; You may have noticed that the REXX solution does use an algorithm &nbsp; (it is, in fact, a very slightly modified version of a (REXX's) bubble sort, with the comparison operator replaced with one that essentially uses a lexicographical comparison &nbsp; --- &nbsp; if I understand the meaning of &nbsp; ''algorithm''. &nbsp; Also, I had some misgivings of placing the Rosetta Code task &nbsp; '''sort three variables''' &nbsp; into that collection of '''sort algorithms'''. &nbsp; Perhaps some verbiage &nbsp; (by people in-the-know) &nbsp; could be added so that everybody knows that other non-algorithmic (?) methods may also be applicable/included within that sorting algorithms group/collection/thingy. &nbsp; I prefer a sort of loosey-goosey definition so that other types of sorting/ordering can be included in (or rather, won't be excluded from) &nbsp; that template of sorting algorithms. &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 20:50, 30 July 2018 (UTC)
 
:: Yeah, you're right, neither of those belong in the sorting algorithm template. They should instead be listed in [[http://rosettacode.org/wiki/Category:Sorting Category:Sorting]]. I'll remove them. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 13:55, 1 August 2018 (UTC)
 
::: It could be argued that '''bogo sort''' isn't an algorithmic sort as it doesn't specify how a shuffle is performed, and for that matter, what the shuffle does, nor how it performs the shuffle &nbsp; (that is, no algorithm is specified for the shuffle). &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 21:02, 1 August 2018 (UTC)
 
::: Will you be adding a template so that the list of tasks for '''Sorting''' will show up as did the '''Sorting algorithms'''? &nbsp; It took me quite a while to track down just where update the list (so that it shows on the task's preamble). &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 19:56, 1 August 2018 (UTC)
 
::: I was thinking about having such a list for tasks dealing with '''primes''' or some such suitably named category, perhaps another category for things dealing with '''factorization''' &nbsp; (both American and British spellings), &nbsp; perhaps even a combined list. &nbsp; I don't know enough about setting up such a thing. Once set up and one knows where to look, it's not that much work to add tasks to the category list. &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 19:56, 1 August 2018 (UTC)
 
::: Same thing about '''self-referential sequences''' &nbsp; (such as '''look-and-say sequences''', '''four is magic''', '''four is the number of letters in the ...''', and such). &nbsp; I'm not sure what the appropriate terminology is. &nbsp; Generally speaking, I use those category templates to help me find other similar tasks to assist me so I can write new solutions/entries. &nbsp; For some categories, this isn't a problem &nbsp; (for instance, sorting, as most sorting/ordering Rosetta Code tasks usually start with '''sort'''. &nbsp; Same thing with (programing) '''looping'''. &nbsp; But, '''four is magic''', not so much. &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 19:56, 1 August 2018 (UTC)
 
 
== Copy-paste error? ==
 
Hi, the output for the REXX entry for [[Bell_numbers#REXX|Bell numbers]] is missing Bell( 1). I'm pretty sure it is just a copy-paste error, but honestly, don't know enough REXX to verify it, so I'm hesitant to just "fix" it without knowing that it is fixed. Just a heads up. Cheers. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 12:33, 7 July 2019 (UTC)
 
: Yuppers. &nbsp; It was just that. &nbsp; Thanks for the heads up. &nbsp; I'm trying to figure out just how that happened, I can see how I might have missed the 1<sup>st</sup> line, but not the 2<sup>nd</sup>. &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 18:00, 7 July 2019 (UTC)
 
 
== Inability to add new sections to certain pages ==
 
I'm hoping you might be able to help resolve the following problem, e.g. by notifying whoever is maintaining RC:
 
There are two serious problems which together are preventing the editing of some pages.
 
(1) When attempting to edit a page such as Sequence:_smallest_number_with_exactly_n_divisors
one is typically confronted with a spurious message about the addition of new external
links, even if the only edit is the addition of a new header.
 
(2) The reCaptcha system does not work. On Firefox, for example,
after seeing the green checkmark in the "I'm not a robot" box, nothing happens
except eventually for a timeout message. On Google Chrome, the popup appears,
but then there's a timeout.
 
Thank you. [[User:Peak|Peak]] ([[User talk:Peak|talk]]) 19:10, 3 July 2021 (UTC)
 
: I also have the same problems. &nbsp; The '''(1)''' problem (above) is certainly annoying, &nbsp; and I just have to bear it and go through the monkey-works business of clicking on buses, fire hydrants, traffic lights, bicycles, crosswalks, chimneys, and occasionally, tractors or stairs. &nbsp; Even though I've been through all of those before, reCaptcha (Captcha) insists on presenting me with multiple screens (trials) and I have to then play that game. &nbsp; I haven't found rhyme nor reason for the superfluous trials. &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 20:06, 3 July 2021 (UTC)
 
: As for the reCaptcha system, as already mentioned above, &nbsp; I have found out that on a slow PC (the slowness most probably caused by insufficient real storage), &nbsp; that FireFox likes to use both of my engines (cores) such that on my old Windows system, the Microsoft Windows is trying to compete with FireFox's consumption of both (CPU) engines, &nbsp; such that I had to limit FireFox to a single engine (by using AFFINITY). &nbsp; One reason of the excessive use of the CPUs by a browser is the number of cookies, &nbsp; when the number of cookies is large, CPU consumption increases dramatically by a browser, making the browser to become &nbsp; ''non-responsive''. &nbsp; I usually just end up deleting a bunch of cookies and that clears things up. &nbsp; Other people have complained about reCaptcha on Rosetta Code's Village Pump (see the link below), &nbsp; but as far as I know, &nbsp; nothing has been done about it, &nbsp; or more to the point, &nbsp; I haven't read about anything being done about it. &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 20:06, 3 July 2021 (UTC)
 
: See: &nbsp; [https://rosettacode.org/wiki/Rosetta_Code:Village_Pump/CAPTCHA_problems Rosetta Code:Village Pump/CAPTCHA problems].
 
== pi &nbsp; musings ==
 
&nbsp;
 
: <big> <big> <math>\sqrt{-1}</math> &nbsp; &nbsp; 2<sup>3</sup> &nbsp; &nbsp; &Sigma; &nbsp; &nbsp; <big><math>\pi</math></big> &nbsp; &nbsp; &nbsp; &nbsp; ··· &nbsp; </big> and it was delicious.
 
 
 
: Too much &nbsp;<big><math>\pi</math></big>&nbsp; can give you a rounded circumference.
 
 
 
: An &nbsp;''opinion''&nbsp; without &nbsp;<big><math>\pi</math></big>&nbsp; is just an &nbsp;''onion''.
 
<br>
-----
<br>
 
-- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 06:09, 29 April 2020 (UTC)
10,327

edits