Hi,
if I compare
⎕FIO['fopen'] with FIO∆fopen,
⎕FIO['fread'] with FIO∆fread,
⎕FIO['fclose'] with FIO∆fclose,
and so on,
then I would say that the FIO∆ variants are more readable
(and also faster) than
Hi,
I believe regular expressions would be a useful and reasonable
thing and I would
not object to making it a ⎕-function. I can provide the framework
for the ⎕-part of
it (class definition, parser etc) if somebody wants to fill in the
rest.
Hi,
a minor bug below:
+/(X,1)≠(1↑X),X←1 1 1 0 1 1 1 1 1 0 0 0 1 0 0 1 0 0 0 0
8
+/(X,1)≠(1↑X),X←1 1 1 0 1 1 1 1 1 0 0 0 1 0 0 1 0 0
0 1
8
Maybe you meant
+/(X,¯1↑X
No, actually not. The problem statement says that the final state of the
pancake stack should be that they are all facing up. Thus if the final
state is 0,there needs to be an extra flip done.
Regards,
Elias
On 23 Jun 2016 02:25, "Juergen Sauermann"
wrote:
> Hi,
>
> a minor bug below:
>
> *
)save
2016-06-23 00:09:01 (GMT-4) fio
df
fio ╔══╗
║fio ║
║'' ⎕fio ''║
╚══╝
errno ╔╗
║z←errno ║
║z←⎕fio[1] ''║
╚╝
getcwd ╔═╗
║z←getcwd ║
║z←⎕fio 30║
