0N/A/*
3261N/A * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/A/* @test
0N/A * @summary it is new version of old test which was
0N/A * /src/share/test/serialization/piotest.java
0N/A * Test of serialization/deserialization of
0N/A * objects with BinaryTree types
0N/A */
0N/A
0N/Aimport java.io.*;
0N/A
0N/Apublic class BinaryTree {
0N/A public static void main (String argv[]) {
0N/A System.err.println("\nRegression test for testing of " +
0N/A "serialization/deserialization of objects " +
0N/A "with BinaryTree types \n");
0N/A
0N/A try {
2496N/A BinaryTreeTest base = new BinaryTreeTest(2);
0N/A FileOutputStream ostream = new FileOutputStream("piotest3.tmp");
2496N/A try {
2496N/A ObjectOutputStream p = new ObjectOutputStream(ostream);
2496N/A p.writeObject(null);
2496N/A p.writeObject(base);
2496N/A p.flush();
2496N/A } finally {
2496N/A ostream.close();
2496N/A }
0N/A
0N/A FileInputStream istream = new FileInputStream("piotest3.tmp");
2496N/A try {
2496N/A ObjectInputStream q = new ObjectInputStream(istream);
2496N/A Object n = q.readObject();
2496N/A if (n != null) {
2496N/A System.err.println("\nnull read as " + n);
2496N/A }
2496N/A BinaryTreeTest nbase = (BinaryTreeTest)q.readObject();
2496N/A if (!base.equals(nbase)) {
2496N/A System.err.println("\nTEST FAILED: BinaryTree read " +
2496N/A "incorrectly.");
2496N/A throw new Error();
2496N/A }
2496N/A } finally {
2496N/A istream.close();
0N/A }
2496N/A
0N/A System.err.println("\nTEST PASSED");
0N/A } catch (Exception e) {
0N/A System.err.print("TEST FAILED: ");
0N/A e.printStackTrace();
0N/A throw new Error();
0N/A }
0N/A }
0N/A}
0N/A
0N/Aclass BinaryTreeTest implements java.io.Serializable {
0N/A public BinaryTreeTest left;
0N/A public BinaryTreeTest right;
0N/A public int id;
0N/A public int level;
0N/A
0N/A private static int count = 0;
0N/A
0N/A public BinaryTreeTest(int l) {
0N/A id = count++;
0N/A level = l;
0N/A if (l > 0) {
0N/A left = new BinaryTreeTest(l-1);
0N/A right = new BinaryTreeTest(l-1);
0N/A }
0N/A }
0N/A
0N/A public void print(int levels) {
0N/A for (int i = 0; i < level; i++) {
0N/A System.out.print(" ");
0N/A }
0N/A System.err.println("node " + id);
0N/A
0N/A if (level <= levels && left != null) {
0N/A left.print(levels);
0N/A }
0N/A
0N/A if (level <= levels && right != null) {
0N/A right.print(levels);
0N/A }
0N/A }
0N/A
0N/A public boolean equals(BinaryTreeTest other) {
0N/A if (other == null) {
0N/A return false;
0N/A }
0N/A
0N/A if (id != other.id) {
0N/A return false;
0N/A }
0N/A
0N/A if (left != null && !left.equals(other.left)) {
0N/A return false;
0N/A }
0N/A
0N/A if (right != null && !right.equals(other.right)) {
0N/A return false;
0N/A }
0N/A
0N/A return true;
0N/A }
0N/A}