Perhaps the formal meaning of flattening is to take all of the cells in order.
I am possibly using the term incorrectly, but referring to a process where
siblings interact with direct parent (placing brackets around a sibling group
for instance) as they unroll up into their parent node. I don'
On Wed, Sep 3, 2014 at 10:28 PM, 'Pascal Jasmin' via Programming
wrote:
> The difference between using L:1 and S:1 is that with L:1 the tree
> structure is kept. When used recursively, the tree gets rolled up
> from the bottom. If there is a relationship with the group of cells
> at a tree level
Thank you Bill,
It's good that the limit doesn't include the locale identifier.
I can shorten some of the code markers. Though 255 characters is a smaller
subset of anything than anything, it is still a useful subset. I demoed the
code to handle any size and shape data, but the most important
Nice work, Devon.
One of the things I would like to do eventually is a sort of "J for
Matlab/R programmers." I figure J is vastly more useful as a general
purpose language than these, but it is also first rate for all kinds of
numerics and mathematical applications. There is a large population
J implementation places an artificial limit on the lengths of
names. try
(255$'a')=.0
(256$'a')=.0
|limit error
| (256$'a')=.0
Ср, 03 сен 2014, jprogramming написал(а):
> strbracket =: {.@:[ , ] , {:@[
> joinB =: (1 : ' ((- # m)&}.@;@(,&m&.>"1))')(@: (] : ;))
> nums2name =: 'NUM' joi
Fair enough- I was just entering comments from my perspective-
Don Kelly
On 02/09/2014 8:14 PM, Devon McCormick wrote:
Not to be curt, but I put this page under my name because it's my own view
of the most basic parts of J.
Everyone is welcome to do the same. Please do so and feel free to inclu
The difference between using L:1 and S:1 is that with L:1 the tree structure is
kept. When used recursively, the tree gets rolled up from the bottom. If
there is a relationship with the group of cells at a tree level, it cannot be
expressed with S: .
in terms of access speed, I do have benchm
The NYCJUG regular monthly meeting will be held this coming Tuesday,
September 9th, 2014, downstairs in the Heartland Brewery in the Empire
State Building, 34th Street and Fifth Avenue, New York City.
Visit our sites at http://www.jsoftware.com/jwiki/NYCJUG and our Meetup at
http://www.meetup.com/
Hmm...
A few comments:
1] I like strbracket:
'()' strbracket 'abc'
(abc)
2] If by 'tree' you mean J boxed lists of boxed lists to arbitrary
depths, here's a simple flattener:
wrote:
> strbracket =: {.@:[ , ] , {:@[
> joinB =: (1 : ' ((- # m)&}.@;@(,&m&.>"1))')(@: (] : ;))
> nums2name =:
strbracket =: {.@:[ , ] , {:@[
joinB =: (1 : ' ((- # m)&}.@;@(,&m&.>"1))')(@: (] : ;))
nums2name =: 'NUM' joinB@:cut@:(('.';'F') rplc~ ('_';'n') rplc~ ":)^:(1 4 8 16
64 128 e.~ 3!:0)
boxsandnums2name =: [: (('B0X_',:'B0oX') strbracket '_' joinB )^:(32 = 3!:0 )
L:1 ^:_ ^:(1 text2name L:0 )@:b
(] : ;) will link arguments if called dyadically or return y if monad.
3 ] : ; 2;3
┌─┬─┬─┐
│3│2│3│
└─┴─┴─┘
(1;3) ] : ; 2;3
┌─┬─┬─┐
│┌─┬─┐│2│3│
││1│3││ │ │
│└─┴─┘│ │ │
└─┴─┴─┘
] : ; 2;3
┌─┬─┐
│2│3│
└─┴─┘
a typical way to turn some verbs (that operate on boxed args) fr
On Tue, Sep 2, 2014 at 2:49 PM, 'Pascal Jasmin' via Programming <
programm...@jsoftware.com> wrote:
> Thomas,
>
> An interesting alternative to getting O. to apply to $: in quicksort,
> would be to apply your parallelism adverb to $:, which btw I am very much
> looking forward to release.
>
> quic
12 matches
Mail list logo
