If I'm looking for places where a function is called, I will use Find Objects to search and then usually click on each function listed to see how the call is...
Does anyone have any experience with making connections between Dyalog (Windows or Linux versions) and external devices that use any of these protocols: SNMP,...
Hi Roger, Have no experience, but Google returns 10 pages of links for "SNMP OCX". Wouldn't know how to pick on, though :-) Morten ... From: roger_kumler...
David, If you are referring to a Windows bound "console application" (from the "export" item of the session menu) then both default output and []<- output are...
Thanks John, I knew it must be something so obvious that I hadn't tried it! ________________________________ From: John Daintree [mailto:johnd@...] ...
FAO: APL J and K lists. Several problems at this website are quite entertaining: http://mathschallenge.net/index.php?section=project The introduction says: ...
Forum: = is defined on namespaces so with namespaces A B C: A B C=A B C gives 1 1 1 and A=A B C gives 1 0 0 and if D<-A, then A=A B C D gives 1 0 0 1 in other...
Trouble is all your subject fns, <iota>, <without>, <element> are defined in terms of <match> not <equals> because they have to work on nested lists and...
Paul, the primitive <iota> _does_ work on namespaces, as long as you mix those up with some []ORs: OR1 NS2 NS3 <iota> OR3 NS2 OR1 4 2 1 Aesthetics of APL ;-) ...
My sense is that APL is a language in which equality should always be defined in terms of "data". I'm unhappy that match in Dyalog APL takes fill into account,...
I think we're Dyalog is free to define "match" anyway they want for namespaces. It hasn't been done yet and it's an open slate. What if we consider the idea...
This will work, but surely this definition is less "useful" than if APL actually compares whether the namespaces were indentical "in content"? If the primitive...
"What if we consider the idea that "match" works on just the pointers?" I was just getting ready to suggest the same thing. While Morten makes a good point...
"This will work, but surely this definition is less "useful" than if APL actually compares whether the namespaces were indentical "in content"?" Morten, I'm...
Hi Paul. Sorry, I did not mean to claim that the requirement to compare content occurs more frequently. I'm claiming that the comparison of content is "more...
Morten, Your point is well taken, it's certainly better to have more functionality, put perhaps it would be better to have some new quad function for deep...
I'm a bit surprised, I never thought of P<match>Q as meaning that I could substitute P for Q. Perhaps this is due to my background with SHARP APL, where empty...
Namespaces are already "different" than nested arrays. Look at assignment. Assignment assigns the pointer, and does not create a copy. (While assignment of...
Morten, ... I guess "substitute" was a poor choice of words. What I meant was if at any point A and B match, then I can do A<-B and resume and break no code....
Enter your vote today! A new poll has been created for the dyalogusers group: How should the match primitive be implemented for namepaces? o Content Match o...
dyalogusers@yahoogrou...
Dec 12, 2004 4:37 am
1276
Alex, I used to agree with your position, but now I kind of think there is no difference between a namespace and a reference. When refs first came out, all of...
I'd have to agree with Paul on this - I no longer think of "named" namespaces as different from a root-level ref to an "unnamed" namespace, and I have a fairly...
Good arguments about =, which is clearly working on the pointers. But on arrays, {lookup} (iota) and {membership} (epsilon) take a different view than =, which...
Paul, ... OK, I WAS being slow yesterday. Understand. True except for SHARP APL empties and SHARED VARIABLES (which are a kind of "object"). ... Not explaining...
... [... deleted ...] Joining the party late, but (siding, I think, with Morten to a degree) I wonder whether having APL programmers worry about pointers isn't...