> I am using recursion to process sibling nodes like
> lined-lists. This works pretty well until I run into
> documents that contains an untypically large node sets. I
> believe that this may be contributing to a stack overflow
> error that I am seeing:
>
> 2010-04-24 23:10:37.042 Notice: TaskSe
Hi Geert,
I've never explored using map:map for this purpose. I'm interested in
understanding how this can be used for building transforms. Can you provide
more details?
Note that I'm assuming that the stack overflow is related to recursion, but
I'm not absolutely sure as stack overflows
Or perhaps using the ::sibling XPath operator to select your dataset and then
processing the dataset with a FLOWR statement?
Keith L. Breinholt
breinhol...@ldschurch.org
-Original Message-
From: general-boun...@developer.marklogic.com
[mailto:general-boun...@developer.marklogic.com] On
Hi Tim,
Not sure, never seen such setting myself. But even if you could, you would
always have the risk of hitting the limit again some time. Have you thought of
strategies that do not require a linked-list? Can't a map:map be of any help
here?
Kind regards,
Geert
>
drs. G.P.H. (Geert) Jost
