Re: [basex-talk] Mistake in the docs?

[Christian Grün]

 I think an empty sequence is required as third parameter to fill the gap for
 paths parameter. Isn't it?
 If you agree I can fix it.

You're surely right. Thanks in advance for fixing it!
Christian

Re: [basex-talk] Execution problem

[Dirk Kirsten]

Hi Samby,

the query is behaving correctly. You have to escape  (with lt;) as it signals 
the beginning of an element. On the other hand you should escape  (with gt;), 
but it is not strictly required.

Cheers,
Dirk

On 07/02/2015 10:40 AM, IrisDeveloper development wrote:
 Hello,


 I am executing following query in basex 8.2

 let $a := aif a  0 {sum((1,2,3))}/a
 return $a

 o/p : aif a gt; 0 6/a

 but when I am executing

 let $a := aif a  0 {sum((1,2,3))}/a
 return $a

 it gives me a  error Expecting element name , '' found.

 Query works for '' but not with ''.


 Thanks
 Samby


-- 
Dirk Kirsten, BaseX GmbH, http://basexgmbh.de
|-- Firmensitz: Blarerstrasse 56, 78462 Konstanz
|-- Registergericht Freiburg, HRB: 708285, Geschäftsführer:
| Dr. Christian Grün, Dr. Alexander Holupirek, Michael Seiferle
`-- Phone: 0049 7531 28 28 676, Fax: 0049 7531 20 05 22

[basex-talk] Execution problem

[IrisDeveloper development]

Hello,


I am executing following query in basex 8.2

let $a := aif a  0 {sum((1,2,3))}/a
return $a

o/p : aif a gt; 0 6/a

but when I am executing

let $a := aif a  0 {sum((1,2,3))}/a
return $a

it gives me a  error Expecting element name , '' found.

Query works for '' but not with ''.


Thanks
Samby

[basex-talk] ft:mark

[Lars Johnsen]

The full text function ft:mark() puts a mark around each of the words that
occur in a match, starting from the first matching word to the last,
including stop words, except for punctuation characters. Is it possible to
check for the kind of characters (or strings) that ft:mark() will skip when
marking matches? Or, would it be possible to ask ft:mark() to put one
marker for the whole match?

The case I am using it for is to get the sequence of matching words within
a match, and sometimes, for long strings, there may be several sequences. A
contiguous sequence of marked elements maybe assumed to make up a match,
while non contiguous do not. One marker around the match solves the
problem, as would detecting characters that are never marked.

Regards
Lars G Johnsen
National Library of Norway