Examples of NodeFilter

com.gargoylesoftware.htmlunit.javascript.host.NodeFilter
org/TR/DOM-Level-2-Traversal-Range/traversal.html"> DOM-Level-2-Traversal-Range @version $Revision: 5301 $ @author Mike Dirolf
com.projity.grouping.core.transform.filtering.NodeFilter
com.sun.org.apache.xml.internal.security.signature.NodeFilter
An interface to tell to the c14n if a node is included or not in the output @author raul
jease.cmf.web.node.NodeFilter
Filters all Nodes which are not in the initial array of accepted Nodes.
net.sourceforge.jpowergraph.NodeFilter
org.apache.jackrabbit.mk.util.NodeFilter
A {@code NodeFilter} represents a filter on property and/or node names specifiedin JSON format. It allows to specify glob patterns for names of nodes and/or properties to be included or excluded.
Example:
```
 { "nodes": [ "foo*", "-foo1" ], "properties": [ "*", "-:childNodeCount" ] } 
```
@see NameFilter @see org.apache.jackrabbit.mk.api.MicroKernel#getNodes(String,String,int,long,int,String)
org.apache.xml.security.signature.NodeFilter
An interface to tell to the c14n if a node is included or not in the output @author raul
org.brixcms.web.tree.NodeFilter
org.dom4j.NodeFilter

NodeFilter defines the behavior for a filter or predicate which acts on a DOM4J Node. Instances can be generated from an {@link DocumentFactory}.
@author James Strachan @version $Revision: 1.7 $
org.gephi.filters.spi.NodeFilter
Basic filters for nodes, that works as predicates. For a given node the filter's role is to return true if the node is kept or false if it is removed. @author Mathieu Bastian
org.htmlparser.NodeFilter
Implement this interface to select particular nodes.
org.modeshape.jcr.cache.document.NodeCacheIterator.NodeFilter
org.openbel.framework.ws.model.NodeFilter
3.org/2001/XMLSchema}anyType"> <sequence> <element name="functionTypeCriteria" type="{http://belframework.org/ws/schemas}FunctionTypeFilterCriteria" maxOccurs="unbounded" minOccurs="0"/> <element name="functionReturnCriteria" type="{http://belframework.org/ws/schemas}FunctionReturnTypeFilterCriteria" maxOccurs="unbounded" minOccurs="0"/> </sequence> </restriction> </complexContent> </complexType>
org.w3c.dom.traversal.NodeFilter
Filters are objects that know how to "filter out" nodes. If a NodeIterator or TreeWalker is given a filter, it applies the filter before it returns the next node. If the filter says to accept the node, the iterator returns it; otherwise, the iterator looks for the next node and pretends that the node that was rejected was not there.
The DOM does not provide any filters. Filter is just an interface that users can implement to provide their own filters.
Filters do not need to know how to iterate, nor do they need to know anything about the data structure that is being iterated. This makes it very easy to write filters, since the only thing they have to know how to do is evaluate a single node. One filter may be used with a number of different kinds of iterators, encouraging code reuse. This is an ECMAScript function reference. This method returns ashort . The parameter is of type Node . @since DOM Level 2

Examples of org.apache.xml.security.signature.NodeFilter

        while (i.hasNext()) {
            Node currentNode = (Node) i.next();
            Iterator it = nodeFilters.iterator();
            boolean skipNode = false;
            while (it.hasNext() && !skipNode) {
                NodeFilter nf = (NodeFilter) it.next();
                if (nf.isNodeInclude(currentNode)!=1) {
                    skipNode = true;
                }
            }
            if (!skipNode) {
                nodeSet.add(currentNode);

View Full Code Here

Examples of org.apache.xml.security.signature.NodeFilter

        while (i.hasNext()) {
            Node currentNode = (Node) i.next();
            Iterator it = nodeFilters.iterator();
            boolean skipNode = false;
            while (it.hasNext() && !skipNode) {
                NodeFilter nf = (NodeFilter) it.next();
                if (nf.isNodeInclude(currentNode)!=1) {
                    skipNode = true;
                }
            }
            if (!skipNode) {
                nodeSet.add(currentNode);

View Full Code Here

Examples of org.apache.xml.security.signature.NodeFilter

        while (i.hasNext()) {
            Node currentNode = (Node) i.next();
            Iterator it = nodeFilters.iterator();
            boolean skipNode = false;
            while (it.hasNext() && !skipNode) {
                NodeFilter nf = (NodeFilter) it.next();
                if (nf.isNodeInclude(currentNode)!=1) {
                    skipNode = true;
                }
            }
            if (!skipNode) {
                nodeSet.add(currentNode);

View Full Code Here

Examples of org.apache.xml.security.signature.NodeFilter

        while (i.hasNext()) {
            Node currentNode = (Node) i.next();
            Iterator it = nodeFilters.iterator();
            boolean skipNode = false;
            while (it.hasNext() && !skipNode) {
                NodeFilter nf = (NodeFilter) it.next();
                if (nf.isNodeInclude(currentNode)!=1) {
                    skipNode = true;
                }
            }
            if (!skipNode) {
                nodeSet.add(currentNode);

View Full Code Here

Examples of org.apache.xml.security.signature.NodeFilter

        while (i.hasNext()) {
            Node currentNode = (Node) i.next();
            Iterator it = nodeFilters.iterator();
            boolean skipNode = false;
            while (it.hasNext() && !skipNode) {
                NodeFilter nf = (NodeFilter) it.next();
                if (nf.isNodeInclude(currentNode)!=1) {
                    skipNode = true;
                }
            }
            if (!skipNode) {
                nodeSet.add(currentNode);

View Full Code Here

Examples of org.apache.xml.security.signature.NodeFilter

        Set<Node> nodeSet = new LinkedHashSet<Node>();
        for (Node currentNode : inputSet) {
            Iterator<NodeFilter> it = nodeFilters.iterator();
            boolean skipNode = false;
            while (it.hasNext() && !skipNode) {
                NodeFilter nf = it.next();
                if (nf.isNodeInclude(currentNode) != 1) {
                    skipNode = true;
                }
            }
            if (!skipNode) {
                nodeSet.add(currentNode);

View Full Code Here

Examples of org.brixcms.web.tree.NodeFilter

        IModel<String> stringModel = adapter.forProperty("title");


        form.add(new TextField<String>("title", stringModel));


        String workspace = nodeModel.getObject().getSession().getWorkspace().getName();
        NodeFilter filter = new NodeTypeFilter(TemplateSiteNodePlugin.TYPE);


        IModel<BrixNode> model = adapter.forNodeProperty("template");


        form.add(new SiteNodePickerPanel("templatePicker", model, workspace, filter));

View Full Code Here

Examples of org.dom4j.NodeFilter

    }


    // Implementation methods
    // -------------------------------------------------------------------------
    protected void testXPath(String xpathExpression) {
        NodeFilter nodeFilter = DocumentHelper
                .createXPathFilter(xpathExpression);
        assertTrue("No NodeFilter object was created", nodeFilter != null);


        List list = document.selectNodes("//author");


        for (Iterator iter = list.iterator(); iter.hasNext();) {
            Node node = (Node) iter.next();


            if (nodeFilter.matches(node)) {
                log("Matches node: " + node.asXML());
            } else {
                log("No match for node: " + node.asXML());
            }
        }

View Full Code Here

Examples of org.gephi.filters.spi.NodeFilter

                    edgeFilters.add((EdgeFilter) f);
                }
            }
            if (nodeFilters.size() > 0) {
                for (Iterator<NodeFilter> itr = nodeFilters.iterator(); itr.hasNext();) {
                    NodeFilter nf = itr.next();
                    if (!nf.init(hgraph)) {
                        itr.remove();
                    }
                }
                List<Node> nodesToRemove = new ArrayList<Node>();
                for (Node n : hgraph.getNodes()) {
                    for (NodeFilter nf : nodeFilters) {
                        if (!nf.evaluate(hgraph, n)) {
                            nodesToRemove.add(n);
                            break;
                        }
                    }
                }


                for (Node n : nodesToRemove) {
                    hgraph.removeNode(n);
                }


                for (NodeFilter nf : nodeFilters) {
                    nf.finish();
                }
            }
            if (edgeFilters.size() > 0) {
                for (Iterator<EdgeFilter> itr = edgeFilters.iterator(); itr.hasNext();) {
                    EdgeFilter ef = itr.next();

View Full Code Here

Examples of org.gephi.filters.spi.NodeFilter

            if (filters.length > 1) {
                throw new IllegalArgumentException("Filter accepts a single filter in parameter");
            }
            HierarchicalGraph hgraph = (HierarchicalGraph) graph;
            if (filters[0] instanceof NodeFilter && ((NodeFilter) filters[0]).init(hgraph)) {
                NodeFilter filter = (NodeFilter) filters[0];
                GraphView hgraphView = hgraph.getView();
                for (Edge e : hgraph.getEdges().toArray()) {
                    Node source = e.getSource().getNodeData().getNode(hgraphView.getViewId());
                    Node target = e.getTarget().getNodeData().getNode(hgraphView.getViewId());
                    boolean remove = false;
                    switch (option) {
                        case SOURCE:
                            remove = !filter.evaluate(hgraph, source);
                            break;
                        case TARGET:
                            remove = !filter.evaluate(hgraph, target);
                            break;
                        case BOTH:
                            remove = !filter.evaluate(hgraph, source) || !filter.evaluate(hgraph, target);
                            break;
                        case ANY:
                            remove = !filter.evaluate(hgraph, source) && !filter.evaluate(hgraph, target);
                            break;
                    }
                    if (remove) {
                        hgraph.removeEdge(e);
                    }
                }
                filter.finish();
            }
            return hgraph;
        }

View Full Code Here

0 1 2 3 4 5

TOP

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.