) .. But atleast i thought i
would get something like
short-desc100/short-desc
short-desc344/short-desc
( I would have liked short-desc444/short-desc )
ANy help would be highly appreciated ..
Thanks
Dak.
--
John Snelson, Lead Engineerhttp://twitter.com/jpcs
MarkLogic Corporation
this function would be tremendous.
Thus, to accept node() as keys for maps, one need first to provide an
external ordering predicate for nodes, see point 3) above.
--
John Snelson, Lead Engineerhttp://twitter.com/jpcs
MarkLogic Corporation http
it. :-)
John
--
John Snelson, Lead Engineerhttp://twitter.com/jpcs
MarkLogic Corporation http://www.marklogic.com
___
talk@x-query.com
http://x-query.com/mailman/listinfo/talk
mailto:jeanmarc.merc...@gmail.com
Yes you're right, using fold should be strightfroward.
For the remove function, I'll try. Hopefully I won't spent too much
time :)
I'll keep you posted
2013/11/20 John Snelson john.snel...@marklogic.com
mailto:john.snel...@marklogic.com
.
-Mike
___
talk@x-query.com
http://x-query.com/mailman/listinfo/talk
--
John Snelson, Lead Engineerhttp://twitter.com/jpcs
MarkLogic Corporation http://www.marklogic.com
implementation only ever uses sequences of length 4,
which will therefore have a constant cost to create (in the size of the
red/black tree).
John
--
John Snelson, Lead Engineerhttp://twitter.com/jpcs
MarkLogic Corporation http://www.marklogic.com
-xquery30-FLWORExpr
I suspect this is just unimplemented in eXist.
John
--
John Snelson, Lead Engineerhttp://twitter.com/jpcs
MarkLogic Corporation http://www.marklogic.com
___
talk@x-query.com
http://x-query.com
/xquery-30/#id-content
John
--
John Snelson, Lead Engineerhttp://twitter.com/jpcs
MarkLogic Corporation http://www.marklogic.com
___
talk@x-query.com
http://x-query.com/mailman/listinfo/talk
section 2.4.2 where?
or was I supposed to have sussed that from seeing
*
Constructor expressions for various kinds of nodes
if I wasI guess it's my bad.
On Wed, Jan 8, 2014 at 4:29 PM, John Snelson john.snel...@marklogic.com
mailto:john.snel...@marklogic.com wrote:
On 08/01/14 16:25
one.
John
--
John Snelson, Lead Engineerhttp://twitter.com/jpcs
MarkLogic Corporation http://www.marklogic.com
___
talk@x-query.com
http://x-query.com/mailman/listinfo/talk
.
Similarly the CurlyArrayConstructor for a ? on it's Expr so it can be left
out. Thus you can also use array{} for an empty array.
John
--
John Snelson, Lead Engineerhttp://twitter.com/jpcs
MarkLogic Corporation http://www.marklogic.com
"[" beyond end of query
>
> whereas the pre-XQuery 3.1 approach:
>
> tokenize("1.2.3", "\.")[. < "3"]
>
> returns the results I'd expect:
>
>("1", "2")
>
> T
lt return $node
>>> })
>>> };
>>>
>>> The idea is that functions that do more than return their input
>>> could be based on the function, and benefit from tail call
>>> optimization.
>>>
>>> Kendall
>>>
>>>
>>>
skype: adam.retter
tweet: adamretter
http://www.adamretter.org.uk
___
talk@x-query.com<mailto:talk@x-query.com>
http://x-query.com/mailman/listinfo/talk
---
This email has been checked for viruses by AVG.
https://www.avg.com
___
talk@x-query.com<mailto:talk@x-query.com>
http://x-query.com/mailman/listinfo/talk
--
John Snelson, Principal Engineer http://twitter.com/jpcs
MarkLogic Corporation http://www.marklogic.com
___
talk@x-query.com
http://x-query.com/mailman/listinfo/talk
Ah - it's a precedence problem. Try putting the partial apply in parentheses:
function($k, $v) {
"$k=" || $k
} =>
(map:for-each(
map {
"a" : "1",
"b" : "2",
"c" : "3"
15 matches
Mail list logo