|
Java example source code file (ReverseOrder2.java)
The ReverseOrder2.java Java example source code/* * Copyright (c) 2003, 2007, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * 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 4809442 6366832 4974878 6372554 4890211 6483125 * @summary Basic test for Collections.reverseOrder * @author Josh Bloch, Martin Buchholz */ import java.util.*; import java.io.*; public class ReverseOrder2 { final static int N = 100; static void realMain(String[] args) throws Throwable { check(Collections.reverseOrder() == Collections.reverseOrder(null)); check(Collections.reverseOrder() == reincarnate(Collections.reverseOrder())); check(Collections.reverseOrder(Collections.reverseOrder(cmp)) == cmp); equal(Collections.reverseOrder(cmp), Collections.reverseOrder(cmp)); equal(Collections.reverseOrder(cmp).hashCode(), Collections.reverseOrder(cmp).hashCode()); check(Collections.reverseOrder(cmp).hashCode() != cmp.hashCode()); test(new ArrayList<String>()); test(new LinkedList<String>()); test2(new ArrayList<Integer>()); test2(new LinkedList<Integer>()); } static void test(List<String> list) { for (int i = 0; i < N; i++) list.add(String.valueOf(i)); Collections.shuffle(list); Collections.sort(list, Collections.reverseOrder(cmp)); equal(list, golden); } private static Comparator<String> cmp = new Comparator Other Java examples (source code examples)Here is a short list of links related to this Java ReverseOrder2.java source code file: |
... this post is sponsored by my books ... | |
#1 New Release! |
FP Best Seller |
Copyright 1998-2021 Alvin Alexander, alvinalexander.com
All Rights Reserved.
A percentage of advertising revenue from
pages under the /java/jwarehouse
URI on this website is
paid back to open source projects.