Package net.sf.saxon.value

Examples of net.sf.saxon.value.ObjectValue

382
383
384
385
386
387
388
389
390
391
392
                        files = file.listFiles(filter);
                    }

                    ObjectValue[] fileValues = new ObjectValue[files.length];
                    for (int f=0; f<files.length; f++) {
                        fileValues[f] = new ObjectValue(files[f]);
                    }

                    FileExpander expander = new FileExpander(params, pipe);
                    return new MappingIterator(new ArrayIterator(fileValues), expander);
                } else {
View Full Code Here
478
479
480
481
482
483
484
     * @return the object, wrapped as an XdmAtomicValue
     */

    public XdmAtomicValue getExternalObject(Object object) {
        ExternalObjectType type = new ExternalObjectType(object.getClass(), processor.getUnderlyingConfiguration());
        return (XdmAtomicValue)XdmItem.wrap(new ObjectValue(object, type));
    }
View Full Code Here
71
72
73
74
75
76
77
        Value[] tuple = new Value[components.length];
        for (int i=0; i<components.length; i++) {
            //tuple[i] = components[i].evaluateItem(context);
            tuple[i] = ExpressionTool.eagerEvaluate(components[i], context);
        }
        return new ObjectValue(tuple);
    }
View Full Code Here
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
        count = 0;

        // initialise the array with data

        while (true) {
            ObjectValue tupleObject = (ObjectValue)base.next();
            if (tupleObject == null) {
                break;
            }
            Value[] tuple = (Value[])tupleObject.getObject();
            if (count==allocated) {
                allocated *= 2;
                Object[] nk2 = new Object[allocated * recordSize];
                System.arraycopy(nodeKeys, 0, nk2, 0, count * recordSize);
                nodeKeys = nk2;
            }
            int k = count*recordSize;
            nodeKeys[k] = new ObjectValue(tuple[0]);
                // this is the "item" that will be returned by the TupleIterator.
                // In general it is actually a sequence, so we wrap it in an ObjectValue
                // It subsequently gets unwrapped by the MappingFunction applied to the
                // output of the SortedTupleIterator.
            for (int n=1; n<=sortkeys.length; n++) {
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
100
            if (!(item instanceof ObjectValue)) {
                dynamicError(
                    "First argument to saxon:eval must be an expression prepared using saxon:expression", context);
                return null;
            }
            ObjectValue obj = (ObjectValue)item;
            Object v = obj.getObject();
            if (!(v instanceof PreparedExpression)) {
                dynamicError(
                    "First argument to saxon:eval must be an expression prepared using saxon:expression", context);
                return null;
            }
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
    public Item evaluateItem(XPathContext c) throws XPathException {
        PreparedExpression pexpr = prepareExpression(c);

        if (operation == EXPRESSION) {
            return new ObjectValue(pexpr);
        } else {
            for (int i=1; i<argument.length; i++) {
                pexpr.variables[i-1].setXPathValue(ExpressionTool.eagerEvaluate(argument[i],c));
            }
            XPathContextMajor c2 = c.newCleanContext();
View Full Code Here
158
159
160
161
162
163
164
165
166
167
168
    public SequenceIterator iterate(XPathContext c) throws XPathException {
        PreparedExpression pexpr = prepareExpression(c);

        if (operation == EXPRESSION) {
            return SingletonIterator.makeIterator(new ObjectValue(pexpr));
        } else {
            for (int i=1; i<argument.length; i++) {
                pexpr.variables[i-1].setXPathValue(ExpressionTool.eagerEvaluate(argument[i],c));
            }
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
     * into real items. This is done because each tuple may actually represent a sequence
     * of underlying values that share the same sort key.
     */

    public Object map(Item item, XPathContext context, Object info) throws XPathException {
        ObjectValue tuple = (ObjectValue)item;
        Object o = tuple.getObject();
        if (o == null) {
            return o;
        }
        if (o instanceof Item) {
            return o;
        }
        Value value = (Value)tuple.getObject();
        return value.iterate(context);
    }
View Full Code Here
132
133
134
135
136
137
138
139
                connection = DriverManager.getConnection(dbString, userString, pwdString);
            } catch (Exception ex) {
                dynamicError("JDBC Connection Failure: " + ex.getMessage(), context);
            }

            return new ObjectValue(connection);

        }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
        } else if (source instanceof BigDecimal) {
            result = new DecimalValue((BigDecimal)source);
        } else if (source instanceof String) {
            result = new StringValue(((String)source));
        } else {
            result = new ObjectValue(source);
        }

        return result;
    }
View Full Code Here
TOP

Related Classes of net.sf.saxon.value.ObjectValue

  • codeStatistics.xpathfunctions.AstTextExtensionFunction
  • codeStatistics.xpathfunctions.ObjValue
  • net.sf.saxon.Configuration
  • net.sf.saxon.expr.CardinalityChecker
  • net.sf.saxon.functions.Evaluate
  • net.sf.saxon.functions.StandardCollectionURIResolver
  • net.sf.saxon.functions.StandardCollectionURIResolver$FileExpander
  • net.sf.saxon.option.sql.SQLConnect$ConnectInstruction
  • net.sf.saxon.s9api.ItemTypeFactory
  • net.sf.saxon.sort.SortedTupleIterator
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.