lux.functions
Class Highlight
java.lang.Object
net.sf.saxon.lib.ExtensionFunctionDefinition
lux.functions.Highlight
- All Implemented Interfaces:
- Serializable
public class Highlight
- extends net.sf.saxon.lib.ExtensionFunctionDefinition
lux:highlight($node as node()?, $query as item(), $tag as item())
lux:highlight($node as node()?, $query as item())
returns
the given node with text matching the query surrounded by the given $tag (or B if no tag is given).
The query may be a string or an element/document of the same types supported by lux:search.
The tag may be specified as either a QName or a string; if a string, an element
is created with no namespace.
- See Also:
Search,
Serialized Form
| Methods inherited from class net.sf.saxon.lib.ExtensionFunctionDefinition |
dependsOnFocus, hasSideEffects, trustResultType |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Highlight
public Highlight()
getArgumentTypes
public net.sf.saxon.value.SequenceType[] getArgumentTypes()
- Specified by:
getArgumentTypes in class net.sf.saxon.lib.ExtensionFunctionDefinition
getFunctionQName
public net.sf.saxon.om.StructuredQName getFunctionQName()
- Specified by:
getFunctionQName in class net.sf.saxon.lib.ExtensionFunctionDefinition
getResultType
public net.sf.saxon.value.SequenceType getResultType(net.sf.saxon.value.SequenceType[] suppliedArgumentTypes)
- Specified by:
getResultType in class net.sf.saxon.lib.ExtensionFunctionDefinition
makeCallExpression
public net.sf.saxon.lib.ExtensionFunctionCall makeCallExpression()
- Specified by:
makeCallExpression in class net.sf.saxon.lib.ExtensionFunctionDefinition
getMinimumNumberOfArguments
public int getMinimumNumberOfArguments()
- Overrides:
getMinimumNumberOfArguments in class net.sf.saxon.lib.ExtensionFunctionDefinition
getMaximumNumberOfArguments
public int getMaximumNumberOfArguments()
- Overrides:
getMaximumNumberOfArguments in class net.sf.saxon.lib.ExtensionFunctionDefinition
Copyright © 2013. All Rights Reserved.