ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/jtreg/util/Collections/BigBinarySearch.java

Comparing jsr166/src/test/jtreg/util/Collections/BigBinarySearch.java (file contents):
Revision 1.1 by jsr166, Tue Sep 1 01:24:16 2009 UTC vs.
Revision 1.5 by jsr166, Mon Jan 8 03:12:03 2018 UTC

#	Line 1 | Line 1
1		/*
2	<	* Copyright 2006 Sun Microsystems, Inc.  All Rights Reserved.
2	>	* Copyright (c) 2006, 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
#	Line 16 | Line 16
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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20	<	* CA 95054 USA or visit www.sun.com if you need additional information or
21	<	* have any questions.
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		/*
#	Line 28 | Line 28
28		* @author Martin Buchholz
29		*/
30
31	<	import java.util.*;
31	>	import java.util.AbstractList;
32	>	import java.util.Collections;
33	>	import java.util.Comparator;
34	>	import java.util.HashMap;
35	>	import java.util.List;
36	>	import java.util.Map;
37	>	import java.util.RandomAccess;
38
39		public class BigBinarySearch {
40
#	Line 38 | Line 44 | public class BigBinarySearch {
44		extends AbstractList<Integer>
45		implements RandomAccess
46		{
47	<	private Map<Integer,Integer> m = new HashMap<Integer,Integer>();
47	>	private Map<Integer,Integer> m = new HashMap<>();
48
49		public Integer get(int i) {
50		if (i < 0) throw new IndexOutOfBoundsException(""+i);
#	Line 61 | Line 67 | public class BigBinarySearch {
67		}
68		}
69
70	<	/** Check that binarySearch finds an element where we got it */
70	>	/** Checks that binarySearch finds an element where we got it. */
71		private static void checkBinarySearch(List<Integer> l, int i) {
72		try { equal(i, Collections.binarySearch(l, l.get(i))); }
73		catch (Throwable t) { unexpected(t); }
74		}
75
76	<	/** Check that binarySearch finds an element where we got it */
76	>	/** Checks that binarySearch finds an element where we got it. */
77		private static void checkBinarySearch(List<Integer> l, int i,
78		Comparator<Integer> comparator) {
79		try { equal(i, Collections.binarySearch(l, l.get(i), comparator)); }

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines