Commits : Individual Commit
Analyzed 5 days
ago based on code collected 5 days ago.
Commit ID
|
Contributor: | ray.j.greenwell | Files Modified: | 1 |
| Date: | 26-January-2011 at 20:36 | Lines Added: | 5 | |
| Repository: | http://samskivert.googlecode.com/svn/trunk /trunk | Lines Removed: | 8 | |
| Commit Comment: | PECS, and use Collections.reverseOrder(). There are actually 5 different implementations of quicksort in here when one will do (the array versions could go away and call the list version, wrapping in Arrays.asList()). But I won't touch those right now. I am super tempted to reduce things down to one List version and one array version. Also it's weird that there are customized Comparators that are null-safe. I believe I was the one who added them in the past, but I've since learned. It's a strange undocumented "convenience" when it's easy enough for someone to provide a null-safe comparator for comparables. (In guava you can call Ordering.natural().nullsLast()). |
|||
Changes by Language
| Language | Code Added | Code Removed | Comments Added | Comment Removed | Blanks Added | Blanks Removed | |
|---|---|---|---|---|---|---|---|
| Java | 5 | 8 | 0 | 0 | 0 | 0 | |
Changes by File
Showing page 1 of 1
| File | Language | Code Added | Code Removed | Comments Added | Comment Removed | Blanks Added | Blanks Removed |
|---|---|---|---|---|---|---|---|
| .../java/com/samskivert/util/QuickSort.java | Java | 5 | 8 | 0 | 0 | 0 | 0 |
Copyright
©
2013
Black Duck Software, Inc.
and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a
Creative Commons Attribution 3.0 Unported License
. Ohloh
®
and the Ohloh logo are trademarks of
Black Duck Software, Inc.
in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.