1 |
|
/* |
2 |
< |
* Copyright (c) 2005, Oracle and/or its affiliates. All rights reserved. |
2 |
> |
* Copyright (c) 2005, 2013, Oracle and/or its affiliates. All rights reserved. |
3 |
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 |
|
* |
5 |
|
* This code is free software; you can redistribute it and/or modify it |
28 |
|
* @author Martin Buchholz |
29 |
|
*/ |
30 |
|
|
31 |
< |
import java.util.*; |
32 |
< |
import java.util.concurrent.*; |
31 |
> |
import java.util.ArrayDeque; |
32 |
> |
import java.util.Arrays; |
33 |
> |
import java.util.Comparator; |
34 |
> |
import java.util.List; |
35 |
> |
import java.util.PriorityQueue; |
36 |
> |
import java.util.Queue; |
37 |
> |
import java.util.concurrent.ArrayBlockingQueue; |
38 |
> |
import java.util.concurrent.LinkedBlockingDeque; |
39 |
> |
import java.util.concurrent.LinkedBlockingQueue; |
40 |
> |
import java.util.concurrent.LinkedTransferQueue; |
41 |
> |
import java.util.concurrent.PriorityBlockingQueue; |
42 |
|
|
43 |
|
public class RemoveContains { |
44 |
|
static volatile int passed = 0, failed = 0; |
69 |
|
} |
70 |
|
|
71 |
|
public static void main(String[] args) { |
72 |
< |
final Comparator<String> firstChar = new Comparator<String>() { |
72 |
> |
final Comparator<String> firstChar = new Comparator<>() { |
73 |
|
public int compare(String x, String y) { |
74 |
|
return x.charAt(0) - y.charAt(0); }}; |
75 |
|
|
76 |
+ |
test(new PriorityQueue<String>(firstChar)); |
77 |
|
test(new PriorityQueue<String>(10, firstChar)); |
78 |
|
test(new PriorityBlockingQueue<String>(10, firstChar)); |
79 |
|
test(new ArrayBlockingQueue<String>(10)); |