Talk:Singly-linked list/Traversal

J implementation

The J implementation presented here is useless, from a J programmer's point of view, since it does not construct a meaningful result and because J programmers already have better tools.

In other words:

• The task set here does not specify a meaningful result.
• I can imagine several different kinds of meaningful results which would fit this task.
• The underlying concept (a singly linked list) is really a language-specific optimization of a more general concept (sequences) which is, at best, irrelevant for J.

From the point of view of a programmer in another language, this might seem silly -- if you can not efficiently update a singly linked list, how can you scale up and deal with a lot of updates? However, a J programmer might treat a large collection of updates as a collection (all updates which need to be dealt with in this unit of time), and apply them all simultaneously. Here, you would need to architect your program differently than you would for doing lots of updates independently -- and a singly linked list is probably the wrong data structure for that task.

Rdm 12:52, 1 September 2009 (UTC)