ViewVC Help

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

root/jsr166/jsr166/src/extra166y/PAS.java

Comparing jsr166/src/extra166y/PAS.java (file contents):
Revision 1.11 by jsr166, Sat Oct 16 16:40:44 2010 UTC vs.
Revision 1.16 by jsr166, Tue Feb 21 01:54:03 2012 UTC

#	Line 1 | Line 1
1		/*
2		* Written by Doug Lea with assistance from members of JCP JSR-166
3		* Expert Group and released to the public domain, as explained at
4	<	* http://creativecommons.org/licenses/publicdomain
4	>	* http://creativecommons.org/publicdomain/zero/1.0/
5		*/
6
7		package extra166y;
#	Line 676 | Line 676 | class PAS {
676		}
677		}
678
679	<	void  atLeaf(int l, int h) {
679	>	void atLeaf(int l, int h) {
680		if (pap.hasFilter())
681		filteredAtLeaf(l, h);
682		else {
#	Line 689 | Line 689 | class PAS {
689		}
690		}
691
692	<	void  filteredAtLeaf(int l, int h) {
692	>	void filteredAtLeaf(int l, int h) {
693		for (int i = l; i < h; ++i) {
694		if (pap.isSelected(i)) {
695		Object x = pap.oget(i);
#	Line 772 | Line 772 | class PAS {
772		}
773		}
774
775	<	void  filteredAtLeaf(int l, int h) {
775	>	void filteredAtLeaf(int l, int h) {
776		for (int i = l; i < h; ++i) {
777		if (pap.isSelected(i)) {
778		double x = pap.dget(i);
#	Line 843 | Line 843 | class PAS {
843		}
844		}
845
846	<	void  atLeaf(int l, int h) {
846	>	void atLeaf(int l, int h) {
847		if (pap.hasFilter())
848		filteredAtLeaf(l, h);
849		else {
#	Line 857 | Line 857 | class PAS {
857		}
858		}
859
860	<	void  filteredAtLeaf(int l, int h) {
860	>	void filteredAtLeaf(int l, int h) {
861		for (int i = l; i < h; ++i) {
862		if (pap.isSelected(i)) {
863		long x = pap.lget(i);
#	Line 1491 | Line 1491 | class PAS {
1491		if ((filtered && !pap.isSelected(k)) ||
1492		(x = src[k]) == null)
1493		continue;
1494	<	int hc = byIdentity? System.identityHashCode(x): x.hashCode();
1494	>	int hc = byIdentity ? System.identityHashCode(x) : x.hashCode();
1495		int hash = hash(hc);
1496		long entry = (((long)hash) << 32) + (k + 1);
1497		int idx = hash & mask;
#	Line 1574 | Line 1574 | class PAS {
1574		}
1575
1576		/**
1577	<	* Return new array holding all elements.
1577	>	* Returns new array holding all elements.
1578		*/
1579		Object[] uniqueObjects(int size) {
1580		Object[] src = pap.ogetArray();
#	Line 1681 | Line 1681 | class PAS {
1681		l+h, n-h, l, g, null).compute();
1682		}
1683		else
1684	<	oquickSort(a, cmp, l, l+n-1);
1684	>	Arrays.sort(a, l, l+n, cmp);
1685		}
1686		}
1687
#	Line 1717 | Line 1717 | class PAS {
1717		l+h, n-h, l, g, null).compute();
1718		}
1719		else
1720	<	ocquickSort(a, l, l+n-1);
1720	>	Arrays.sort(a, l, l+n);
1721		}
1722		}
1723
#	Line 1887 | Line 1887 | class PAS {
1887		}
1888
1889		/**
1890	<	* Perform merging for FJSorter. If big enough, splits Left
1890	>	* Performs merging for FJSorter. If big enough, splits Left
1891		* partition in half; finds the greatest point in Right partition
1892		* less than the beginning of the second half of Left via binary
1893		* search; and then, in parallel, merges left half of Left with
#	Line 2307 | Line 2307 | class PAS {
2307
2308		// versions of quicksort with comparators
2309
2310	–	static void oquickSort(Object[] a, Comparator cmp, int lo, int hi) {
2311	–	for (;;) {
2312	–	if (hi - lo <= INSERTION_SORT_THRESHOLD) {
2313	–	for (int i = lo + 1; i <= hi; i++) {
2314	–	Object t = a[i];
2315	–	int j = i - 1;
2316	–	while (j >= lo && cmp.compare(t, a[j]) < 0) {
2317	–	a[j+1] = a[j];
2318	–	--j;
2319	–	}
2320	–	a[j+1] = t;
2321	–	}
2322	–	return;
2323	–	}
2324	–
2325	–	int mid = (lo + hi) >>> 1;
2326	–	if (cmp.compare(a[lo], a[mid]) > 0) {
2327	–	Object t = a[lo]; a[lo] = a[mid]; a[mid] = t;
2328	–	}
2329	–	if (cmp.compare(a[mid], a[hi]) > 0) {
2330	–	Object t = a[mid]; a[mid] = a[hi]; a[hi] = t;
2331	–	if (cmp.compare(a[lo], a[mid]) > 0) {
2332	–	Object u = a[lo]; a[lo] = a[mid]; a[mid] = u;
2333	–	}
2334	–	}
2335	–
2336	–	Object pivot = a[mid];
2337	–	int left = lo+1;
2338	–	int right = hi-1;
2339	–	boolean sameLefts = true;
2340	–	for (;;) {
2341	–	while (cmp.compare(pivot, a[right]) < 0)
2342	–	--right;
2343	–	int c;
2344	–	while (left < right &&
2345	–	(c = cmp.compare(pivot, a[left])) >= 0) {
2346	–	if (c != 0)
2347	–	sameLefts = false;
2348	–	++left;
2349	–	}
2350	–	if (left < right) {
2351	–	Object t = a[left]; a[left] = a[right]; a[right] = t;
2352	–	--right;
2353	–	}
2354	–	else break;
2355	–	}
2356	–
2357	–	if (sameLefts && right == hi - 1)
2358	–	return;
2359	–	if (left - lo <= hi - right) {
2360	–	oquickSort(a, cmp, lo, left);
2361	–	lo = left + 1;
2362	–	}
2363	–	else {
2364	–	oquickSort(a, cmp, right, hi);
2365	–	hi = left;
2366	–	}
2367	–	}
2368	–	}
2369	–
2370	–	static void ocquickSort(Comparable[] a, int lo, int hi) {
2371	–	for (;;) {
2372	–	if (hi - lo <= INSERTION_SORT_THRESHOLD) {
2373	–	for (int i = lo + 1; i <= hi; i++) {
2374	–	Comparable t = a[i];
2375	–	int j = i - 1;
2376	–	while (j >= lo && t.compareTo(a[j]) < 0) {
2377	–	a[j+1] = a[j];
2378	–	--j;
2379	–	}
2380	–	a[j+1] = t;
2381	–	}
2382	–	return;
2383	–	}
2384	–
2385	–	int mid = (lo + hi) >>> 1;
2386	–	if (a[lo].compareTo(a[mid]) > 0) {
2387	–	Comparable t = a[lo]; a[lo] = a[mid]; a[mid] = t;
2388	–	}
2389	–	if (a[mid].compareTo(a[hi]) > 0) {
2390	–	Comparable t = a[mid]; a[mid] = a[hi]; a[hi] = t;
2391	–	if (a[lo].compareTo(a[mid]) > 0) {
2392	–	Comparable u = a[lo]; a[lo] = a[mid]; a[mid] = u;
2393	–	}
2394	–	}
2395	–	Comparable pivot = a[mid];
2396	–	int left = lo+1;
2397	–	int right = hi-1;
2398	–	boolean sameLefts = true;
2399	–	for (;;) {
2400	–	while (pivot.compareTo(a[right]) < 0)
2401	–	--right;
2402	–	int c;
2403	–	while (left < right && (c = pivot.compareTo(a[left])) >= 0) {
2404	–	if (c != 0)
2405	–	sameLefts = false;
2406	–	++left;
2407	–	}
2408	–	if (left < right) {
2409	–	Comparable t = a[left]; a[left] = a[right]; a[right] = t;
2410	–	--right;
2411	–	}
2412	–	else break;
2413	–	}
2414	–
2415	–	if (sameLefts && right == hi - 1)
2416	–	return;
2417	–	if (left - lo <= hi - right) {
2418	–	ocquickSort(a, lo, left);
2419	–	lo = left + 1;
2420	–	}
2421	–	else {
2422	–	ocquickSort(a, right, hi);
2423	–	hi = left;
2424	–	}
2425	–	}
2426	–	}
2427	–
2310
2311		static void dquickSort(double[] a, DoubleComparator cmp, int lo, int hi) {
2312		for (;;) {
#	Line 2673 | Line 2555 | class PAS {
2555		op.pushUp(par, par.left, par.right);
2556		int refork =
2557		((pb & CUMULATE) == 0 &&
2558	<	par.lo == op.origin)? CUMULATE : 0;
2558	>	par.lo == op.origin) ? CUMULATE : 0;
2559		int nextPhase = pb|cb|refork;
2560		if (pb == nextPhase ||
2561		phaseUpdater.compareAndSet(par, pb, nextPhase)) {

Diff Legend

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