Examples of EdgeFilter

com.jhlabs.image.EdgeFilter
org.gephi.filters.spi.EdgeFilter
Basic filters for edges, that works as predicates. For a given edge the filter's role is to return true if the edge is kept or false if it is removed. @author Mathieu Bastian
org.openbel.framework.ws.model.EdgeFilter
3.org/2001/XMLSchema}anyType"> <sequence> <element name="relationshipCriteria" type="{http://belframework.org/ws/schemas}RelationshipTypeFilterCriteria" maxOccurs="unbounded"/> </sequence> </restriction> </complexContent> </complexType>

Examples of com.jhlabs.image.EdgeFilter

        model.addElement(new DisplayInfo<BufferedImageOp>(new DiffuseFilter()));
        model.addElement(new DisplayInfo<BufferedImageOp>(new DiffusionFilter()));
        model.addElement(new DisplayInfo<BufferedImageOp>(new DilateFilter()));
        model.addElement(new DisplayInfo<BufferedImageOp>(new DisplaceFilter()));
        model.addElement(new DisplayInfo<BufferedImageOp>(new DitherFilter()));
        model.addElement(new DisplayInfo<BufferedImageOp>(new EdgeFilter()));
        model.addElement(new DisplayInfo<BufferedImageOp>(new EmbossFilter()));
        model.addElement(new DisplayInfo<BufferedImageOp>(new EqualizeFilter()));
        model.addElement(new DisplayInfo<BufferedImageOp>(new ErodeFilter()));
        model.addElement(new DisplayInfo<BufferedImageOp>(new FlareFilter()));
        model.addElement(new DisplayInfo<BufferedImageOp>(new GainFilter()));

View Full Code Here

Examples of org.gephi.filters.spi.EdgeFilter

                    nf.finish();
                }
            }
            if (edgeFilters.size() > 0) {
                for (Iterator<EdgeFilter> itr = edgeFilters.iterator(); itr.hasNext();) {
                    EdgeFilter ef = itr.next();
                    if (!ef.init(hgraph)) {
                        itr.remove();
                    }
                }
                List<Edge> edgesToRemove = new ArrayList<Edge>();
                for (Edge e : hgraph.getEdges()) {
                    for (EdgeFilter ef : edgeFilters) {
                        if (!ef.evaluate(hgraph, e)) {
                            edgesToRemove.add(e);
                            break;
                        }
                    }
                }


                for (Edge e : edgesToRemove) {
                    hgraph.removeEdge(e);
                }


                for (EdgeFilter ef : edgeFilters) {
                    ef.finish();
                }
            }
            return hgraph;
        }

View Full Code Here

Examples of org.gephi.filters.spi.EdgeFilter

                throw new IllegalArgumentException("Not Filter accepts a single filter in parameter");
            }
            HierarchicalGraph hgraph = (HierarchicalGraph) graph;
            Filter filter = filters[0];
            if (filter instanceof EdgeFilter && ((EdgeFilter) filter).init(hgraph)) {
                EdgeFilter edgeFilter = (EdgeFilter) filter;
                for (Edge e : hgraph.getEdgesAndMetaEdges().toArray()) {
                    if (edgeFilter.evaluate(hgraph, e)) {
                        hgraph.removeEdge(e);
                    }
                }
                edgeFilter.finish();
            }


            return hgraph;
        }

View Full Code Here

Examples of org.gephi.filters.spi.EdgeFilter

                    nf.finish();
                }
            }
            if (edgeFilters.size() > 0) {
                for (Iterator<EdgeFilter> itr = edgeFilters.iterator(); itr.hasNext();) {
                    EdgeFilter ef = itr.next();
                    if (!ef.init(hgraph)) {
                        itr.remove();
                    }
                }
                List<Edge> edgesToRemove = new ArrayList<Edge>();
                for (Edge e : hgraph.getEdgesAndMetaEdges()) {
                    boolean remove = true;
                    for (EdgeFilter ef : edgeFilters) {
                        if (ef.evaluate(hgraph, e)) {
                            remove = false;
                        }
                    }
                    if (remove) {
                        edgesToRemove.add(e);
                    }
                }


                for (Edge e : edgesToRemove) {
                    hgraph.removeEdge(e);
                }
                for (EdgeFilter ef : edgeFilters) {
                    ef.finish();
                }
            }
            return hgraph;
        }

View Full Code Here

Examples of org.gephi.filters.spi.EdgeFilter

                    nf.finish();
                }
            }
            if (edgeFilters.size() > 0) {
                for (Iterator<EdgeFilter> itr = edgeFilters.iterator(); itr.hasNext();) {
                    EdgeFilter ef = itr.next();
                    if (!ef.init(hgraph)) {
                        itr.remove();
                    }
                }
                List<Edge> edgesToRemove = new ArrayList<Edge>();
                for (Edge e : hgraph.getEdgesAndMetaEdges()) {
                    boolean remove = true;
                    for (EdgeFilter ef : edgeFilters) {
                        if (ef.evaluate(hgraph, e)) {
                            remove = false;
                        }
                    }
                    if (remove) {
                        edgesToRemove.add(e);
                    }
                }


                for (Edge e : edgesToRemove) {
                    hgraph.removeEdge(e);
                }
                for (EdgeFilter ef : edgeFilters) {
                    ef.finish();
                }
            }
            return hgraph;
        }

View Full Code Here

Examples of org.gephi.filters.spi.EdgeFilter

                    nf.finish();
                }
            }
            if (edgeFilters.size() > 0) {
                for (Iterator<EdgeFilter> itr = edgeFilters.iterator(); itr.hasNext();) {
                    EdgeFilter ef = itr.next();
                    if (!ef.init(hgraph)) {
                        itr.remove();
                    }
                }
                List<Edge> edgesToRemove = new ArrayList<Edge>();
                for (Edge e : hgraph.getEdges()) {
                    for (EdgeFilter ef : edgeFilters) {
                        if (!ef.evaluate(hgraph, e)) {
                            edgesToRemove.add(e);
                            break;
                        }
                    }
                }


                for (Edge e : edgesToRemove) {
                    hgraph.removeEdge(e);
                }


                for (EdgeFilter ef : edgeFilters) {
                    ef.finish();
                }
            }
            return hgraph;
        }

View Full Code Here

Examples of org.gephi.filters.spi.EdgeFilter

                throw new IllegalArgumentException("Not Filter accepts a single filter in parameter");
            }
            HierarchicalGraph hgraph = (HierarchicalGraph) graph;
            Filter filter = filters[0];
            if (filter instanceof EdgeFilter && ((EdgeFilter) filter).init(hgraph)) {
                EdgeFilter edgeFilter = (EdgeFilter) filter;
                List<Edge> edgesToRemove = new ArrayList<Edge>();
                for (Edge e : hgraph.getEdgesAndMetaEdges().toArray()) {
                    if (edgeFilter.evaluate(hgraph, e)) {
                        edgesToRemove.add(e);
                    }
                }
                for (Edge e : edgesToRemove) {
                    hgraph.removeEdge(e);
                }
                edgeFilter.finish();
            }


            return hgraph;
        }

View Full Code Here

Examples of org.openbel.framework.ws.model.EdgeFilter

        KamHandle hndl = request.getHandle();
        if (hndl == null || hndl.getHandle() == null) {
            throw new RequestException(KAM_REQUEST_NO_HANDLE);
        }


        EdgeFilter filter = request.getFilter();
        if (filter == null) {
            throw new RequestException("Filter is missing.");
        }


        // Get the Dialect (may be null)

View Full Code Here

Examples of org.openbel.framework.ws.model.EdgeFilter

        assertThat(kamName, is(not(nullValue())));
        assertThat(r, is(not(nullValue())));


        final KamHandle handle = loadKam(kamName);


        EdgeFilter f = factory.createEdgeFilter();
        RelationshipTypeFilterCriteria c = factory
                .createRelationshipTypeFilterCriteria();
        c.getValueSet().add(r);
        f.getRelationshipCriteria().add(c);


        final FindKamEdgesRequest ereq = factory.createFindKamEdgesRequest();
        ereq.setFilter(f);
        ereq.setHandle(handle);
        FindKamEdgesResponse eres = webAPI.findKamEdges(ereq);

View Full Code Here

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.