Since d. /D. are being retired (for derivative usage), why not use them for an
inbuilt dictionary type?
I think J would be better with some kind of hashmap / dictionary (O(1) lookup
time), and d./D. already match
the first letter of "dictionary", so it's the perfect fit.
On Monday, November
key/value dictionary can be done in addon, but I think better
implemented in C for efficieny because it contains loops.
Sun, 17 Nov 2019, Henry Rich написал(а):
> In J I find myself coming back to simple arrays for most data structures.
>
> Trees can be represented as boxes containing subtrees.
Yes, but I want something lean and fast, not dealing with file-size
chunks. Example: a German-English dictionary. I give it a German word,
it gives me back the English. It can be continually updated.
Henry Rich
On 11/17/2019 10:02 PM, 'Jim Russell' via Programming wrote:
AFAIR, wasn't that
AFAIR, wasn't that a feature built into the (lib 1) component files addon? I
don't recall using a separate dictionary function.
> On Nov 17, 2019, at 9:49 PM, Henry Rich wrote:
>
> The datatype I really want is a directory object that acts as an efficient
> and easy-to-use associative memory.
Thanks for all the answers so far.
What prompted my questioning is the Advent of Code problem mentioned by
R.E.Boss in september :
http://www.jsoftware.com/pipermail/programming/2019-September/053995.html
I tried a simple approach splitting huge arrays in two to insert data and
it took forever to
In J I find myself coming back to simple arrays for most data structures.
Trees can be represented as boxes containing subtrees. That works, but
is usually more trouble than simply managing an array.
Linked lists are used only for efficiency, and in the cases where that
matters you can easil
I failed to communicate the links before, but here they are. Ordinal fractions
are somewhat like infinite-dimensional arrays.
https://www.academia.edu/10031088/ORDINAL_FRACTIONS_-_the_algebra_of_data
http://www.statemaster.com/encyclopedia/Ordinal-fraction
Bo.
Den søndag den 17. november 2
Trees are simple to implement in J -
https://code.jsoftware.com/wiki/User:Devon_McCormick/Trees - as are graphs
-
https://code.jsoftware.com/wiki/NYCJUG/2009-11-10/BreadthFirstGraphTraversal
.
A stack is simple to implement too but I'm not sure why you would want to
as it's simply a vector with ve
901-beta-q is available.
This fixes a few bugs found in previous betas.
This is probably the last beta, so please pile on to try to find bugs
before they slip into the release.
The release will be before the end of the month.
--
ORDINAL FRACTIONS - the algebra of data
|
|
|
| | |
|
|
|
| |
ORDINAL FRACTIONS - the algebra of data
This paper was submitted to the 10th World Computer Congress, IFIP 1986
conference, but rejected by the referee
|
|
|
Den søndag den 17. november 2019 07.12.02 CE
10 matches
Mail list logo
