World: r3wp
[!REBOL3]
older newer | first last |
BrianH 22-Feb-2011 [7521] | It seems to extend to all other types as well. It looks intentional. |
Henrik 26-Feb-2011 [7522] | Carl asks: this week tried building libr3.so on PPC ... but there is a problem, the compiler is too old. I tried updating gcc, but all the apt-get links are too old, and it failed. I'm looking for a ppc compiler >= 3.4, if you know where one is archived. |
Andreas 26-Feb-2011 [7523x2] | osx ppc? |
apt-get sounds more like linux ppc. | |
Henrik 26-Feb-2011 [7525] | I'll try to see if Carl can come in here to solve the issue. |
Andreas 26-Feb-2011 [7526x4] | tell him to fix his apt sources list to use archive.debian.org urls |
that'll get his "apt-get links" working again | |
if there's any chance to get at a (i assume gcc) compiler >= 3.4 depends on how old a distro he is using | |
(-> moving to Linux) | |
BrianH 26-Feb-2011 [7530] | He got it working on Gentoo. |
Sunanda 27-Feb-2011 [7531] | This may just be a variant of CC#1506.....But why does this throw an error: do [print 222 break] 222 ** Throw error: no loop to break While this does not? also true do [print 222 break] 222 == true |
BrianH 27-Feb-2011 [7532x3] | That's http://issue.cc/r3/1509 |
It is definitely not #1506, though the behavior of the first example was complained about in that ticket. | |
The behavior in the first example is arguably correct, but let's not rehash that argument. See #1506 for details. | |
Gregg 27-Feb-2011 [7535] | As Andreas said in another group, /wait works with CALL under Windows, but there is no /output refinement yet. I believe RT is hoping for outside help on CALL for R3 due to its complexity under R2. I don't know if there's a bounty for it or not. |
Pekr 27-Feb-2011 [7536] | there were some bounties for some R3 related stuff, but I don't remember if it was for CALL, most probably not ... |
GrahamC 27-Feb-2011 [7537x2] | No bounties offered by RT though |
Carl did offer to provide the ODBC sources but that has not happened either | |
Dockimbel 27-Feb-2011 [7539] | You have a R2 implementation of CALL for Windows here: http://code.google.com/p/cheyenne-server/source/browse/trunk/Cheyenne/misc/call.r Shouldn't be difficult to port it to C and extend the existing R3's CALL implementation to support /output, /input and /error. |
BrianH 27-Feb-2011 [7540] | Too bad about /wait not being optional there. Is that a solvable problem? |
Dockimbel 27-Feb-2011 [7541x2] | This is the non-blocking version: http://softinnov.org/rebol/acall.shtml |
The issue with this async CALL is that it's not possible to make user events in R2's event loop, so it's relying on a dirty port hack and a bit of busy looping IIRC. | |
BrianH 27-Feb-2011 [7543x2] | I was thinking of fire and forget, but that was my next question. |
Async call, and async in general, is a lot easier in R3. I would be quite interested in an async call port in R3, particularly when we start to get port plumbing. | |
Andreas 27-Feb-2011 [7545x3] | From a quick glance at Cheyene's call.r, enabling /wait should be rather simple: don't enter the final UNTIL loop unless WAIT (or OUTPUT, or ERROR) is set. |
I think you could also get rid of the until loop completely, by using WaitForSingleObject to wait for process termination. Which is exactly how the current win32 hostkit does it, btw. | |
but then, you probably couldn't in cheyenne, as it will block everything else. | |
Dockimbel 27-Feb-2011 [7548] | In fact, this blocking mezz-level CALL is used in worker process where it's allowed to wait. Right, WaitForSingleObject is the correct way, this CALL was just a quick adaptation of my async version for Cheyenne (I needed to pass environments variables to a child process for CGI support), but I think I'll drop it in next Cheyenne revisions and use a different approach. |
Robking 28-Feb-2011 [7549] | I had a question regarding event handling in REBOL 2. Please let me know the appropriate forum for that sort of question. :) |
BrianH 28-Feb-2011 [7550] | Try Core or View. |
Andreas 28-Feb-2011 [7551] | Or "Rebol School" :) |
Robking 28-Feb-2011 [7552] | Thanks, sorry. Works for me. :) |
Andreas 28-Feb-2011 [7553x4] | Me: "What makes CASE/all different from a long sequence of IFs?" Brian: "Maintainability of code." That's probably an effect of CASE/all enforcing a strict sequence of IFs, i.e. without other (unconditional) code blocks in between those IFs. |
But this is probably only a matter of discipline, as one can easily smuggle uncoditional code into CASE/all too (by using #[true] as condition). | |
At which point, all that's left with CASE/all is one additional level of indentation. | |
And maybe a more efficient evaluation in case of R3. | |
BrianH 28-Feb-2011 [7557x3] | Yes to both of those. With the old LOAD, noone other than me could add features because the old control flow was too complex. With the new LOAD and LOAD-HEADER, features were easy to add. |
The most efficient way to add non-conditional code is to put the code in the conditional clause and have none for the associated code block. There are several lines like that in LOAD-HEADER. | |
And it is definitely more efficient evaluation in R3, and R2 as well. | |
Ladislav 1-Mar-2011 [7560] | What makes CASE/all different from a long sequence of IFs? - as far as I am concerned, I simply don't use, and never used CASE/ALL |
Rebolek 1-Mar-2011 [7561] | You should try it, it's not bad. |
Ladislav 1-Mar-2011 [7562x2] | Do not have any code where it would be of any advantage |
As far as the maintainability of the code goes, it shall be noted, that CASE/ALL is one of the worst constructs to test. | |
Henrik 1-Mar-2011 [7564] | I have two CASE/ALLs in NLPP (Ladislav knows what NLPP is). :-) |
Ladislav 1-Mar-2011 [7565] | http://www.saphirion.com/downloads/files/saphirion_nlpp.pdf |
Henrik 1-Mar-2011 [7566] | Nevertheless, the code could be replaced, if needed, but it looks to be working ok with CASE/ALL. |
BrianH 1-Mar-2011 [7567x3] | I've never had a problem with CASE itself, /all or not. If it is tough to test I've never seen it. |
There are a few functions in R3 that take the form of a CASE/all followed by a CASE. SAVE is one such function, though it has a series of IF statements at its beginning leftover from before that could be made more efficient by adding to the beginning of the CASE/all. | |
CASE/all is no more difficult to test than the series of IF statements it replaces. Easier to analyze, because it's more structured. | |
Ladislav 1-Mar-2011 [7570] | CASE/all is no more difficult to test than the series of IF statements it replaces. - yes, sure that is true |
older newer | first last |