![]() ![]() The last post is someone saying, “Nevermind, I figured it out myself” without elaborating further. ![]() In particular, Ray’s favorite variable names were bool, class, new, and delete.ĩ) That’s it! When it fails to compile feel free to email me at the address I haven’t used since the Clinton administration and I’ll be happy to send you back curt replies admonishing you to RTFM.ġ0) Do a Google search and discover a three year old forum thread where a half dozen people all had the exact same problem you’re having now, which nobody ever answered. You may need to make a few hundred perfectly trivial edits to them to get a clean compile. He’s like that.Ĩ) RaymondSort files are written in ANSI C and a profane variant of Esperanto. Don’t be offended if he tries to goad you into a knife fight. (The password is “Bob-o sent me.” They only change the backroom password when a new version of Windows comes out, so this password will be good until Windows XP launches.)ħ) Ask Uncle Raymond for the source to RaymondSort. Yes, there are dozens of popular sorting systems out there but RaymondSort is proven to be 0.1% faster in single-threaded environments where the computer has less than 100MB of memory to work with.Ħ) Go to the back room of Uncle Raymonds Bar in Pineville, WV on a Wednesday night. He probably knows about this kind of stuff.Ĥ) Don’t do the previous step if your filesystem is case-sensitive.ĥ) You’ll need the source for the RaymondSort algorithm. Consult with an older programmer who is like a mentor to you. You may need to precede this with a period. For all other platforms, go through all the files and replace all the double backslashes in the header file paths with single pairs of reverse-backslashes. If you’d like to see the directions in English, you can get them at the following dead link.ģ) If you’re compiling on an IBM z800 then the source should be fine. This will explain how to arrange your project directories so that it will be able to find the needed files. iforget.)Ģ) Follow the directions in the readme.nfo, which is a text file with no line breaks. Now go and download a program to open the archive because they’re not using the archive format native to your operating system. The directions to compile someone else’s project go something like this:ġ) Download all the source code. The other solution is that you can throw the source files out there and let everyone compile it themselves, which requires little effort on your part and lots of effort on theirs. So if you don’t own a Mac then Mac users can’t use your stuff, thus limiting the reach of your work. And you can’t compile for a platform unless you have access to it. Linux? PC? Mac? 64 bit? 32 bit? It will be frustrating if a Linux developer shows up and you only have the PC version of your library available. The downside is that every platform will need its own library. This is a binary file that you can hand to just about anyone and it will (in theory) be fairly easy for them to plug it into their own program. When someone shares their solution with the world, they can do it in one of two ways: The first way is that they can compile their stuff into a library. Suddenly you’re performing some sort of archaeological data mining, looking for fragments of code written by a teenage Bjarne Stroustrup in 1965 and trying to translate his comments from the original Danish. It turns out the shortest-distance stuff incorporated someone else’s code, which was a program designed to differentiate between wombats and hamsters, which in turn used some guy’s 1988 C code to rate things according to how furry they are. You think you’re done, but when you try to use it you find out it depends on other files you don’t have. You go and grab a chunk of code for (say) calculating the shortest distance between any two wombats. Things get tricky when you have a solution that incorporates another solution which incorporates another, and so on. There’s no reason to do it yourself unless you see some flaw in the existing solution and you think you can do better. For example, if you need a really fast algorithm for sorting a big wad ‘o data, or generating high quality pseudo-random numbers, then you don’t need to knock yourself out. The language is 31 years old at this point, and odds are good that if there’s something you need your program to do, someone else has already come across the problem, solved it, and put the thing out there for people to use. One of the strengths of the language is the way that you can use libraries written by someone else. ![]() I loved doing it in my late 20’s and early 30’s, but over the past few years I’ve gotten fed up with this language and its cryptic aggravating bullshit.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |