blob: a2cde412d03f85f609bc7e61d1a6e90dd7a9a881 [file] [log] [blame]
J. Duke319a3b92007-12-01 00:00:00 +00001/*
2 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 *
8 * - Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 *
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 *
15 * - Neither the name of Sun Microsystems nor the names of its
16 * contributors may be used to endorse or promote products derived
17 * from this software without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
20 * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
21 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
24 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
26 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
27 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
28 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
29 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 */
31
32/*
33 */
34
35/**
36 * A generic sort demonstration algorithm
37 * SortAlgorithm.java, Thu Oct 27 10:32:35 1994
38 *
39 * @author James Gosling
40 */
41
42class SortAlgorithm {
43 /**
44 * The sort item.
45 */
46 private SortItem parent;
47
48 /**
49 * When true stop sorting.
50 */
51 protected boolean stopRequested = false;
52
53 /**
54 * Set the parent.
55 */
56 public void setParent(SortItem p) {
57 parent = p;
58 }
59
60 /**
61 * Pause for a while.
62 */
63 protected void pause() throws Exception {
64 if (stopRequested) {
65 throw new Exception("Sort Algorithm");
66 }
67 parent.pause(parent.h1, parent.h2);
68 }
69
70 /**
71 * Pause for a while and mark item 1.
72 */
73 protected void pause(int H1) throws Exception {
74 if (stopRequested) {
75 throw new Exception("Sort Algorithm");
76 }
77 parent.pause(H1, parent.h2);
78 }
79
80 /**
81 * Pause for a while and mark item 1 & 2.
82 */
83 protected void pause(int H1, int H2) throws Exception {
84 if (stopRequested) {
85 throw new Exception("Sort Algorithm");
86 }
87 parent.pause(H1, H2);
88 }
89
90 /**
91 * Stop sorting.
92 */
93 public void stop() {
94 stopRequested = true;
95 }
96
97 /**
98 * Initialize
99 */
100 public void init() {
101 stopRequested = false;
102 }
103
104 /**
105 * This method will be called to
106 * sort an array of integers.
107 */
108 void sort(int a[]) throws Exception {
109 }
110}