samples/apifest1/day1/subclassingsolution/test/org/netbeans/apifest/boolcircuit/CircuitTest.java
1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/samples/apifest1/day1/subclassingsolution/test/org/netbeans/apifest/boolcircuit/CircuitTest.java Sat Jun 14 09:52:45 2008 +0200
1.3 @@ -0,0 +1,136 @@
1.4 +/*
1.5 + * The contents of this file are subject to the terms of the Common Development
1.6 + * and Distribution License (the License). You may not use this file except in
1.7 + * compliance with the License.
1.8 + *
1.9 + * You can obtain a copy of the License at http://www.netbeans.org/cddl.html
1.10 + * or http://www.netbeans.org/cddl.txt.
1.11 + *
1.12 + * When distributing Covered Code, include this CDDL Header Notice in each file
1.13 + * and include the License file at http://www.netbeans.org/cddl.txt.
1.14 + * If applicable, add the following below the CDDL Header, with the fields
1.15 + * enclosed by brackets [] replaced by your own identifying information:
1.16 + * "Portions Copyrighted [year] [name of copyright owner]"
1.17 + *
1.18 + * The Original Software is NetBeans. The Initial Developer of the Original
1.19 + * Software is Sun Microsystems, Inc. Portions Copyright 1997-2006 Sun
1.20 + * Microsystems, Inc. All Rights Reserved.
1.21 + */
1.22 +
1.23 +package org.netbeans.apifest.boolcircuit;
1.24 +
1.25 +import java.security.CodeSource;
1.26 +import java.security.Permission;
1.27 +import java.security.PermissionCollection;
1.28 +import java.security.Policy;
1.29 +import java.util.Collection;
1.30 +import java.util.Collections;
1.31 +import java.util.Enumeration;
1.32 +import junit.framework.TestCase;
1.33 +import junit.framework.*;
1.34 +
1.35 +import static org.netbeans.apifest.boolcircuit.Circuit.*;
1.36 +
1.37 +/** The initial quest for this APIFest is to create an API for boolean
1.38 + * circuits. Such API shall be able to compose a boolean circuit from
1.39 + * basic elements and evaluate the result given initial values for
1.40 + * input variables.
1.41 + * <p>
1.42 + * The basic elements include:
1.43 + * <ul>
1.44 + * <li>negation - has one input and one output and changes 0 on input to
1.45 + * on output 1 and 1 to 0
1.46 + * <li>and - has two inputs and one output. The output is 1 only if both
1.47 + * inputs are 1, otherwise it is 0
1.48 + * <li>or - has two inputs and one output. The output is 1 always, except
1.49 + * in the case when both inputs are 0
1.50 + * </ul>
1.51 + *
1.52 + * <p>
1.53 + * The boolean circuit can be used to represent boolean formulas and compute
1.54 + * the results for certain values of its inputs. The individual tasks described
1.55 + * as tests bellow.
1.56 + *
1.57 + * <p>
1.58 + * Links of interest:
1.59 + * <ul>
1.60 + * <li><a href="http://en.wikipedia.org/wiki/Truth_table">Truth table</a>
1.61 + * <li><a href="http://en.wikipedia.org/wiki/Tautology_(logic)">Taugology</a>
1.62 + * </ul>
1.63 + */
1.64 +public class CircuitTest extends TestCase {
1.65 +
1.66 +
1.67 +
1.68 + static {
1.69 + // your code shall run without any permissions
1.70 + }
1.71 +
1.72 + public CircuitTest(String testName) {
1.73 + super(testName);
1.74 + }
1.75 +
1.76 + protected void setUp() throws Exception {
1.77 + }
1.78 +
1.79 + protected void tearDown() throws Exception {
1.80 + }
1.81 +
1.82 +
1.83 + /**
1.84 + * Create a circuit to evaluate x1 and x2 and then
1.85 + * verify that its result is false for input (false, true) and
1.86 + * it is true for input (true, true).
1.87 + */
1.88 + public void testX1andX2() {
1.89 +
1.90 + assertFalse( AND.evaluate( false, true ));
1.91 + assertTrue( AND.evaluate( true, true ));
1.92 + }
1.93 +
1.94 + /**
1.95 + * Create a circuit to evaluate (x1 and x2) or x3 and then
1.96 + * verify that its result is false for input (false, true, false) and
1.97 + * it is true for input (false, false, true).
1.98 + */
1.99 + public void testX1andX2orX3() {
1.100 +
1.101 + Circuit c = new Circuit() {
1.102 +
1.103 + @Override
1.104 + public boolean evaluate(boolean[] in) {
1.105 + if ( in.length != 3) {
1.106 + throw new IllegalArgumentException( "Should have one parameter");
1.107 + }
1.108 + return OR.evaluate( AND.evaluate( in[0], in[1] ), in[2] );
1.109 + }
1.110 +
1.111 + };
1.112 +
1.113 + assertFalse( c.evaluate( false, true, false ) );
1.114 + assertTrue( c.evaluate( false, false, true ) );
1.115 +
1.116 + }
1.117 + /**
1.118 + * Create a circuit to evaluate (x1 or not(x1)) and then
1.119 + * verify that its result is true for all values of x1.
1.120 + */
1.121 + public void testAlwaysTrue() {
1.122 +
1.123 + Circuit c = new Circuit() {
1.124 +
1.125 + @Override
1.126 + public boolean evaluate(boolean[] in) {
1.127 + if ( in.length != 1) {
1.128 + throw new IllegalArgumentException( "Should have three parameters");
1.129 + }
1.130 + return OR.evaluate( in[0], NOT.evaluate( in[0] ) );
1.131 + }
1.132 +
1.133 + };
1.134 +
1.135 + assertTrue( c.evaluate( true ) );
1.136 + assertTrue( c.evaluate( false ) );
1.137 + }
1.138 +
1.139 +}