< prev index next >

test/sun/nio/cs/FindEncoderBugs.java

Print this page


   1 /*
   2  * Copyright (c) 2008, 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
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  */
  23 
  24 /*
  25  * @test
  26  * @bug 6233345 6381699 6381702 6381705 6381706
  27  * @summary Encode many char sequences in many ways
  28  * @library /lib/testlibrary/
  29  * @build jdk.testlibrary.*
  30  * @run main/timeout=1200 FindEncoderBugs
  31  * @author Martin Buchholz
  32  * @key randomness intermittent
  33  */
  34 
  35 import java.util.*;
  36 import java.util.regex.*;
  37 import java.nio.*;
  38 import java.nio.charset.*;
  39 import jdk.testlibrary.RandomFactory;
  40 
  41 public class FindEncoderBugs {
  42 
  43     static boolean isBroken(String csn) {
  44         if (csn.equals("x-COMPOUND_TEXT")) return true;
  45         return false;
  46     }
  47 
  48     static <T extends Comparable<? super T>> List<T> sort(Collection<T> c) {
  49         List<T> list = new ArrayList<T>(c);
  50         Collections.sort(list);
  51         return list;
  52     }


   1 /*
   2  * Copyright (c) 2008, 2016, 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
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  */
  23 
  24 /*
  25  * @test
  26  * @bug 6233345 6381699 6381702 6381705 6381706
  27  * @summary Encode many char sequences in many ways
  28  * @library /lib/testlibrary/
  29  * @build jdk.testlibrary.*
  30  * @run main/timeout=1200 FindEncoderBugs
  31  * @author Martin Buchholz
  32  * @key randomness
  33  */
  34 
  35 import java.util.*;
  36 import java.util.regex.*;
  37 import java.nio.*;
  38 import java.nio.charset.*;
  39 import jdk.testlibrary.RandomFactory;
  40 
  41 public class FindEncoderBugs {
  42 
  43     static boolean isBroken(String csn) {
  44         if (csn.equals("x-COMPOUND_TEXT")) return true;
  45         return false;
  46     }
  47 
  48     static <T extends Comparable<? super T>> List<T> sort(Collection<T> c) {
  49         List<T> list = new ArrayList<T>(c);
  50         Collections.sort(list);
  51         return list;
  52     }


< prev index next >