/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*
* @test
* @bug 6332435
* @summary Basic tests for CountDownLatch
* @author Seetharam Avadhanam, Martin Buchholz
*/
interface AwaiterFactory {
}
}
public class Basic {
try {
}
}
final CountDownLatch gate) {
try {
}
}
final CountDownLatch gate,
final long millis) {
try {
}
}
final CountDownLatch gate,
final int i) {
if (i == 1)
}
//----------------------------------------------------------------
// Normal use
//----------------------------------------------------------------
int count = 0;
for (int i = 0; i < 3; i++) {
}
for (int i = 0; i < 12; i++)
a[i].join();
for (int i = 0; i < 12; i++)
checkResult(a[i], null);
}
//----------------------------------------------------------------
// One thread interrupted
//----------------------------------------------------------------
int count = 0;
for (int i = 0; i < 3; i++) {
}
for (int i = 0; i < 12; i++)
a[i].join();
for (int i = 0; i < 12; i++)
checkResult(a[i],
}
//----------------------------------------------------------------
// One thread timed out
//----------------------------------------------------------------
int count =0;
for (int i = 0; i < 3; i++) {
}
for (int i = 0; i < 12; i++)
a[i].join();
for (int i = 0; i < 12; i++)
checkResult(a[i], null);
}
normalUse();
timeOut();
}
}
t.printStackTrace();
}
", expected = " + expected);
}
}
}
}