This repository has been archived by the owner on Sep 3, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 3
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
42 changed files
with
2,294 additions
and
336 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
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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,102 @@ | ||
| package it.near.sdk.geopolis; | ||
|
|
||
| import org.json.JSONObject; | ||
|
|
||
| import java.util.ArrayList; | ||
| import java.util.Collections; | ||
| import java.util.List; | ||
|
|
||
| import it.near.sdk.geopolis.beacons.BeaconNode; | ||
| import it.near.sdk.morpheusnear.Morpheus; | ||
| import it.near.sdk.utils.NearJsonAPIUtils; | ||
|
|
||
| import static it.near.sdk.utils.NearUtils.safe; | ||
|
|
||
| public class NodesManager2 { | ||
|
|
||
| private List<Node> nodes; | ||
|
|
||
| private Morpheus morpheus; | ||
| private List<Node> emptyList = Collections.<Node>emptyList(); | ||
| ; | ||
|
|
||
| public NodesManager2(Morpheus morpheus) { | ||
| this.morpheus = morpheus; | ||
| } | ||
|
|
||
| public List<Node> setNodes(JSONObject jsonObject) { | ||
| nodes = NearJsonAPIUtils.parseList(morpheus, jsonObject, Node.class); | ||
| return nodes; | ||
| } | ||
|
|
||
| public List<Node> getRoots() { | ||
| if (nodes != null) { | ||
| return nodes; | ||
| } else { | ||
| return emptyList; | ||
| } | ||
| } | ||
|
|
||
| public Node getNode(String nodeId) { | ||
| return nodes != null ? findNodeIn(nodes, nodeId) : null; | ||
| } | ||
|
|
||
| private Node findNodeIn(List<Node> nodes, String id) { | ||
| for (Node node : nodes) { | ||
| if (node.getId().equals(id)) { | ||
| return node; | ||
| } else if (node.getChildren() != null) { | ||
| Node foundNode = findNodeIn(node.getChildren(), id); | ||
| if (foundNode != null) return foundNode; | ||
| } | ||
| } | ||
| return null; | ||
| } | ||
|
|
||
| public List<Node> getMonitoredNodesOnEnter(String nodeId) { | ||
|
|
||
| if (nodes == null) return emptyList; | ||
| Node node = findNodeIn(nodes, nodeId); | ||
| if (node == null || BeaconNode.isBeacon(node)) return emptyList; | ||
|
|
||
| return getMonitoredNodesOnEnter(node); | ||
| } | ||
|
|
||
| private List<Node> getMonitoredNodesOnEnter(Node node) { | ||
| List<Node> regionsToMonitor = new ArrayList<>(); | ||
| regionsToMonitor.addAll(getSibilings(node)); | ||
|
|
||
| for (Node child : safe(node.getChildren())) { | ||
| if (!BeaconNode.isBeacon(child)) | ||
| regionsToMonitor.add(child); | ||
| } | ||
| return regionsToMonitor; | ||
| } | ||
|
|
||
| private List<Node> getSibilings(Node node) { | ||
| if (node.getParent() != null) | ||
| return node.getParent().getChildren(); | ||
| return nodes; | ||
| } | ||
|
|
||
| public List<Node> getMonitoredNodesOnExit(String nodeId) { | ||
| if (nodes == null) return emptyList; | ||
| Node node = findNodeIn(nodes, nodeId); | ||
| if (node == null || BeaconNode.isBeacon(node)) return emptyList; | ||
| if (node.getParent() == null) return nodes; | ||
| return getMonitoredNodesOnEnter(node.getParent()); | ||
| } | ||
|
|
||
|
|
||
| public List<Node> getRangedNodesOnEnter(String nodeId) { | ||
| if (nodes == null) return emptyList; | ||
| Node node = findNodeIn(nodes, nodeId); | ||
| if (node == null || BeaconNode.isBeacon(node) || node.getChildren() == null) return emptyList; | ||
| List<Node> beaconsToReturn = new ArrayList<>(); | ||
| for (Node child : safe(node.getChildren())) { | ||
| if (BeaconNode.isBeacon(child)) | ||
| beaconsToReturn.add(child); | ||
| } | ||
| return beaconsToReturn; | ||
| } | ||
| } |
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
Oops, something went wrong.