Package org.apache.commons.jxpath.ri.model

Examples of org.apache.commons.jxpath.ri.model.NodePointer.clone()

108
109
110
111
112
113
114
115
116
117
118
    public boolean nextNode(){
        while (nextIgnoreDuplicates()){
            NodePointer location = getCurrentNodePointer();
            if (!visitedNodes.contains(location)){
                visitedNodes.add(location.clone());
                position++;
                return true;
            }
        }
        return false;
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
    public boolean nextNode(){
        while (nextIgnoreDuplicates()){
            NodePointer location = getCurrentNodePointer();
            if (!visitedNodes.contains(location)){
                visitedNodes.add(location.clone());
                position++;
                return true;
            }
        }
        return false;
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
            EvalContext ctx = (EvalContext)contexts[i];
            while (ctx.nextSet()){
                while (ctx.nextNode()){
                    NodePointer ptr = ctx.getCurrentNodePointer();
                    if (!set.contains(ptr)){
                        ptr = (NodePointer)ptr.clone();
                        list.add(ptr);
                        set.add(ptr);
                    }
                }
            }
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
    public InitialContext(EvalContext parentContext){
        super(parentContext);
        NodePointer ptr = parentContext.getCurrentNodePointer();
        if (ptr != null){
            nodePointer = (NodePointer)ptr.clone();
            collection = (nodePointer.getIndex() == NodePointer.WHOLE_COLLECTION);
        }
    }

    public Pointer getSingleNodePointer(){
View Full Code Here
203
204
205
206
207
208
209
210
211
212
213
        else if (childPointer.isCollection()) {
            // Iterate over all values and
            // execute remaining steps for each node,
            // looking for the best quality match
            int bestQuality = 0;
            childPointer = (NodePointer) childPointer.clone();
            NodePointer bestMatch = null;
            int count = childPointer.getLength();
            for (int i = 0; i < count; i++) {
                childPointer.setIndex(i);
                NodePointer pointer =
View Full Code Here
216
217
218
219
220
221
222
223
224
225
226
                if (quality == PERFECT_MATCH) {
                    return pointer;
                }
                else if (quality > bestQuality) {
                    bestQuality = quality;
                    bestMatch = (NodePointer) pointer.clone();
                }
            }
            if (bestMatch != null) {
                return bestMatch;
            }
View Full Code Here
267
268
269
270
271
272
273
274
275
276
277
                if (quality == PERFECT_MATCH) {
                    return pointer;
                }
                else if (quality > bestQuality) {
                    bestQuality = quality;
                    bestMatch = (NodePointer) pointer.clone();
                }
            }
        }

        if (bestMatch != null) {
View Full Code Here
515
516
517
518
519
520
521
522
523
524
525
                    int quality = computeQuality(pointer);
                    if (quality == PERFECT_MATCH) {
                        return pointer;
                    }
                    if (quality > bestQuality) {
                        bestMatch = (NodePointer) pointer.clone();
                        bestQuality = quality;
                    }
                }
            }
            if (bestMatch != null) {
View Full Code Here
624
625
626
627
628
629
630
631
632
633
634
    {
        Expression predicate = predicates[currentPredicate];
        int index = indexFromPredicate(context, predicate);
        NodePointer pointer = parent;
        if (isCollectionElement(pointer, index)) {
            pointer = (NodePointer) pointer.clone();
            pointer.setIndex(index);
            return doPredicate(
                context,
                pointer,
                steps,
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.