Package ru.batrdmi.svnplugin.logic

Examples of ru.batrdmi.svnplugin.logic.Revision

25
26
27
28
29
30
31
32
33
        List<Revision> revisions = ae.getData(SVNRevisionGraph.SELECTED_REVISIONS);
        int selectionSize = (revisions == null) ? 0 : revisions.size();
        if (selectionSize == 2) {
            graph.compareFileRevisions(revisions.get(0), revisions.get(1));
        } else if (selectionSize == 1) {
            Revision currentRevision = ae.getData(SVNRevisionGraph.CURRENT_REVISION);
            graph.compareFileRevisions(revisions.get(0), currentRevision);
        }
    }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
    }

    public void update(@NotNull AnActionEvent e) {
        Presentation presentation = e.getPresentation();
        FilePath filePath = e.getData(SVNRevisionGraph.SRC_FILE);
        Revision revision = e.getData(SVNRevisionGraph.SELECTED_REVISION);
        boolean enabled = isEnabled(filePath, revision);
        presentation.setEnabled(enabled);
        presentation.setVisible(enabled || !ActionPlaces.isPopupPlace(e.getPlace()));
    }
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
71
        return cell.isEdge() && !cell.getStyle().equals(SVNRevisionGraph.IN_BRANCH_LINK_STYLE);
    }

    private static Set<mxCell> highlightEdge(RevisionGraphModel model, mxCell edge, boolean on) {
        Set<mxCell> changedCells = new HashSet<mxCell>();
        Revision targetRev = ((RevisionGraphModel.Node)edge.getTarget().getValue()).revisions.get(0);
        List<Revision> copiedOrMergedRevisions = targetRev.getCopiedOrMergedRevisions();
        for (Revision r : copiedOrMergedRevisions) {
            mxCell cell = model.getCellForRevision(r);
            if (cell != null) {
                changedCells.add(cell);
            }
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
        }
        List<RevisionGraphModel.Node> selectedRevs = graph.getModel().getSelectedNodes();
        if (selectedRevs.size() != 1) {
            return false;
        }
        Revision targetRevision = kp.moveFrom(selectedRevs.get(0));
        if (targetRevision != null) {
            graph.selectAndShowRevision(targetRevision);
        }
        return true;
    }
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
        }
        return true;
    }

    private Revision moveUp(RevisionGraphModel.Node currentNode) {
        Revision current = currentNode.revisions.get(0);
        RevisionGraphModel model = graph.getModel();
        Set<Revision> linkedRevs = model.getLinkedRevisions(current);
        if (linkedRevs.isEmpty()) {
            graph.moveUpRange();
            return null;
        }
        Revision result = null;
        double currY = model.getCellForRevision(current).getGeometry().getY();
        Comparator<Revision> comparator = new LinkedRevisionsByDistance(current, false);
        for (Revision r : linkedRevs) {
            if ((model.getCellForRevision(r).getGeometry().getY() - currY < PRECISION)
                    && (result == null || comparator.compare(result, r) > 0)) {
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
        }
        return result;
    }

    private Revision moveDown(RevisionGraphModel.Node currentNode) {
        Revision current = currentNode.revisions.get(0);
        RevisionGraphModel model = graph.getModel();
        Set<Revision> linkedRevs = model.getLinkedRevisions(current);
        if (linkedRevs.isEmpty()) {
            graph.moveDownRange();
            return null;
        }
        Revision result = null;
        double currY = model.getCellForRevision(current).getGeometry().getY();
        Comparator<Revision> comparator = new LinkedRevisionsByDistance(current, true);
        for (Revision r : linkedRevs) {
            if ((model.getCellForRevision(r).getGeometry().getY() - currY > PRECISION)
                    && (result == null || comparator.compare(result, r) > 0)) {
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
        }
        return (result == null) ? current : result;
    }

    private Revision moveLeft(RevisionGraphModel.Node currentNode) {
        Revision current = currentNode.revisions.get(0);
        List<Revision> revsOnPath = graph.getModel().getRevisionsForPath(current.getRelPath());
        ListIterator<Revision> it = revsOnPath.listIterator(revsOnPath.size());
        while (it.hasPrevious()) {
            Revision r = it.previous();
            if (r.equals(current) && it.hasPrevious()) {
                return it.previous();
            }
        }
        return null;
    }
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
        }
        return null;
    }

    private Revision moveRight(RevisionGraphModel.Node currentNode) {
        Revision current = currentNode.revisions.get(currentNode.revisions.size() - 1);
        List<Revision> revsOnPath = graph.getModel().getRevisionsForPath(current.getRelPath());
        Iterator<Revision> it = revsOnPath.iterator();
        while (it.hasNext()) {
            Revision r = it.next();
            if (r.equals(current) && it.hasNext()) {
                return it.next();
            }
        }
        return null;
    }
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
    }

    private mxCell createCell(mxCell neighborCell, Revision rev, boolean collapseRevisions) {
        mxCell result;
        List<Revision> prevList = (neighborCell == null) ? null : ((Node)neighborCell.getValue()).revisions;
        Revision prevRev = (prevList == null) ? null : prevList.get(prevList.size() - 1);
        int thisOrder = revisionOrder.get(rev);
        int prevOrder = (prevRev == null) ? -100 : revisionOrder.get(prevRev);
        if (collapseRevisions && prevRev != currentRevision && rev != currentRevision
                && prevRev != null && !linkedRevisions.containsKey(prevRev) && !prevRev.isDeleted()
                && !linkedRevisions.containsKey(rev) && !rev.isDeleted() && (thisOrder - prevOrder) == 1
                && (prevOrder == 0 || revisions.get(prevOrder - 1).getRevisionNumber() < prevRev.getRevisionNumber())
                && (thisOrder == (revisions.size() - 1) || revisions.get(thisOrder + 1).getRevisionNumber() > rev.getRevisionNumber())) {
            prevList.add(rev);
            result = neighborCell;
        } else {
            List<Revision> nodeRevisions = new ArrayList<Revision>();
            nodeRevisions.add(rev);
            result = new mxCell(new Node(nodeRevisions), new mxGeometry(), null);
            result.setVertex(true);
            result.setConnectable(true);
            result.setStyle(SVNRevisionGraph.REVISION_STYLE + ";"
                    + mxConstants.STYLE_STROKEWIDTH + "=" + ((rev == currentRevision) ? "3" : "1")  + ";"
                    + mxConstants.STYLE_DASHED + "=" + rev.isDeleted());
            addCell(result);
            if (prevRev != null && !prevRev.isDeleted()) {
                createEdge(neighborCell, result, false);
            }
        }
        cellMap.put(rev, result);
        return result;
View Full Code Here
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
        Double nextY = null;
        int i = 0;
        for (String path : revMap.keySet()) {
            ArrayList<Revision> revsOnPath = revMap.get(path);
            if (i != 0) {
                Revision firstRev = revsOnPath.get(0);
                lastCell = getLinkedCell(firstRev);
            }
            int relativePosition = SwingConstants.BOTTOM;
            double widestY = 0;
            for (Revision rev : revsOnPath) {
                mxCell cell = cellMap.get(rev);
                if (cell != lastCell) {
                    lastCell = positionCell(lastCell, relativePosition, nextY, cell);
                    relativePosition = SwingConstants.RIGHT;
                    mxRectangle rect = lastCell.getGeometry();
                    widestY = Math.max(widestY, rect.getY() + rect.getHeight());
                }
            }
            nextY = widestY + SVNRevisionGraph.CELL_SPACING;
            i++;
        }
        //Now adjust x position in order of revision numbers
        for (i = 1; i < revisions.size(); i++) {
            Revision rev = revisions.get(i);
            Revision prevRev = revisions.get(i - 1);
            mxCell cell = cellMap.get(rev);
            mxCell prevCell = cellMap.get(prevRev);
            if (cell != prevCell) {
                Rectangle rect = cell.getGeometry().getRectangle();
                positionCell(prevCell,
                        rev.getRevisionNumber() > prevRev.getRevisionNumber() ? SwingConstants.RIGHT : SwingConstants.BOTTOM,
                        rect.getY(), cell);
            }
        }
    }
View Full Code Here
TOP

Related Classes of ru.batrdmi.svnplugin.logic.Revision

  • ru.batrdmi.svnplugin.actions.CompareAction
  • ru.batrdmi.svnplugin.actions.MyGetVersionAction
  • ru.batrdmi.svnplugin.actions.ShowPropertiesAction
  • ru.batrdmi.svnplugin.KeyboardNavigator
  • ru.batrdmi.svnplugin.RevisionGraphModel
  • ru.batrdmi.svnplugin.RevisionHighlighter
    • 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.