| /* |
| * Copyright 2000-2014 JetBrains s.r.o. |
| * |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| |
| package com.intellij.vcs.log.graph.impl.permanent; |
| |
| import com.intellij.util.SmartList; |
| import com.intellij.vcs.log.graph.api.LinearGraph; |
| import com.intellij.vcs.log.graph.utils.Flags; |
| import com.intellij.vcs.log.graph.utils.IntList; |
| import com.intellij.vcs.log.graph.utils.impl.CompressedIntList; |
| import org.jetbrains.annotations.NotNull; |
| |
| import java.util.Collections; |
| import java.util.List; |
| |
| public class PermanentLinearGraphImpl implements LinearGraph { |
| private final Flags mySimpleNodes; |
| |
| // myNodeToEdgeIndex.length = nodesCount() + 1. |
| private final IntList myNodeToEdgeIndex; |
| private final IntList myLongEdges; |
| |
| /*package*/ PermanentLinearGraphImpl(Flags simpleNodes, int[] nodeToEdgeIndex, int[] longEdges) { |
| mySimpleNodes = simpleNodes; |
| myNodeToEdgeIndex = CompressedIntList.newInstance(nodeToEdgeIndex); |
| myLongEdges = CompressedIntList.newInstance(longEdges); |
| } |
| |
| @Override |
| public int nodesCount() { |
| return mySimpleNodes.size(); |
| } |
| |
| @NotNull |
| @Override |
| public List<Integer> getUpNodes(int nodeIndex) { |
| List<Integer> result = new SmartList<Integer>(); |
| if (nodeIndex != 0 && mySimpleNodes.get(nodeIndex - 1)) { |
| result.add(nodeIndex - 1); |
| } |
| |
| for (int i = myNodeToEdgeIndex.get(nodeIndex); i < myNodeToEdgeIndex.get(nodeIndex + 1); i++) { |
| int node = myLongEdges.get(i); |
| if (node < nodeIndex) |
| result.add(node); |
| } |
| |
| return result; |
| } |
| |
| |
| @NotNull |
| @Override |
| public List<Integer> getDownNodes(int nodeIndex) { |
| if (mySimpleNodes.get(nodeIndex)) { |
| return Collections.singletonList(nodeIndex + 1); |
| } |
| |
| List<Integer> result = new SmartList<Integer>(); |
| for (int i = myNodeToEdgeIndex.get(nodeIndex); i < myNodeToEdgeIndex.get(nodeIndex + 1); i++) { |
| int node = myLongEdges.get(i); |
| if (nodeIndex < node) |
| result.add(node); |
| } |
| |
| return result; |
| } |
| } |