Skip to content

Commit

Permalink
Spotless
Browse files Browse the repository at this point in the history
  • Loading branch information
lucaneg committed Dec 5, 2023
1 parent 6586dd7 commit 5e5a445
Show file tree
Hide file tree
Showing 9 changed files with 45 additions and 60 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -2,26 +2,6 @@

import static org.junit.Assert.fail;

import java.lang.reflect.Constructor;
import java.lang.reflect.Modifier;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.SortedSet;
import java.util.TreeSet;

import org.junit.Before;
import org.junit.Test;
import org.reflections.Reflections;
import org.reflections.scanners.SubTypesScanner;

import it.unive.lisa.analysis.AbstractState;
import it.unive.lisa.analysis.AnalysisState;
import it.unive.lisa.analysis.AnalyzedCFG;
Expand Down Expand Up @@ -95,6 +75,24 @@
import it.unive.lisa.util.datastructures.graph.GraphVisitor;
import it.unive.lisa.util.representation.StringRepresentation;
import it.unive.lisa.util.representation.StructuredRepresentation;
import java.lang.reflect.Constructor;
import java.lang.reflect.Modifier;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.SortedSet;
import java.util.TreeSet;
import org.junit.Before;
import org.junit.Test;
import org.reflections.Reflections;
import org.reflections.scanners.SubTypesScanner;

public class SemanticsSanityTest {

Expand Down
Original file line number Diff line number Diff line change
@@ -1,5 +1,12 @@
package it.unive.lisa.outputs.serializableGraph;

import it.unive.lisa.analysis.AnalyzedCFG;
import it.unive.lisa.program.cfg.CFG;
import it.unive.lisa.program.cfg.edge.Edge;
import it.unive.lisa.program.cfg.statement.NaryExpression;
import it.unive.lisa.program.cfg.statement.NaryStatement;
import it.unive.lisa.program.cfg.statement.Statement;
import it.unive.lisa.util.datastructures.graph.GraphVisitor;
import java.util.Arrays;
import java.util.IdentityHashMap;
import java.util.LinkedList;
Expand All @@ -9,17 +16,8 @@
import java.util.TreeSet;
import java.util.function.BiFunction;
import java.util.stream.Collectors;

import org.apache.commons.lang3.tuple.Pair;

import it.unive.lisa.analysis.AnalyzedCFG;
import it.unive.lisa.program.cfg.CFG;
import it.unive.lisa.program.cfg.edge.Edge;
import it.unive.lisa.program.cfg.statement.NaryExpression;
import it.unive.lisa.program.cfg.statement.NaryStatement;
import it.unive.lisa.program.cfg.statement.Statement;
import it.unive.lisa.util.datastructures.graph.GraphVisitor;

/**
* Utility class to build {@link SerializableGraph}s from {@link CFG}s.
*
Expand Down
Original file line number Diff line number Diff line change
@@ -1,11 +1,5 @@
package it.unive.lisa.program.cfg.statement;

import java.util.Arrays;
import java.util.Collection;
import java.util.Objects;

import org.apache.commons.lang3.StringUtils;

import it.unive.lisa.analysis.AbstractState;
import it.unive.lisa.analysis.AnalysisState;
import it.unive.lisa.analysis.SemanticException;
Expand All @@ -21,6 +15,10 @@
import it.unive.lisa.type.Type;
import it.unive.lisa.type.Untyped;
import it.unive.lisa.util.datastructures.graph.GraphVisitor;
import java.util.Arrays;
import java.util.Collection;
import java.util.Objects;
import org.apache.commons.lang3.StringUtils;

/**
* A generic expression with {@code n} sub-expressions.
Expand Down
Original file line number Diff line number Diff line change
@@ -1,10 +1,5 @@
package it.unive.lisa.program.cfg.statement;

import java.util.Arrays;
import java.util.Objects;

import org.apache.commons.lang3.StringUtils;

import it.unive.lisa.analysis.AbstractState;
import it.unive.lisa.analysis.AnalysisState;
import it.unive.lisa.analysis.SemanticException;
Expand All @@ -17,6 +12,9 @@
import it.unive.lisa.program.cfg.statement.evaluation.EvaluationOrder;
import it.unive.lisa.program.cfg.statement.evaluation.LeftToRightEvaluation;
import it.unive.lisa.util.datastructures.graph.GraphVisitor;
import java.util.Arrays;
import java.util.Objects;
import org.apache.commons.lang3.StringUtils;

/**
* A generic statement with {@code n} sub-expressions.
Expand Down
Original file line number Diff line number Diff line change
@@ -1,7 +1,5 @@
package it.unive.lisa.program.cfg.statement;

import java.util.Objects;

import it.unive.lisa.analysis.AbstractState;
import it.unive.lisa.analysis.AnalysisState;
import it.unive.lisa.analysis.SemanticException;
Expand All @@ -13,6 +11,7 @@
import it.unive.lisa.program.cfg.edge.Edge;
import it.unive.lisa.program.cfg.statement.call.Call;
import it.unive.lisa.util.datastructures.graph.code.CodeNode;
import java.util.Objects;

/**
* A statement of the program to analyze.
Expand Down
Original file line number Diff line number Diff line change
@@ -1,7 +1,5 @@
package it.unive.lisa.program.cfg.statement;

import java.util.Objects;

import it.unive.lisa.analysis.AbstractState;
import it.unive.lisa.analysis.AnalysisState;
import it.unive.lisa.analysis.SemanticException;
Expand All @@ -18,6 +16,7 @@
import it.unive.lisa.type.Type;
import it.unive.lisa.type.Untyped;
import it.unive.lisa.util.datastructures.graph.GraphVisitor;
import java.util.Objects;

/**
* A reference to a variable of the current CFG, identified by its name.
Expand Down
Original file line number Diff line number Diff line change
@@ -1,7 +1,5 @@
package it.unive.lisa.program.cfg.statement.call;

import java.util.Collection;

import it.unive.lisa.analysis.AbstractState;
import it.unive.lisa.analysis.AnalysisState;
import it.unive.lisa.analysis.SemanticException;
Expand All @@ -10,6 +8,7 @@
import it.unive.lisa.interprocedural.InterproceduralAnalysis;
import it.unive.lisa.program.cfg.CodeMember;
import it.unive.lisa.program.cfg.statement.Expression;
import java.util.Collection;

/**
* A call that wraps another one that has been created through
Expand Down
Original file line number Diff line number Diff line change
@@ -1,5 +1,9 @@
package it.unive.lisa.util.datastructures.graph.code;

import it.unive.lisa.program.ProgramValidationException;
import it.unive.lisa.util.collections.CollectionUtilities.SortedSetCollector;
import it.unive.lisa.util.datastructures.graph.Edge;
import it.unive.lisa.util.datastructures.graph.Node;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
Expand All @@ -15,15 +19,9 @@
import java.util.Set;
import java.util.stream.Collectors;
import java.util.stream.Stream;

import org.apache.commons.lang3.StringUtils;
import org.apache.commons.lang3.tuple.Pair;

import it.unive.lisa.program.ProgramValidationException;
import it.unive.lisa.util.collections.CollectionUtilities.SortedSetCollector;
import it.unive.lisa.util.datastructures.graph.Edge;
import it.unive.lisa.util.datastructures.graph.Node;

/**
* A list of nodes of a {@link CodeGraph}, together with the edges connecting
* them.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -2,14 +2,6 @@

import static org.junit.Assert.assertEquals;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.SortedSet;
import java.util.TreeSet;

import org.junit.Test;

import it.unive.lisa.TestLanguageFeatures;
import it.unive.lisa.TestTypeSystem;
import it.unive.lisa.outputs.serializableGraph.SerializableCFG;
Expand All @@ -29,6 +21,12 @@
import it.unive.lisa.program.cfg.statement.Return;
import it.unive.lisa.program.cfg.statement.Statement;
import it.unive.lisa.program.cfg.statement.VariableRef;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.SortedSet;
import java.util.TreeSet;
import org.junit.Test;

public class SerializableGraphTest {

Expand Down

0 comments on commit 5e5a445

Please sign in to comment.