forked from moditect/deptective
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
moditect#27 Making Node a self-referential interface type, allowing f…
…or specific sub-types
- Loading branch information
1 parent
9a69924
commit b3e1488
Showing
14 changed files
with
171 additions
and
166 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
93 changes: 93 additions & 0 deletions
93
javac-plugin/src/main/java/org/moditect/deptective/internal/graph/SimpleNode.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,93 @@ | ||
| /** | ||
| * Copyright 2019 The ModiTect authors | ||
| * | ||
| * 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 org.moditect.deptective.internal.graph; | ||
|
|
||
| import java.util.HashMap; | ||
| import java.util.Map; | ||
| import java.util.Objects; | ||
|
|
||
| /** | ||
| * @author Gerd Wütherich (gw@code-kontor.io) | ||
| */ | ||
| public class SimpleNode implements Node<SimpleNode> { | ||
|
|
||
| private Map<SimpleNode, Dependency<SimpleNode>> outgoingDependencies; | ||
| private final String id; | ||
|
|
||
| public SimpleNode(String id) { | ||
| this.id = Objects.requireNonNull(id); | ||
| } | ||
|
|
||
| public String getId() { | ||
| return id; | ||
| } | ||
|
|
||
| @Override | ||
| public Dependency<SimpleNode> getOutgoingDependencyTo(SimpleNode node) { | ||
| if (!hasOutgoingDependencies()) { | ||
| return null; | ||
| } | ||
|
|
||
| return outgoingDependencies.get(node); | ||
| } | ||
|
|
||
| @Override | ||
| public boolean hasOutgoingDependencies() { | ||
| return outgoingDependencies != null && !outgoingDependencies.isEmpty(); | ||
| } | ||
|
|
||
| public void addOutgoingDependency(SimpleNode to, int aggregatedWeight) { | ||
| outgoingDependencies().put(to, new Dependency<>(to, aggregatedWeight)); | ||
| } | ||
|
|
||
| @Override | ||
| public String toString() { | ||
| return "SimpleNode [id=" + id + "]"; | ||
| } | ||
|
|
||
| @Override | ||
| public int hashCode() { | ||
| final int prime = 31; | ||
| int result = 1; | ||
| result = prime * result + ((id == null) ? 0 : id.hashCode()); | ||
| return result; | ||
| } | ||
|
|
||
| @Override | ||
| public boolean equals(Object obj) { | ||
| if (this == obj) | ||
| return true; | ||
| if (obj == null) | ||
| return false; | ||
| if (getClass() != obj.getClass()) | ||
| return false; | ||
| SimpleNode other = (SimpleNode) obj; | ||
| if (id == null) { | ||
| if (other.id != null) | ||
| return false; | ||
| } | ||
| else if (!id.equals(other.id)) | ||
| return false; | ||
| return true; | ||
| } | ||
|
|
||
| private Map<SimpleNode, Dependency<SimpleNode>> outgoingDependencies() { | ||
| if (outgoingDependencies == null) { | ||
| outgoingDependencies = new HashMap<>(); | ||
| } | ||
| return outgoingDependencies; | ||
| } | ||
| } |
Oops, something went wrong.