255 lines
5.5 KiB
Go
255 lines
5.5 KiB
Go
|
package xpath
|
||
|
|
||
|
import (
|
||
|
"errors"
|
||
|
"strconv"
|
||
|
"strings"
|
||
|
)
|
||
|
|
||
|
// The XPath function list.
|
||
|
|
||
|
func predicate(q query) func(NodeNavigator) bool {
|
||
|
type Predicater interface {
|
||
|
Test(NodeNavigator) bool
|
||
|
}
|
||
|
if p, ok := q.(Predicater); ok {
|
||
|
return p.Test
|
||
|
}
|
||
|
return func(NodeNavigator) bool { return true }
|
||
|
}
|
||
|
|
||
|
// positionFunc is a XPath Node Set functions position().
|
||
|
func positionFunc(q query, t iterator) interface{} {
|
||
|
var (
|
||
|
count = 1
|
||
|
node = t.Current()
|
||
|
)
|
||
|
test := predicate(q)
|
||
|
for node.MoveToPrevious() {
|
||
|
if test(node) {
|
||
|
count++
|
||
|
}
|
||
|
}
|
||
|
return float64(count)
|
||
|
}
|
||
|
|
||
|
// lastFunc is a XPath Node Set functions last().
|
||
|
func lastFunc(q query, t iterator) interface{} {
|
||
|
var (
|
||
|
count = 0
|
||
|
node = t.Current()
|
||
|
)
|
||
|
node.MoveToFirst()
|
||
|
test := predicate(q)
|
||
|
for {
|
||
|
if test(node) {
|
||
|
count++
|
||
|
}
|
||
|
if !node.MoveToNext() {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
return float64(count)
|
||
|
}
|
||
|
|
||
|
// countFunc is a XPath Node Set functions count(node-set).
|
||
|
func countFunc(q query, t iterator) interface{} {
|
||
|
var count = 0
|
||
|
test := predicate(q)
|
||
|
switch typ := q.Evaluate(t).(type) {
|
||
|
case query:
|
||
|
for node := typ.Select(t); node != nil; node = typ.Select(t) {
|
||
|
if test(node) {
|
||
|
count++
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
return float64(count)
|
||
|
}
|
||
|
|
||
|
// sumFunc is a XPath Node Set functions sum(node-set).
|
||
|
func sumFunc(q query, t iterator) interface{} {
|
||
|
var sum float64
|
||
|
switch typ := q.Evaluate(t).(type) {
|
||
|
case query:
|
||
|
for node := typ.Select(t); node != nil; node = typ.Select(t) {
|
||
|
if v, err := strconv.ParseFloat(node.Value(), 64); err == nil {
|
||
|
sum += v
|
||
|
}
|
||
|
}
|
||
|
case float64:
|
||
|
sum = typ
|
||
|
case string:
|
||
|
if v, err := strconv.ParseFloat(typ, 64); err != nil {
|
||
|
sum = v
|
||
|
}
|
||
|
}
|
||
|
return sum
|
||
|
}
|
||
|
|
||
|
// nameFunc is a XPath functions name([node-set]).
|
||
|
func nameFunc(q query, t iterator) interface{} {
|
||
|
return t.Current().LocalName()
|
||
|
}
|
||
|
|
||
|
// startwithFunc is a XPath functions starts-with(string, string).
|
||
|
func startwithFunc(arg1, arg2 query) func(query, iterator) interface{} {
|
||
|
return func(q query, t iterator) interface{} {
|
||
|
var (
|
||
|
m, n string
|
||
|
ok bool
|
||
|
)
|
||
|
switch typ := arg1.Evaluate(t).(type) {
|
||
|
case string:
|
||
|
m = typ
|
||
|
case query:
|
||
|
node := typ.Select(t)
|
||
|
if node == nil {
|
||
|
return false
|
||
|
}
|
||
|
m = node.Value()
|
||
|
default:
|
||
|
panic(errors.New("starts-with() function argument type must be string"))
|
||
|
}
|
||
|
n, ok = arg2.Evaluate(t).(string)
|
||
|
if !ok {
|
||
|
panic(errors.New("starts-with() function argument type must be string"))
|
||
|
}
|
||
|
return strings.HasPrefix(m, n)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// containsFunc is a XPath functions contains(string or @attr, string).
|
||
|
func containsFunc(arg1, arg2 query) func(query, iterator) interface{} {
|
||
|
return func(q query, t iterator) interface{} {
|
||
|
var (
|
||
|
m, n string
|
||
|
ok bool
|
||
|
)
|
||
|
|
||
|
switch typ := arg1.Evaluate(t).(type) {
|
||
|
case string:
|
||
|
m = typ
|
||
|
case query:
|
||
|
node := typ.Select(t)
|
||
|
if node == nil {
|
||
|
return false
|
||
|
}
|
||
|
m = node.Value()
|
||
|
default:
|
||
|
panic(errors.New("contains() function argument type must be string"))
|
||
|
}
|
||
|
|
||
|
n, ok = arg2.Evaluate(t).(string)
|
||
|
if !ok {
|
||
|
panic(errors.New("contains() function argument type must be string"))
|
||
|
}
|
||
|
|
||
|
return strings.Contains(m, n)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// normalizespaceFunc is XPath functions normalize-space(string?)
|
||
|
func normalizespaceFunc(q query, t iterator) interface{} {
|
||
|
var m string
|
||
|
switch typ := q.Evaluate(t).(type) {
|
||
|
case string:
|
||
|
m = typ
|
||
|
case query:
|
||
|
node := typ.Select(t)
|
||
|
if node == nil {
|
||
|
return false
|
||
|
}
|
||
|
m = node.Value()
|
||
|
}
|
||
|
return strings.TrimSpace(m)
|
||
|
}
|
||
|
|
||
|
// substringFunc is XPath functions substring function returns a part of a given string.
|
||
|
func substringFunc(arg1, arg2, arg3 query) func(query, iterator) interface{} {
|
||
|
return func(q query, t iterator) interface{} {
|
||
|
var m string
|
||
|
switch typ := arg1.Evaluate(t).(type) {
|
||
|
case string:
|
||
|
m = typ
|
||
|
case query:
|
||
|
node := typ.Select(t)
|
||
|
if node == nil {
|
||
|
return false
|
||
|
}
|
||
|
m = node.Value()
|
||
|
}
|
||
|
|
||
|
var start, length float64
|
||
|
var ok bool
|
||
|
|
||
|
if start, ok = arg2.Evaluate(t).(float64); !ok {
|
||
|
panic(errors.New("substring() function first argument type must be int"))
|
||
|
}
|
||
|
if arg3 != nil {
|
||
|
if length, ok = arg3.Evaluate(t).(float64); !ok {
|
||
|
panic(errors.New("substring() function second argument type must be int"))
|
||
|
}
|
||
|
}
|
||
|
if (len(m) - int(start)) < int(length) {
|
||
|
panic(errors.New("substring() function start and length argument out of range"))
|
||
|
}
|
||
|
if length > 0 {
|
||
|
return m[int(start):int(length+start)]
|
||
|
}
|
||
|
return m[int(start):]
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// stringLengthFunc is XPATH string-length( [string] ) function that returns a number
|
||
|
// equal to the number of characters in a given string.
|
||
|
func stringLengthFunc(arg1 query) func(query, iterator) interface{} {
|
||
|
return func(q query, t iterator) interface{} {
|
||
|
switch v := arg1.Evaluate(t).(type) {
|
||
|
case string:
|
||
|
return float64(len(v))
|
||
|
case query:
|
||
|
node := v.Select(t)
|
||
|
if node == nil {
|
||
|
break
|
||
|
}
|
||
|
return float64(len(node.Value()))
|
||
|
}
|
||
|
return float64(0)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// notFunc is XPATH functions not(expression) function operation.
|
||
|
func notFunc(q query, t iterator) interface{} {
|
||
|
switch v := q.Evaluate(t).(type) {
|
||
|
case bool:
|
||
|
return !v
|
||
|
case query:
|
||
|
node := v.Select(t)
|
||
|
return node == nil
|
||
|
default:
|
||
|
return false
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// concatFunc is the concat function concatenates two or more
|
||
|
// strings and returns the resulting string.
|
||
|
// concat( string1 , string2 [, stringn]* )
|
||
|
func concatFunc(args ...query) func(query, iterator) interface{} {
|
||
|
return func(q query, t iterator) interface{} {
|
||
|
var a []string
|
||
|
for _, v := range args {
|
||
|
switch v := v.Evaluate(t).(type) {
|
||
|
case string:
|
||
|
a = append(a, v)
|
||
|
case query:
|
||
|
node := v.Select(t)
|
||
|
if node != nil {
|
||
|
a = append(a, node.Value())
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
return strings.Join(a, "")
|
||
|
}
|
||
|
}
|