v1/test/src/drt/drtcases/QNameSetTest.java - xmlbeans - Git at Google

 /*   Copyright 2004 The Apache Software Foundation
  *
  *   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 drtcases;

 import javax.xml.namespace.QName;

 import java.text.DecimalFormat;
 import java.util.Random;
 import java.util.Stack;

 import org.apache.xmlbeans.QNameSetBuilder;
 import org.apache.xmlbeans.QNameSetSpecification;
 import junit.framework.TestCase;
 import junit.framework.Assert;
 import junit.framework.Test;
 import junit.framework.TestSuite;

 public class QNameSetTest extends TestCase
 {
     public QNameSetTest(String name) { super(name); }
     public static Test suite() { return new TestSuite(QNameSetTest.class); }

     public static String format(int indent, int iter, String p, QNameSetBuilder set)
     {
         /*
         System.err.print(new DecimalFormat("00000 ").format(iter));
         while (indent-- > 0)
             System.err.print(' ');
         System.err.print(p);
         System.err.print(" = ");
         System.err.println(set.dump());
         */

         return "case# " + iter + " " + p + " " + set.toString();

     }


     public void testQNameSets()
     {
         int iterations = 10000;
         int seed = 0;
         int stopat = -1;

         Random rnd = new Random(seed);
         String[] localname = {"a", "b", "c", "d", "e"};
         String[] namespace = {"n1", "n2", "n3", "n4", "n5"};
         int width = localname.length;

         QName[] name = new QName[width * namespace.length];
         for (int i = 0; i < width; i++)
         {
             for (int j = 0; j < namespace.length; j++)
             {
                 name[i + width * j] = new QName(namespace[j], localname[i]);
             }
         }

         Stack teststack = new Stack(); // stack of sets
         Stack trackstack = new Stack(); // stack of boolean arrays

         QNameSetBuilder current = new QNameSetBuilder();
         boolean[] contents = new boolean[width * namespace.length];
         boolean[] temp;
         int i = 0;
         int j = 0;

         for (int l = 0; l < iterations; l++)
         {
             // for debugging

             if (l == stopat)
                 System.err.println("We're here");

             // apply a random operation

             if (rnd.nextInt(3) != 0)
             {
                 i = rnd.nextInt(width - 1); // don't do the last one for isAll test
                 j = rnd.nextInt(namespace.length - 1); // don't do the last one for isAll test
             }

             String label;

             switch (teststack.size() < 1 ? 24 : rnd.nextInt(iterations - l > teststack.size() ? 24 : 5))
             {
                 default:
                     teststack.push(current);
                     trackstack.push(contents);
                     current = new QNameSetBuilder();
                     contents = new boolean[width * namespace.length];
                     label = "new";
                     break;

                 case 19:
                 case 20:
                 case 22:
                     teststack.push(current);
                     trackstack.push(contents);
                     current = new QNameSetBuilder();
                     contents = new boolean[width * namespace.length];

                     if (rnd.nextInt(2) == 0)
                     {
                         current.invert();
                         for (int k = 0; k < width; k++)
                         {
                             contents[k + width * (namespace.length - 1)] = true;
                         }
                     }

                     for (int h = 0; h < namespace.length - 1; h++)
                     {
                         if (rnd.nextInt(2) == 0)
                             current.removeNamespace(namespace[h]);
                         else
                         {
                             current.addNamespace(namespace[h]);
                             contents[width - 1 + width * h] = true;
                         }
                         for (int k = 0; k < width - 1; k++)
                         {
                             if (rnd.nextInt(2) == 0)
                                 current.remove(name[k + width * h]);
                             else
                             {
                                 current.add(name[k + width * h]);
                                 contents[k + width * h] = true;
                             }
                         }
                     }
                     label = "random";
                     break;

                 case 0:
                     current.addAll((QNameSetSpecification)teststack.pop());
                     temp = (boolean[])trackstack.pop();
                     for (int k = 0; k < width * namespace.length; k++)
                         if (temp[k])
                             contents[k] = true;
                     label = "add set";
                     break;

                 case 1:
                     current.removeAll((QNameSetSpecification)teststack.pop());
                     temp = (boolean[])trackstack.pop();
                     for (int k = 0; k < width * namespace.length; k++)
                         if (temp[k])
                             contents[k] = false;
                     label = "remove set";
                     break;

                 case 2:
                     current.restrict((QNameSetSpecification)teststack.pop());
                     temp = (boolean[])trackstack.pop();
                     for (int k = 0; k < width * namespace.length; k++)
                         if (!temp[k])
                             contents[k] = false;
                     label = "restrict set";
                     break;

                 case 3:
                     label = "union";
                     current = new QNameSetBuilder(current.union((QNameSetSpecification)teststack.pop()));
                     temp = (boolean[])trackstack.pop();
                     for (int k = 0; k < width * namespace.length; k++)
                         if (temp[k])
                             contents[k] = true;
                     label = "union";
                     break;

                 case 4:
                     label = "intersect";
                     current = new QNameSetBuilder(current.intersect((QNameSetSpecification)teststack.pop()));
                     temp = (boolean[])trackstack.pop();
                     for (int k = 0; k < width * namespace.length; k++)
                         if (!temp[k])
                             contents[k] = false;
                     label = "intersect";
                     break;

                 case 5:
                     current = new QNameSetBuilder(current);
                     label = "copy";
                     break;

                 case 6:
                 case 7:
                 case 8:
                     current.add(name[i + width * j]);
                     contents[i + width * j] = true;
                     label = "add one " + name[i + width * j];
                     break;

                 case 9:
                 case 10:
                 case 11:
                     current.remove(name[i + width * j]);
                     contents[i + width * j] = false;
                     label = "remove one " + name[i + width * j];
                     break;

                 case 12:
                 case 13:
                     current.addNamespace(namespace[j]);
                     for (int k = 0; k < width; k++)
                         contents[k + width * j] = true;
                     label = "add namespace " + namespace[j];
                     break;

                 case 14:
                 case 15:
                     current.removeNamespace(namespace[j]);
                     for (int k = 0; k < width; k++)
                         contents[k + width * j] = false;
                     label = "remove namespace " + namespace[j];
                     break;

                 case 16:
                 case 17:
                     current.invert();
                     for (int k = 0; k < width * namespace.length; k++)
                         contents[k] = !contents[k];
                     label = "invert";
                     break;

                 case 18:
                     current = new QNameSetBuilder(current.inverse());
                     for (int k = 0; k < width * namespace.length; k++)
                         contents[k] = !contents[k];
                     label = "inverse";
                     break;

             }

             // System.out.println(format(teststack.size(), l, label, current));

             // then, verify current matches contents
             int count = 0;
             for (int k = 0; k < width * namespace.length; k++)
             {
                 Assert.assertTrue(format(0, l, "Content mismatch " + name[k], current), (current.contains(name[k]) == contents[k]));
                 {
                     // testprint(0, l, "ERROR ON " + name[k], current);
                     // testprint(0, l, "expected " + contents[k] + ", got " + !contents[k], current);
                     // System.exit(1);
                 }
                 if (contents[k])
                     count++;
             }

             Assert.assertTrue(format(0, l, "ERROR: isEmpty is wrong", current), ((count == 0) == current.isEmpty()));
             {
                 // testprint(0, l, "ERROR: isEmpty is wrong", current);
                 // testprint(0, l, "expected " + (count == 0) + ", got " + !(count == 0), current);
                 // System.exit(1);
             }

             Assert.assertTrue(format(0, l, "ERROR: isAll is wrong", current), (count == width * namespace.length) == current.isAll());
             {
                 // testprint(0, l, "ERROR: isAll is wrong", current);
                 // testprint(0, l, "expected " + (count == width * namespace.length) + ", got " + !(count == width * namespace.length), current);
                 // System.exit(1);
             }

             // test isDisjoint and containsAll
             if (teststack.size() >= 1)
             {
                 boolean disjoint = true;
                 temp = (boolean[])trackstack.peek();
                 for (int k = 0; k < width * namespace.length; k++)
                 {
                     if (temp[k] && contents[k])
                     {
                         disjoint = false;
                         break;
                     }
                 }
                 Assert.assertTrue(format(0, l, "ERROR: disjoint is wrong", current), disjoint == current.isDisjoint((QNameSetSpecification)teststack.peek()));
                 {
                     // testprint(0, l, "ERROR: disjoint is wrong", current);
                     // testprint(0, l, "expected " + disjoint + ", got " + !disjoint, (QNameSetBuilder)teststack.peek());
                     // System.exit(1);
                 }


                 boolean containsAll = true;
                 for (int k = 0; k < width * namespace.length; k++)
                 {
                     if (temp[k] && !contents[k])
                     {
                         containsAll = false;
                         break;
                     }
                 }
                 Assert.assertTrue(format(0, l, "ERROR: containsAll is wrong", current), containsAll == current.containsAll((QNameSetSpecification)teststack.peek()));
             }

         }
     }
 }
	/* Copyright 2004 The Apache Software Foundation
	*
	* 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 drtcases;

	import javax.xml.namespace.QName;

	import java.text.DecimalFormat;
	import java.util.Random;
	import java.util.Stack;

	import org.apache.xmlbeans.QNameSetBuilder;
	import org.apache.xmlbeans.QNameSetSpecification;
	import junit.framework.TestCase;
	import junit.framework.Assert;
	import junit.framework.Test;
	import junit.framework.TestSuite;

	public class QNameSetTest extends TestCase
	{
	public QNameSetTest(String name) { super(name); }
	public static Test suite() { return new TestSuite(QNameSetTest.class); }

	public static String format(int indent, int iter, String p, QNameSetBuilder set)
	{
	/*
	System.err.print(new DecimalFormat("00000 ").format(iter));
	while (indent-- > 0)
	System.err.print(' ');
	System.err.print(p);
	System.err.print(" = ");
	System.err.println(set.dump());
	*/

	return "case# " + iter + " " + p + " " + set.toString();

	}


	public void testQNameSets()
	{
	int iterations = 10000;
	int seed = 0;
	int stopat = -1;

	Random rnd = new Random(seed);
	String[] localname = {"a", "b", "c", "d", "e"};
	String[] namespace = {"n1", "n2", "n3", "n4", "n5"};
	int width = localname.length;

	QName[] name = new QName[width * namespace.length];
	for (int i = 0; i < width; i++)
	{
	for (int j = 0; j < namespace.length; j++)
	{
	name[i + width * j] = new QName(namespace[j], localname[i]);
	}
	}

	Stack teststack = new Stack(); // stack of sets
	Stack trackstack = new Stack(); // stack of boolean arrays

	QNameSetBuilder current = new QNameSetBuilder();
	boolean[] contents = new boolean[width * namespace.length];
	boolean[] temp;
	int i = 0;
	int j = 0;

	for (int l = 0; l < iterations; l++)
	{
	// for debugging

	if (l == stopat)
	System.err.println("We're here");

	// apply a random operation

	if (rnd.nextInt(3) != 0)
	{
	i = rnd.nextInt(width - 1); // don't do the last one for isAll test
	j = rnd.nextInt(namespace.length - 1); // don't do the last one for isAll test
	}

	String label;

	switch (teststack.size() < 1 ? 24 : rnd.nextInt(iterations - l > teststack.size() ? 24 : 5))
	{
	default:
	teststack.push(current);
	trackstack.push(contents);
	current = new QNameSetBuilder();
	contents = new boolean[width * namespace.length];
	label = "new";
	break;

	case 19:
	case 20:
	case 22:
	teststack.push(current);
	trackstack.push(contents);
	current = new QNameSetBuilder();
	contents = new boolean[width * namespace.length];

	if (rnd.nextInt(2) == 0)
	{
	current.invert();
	for (int k = 0; k < width; k++)
	{
	contents[k + width * (namespace.length - 1)] = true;
	}
	}

	for (int h = 0; h < namespace.length - 1; h++)
	{
	if (rnd.nextInt(2) == 0)
	current.removeNamespace(namespace[h]);
	else
	{
	current.addNamespace(namespace[h]);
	contents[width - 1 + width * h] = true;
	}
	for (int k = 0; k < width - 1; k++)
	{
	if (rnd.nextInt(2) == 0)
	current.remove(name[k + width * h]);
	else
	{
	current.add(name[k + width * h]);
	contents[k + width * h] = true;
	}
	}
	}
	label = "random";
	break;

	case 0:
	current.addAll((QNameSetSpecification)teststack.pop());
	temp = (boolean[])trackstack.pop();
	for (int k = 0; k < width * namespace.length; k++)
	if (temp[k])
	contents[k] = true;
	label = "add set";
	break;

	case 1:
	current.removeAll((QNameSetSpecification)teststack.pop());
	temp = (boolean[])trackstack.pop();
	for (int k = 0; k < width * namespace.length; k++)
	if (temp[k])
	contents[k] = false;
	label = "remove set";
	break;

	case 2:
	current.restrict((QNameSetSpecification)teststack.pop());
	temp = (boolean[])trackstack.pop();
	for (int k = 0; k < width * namespace.length; k++)
	if (!temp[k])
	contents[k] = false;
	label = "restrict set";
	break;

	case 3:
	label = "union";
	current = new QNameSetBuilder(current.union((QNameSetSpecification)teststack.pop()));
	temp = (boolean[])trackstack.pop();
	for (int k = 0; k < width * namespace.length; k++)
	if (temp[k])
	contents[k] = true;
	label = "union";
	break;

	case 4:
	label = "intersect";
	current = new QNameSetBuilder(current.intersect((QNameSetSpecification)teststack.pop()));
	temp = (boolean[])trackstack.pop();
	for (int k = 0; k < width * namespace.length; k++)
	if (!temp[k])
	contents[k] = false;
	label = "intersect";
	break;

	case 5:
	current = new QNameSetBuilder(current);
	label = "copy";
	break;

	case 6:
	case 7:
	case 8:
	current.add(name[i + width * j]);
	contents[i + width * j] = true;
	label = "add one " + name[i + width * j];
	break;

	case 9:
	case 10:
	case 11:
	current.remove(name[i + width * j]);
	contents[i + width * j] = false;
	label = "remove one " + name[i + width * j];
	break;

	case 12:
	case 13:
	current.addNamespace(namespace[j]);
	for (int k = 0; k < width; k++)
	contents[k + width * j] = true;
	label = "add namespace " + namespace[j];
	break;

	case 14:
	case 15:
	current.removeNamespace(namespace[j]);
	for (int k = 0; k < width; k++)
	contents[k + width * j] = false;
	label = "remove namespace " + namespace[j];
	break;

	case 16:
	case 17:
	current.invert();
	for (int k = 0; k < width * namespace.length; k++)
	contents[k] = !contents[k];
	label = "invert";
	break;

	case 18:
	current = new QNameSetBuilder(current.inverse());
	for (int k = 0; k < width * namespace.length; k++)
	contents[k] = !contents[k];
	label = "inverse";
	break;

	}

	// System.out.println(format(teststack.size(), l, label, current));

	// then, verify current matches contents
	int count = 0;
	for (int k = 0; k < width * namespace.length; k++)
	{
	Assert.assertTrue(format(0, l, "Content mismatch " + name[k], current), (current.contains(name[k]) == contents[k]));
	{
	// testprint(0, l, "ERROR ON " + name[k], current);
	// testprint(0, l, "expected " + contents[k] + ", got " + !contents[k], current);
	// System.exit(1);
	}
	if (contents[k])
	count++;
	}

	Assert.assertTrue(format(0, l, "ERROR: isEmpty is wrong", current), ((count == 0) == current.isEmpty()));
	{
	// testprint(0, l, "ERROR: isEmpty is wrong", current);
	// testprint(0, l, "expected " + (count == 0) + ", got " + !(count == 0), current);
	// System.exit(1);
	}

	Assert.assertTrue(format(0, l, "ERROR: isAll is wrong", current), (count == width * namespace.length) == current.isAll());
	{
	// testprint(0, l, "ERROR: isAll is wrong", current);
	// testprint(0, l, "expected " + (count == width * namespace.length) + ", got " + !(count == width * namespace.length), current);
	// System.exit(1);
	}

	// test isDisjoint and containsAll
	if (teststack.size() >= 1)
	{
	boolean disjoint = true;
	temp = (boolean[])trackstack.peek();
	for (int k = 0; k < width * namespace.length; k++)
	{
	if (temp[k] && contents[k])
	{
	disjoint = false;
	break;
	}
	}
	Assert.assertTrue(format(0, l, "ERROR: disjoint is wrong", current), disjoint == current.isDisjoint((QNameSetSpecification)teststack.peek()));
	{
	// testprint(0, l, "ERROR: disjoint is wrong", current);
	// testprint(0, l, "expected " + disjoint + ", got " + !disjoint, (QNameSetBuilder)teststack.peek());
	// System.exit(1);
	}


	boolean containsAll = true;
	for (int k = 0; k < width * namespace.length; k++)
	{
	if (temp[k] && !contents[k])
	{
	containsAll = false;
	break;
	}
	}
	Assert.assertTrue(format(0, l, "ERROR: containsAll is wrong", current), containsAll == current.containsAll((QNameSetSpecification)teststack.peek()));
	}

	}
	}
	}