This is an automated email from the ASF dual-hosted git repository.

andy pushed a commit to branch main
in repository https://gitbox.apache.org/repos/asf/jena.git

commit 8248e0f3675790b69ac934f483b2753ad9a2b860
Author: Andy Seaborne <[email protected]>
AuthorDate: Mon May 26 08:54:54 2025 +0100

    Removed commented out code
---
 .../jena/sparql/resultset/ResultSetCompare1.java   | 346 ---------------------
 pom.xml                                            |   5 +
 2 files changed, 5 insertions(+), 346 deletions(-)

diff --git 
a/jena-arq/src/main/java/org/apache/jena/sparql/resultset/ResultSetCompare1.java
 
b/jena-arq/src/main/java/org/apache/jena/sparql/resultset/ResultSetCompare1.java
deleted file mode 100644
index 597a4d6898..0000000000
--- 
a/jena-arq/src/main/java/org/apache/jena/sparql/resultset/ResultSetCompare1.java
+++ /dev/null
@@ -1,346 +0,0 @@
-/*
- * Licensed to the Apache Software Foundation (ASF) under one
- * or more contributor license agreements.  See the NOTICE file
- * distributed with this work for additional information
- * regarding copyright ownership.  The ASF licenses this file
- * to you 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.apache.jena.sparql.resultset;
-
-public class ResultSetCompare1{}
-//import java.util.Iterator;
-//import java.util.List;
-//import java.util.Set;
-//
-//import org.apache.jena.atlas.iterator.Iter;
-//import org.apache.jena.graph.Node;
-//import org.apache.jena.query.ResultSet;
-//import org.apache.jena.query.ResultSetFactory;
-//import org.apache.jena.query.ResultSetRewindable;
-//import org.apache.jena.sparql.core.Var;
-//import org.apache.jena.sparql.engine.binding.Binding;
-//import org.apache.jena.sparql.exec.RowSet;
-//import org.apache.jena.sparql.util.EqualityTest;
-//import org.apache.jena.sparql.util.NodeUtils;
-//import org.apache.jena.sparql.util.iso.BNodeIso;
-//
-///** Comparison of ResultSets.
-// *  Note that reading ResultSets is destructive so consider using {@link 
ResultSetRewindable}
-// *  from {@link ResultSetFactory#makeRewindable}
-// */
-//
-//public class ResultSetCompare1 -- Original.
-//{
-//    /** Compare two result sets for equivalence.  Equivalence means:
-//     * A row rs1 has one matching row in rs2, and vice versa.
-//     * A row is only matched once.
-//     * Rows match if they have the same variables with the same values.
-//     * bNodes must map to a consistent other bNodes.  Value comparisons of 
nodes.
-//     *
-//     * Destructive - rs1 and rs2 are both read, possibly to exhaustion.
-//     * @param rs1
-//     * @param rs2
-//     * @return true if they are equivalent
-//     */
-//
-//    public static boolean equalsByValue(ResultSet rs1, ResultSet rs2) {
-//        return ResultsCompare.equalsByValue(rs1, rs2);
-//    }
-//
-//    /** See {@link #equalsByValue(ResultSet, ResultSet)} */
-//    public static boolean equalsByValue(RowSet rs1, RowSet rs2) {
-//        return ResultsCompare.equalsByValue(rs1, rs2);
-//    }
-//
-////
-////    public static boolean equalsByTest(Collection<Binding> b1, 
Collection<Binding> b2, EqualityTest match)
-////    {
-////        List<Binding> rows1 = new ArrayList<>(b1);
-////        List<Binding> rows2 = new ArrayList<>(b2);
-////        return equivalent(rows1, rows2, match);
-////    }
-////
-//    /** compare two result sets for equivalence.  Equivalence means:
-//     * A row rs1 has one matching row in rs2, and vice versa.
-//     * A row is only matched once.
-//     * Rows match if they have the same variables with the same values,
-//     * bNodes must map to a consistent other bNodes.
-//     * Term comparisons of nodes.
-//     *
-//     * Destructive - rs1 and rs2 are both read, possibly to exhaustion.
-//     * @param rs1
-//     * @param rs2
-//     * @return true if they are equivalent
-//     */
-//
-//    public static boolean equalsByTerm(ResultSet rs1, ResultSet rs2) {
-//        return ResultsCompare.equalsByTerm(rs1, rs2);
-//    }
-//
-//    /** See {@link #equalsByTerm(ResultSet, ResultSet)} */
-//    public static boolean equalsByTerm(RowSet rs1, RowSet rs2) {
-//        return ResultsCompare.equalsByTerm(rs1, rs2);
-//    }
-//
-//    /** Compare two result sets for equivalence.  Equivalence means:
-//     * Each row in rs1 matches the same index row in rs2.
-//     * Rows match if they have the same variables with the same values,
-//     * bNodes must map to a consistent other bNodes.
-//     * Value comparisons of nodes.
-//     *
-//     * Destructive - rs1 and rs2 are both read, possibly to exhaustion.
-//     * @param rs1
-//     * @param rs2
-//     * @return true if they are equivalent
-//     */
-//    public static boolean equalsByValueAndOrder(ResultSet rs1, ResultSet 
rs2) {
-//        return equalsByValueAndOrder(RowSet.adapt(rs1), RowSet.adapt(rs2));
-//    }
-//
-//    /** See {@link #equalsByValueAndOrder(ResultSet, ResultSet)} */
-//    public static boolean equalsByValueAndOrder(RowSet rs1, RowSet rs2) {
-//        if ( ! compareHeader(rs1, rs2) )
-//            return false;
-//        return equivalentByOrder(convert(rs1) , convert(rs2), 
BNodeIso.bnodeIsoByValue());
-//    }
-//
-//
-//    /** compare two result sets for equivalence.  Equivalence means:
-//     * Each row in rs1 matches the same index row in rs2.
-//     * Rows match if they have the same variables with the same values,
-//     * bNodes must map to a consistent other bNodes.
-//     * RDF term comparisons of nodes.
-//     *
-//     * Destructive - rs1 and rs2 are both read, possibly to exhaustion.
-//     * @param rs1
-//     * @param rs2
-//     * @return true if they are equivalent
-//     */
-//    public static boolean equalsByTermAndOrder(ResultSet rs1, ResultSet rs2) 
{
-//        return equalsByTermAndOrder(RowSet.adapt(rs1), RowSet.adapt(rs2));
-//    }
-//
-//    /** See {@link #equalsByTermAndOrder(ResultSet, ResultSet)} */
-//    public static boolean equalsByTermAndOrder(RowSet rs1, RowSet rs2) {
-//        if ( ! compareHeader(rs1, rs2) )
-//            return false;
-//        return equivalentByOrder(convert(rs1) , convert(rs2), 
BNodeIso.bnodeIsoByTerm());
-//    }
-//
-//    /** compare two result sets for exact equality equivalence.
-//     * Exact equality means:
-//     * Each row in rs1 matches the same index row in rs2.
-//     * Rows match if they have the same variables with the same values,
-//     * bNodes must have same labels
-//     *
-//     * Destructive - rs1 and rs2 are both read, possibly to exhaustion.
-//     * @param rs1
-//     * @param rs2
-//     * @return true if they are equivalent
-//     */
-//    public static boolean equalsExact(ResultSet rs1, ResultSet rs2) {
-//        return equalsExact(RowSet.adapt(rs1), RowSet.adapt(rs2));
-//    }
-//
-//    /** Compare two list - unordered */
-//    public static boolean equalsByTerm(List<Binding> list1, List<Binding> 
list2) {
-//        return ResultsCompare.equalsByTerm(list1, list2);
-//    }
-//
-//    /** Compare two list - unordered */
-//    public static boolean equalsExact(List<Binding> list1, List<Binding> 
list2) {
-//        return ResultsCompare.equalsExact(list1, list2);
-//    }
-//
-//    /**
-//     * Compare two row sets for exact equality equivalence.
-//     * Exact equality means:
-//     * Each row in rs1 matches the same index row in rs2.
-//     * Rows match if they have the same variables with the same values,
-//     * bNodes must have same labels
-//     *
-//     * Destructive - rs1 and rs2 are both read, possibly to exhaustion.
-//     * @param rs1
-//     * @param rs2
-//     * @return true if they are equivalent
-//     */
-//    public static boolean equalsExact(RowSet rs1, RowSet rs2) {
-//        if ( !compareHeader(rs1, rs2) )
-//            return false;
-//        return equivalentByOrder(convert(rs1) , convert(rs2), 
NodeUtils.sameNode);
-//    }
-//
-////
-////    /**
-////     * Compare two result sets for blank node isomorphism equivalence.
-////     * Only does RDF term comparison.
-////     * @deprecated Use {@link #equalsByTerm(ResultSet, ResultSet)}
-////     */
-////    @Deprecated(forRemoval = true)
-////    public static boolean isomorphic(ResultSet rs1, ResultSet rs2) {
-////        Model m1 = RDFOutput.encodeAsModel(rs1);
-////        Model m2 = RDFOutput.encodeAsModel(rs2);
-////        return m1.isIsomorphicWith(m2);
-////    }
-////
-////    /**
-////     * Compare two row sets for blank node isomorphism equivalence.
-////     * Only does RDF term comparison.
-////     * @deprecated Use {@link #equalsByTerm(RowSet, RowSet)}
-////     */
-////    @Deprecated(forRemoval = true)
-////    public static boolean isomorphic(RowSet rs1, RowSet rs2) {
-////        return isomorphic(ResultSet.adapt(rs1), ResultSet.adapt(rs2));
-////    }
-////
-//
-//    static private List<Binding> convert(RowSet rs) {
-//        return Iter.iter(rs).toList();
-//    }
-//
-//
-//    /** Compare two bindings, use the node equality test provided */
-//    static public boolean equal(Binding bind1, Binding bind2, EqualityTest 
test) {
-//        if ( bind1 == bind2 )
-//            return true;
-//        if ( bind1.size() != bind2.size() )
-//            return false;
-//        // They are the same size so containment is enough.
-//        if ( ! containedIn(bind1, bind2, test) )
-//            return false;
-//        return true;
-//    }
-//
-//    static private boolean compareHeader(RowSet rs1, RowSet rs2) {
-//        if ( rs1 == null && rs2 == null )
-//            return true;
-//        if ( rs1 == null )
-//            return false;
-//        if ( rs2 == null )
-//            return false;
-//        Set<Var> names1 = Set.copyOf(rs1.getResultVars());
-//        Set<Var> names2 = Set.copyOf(rs2.getResultVars());
-//        return names1.equals(names2);
-//    }
-//
-////    private static final boolean DEBUG = false;
-////
-////    static private boolean equivalent(Collection<Binding> rows1, 
Collection<Binding> rows2, EqualityTest match) {
-////        if ( rows1.size() != rows2.size() )
-////            return false;
-////        for ( Binding row1 : rows1 ) {
-////            if ( DEBUG ) System.out.println("   Row1 = "+row1);
-////
-////            // find in rows2.
-////            Binding matched = null;
-////            int i = 0;
-////            for ( Binding row2 : rows2 ) {
-////                if ( DEBUG ) System.out.printf("%-2d Row2 = %s\n", i++, 
row2);
-////
-////                // NEED BACKTRACKING
-////                if ( equal(row1, row2, match) ) {
-////                    if ( DEBUG ) System.out.println("MATCHES");
-////                    matched = row2;
-////                    break;
-////                }
-////            }
-////
-////            if ( DEBUG ) System.out.println();
-////            if ( matched == null )
-////                return false;
-////            // Remove matching.
-////            rows2.remove(matched);
-////        }
-////        return true;
-////    }
-////
-//    static private boolean equivalentByOrder(List<Binding> rows1, 
List<Binding> rows2, EqualityTest match) {
-//        if ( rows1.size() != rows2.size() )
-//             return false;
-//
-//        Iterator<Binding> iter1 = rows1.iterator();
-//        Iterator<Binding> iter2 = rows2.iterator();
-//
-//        while ( iter1.hasNext() )
-//        {
-//            // Does not need backtracking because rows must
-//            // align and so must variables in a row.
-//            Binding row1 = iter1.next();
-//            Binding row2 = iter2.next();
-//            if ( !equal(row1, row2, match) )
-//                return false;
-//        }
-//        return true;
-//    }
-//
-//    // Is bind1 contained in bind2?  For every (var,value) in bind1, is it 
in bind2?
-//    // Maybe more in bind2.
-//    private static boolean containedIn(Binding bind1, Binding bind2, 
EqualityTest test) {
-//        // There are about 100 ways to do this!
-//        Iterator<Var> iter1 =  bind1.vars();
-//
-//        while(iter1.hasNext()) {
-//            Var v = iter1.next();
-//            Node n1 = bind1.get(v);
-//            Node n2 = bind2.get(v);
-//            if ( n2 == null )
-//                // v bound in bind1 and not in bind2.
-//                return false;
-//            if ( ! test.equal(n1, n2) )
-//                return false;
-//        }
-//        return true;
-//    }
-////
-////    public static class BNodeIso implements EqualityTest
-////    {
-////        private NodeIsomorphismMap mapping;
-////        private EqualityTest literalTest;
-////
-////        public BNodeIso(EqualityTest literalTest) {
-////            this.mapping = new NodeIsomorphismMap();
-////            this.literalTest = literalTest;
-////        }
-////
-////        @Override
-////        public boolean equal(Node n1, Node n2) {
-////            if ( n1 == null && n2 == null )
-////                return true;
-////            if ( n1 == null )
-////                return false;
-////            if ( n2 == null )
-////                return false;
-////
-////            if ( n1.isURI() && n2.isURI() )
-////                return n1.equals(n2);
-////
-////            if ( n1.isLiteral() && n2.isLiteral() )
-////                return literalTest.equal(n1, n2);
-////
-////            if ( n1.isBlank() && n2.isBlank() )
-////                return Iso.nodeIso(n1, n2, mapping);
-////
-////            if ( n1.isVariable() && n2.isVariable() )
-////                return mapping.makeIsomorphic(n1, n2);
-////
-////            if ( n1.isTripleTerm() && n2.isTripleTerm() ) {
-////                Triple t1 = n1.getTriple();
-////                Triple t2 = n2.getTriple();
-////                return  Iso.tripleIso(t1, t2, mapping);
-////            }
-////
-////            return false;
-////        }
-////    }
-//}
diff --git a/pom.xml b/pom.xml
index b1c0f398cb..05086104d1 100644
--- a/pom.xml
+++ b/pom.xml
@@ -970,6 +970,11 @@
             <release>${java.version}</release>
             <compilerArgs>
               <arg>-proc:none</arg>
+              <!-- 
+                   In preparation for Jena6, silence deprecation=removal 
warnings.
+                   There are many.
+                   Remove Xlint setting at or after Jena6.
+              -->
               <arg>-Xlint:-removal</arg>
             </compilerArgs>
           </configuration>

Reply via email to