There is no replacement for checkArgument in recent JDK's - however the logic is simple enough that we can just expand out the conditions.

johnmay · egonw · commit e1abff282767 · 2022-01-01T11:32:07.000+01:00
diff --git a/base/core/src/main/java/org/openscience/cdk/graph/JumboPathGraph.java b/base/core/src/main/java/org/openscience/cdk/graph/JumboPathGraph.java
@@ -31,8 +31,6 @@
 import java.util.List;
 import java.util.Objects;
 
-import static com.google.common.base.Preconditions.checkArgument;
-
 /**
  * A path graph (<b>P-Graph</b>) for graphs with more than 64 vertices - the
  * P-Graph provides efficient generation of all simple cycles in a graph
@@ -87,8 +85,8 @@ final class JumboPathGraph extends PathGraph {
         int ord = graph.length;
 
         // check configuration
-        checkArgument(ord > 2, "graph was acyclic");
-        checkArgument(limit >= 3 && limit <= ord, "limit should be from 3 to |V|");
+        if (ord <= 2) throw new IllegalArgumentException("graph was acyclic");
+        if (limit < 3 || limit > ord) throw new IllegalArgumentException("limit should be from 3 to |V|");
 
         for (int v = 0; v < ord; v++)
             graph[v] = Lists.newArrayList();
diff --git a/base/core/src/main/java/org/openscience/cdk/graph/RegularPathGraph.java b/base/core/src/main/java/org/openscience/cdk/graph/RegularPathGraph.java
@@ -30,7 +30,6 @@
 import java.util.List;
 import java.util.Objects;
 
-import static com.google.common.base.Preconditions.checkArgument;
 
 /**
  * A path graph (<b>P-Graph</b>) for graphs with less than 64 vertices - the
@@ -86,9 +85,9 @@ final class RegularPathGraph extends PathGraph {
         int ord = graph.length;
 
         // check configuration
-        checkArgument(ord > 2, "graph was acyclic");
-        checkArgument(limit >= 3 && limit <= ord, "limit should be from 3 to |V|");
-        checkArgument(ord < 64, "graph has 64 or more atoms, use JumboPathGraph");
+        if (ord <= 2) throw new IllegalArgumentException("graph was acyclic");
+        if (limit < 3 || limit > ord) throw new IllegalArgumentException("limit should be from 3 to |V|");
+        if (ord >= 64) throw new IllegalArgumentException("graph has 64 or more atoms, use JumboPathGraph");
 
         for (int v = 0; v < ord; v++)
             graph[v] = Lists.newArrayList();
diff --git a/storage/smiles/src/main/java/org/openscience/cdk/smiles/CDKToBeam.java b/storage/smiles/src/main/java/org/openscience/cdk/smiles/CDKToBeam.java
@@ -53,7 +53,6 @@
 import java.util.Map;
 import java.util.Objects;
 
-import static com.google.common.base.Preconditions.checkArgument;
 import static org.openscience.cdk.CDKConstants.ATOM_ATOM_MAPPING;
 import static org.openscience.cdk.interfaces.IDoubleBondStereochemistry.Conformation.TOGETHER;
 import static org.openscience.cdk.interfaces.ITetrahedralChirality.Stereo.CLOCKWISE;
@@ -112,7 +111,7 @@ Atom toBeamAtom(IAtom atom) throws CDKException {
 
     Edge toBeamEdge(IBond b, Map<IAtom, Integer> indices) throws CDKException {
 
-        checkArgument(b.getAtomCount() == 2, "Invalid number of atoms on bond");
+        if (b.getAtomCount() != 2) throw new IllegalArgumentException("Invalid number of atoms on bond");
 
         int u = indices.get(b.getBegin());
         int v = indices.get(b.getEnd());
@@ -253,7 +252,7 @@ static Atom toBeamAtom(final IAtom a, final int flavour) {
      */
     static Edge toBeamEdge(IBond b, int flavour, Map<IAtom, Integer> indices) throws CDKException {
 
-        checkArgument(b.getAtomCount() == 2, "Invalid number of atoms on bond");
+        if (b.getAtomCount() != 2) throw new IllegalArgumentException("Invalid number of atoms on bond");
 
         int u = indices.get(b.getBegin());
         int v = indices.get(b.getEnd());
