Package org.apache.ivy.core.resolve

Examples of org.apache.ivy.core.resolve.IvyNode


            List dependencies = new ArrayList(report.getDependencies());
            Collections.sort(dependencies);
            if (dependencies.size() > 0) {
                String[] confs = report.getConfigurations();
                for (int i = 0; i < dependencies.size(); i++) {
                    IvyNode node = (IvyNode) dependencies.get(i);
                    if (node.isCompletelyEvicted()) {
                        continue;
                    }
                    List nodeConfs = new ArrayList(confs.length);
                    for (int j = 0; j < confs.length; j++) {
                        String conf = confs[j];
                        if (report.getConfigurationReport(conf).getModuleRevisionIds().contains(
                            node.getResolvedId())) {
                            nodeConfs.add(conf);
                        }
                    }
                    Message
                            .info("\t" + node + " from "
                                    + node.getModuleRevision().getResolver().getName() + " in "
                                    + nodeConfs);
                }
            }
        }
View Full Code Here


                saxHandler.startDocument();
                saxHandler.startElement(null, "modules", "modules", new AttributesImpl());

                for (int i = 0; i < dependencies.length; i++) {
                    IvyNode dependency = dependencies[i];
                    if (dependency.getModuleRevision() == null
                            || dependency.isCompletelyEvicted()) {
                        continue;
                    }

                    startModule(saxHandler, dependency);

                    Set artifactsOfModuleRev = (Set) moduleRevToArtifactsMap.get(dependency
                            .getModuleRevision().getId());
                    if (artifactsOfModuleRev != null) {
                        for (Iterator iter = artifactsOfModuleRev.iterator(); iter.hasNext();) {
                            Artifact artifact = (Artifact) iter.next();
View Full Code Here

    public Collection resolveConflicts(IvyNode parent, Collection conflicts) {
        if (conflicts.size() < 2) {
            return conflicts;
        }
        for (Iterator iter = conflicts.iterator(); iter.hasNext();) {
            IvyNode node = (IvyNode) iter.next();
            DependencyDescriptor dd = node.getDependencyDescriptor(parent);
            if (dd != null && dd.isForce()
                    && parent.getResolvedId().equals(dd.getParentRevisionId())) {
                return Collections.singleton(node);
            }
        }
View Full Code Here

    }

    private ArtifactInfo[] toArtifactInfo(Collection conflicts) {
        List artifacts = new ArrayList(conflicts.size());
        for (Iterator iter = conflicts.iterator(); iter.hasNext();) {
            IvyNode node = (IvyNode) iter.next();
            artifacts.add(new IvyNodeArtifactInfo(node));
        }
        return (ArtifactInfo[]) artifacts.toArray(new ArtifactInfo[artifacts.size()]);
    }
View Full Code Here

    public StrictConflictManager() {
    }

    public Collection resolveConflicts(IvyNode parent, Collection conflicts) {
        IvyNode lastNode = null;
        for (Iterator iter = conflicts.iterator(); iter.hasNext();) {
            IvyNode node = (IvyNode) iter.next();

            if (lastNode != null && !lastNode.equals(node)) {
                String msg = lastNode + " (needed by " + Arrays.asList(lastNode.getAllCallers())
                        + ") conflicts with " + node + " (needed by "
                        + Arrays.asList(node.getAllCallers()) + ")";
                Message.error(msg);
                Message.sumupProblems();
                throw new StrictConflictException(msg);
            }
            lastNode = node;
View Full Code Here

    public void setIgnoreNonMatching(boolean ignoreNonMatching) {
        mIgnoreNonMatching = ignoreNonMatching;
    }

    public Collection resolveConflicts(IvyNode parent, Collection conflicts) {
        IvyNode lastNode = null;
        for (Iterator iter = conflicts.iterator(); iter.hasNext();) {
            IvyNode node = (IvyNode) iter.next();

            if (lastNode != null && !matchEquals(node, lastNode)) {
                String msg = lastNode + ":" + getMatch(lastNode) + " (needed by "
                        + Arrays.asList(lastNode.getAllCallers()) + ") conflicts with " + node
                        + ":" + getMatch(node) + " (needed by "
                        + Arrays.asList(node.getAllCallers()) + ")";
                Message.error(msg);
                Message.sumupProblems();
                throw new StrictConflictException(msg);
            }
            if (lastNode == null || nodeIsGreater(node, lastNode)) {
View Full Code Here

        ResolvedResource[] ret = new ResolvedResource[mds.size()];
        int i = 0;
        Iterator itMd = mds.iterator();
        while (itMd.hasNext()) {
            ModuleDescriptor md = (ModuleDescriptor) itMd.next();
            IvyNode node = data.getNode(md.getModuleRevisionId());
            if (node != null) {
                // already resolved import, no need to go further
                return new ResolvedResource[] {buildResolvedCapabilityMd(dd, node.getDescriptor())};
            }
            ret[i++] = buildResolvedCapabilityMd(dd, md);
        }
        return ret;
    }
View Full Code Here

    List deps = report.getDependencies();
    Iterator dependencies = deps.iterator();
    String[] confs = report.getConfigurations();
    while (dependencies.hasNext()) {
      IvyNode node = (IvyNode) dependencies.next();
      for (int i = 0; i < confs.length; i++) {
        String conf = confs[i];
        if (!node.isEvicted(conf)) {
          boolean flag1 = report.getConfigurationReport(conf)
              .getDependency(node.getResolvedId()) != null;
          boolean flag2 = report.getConfigurationReport(conf)
              .getModuleRevisionIds().contains(node.getResolvedId());
          assertEquals("Inconsistent data for node " + node + " in conf " + conf , flag1, flag2);
        }
      }
    }
  }
View Full Code Here

         */
       
        Map dependenciesMap = new LinkedHashMap();
        List nulls = new ArrayList();
        for (Iterator iter = nodes.iterator(); iter.hasNext();) {
            IvyNode node = (IvyNode)iter.next();
            if (node.getDescriptor() == null) {
                nulls.add(node);
            } else {
                List n = (List)dependenciesMap.get(node.getDescriptor());
                if (n == null) {
                    n = new ArrayList();
                    dependenciesMap.put(node.getDescriptor(), n);
                }
                n.add(node);
            }
        }
        List list = sortModuleDescriptors(dependenciesMap.keySet());
View Full Code Here

        List dependencies = new ArrayList(report.getDependencies());
        Collections.sort(dependencies);
        if (dependencies.size() > 0) {
          String[] confs = report.getConfigurations();
          for (int i = 0; i < dependencies.size(); i++) {
            IvyNode node = (IvyNode)dependencies.get(i);
            if (node.isCompletelyEvicted()) {
              continue;
            }
            List nodeConfs = new ArrayList(confs.length);
            for (int j = 0; j < confs.length; j++) {
              String conf = confs[j];
              if (report.getConfigurationReport(conf).getModuleRevisionIds().contains(node.getResolvedId())) {
                nodeConfs.add(conf);
              }
            }
            Message.info("\t"+node+" from "+node.getModuleRevision().getResolver().getName()+" in "+nodeConfs);
          }
        }
      }

        IvyNode[] evicted = report.getEvictedNodes();
View Full Code Here

TOP

Related Classes of org.apache.ivy.core.resolve.IvyNode

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.